java -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/chccomp2018/chcToBoogie_automizer.epf -i /storage/chc-comp/vmt-chc-benchmarks/ctigar/nested2.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-55b8104 [2018-06-18 13:27:51,949 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-18 13:27:51,951 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-18 13:27:51,965 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-18 13:27:51,966 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-18 13:27:51,967 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-18 13:27:51,968 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-18 13:27:51,970 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-18 13:27:51,972 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-18 13:27:51,973 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-18 13:27:51,973 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-18 13:27:51,974 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-18 13:27:51,974 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-18 13:27:51,976 INFO L177 SettingsManager]: ChcToBoogie provides no preferences, ignoring... [2018-06-18 13:27:51,976 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-18 13:27:51,977 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-18 13:27:51,978 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-18 13:27:51,980 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-18 13:27:51,982 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-18 13:27:51,992 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-18 13:27:51,993 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-18 13:27:51,996 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-18 13:27:51,996 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-18 13:27:51,996 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-18 13:27:51,997 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-18 13:27:51,998 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-18 13:27:51,999 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-18 13:27:51,999 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-18 13:27:52,007 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-18 13:27:52,008 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-18 13:27:52,008 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-18 13:27:52,009 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-18 13:27:52,009 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-18 13:27:52,010 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-18 13:27:52,010 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-18 13:27:52,011 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chccomp2018/chcToBoogie_automizer.epf [2018-06-18 13:27:52,028 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-18 13:27:52,028 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-18 13:27:52,028 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-18 13:27:52,028 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-18 13:27:52,030 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-18 13:27:52,030 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-18 13:27:52,030 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-18 13:27:52,030 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-18 13:27:52,030 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-18 13:27:52,031 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-18 13:27:52,031 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-18 13:27:52,031 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-18 13:27:52,031 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-18 13:27:52,031 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-18 13:27:52,032 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-18 13:27:52,032 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-18 13:27:52,032 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-18 13:27:52,033 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-18 13:27:52,033 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-18 13:27:52,081 INFO ]: Repository-Root is: /tmp [2018-06-18 13:27:52,095 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-18 13:27:52,100 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-18 13:27:52,101 INFO ]: Initializing SmtParser... [2018-06-18 13:27:52,101 INFO ]: SmtParser initialized [2018-06-18 13:27:52,102 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/ctigar/nested2.c.smt2 [2018-06-18 13:27:52,103 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-18 13:27:52,190 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/nested2.c.smt2 unknown [2018-06-18 13:27:52,440 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/nested2.c.smt2 [2018-06-18 13:27:52,447 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-18 13:27:52,452 INFO ]: Walking toolchain with 4 elements. [2018-06-18 13:27:52,452 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-18 13:27:52,452 INFO ]: Initializing ChcToBoogie... [2018-06-18 13:27:52,453 INFO ]: ChcToBoogie initialized [2018-06-18 13:27:52,457 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 18.06 01:27:52" (1/1) ... [2018-06-18 13:27:52,515 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:27:52 Unit [2018-06-18 13:27:52,515 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-18 13:27:52,516 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-18 13:27:52,516 INFO ]: Initializing Boogie Preprocessor... [2018-06-18 13:27:52,516 INFO ]: Boogie Preprocessor initialized [2018-06-18 13:27:52,537 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:27:52" (1/1) ... [2018-06-18 13:27:52,537 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:27:52" (1/1) ... [2018-06-18 13:27:52,557 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:27:52" (1/1) ... [2018-06-18 13:27:52,557 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:27:52" (1/1) ... [2018-06-18 13:27:52,561 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:27:52" (1/1) ... [2018-06-18 13:27:52,562 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:27:52" (1/1) ... [2018-06-18 13:27:52,563 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:27:52" (1/1) ... [2018-06-18 13:27:52,574 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-18 13:27:52,575 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-18 13:27:52,575 INFO ]: Initializing RCFGBuilder... [2018-06-18 13:27:52,575 INFO ]: RCFGBuilder initialized [2018-06-18 13:27:52,576 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:27:52" (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-18 13:27:52,604 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-18 13:27:52,604 INFO ]: Found specification of procedure False [2018-06-18 13:27:52,604 INFO ]: Found implementation of procedure False [2018-06-18 13:27:52,604 INFO ]: Specification and implementation of procedure state given in one single declaration [2018-06-18 13:27:52,604 INFO ]: Found specification of procedure state [2018-06-18 13:27:52,604 INFO ]: Found implementation of procedure state [2018-06-18 13:27:52,605 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-18 13:27:52,605 INFO ]: Found specification of procedure Ultimate.START [2018-06-18 13:27:52,605 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-18 13:27:52,855 INFO ]: Using library mode [2018-06-18 13:27:52,856 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.06 01:27:52 BoogieIcfgContainer [2018-06-18 13:27:52,856 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-18 13:27:52,857 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-18 13:27:52,857 INFO ]: Initializing TraceAbstraction... [2018-06-18 13:27:52,860 INFO ]: TraceAbstraction initialized [2018-06-18 13:27:52,860 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 18.06 01:27:52" (1/3) ... [2018-06-18 13:27:52,861 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3061fb80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 18.06 01:27:52, skipping insertion in model container [2018-06-18 13:27:52,861 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 01:27:52" (2/3) ... [2018-06-18 13:27:52,861 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3061fb80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.06 01:27:52, skipping insertion in model container [2018-06-18 13:27:52,861 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.06 01:27:52" (3/3) ... [2018-06-18 13:27:52,863 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-18 13:27:52,872 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-18 13:27:52,888 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-18 13:27:52,944 INFO ]: Using default assertion order modulation [2018-06-18 13:27:52,945 INFO ]: Interprodecural is true [2018-06-18 13:27:52,945 INFO ]: Hoare is false [2018-06-18 13:27:52,945 INFO ]: Compute interpolants for FPandBP [2018-06-18 13:27:52,945 INFO ]: Backedges is TWOTRACK [2018-06-18 13:27:52,945 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-18 13:27:52,945 INFO ]: Difference is false [2018-06-18 13:27:52,945 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-18 13:27:52,945 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-18 13:27:52,959 INFO ]: Start isEmpty. Operand 13 states. [2018-06-18 13:27:52,970 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-18 13:27:52,970 INFO ]: Found error trace [2018-06-18 13:27:52,970 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:27:52,971 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:27:52,976 INFO ]: Analyzing trace with hash -683425083, now seen corresponding path program 1 times [2018-06-18 13:27:52,977 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:27:52,978 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:27:53,014 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:27:53,015 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 13:27:53,015 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:27:53,042 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:27:53,050 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:27:53,130 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-18 13:27:53,132 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-18 13:27:53,132 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-18 13:27:53,133 INFO ]: Interpolant automaton has 4 states [2018-06-18 13:27:53,146 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-18 13:27:53,147 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 13:27:53,149 INFO ]: Start difference. First operand 13 states. Second operand 4 states. [2018-06-18 13:27:53,223 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:27:53,224 INFO ]: Finished difference Result 13 states and 14 transitions. [2018-06-18 13:27:53,225 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-18 13:27:53,227 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-18 13:27:53,227 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:27:53,237 INFO ]: With dead ends: 13 [2018-06-18 13:27:53,237 INFO ]: Without dead ends: 13 [2018-06-18 13:27:53,239 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 13:27:53,252 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-18 13:27:53,275 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-18 13:27:53,276 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-18 13:27:53,277 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-06-18 13:27:53,278 INFO ]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 9 [2018-06-18 13:27:53,278 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:27:53,278 INFO ]: Abstraction has 13 states and 14 transitions. [2018-06-18 13:27:53,278 INFO ]: Interpolant automaton has 4 states. [2018-06-18 13:27:53,278 INFO ]: Start isEmpty. Operand 13 states and 14 transitions. [2018-06-18 13:27:53,279 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-18 13:27:53,279 INFO ]: Found error trace [2018-06-18 13:27:53,279 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:27:53,280 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:27:53,280 INFO ]: Analyzing trace with hash 204343015, now seen corresponding path program 1 times [2018-06-18 13:27:53,280 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:27:53,280 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:27:53,281 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:27:53,281 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 13:27:53,281 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:27:53,318 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:27:53,318 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:27:53,467 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 13:27:53,467 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:27:53,467 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-18 13:27:53,478 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 13:27:53,516 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:27:53,528 INFO ]: Computing forward predicates... [2018-06-18 13:27:53,679 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 13:27:53,712 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:27:53,712 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-18 13:27:53,713 INFO ]: Interpolant automaton has 6 states [2018-06-18 13:27:53,713 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-18 13:27:53,713 INFO ]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-18 13:27:53,713 INFO ]: Start difference. First operand 13 states and 14 transitions. Second operand 6 states. [2018-06-18 13:27:53,889 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:27:53,889 INFO ]: Finished difference Result 15 states and 16 transitions. [2018-06-18 13:27:53,890 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-18 13:27:53,890 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-18 13:27:53,890 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:27:53,891 INFO ]: With dead ends: 15 [2018-06-18 13:27:53,891 INFO ]: Without dead ends: 15 [2018-06-18 13:27:53,892 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-18 13:27:53,892 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-18 13:27:53,895 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-18 13:27:53,895 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-18 13:27:53,895 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-06-18 13:27:53,895 INFO ]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2018-06-18 13:27:53,895 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:27:53,895 INFO ]: Abstraction has 15 states and 16 transitions. [2018-06-18 13:27:53,896 INFO ]: Interpolant automaton has 6 states. [2018-06-18 13:27:53,896 INFO ]: Start isEmpty. Operand 15 states and 16 transitions. [2018-06-18 13:27:53,896 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-18 13:27:53,896 INFO ]: Found error trace [2018-06-18 13:27:53,896 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:27:53,896 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:27:53,897 INFO ]: Analyzing trace with hash -1649658231, now seen corresponding path program 2 times [2018-06-18 13:27:53,897 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:27:53,897 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:27:53,898 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:27:53,898 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 13:27:53,898 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:27:53,936 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:27:53,937 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:27:54,432 WARN ]: Spent 292.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 12 [2018-06-18 13:27:54,572 WARN ]: Spent 102.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 6 [2018-06-18 13:27:54,593 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-18 13:27:54,593 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:27:54,593 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-18 13:27:54,616 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-18 13:27:54,664 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-18 13:27:54,664 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:27:54,667 INFO ]: Computing forward predicates... [2018-06-18 13:27:54,970 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-18 13:27:54,990 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:27:54,990 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-18 13:27:54,990 INFO ]: Interpolant automaton has 8 states [2018-06-18 13:27:54,990 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-18 13:27:54,990 INFO ]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-18 13:27:54,990 INFO ]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2018-06-18 13:27:55,622 WARN ]: Spent 278.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 13 [2018-06-18 13:27:55,692 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:27:55,693 INFO ]: Finished difference Result 17 states and 18 transitions. [2018-06-18 13:27:55,693 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-18 13:27:55,693 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-18 13:27:55,693 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:27:55,694 INFO ]: With dead ends: 17 [2018-06-18 13:27:55,694 INFO ]: Without dead ends: 17 [2018-06-18 13:27:55,694 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-06-18 13:27:55,694 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-18 13:27:55,697 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-18 13:27:55,697 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-18 13:27:55,697 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-06-18 13:27:55,698 INFO ]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 17 [2018-06-18 13:27:55,698 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:27:55,698 INFO ]: Abstraction has 17 states and 18 transitions. [2018-06-18 13:27:55,698 INFO ]: Interpolant automaton has 8 states. [2018-06-18 13:27:55,698 INFO ]: Start isEmpty. Operand 17 states and 18 transitions. [2018-06-18 13:27:55,698 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-18 13:27:55,699 INFO ]: Found error trace [2018-06-18 13:27:55,699 INFO ]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:27:55,699 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:27:55,699 INFO ]: Analyzing trace with hash 2119922091, now seen corresponding path program 3 times [2018-06-18 13:27:55,699 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:27:55,699 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:27:55,700 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:27:55,700 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:27:55,700 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:27:55,734 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:27:55,735 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:27:56,041 WARN ]: Spent 101.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 22 [2018-06-18 13:27:56,270 INFO ]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-18 13:27:56,271 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:27:56,271 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-18 13:27:56,285 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-18 13:27:56,333 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-18 13:27:56,333 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:27:56,337 INFO ]: Computing forward predicates... [2018-06-18 13:27:56,563 WARN ]: Spent 111.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 14 [2018-06-18 13:27:56,838 INFO ]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-18 13:27:56,872 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:27:56,872 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2018-06-18 13:27:56,873 INFO ]: Interpolant automaton has 14 states [2018-06-18 13:27:56,873 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-18 13:27:56,873 INFO ]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-06-18 13:27:56,873 INFO ]: Start difference. First operand 17 states and 18 transitions. Second operand 14 states. [2018-06-18 13:27:57,080 WARN ]: Spent 148.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 31 [2018-06-18 13:27:57,384 WARN ]: Spent 105.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2018-06-18 13:27:57,403 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:27:57,403 INFO ]: Finished difference Result 19 states and 20 transitions. [2018-06-18 13:27:57,405 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-18 13:27:57,405 INFO ]: Start accepts. Automaton has 14 states. Word has length 21 [2018-06-18 13:27:57,405 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:27:57,406 INFO ]: With dead ends: 19 [2018-06-18 13:27:57,406 INFO ]: Without dead ends: 19 [2018-06-18 13:27:57,406 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2018-06-18 13:27:57,406 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-18 13:27:57,409 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-18 13:27:57,409 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-18 13:27:57,410 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-06-18 13:27:57,410 INFO ]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 21 [2018-06-18 13:27:57,410 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:27:57,410 INFO ]: Abstraction has 19 states and 20 transitions. [2018-06-18 13:27:57,410 INFO ]: Interpolant automaton has 14 states. [2018-06-18 13:27:57,410 INFO ]: Start isEmpty. Operand 19 states and 20 transitions. [2018-06-18 13:27:57,411 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-18 13:27:57,411 INFO ]: Found error trace [2018-06-18 13:27:57,411 INFO ]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:27:57,411 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:27:57,411 INFO ]: Analyzing trace with hash 1762711629, now seen corresponding path program 4 times [2018-06-18 13:27:57,411 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:27:57,411 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:27:57,412 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:27:57,412 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:27:57,412 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:27:57,445 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:27:57,446 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:27:57,780 WARN ]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-06-18 13:27:57,897 WARN ]: Spent 111.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 22 [2018-06-18 13:27:58,034 INFO ]: Checked inductivity of 36 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-18 13:27:58,034 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:27:58,034 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 13:27:58,041 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-18 13:27:58,077 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-18 13:27:58,077 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:27:58,081 INFO ]: Computing forward predicates... [2018-06-18 13:27:58,362 WARN ]: Spent 245.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 20 [2018-06-18 13:27:58,555 WARN ]: Spent 160.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 24 [2018-06-18 13:27:58,721 WARN ]: Spent 135.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2018-06-18 13:27:58,908 INFO ]: Checked inductivity of 36 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-18 13:27:58,927 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:27:58,927 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 15 [2018-06-18 13:27:58,928 INFO ]: Interpolant automaton has 15 states [2018-06-18 13:27:58,928 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-18 13:27:58,928 INFO ]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-06-18 13:27:58,928 INFO ]: Start difference. First operand 19 states and 20 transitions. Second operand 15 states. [2018-06-18 13:27:59,162 WARN ]: Spent 214.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2018-06-18 13:27:59,551 WARN ]: Spent 177.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 33 [2018-06-18 13:27:59,699 WARN ]: Spent 133.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2018-06-18 13:27:59,718 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:27:59,718 INFO ]: Finished difference Result 21 states and 22 transitions. [2018-06-18 13:27:59,718 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-18 13:27:59,718 INFO ]: Start accepts. Automaton has 15 states. Word has length 25 [2018-06-18 13:27:59,718 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:27:59,719 INFO ]: With dead ends: 21 [2018-06-18 13:27:59,719 INFO ]: Without dead ends: 21 [2018-06-18 13:27:59,719 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-06-18 13:27:59,719 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-18 13:27:59,723 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-18 13:27:59,723 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-18 13:27:59,723 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-06-18 13:27:59,723 INFO ]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 25 [2018-06-18 13:27:59,724 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:27:59,724 INFO ]: Abstraction has 21 states and 22 transitions. [2018-06-18 13:27:59,724 INFO ]: Interpolant automaton has 15 states. [2018-06-18 13:27:59,724 INFO ]: Start isEmpty. Operand 21 states and 22 transitions. [2018-06-18 13:27:59,725 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-18 13:27:59,725 INFO ]: Found error trace [2018-06-18 13:27:59,725 INFO ]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:27:59,725 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:27:59,725 INFO ]: Analyzing trace with hash 853117551, now seen corresponding path program 5 times [2018-06-18 13:27:59,725 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:27:59,725 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:27:59,726 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:27:59,726 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:27:59,726 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:27:59,763 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:27:59,764 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:28:00,142 WARN ]: Spent 126.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 23 [2018-06-18 13:28:00,360 INFO ]: Checked inductivity of 55 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-18 13:28:00,360 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:28:00,360 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 13:28:00,366 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-18 13:28:00,470 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-18 13:28:00,470 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:28:00,474 INFO ]: Computing forward predicates... [2018-06-18 13:28:01,012 WARN ]: Spent 184.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-06-18 13:28:01,199 WARN ]: Spent 131.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2018-06-18 13:28:03,202 WARN ]: Spent 1.51 s on a formula simplification. DAG size of input: 51 DAG size of output: 20 [2018-06-18 13:28:03,735 INFO ]: Checked inductivity of 55 backedges. 1 proven. 39 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-18 13:28:03,755 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:28:03,756 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 22 [2018-06-18 13:28:03,756 INFO ]: Interpolant automaton has 22 states [2018-06-18 13:28:03,756 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-18 13:28:03,756 INFO ]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2018-06-18 13:28:03,756 INFO ]: Start difference. First operand 21 states and 22 transitions. Second operand 22 states. [2018-06-18 13:28:04,033 WARN ]: Spent 224.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2018-06-18 13:28:04,490 WARN ]: Spent 326.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2018-06-18 13:28:04,686 WARN ]: Spent 177.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2018-06-18 13:28:05,072 WARN ]: Spent 245.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 38 [2018-06-18 13:28:05,101 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:28:05,101 INFO ]: Finished difference Result 23 states and 24 transitions. [2018-06-18 13:28:05,104 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-18 13:28:05,104 INFO ]: Start accepts. Automaton has 22 states. Word has length 29 [2018-06-18 13:28:05,104 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:28:05,105 INFO ]: With dead ends: 23 [2018-06-18 13:28:05,105 INFO ]: Without dead ends: 23 [2018-06-18 13:28:05,105 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=166, Invalid=646, Unknown=0, NotChecked=0, Total=812 [2018-06-18 13:28:05,105 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-18 13:28:05,108 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-18 13:28:05,108 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-18 13:28:05,109 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-06-18 13:28:05,109 INFO ]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 29 [2018-06-18 13:28:05,109 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:28:05,109 INFO ]: Abstraction has 23 states and 24 transitions. [2018-06-18 13:28:05,109 INFO ]: Interpolant automaton has 22 states. [2018-06-18 13:28:05,109 INFO ]: Start isEmpty. Operand 23 states and 24 transitions. [2018-06-18 13:28:05,110 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-18 13:28:05,110 INFO ]: Found error trace [2018-06-18 13:28:05,110 INFO ]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:28:05,110 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:28:05,110 INFO ]: Analyzing trace with hash -1661294575, now seen corresponding path program 6 times [2018-06-18 13:28:05,110 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:28:05,110 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:28:05,111 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:28:05,111 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:28:05,111 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:28:05,193 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:28:05,196 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:28:05,689 WARN ]: Spent 133.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2018-06-18 13:28:05,853 INFO ]: Checked inductivity of 78 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-18 13:28:05,853 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:28:05,853 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 13:28:05,859 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-18 13:28:05,910 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-18 13:28:05,910 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:28:05,915 INFO ]: Computing forward predicates... [2018-06-18 13:28:11,383 WARN ]: Spent 4.96 s on a formula simplification. DAG size of input: 643 DAG size of output: 78 [2018-06-18 13:28:13,431 INFO ]: Checked inductivity of 78 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-18 13:28:13,464 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:28:13,464 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 25 [2018-06-18 13:28:13,464 INFO ]: Interpolant automaton has 25 states [2018-06-18 13:28:13,464 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-18 13:28:13,465 INFO ]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2018-06-18 13:28:13,465 INFO ]: Start difference. First operand 23 states and 24 transitions. Second operand 25 states. [2018-06-18 13:28:14,189 WARN ]: Spent 678.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 74 [2018-06-18 13:28:14,561 WARN ]: Spent 331.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 33 [2018-06-18 13:28:14,948 WARN ]: Spent 347.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 39 [2018-06-18 13:28:15,393 WARN ]: Spent 412.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 57 [2018-06-18 13:28:15,949 WARN ]: Spent 418.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 45 [2018-06-18 13:28:16,514 WARN ]: Spent 530.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 52 [2018-06-18 13:28:16,984 WARN ]: Spent 439.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 66 [2018-06-18 13:28:17,015 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:28:17,016 INFO ]: Finished difference Result 25 states and 26 transitions. [2018-06-18 13:28:17,016 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-18 13:28:17,016 INFO ]: Start accepts. Automaton has 25 states. Word has length 33 [2018-06-18 13:28:17,017 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:28:17,017 INFO ]: With dead ends: 25 [2018-06-18 13:28:17,017 INFO ]: Without dead ends: 25 [2018-06-18 13:28:17,018 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=174, Invalid=818, Unknown=0, NotChecked=0, Total=992 [2018-06-18 13:28:17,018 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-18 13:28:17,021 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-18 13:28:17,021 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-18 13:28:17,022 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-06-18 13:28:17,022 INFO ]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 33 [2018-06-18 13:28:17,022 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:28:17,022 INFO ]: Abstraction has 25 states and 26 transitions. [2018-06-18 13:28:17,022 INFO ]: Interpolant automaton has 25 states. [2018-06-18 13:28:17,022 INFO ]: Start isEmpty. Operand 25 states and 26 transitions. [2018-06-18 13:28:17,023 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-18 13:28:17,023 INFO ]: Found error trace [2018-06-18 13:28:17,023 INFO ]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:28:17,023 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:28:17,023 INFO ]: Analyzing trace with hash -1494134477, now seen corresponding path program 7 times [2018-06-18 13:28:17,023 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:28:17,023 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:28:17,024 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:28:17,024 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:28:17,024 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:28:17,102 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:28:17,103 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:28:17,341 WARN ]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2018-06-18 13:28:17,793 WARN ]: Spent 397.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2018-06-18 13:28:18,425 INFO ]: Checked inductivity of 105 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-18 13:28:18,425 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:28:18,425 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 13:28:18,431 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 13:28:18,472 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:28:18,478 INFO ]: Computing forward predicates... [2018-06-18 13:28:23,952 WARN ]: Spent 137.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 24 [2018-06-18 13:28:24,645 WARN ]: Spent 476.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 34 [2018-06-18 13:28:26,154 INFO ]: Checked inductivity of 105 backedges. 1 proven. 76 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-18 13:28:26,175 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:28:26,175 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 28 [2018-06-18 13:28:26,175 INFO ]: Interpolant automaton has 28 states [2018-06-18 13:28:26,175 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-18 13:28:26,176 INFO ]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2018-06-18 13:28:26,176 INFO ]: Start difference. First operand 25 states and 26 transitions. Second operand 28 states. [2018-06-18 13:28:26,465 WARN ]: Spent 256.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2018-06-18 13:28:26,606 WARN ]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 21 [2018-06-18 13:28:26,801 WARN ]: Spent 166.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2018-06-18 13:28:27,129 WARN ]: Spent 230.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 43 [2018-06-18 13:28:27,358 WARN ]: Spent 204.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 40 [2018-06-18 13:28:27,694 WARN ]: Spent 309.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 45 [2018-06-18 13:28:27,976 WARN ]: Spent 252.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2018-06-18 13:28:28,437 WARN ]: Spent 434.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2018-06-18 13:28:28,470 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:28:28,470 INFO ]: Finished difference Result 27 states and 28 transitions. [2018-06-18 13:28:28,470 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-18 13:28:28,470 INFO ]: Start accepts. Automaton has 28 states. Word has length 37 [2018-06-18 13:28:28,471 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:28:28,471 INFO ]: With dead ends: 27 [2018-06-18 13:28:28,471 INFO ]: Without dead ends: 27 [2018-06-18 13:28:28,472 INFO ]: 0 DeclaredPredicates, 62 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=247, Invalid=1013, Unknown=0, NotChecked=0, Total=1260 [2018-06-18 13:28:28,472 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-18 13:28:28,478 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-18 13:28:28,478 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-18 13:28:28,478 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-06-18 13:28:28,478 INFO ]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 37 [2018-06-18 13:28:28,478 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:28:28,478 INFO ]: Abstraction has 27 states and 28 transitions. [2018-06-18 13:28:28,478 INFO ]: Interpolant automaton has 28 states. [2018-06-18 13:28:28,478 INFO ]: Start isEmpty. Operand 27 states and 28 transitions. [2018-06-18 13:28:28,479 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-18 13:28:28,479 INFO ]: Found error trace [2018-06-18 13:28:28,479 INFO ]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:28:28,480 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:28:28,480 INFO ]: Analyzing trace with hash 1618126293, now seen corresponding path program 8 times [2018-06-18 13:28:28,480 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:28:28,480 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:28:28,480 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:28:28,480 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 13:28:28,480 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:28:28,533 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:28:28,534 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:28:29,409 INFO ]: Checked inductivity of 136 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-18 13:28:29,409 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:28:29,409 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 13:28:29,415 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-18 13:28:29,476 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-18 13:28:29,476 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:28:29,481 INFO ]: Computing forward predicates... [2018-06-18 13:28:34,046 WARN ]: Spent 159.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2018-06-18 13:28:34,921 INFO ]: Checked inductivity of 136 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-18 13:28:34,941 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:28:34,941 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 32 [2018-06-18 13:28:34,941 INFO ]: Interpolant automaton has 32 states [2018-06-18 13:28:34,941 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-18 13:28:34,942 INFO ]: CoverageRelationStatistics Valid=115, Invalid=877, Unknown=0, NotChecked=0, Total=992 [2018-06-18 13:28:34,942 INFO ]: Start difference. First operand 27 states and 28 transitions. Second operand 32 states. [2018-06-18 13:28:35,681 WARN ]: Spent 673.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2018-06-18 13:28:35,872 WARN ]: Spent 133.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 21 [2018-06-18 13:28:36,158 WARN ]: Spent 259.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 33 [2018-06-18 13:28:36,426 WARN ]: Spent 235.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 37 [2018-06-18 13:28:36,749 WARN ]: Spent 293.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 38 [2018-06-18 13:28:37,050 WARN ]: Spent 270.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 36 [2018-06-18 13:28:37,446 WARN ]: Spent 366.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 46 [2018-06-18 13:28:37,770 WARN ]: Spent 275.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 36 [2018-06-18 13:28:38,340 WARN ]: Spent 513.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 53 [2018-06-18 13:28:38,372 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 13:28:38,372 INFO ]: Finished difference Result 29 states and 30 transitions. [2018-06-18 13:28:38,372 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-18 13:28:38,372 INFO ]: Start accepts. Automaton has 32 states. Word has length 41 [2018-06-18 13:28:38,372 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 13:28:38,373 INFO ]: With dead ends: 29 [2018-06-18 13:28:38,373 INFO ]: Without dead ends: 29 [2018-06-18 13:28:38,373 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=301, Invalid=1339, Unknown=0, NotChecked=0, Total=1640 [2018-06-18 13:28:38,374 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-18 13:28:38,377 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-18 13:28:38,377 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-18 13:28:38,378 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-06-18 13:28:38,378 INFO ]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 41 [2018-06-18 13:28:38,378 INFO ]: Finished accepts. word is rejected. [2018-06-18 13:28:38,378 INFO ]: Abstraction has 29 states and 30 transitions. [2018-06-18 13:28:38,378 INFO ]: Interpolant automaton has 32 states. [2018-06-18 13:28:38,378 INFO ]: Start isEmpty. Operand 29 states and 30 transitions. [2018-06-18 13:28:38,379 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-18 13:28:38,379 INFO ]: Found error trace [2018-06-18 13:28:38,379 INFO ]: trace histogram [10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 13:28:38,379 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 13:28:38,379 INFO ]: Analyzing trace with hash 996918775, now seen corresponding path program 9 times [2018-06-18 13:28:38,379 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 13:28:38,380 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 13:28:38,380 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:28:38,380 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 13:28:38,380 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 13:28:38,444 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:28:38,444 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 13:28:39,245 WARN ]: Spent 552.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-06-18 13:28:40,039 INFO ]: Checked inductivity of 171 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-18 13:28:40,040 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 13:28:40,040 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 13:28:40,045 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-18 13:28:40,103 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-06-18 13:28:40,103 INFO ]: Conjunction of SSA is unsat [2018-06-18 13:28:40,110 INFO ]: Computing forward predicates... [2018-06-18 13:28:44,614 WARN ]: Spent 4.08 s on a formula simplification. DAG size of input: 735 DAG size of output: 67 [2018-06-18 13:28:44,883 WARN ]: Spent 219.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 28 [2018-06-18 13:28:45,079 WARN ]: Spent 147.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2018-06-18 13:28:45,617 WARN ]: Spent 451.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 34 [2018-06-18 13:28:46,321 WARN ]: Spent 470.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 30 [2018-06-18 13:28:47,152 INFO ]: Checked inductivity of 171 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-18 13:28:47,172 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 13:28:47,172 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 34 [2018-06-18 13:28:47,174 INFO ]: Interpolant automaton has 34 states [2018-06-18 13:28:47,174 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-18 13:28:47,175 INFO ]: CoverageRelationStatistics Valid=102, Invalid=1020, Unknown=0, NotChecked=0, Total=1122 [2018-06-18 13:28:47,175 INFO ]: Start difference. First operand 29 states and 30 transitions. Second operand 34 states. [2018-06-18 13:28:48,354 WARN ]: Spent 1.08 s on a formula simplification. DAG size of input: 150 DAG size of output: 96 [2018-06-18 13:28:49,112 WARN ]: Spent 613.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 52 [2018-06-18 13:28:49,717 WARN ]: Spent 560.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 67 [2018-06-18 13:28:50,362 WARN ]: Spent 598.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 67 [2018-06-18 13:28:51,035 WARN ]: Spent 627.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 71 [2018-06-18 13:28:52,098 WARN ]: Spent 1.02 s on a formula simplification. DAG size of input: 160 DAG size of output: 43 [2018-06-18 13:28:52,553 WARN ]: Spent 407.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 39 [2018-06-18 13:28:53,221 WARN ]: Spent 619.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 74 Received shutdown request... [2018-06-18 13:28:53,704 WARN ]: Removed 10 from assertion stack [2018-06-18 13:28:53,704 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-18 13:28:53,704 WARN ]: Verification canceled [2018-06-18 13:28:53,707 WARN ]: Timeout [2018-06-18 13:28:53,707 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.06 01:28:53 BoogieIcfgContainer [2018-06-18 13:28:53,707 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-18 13:28:53,708 INFO ]: Toolchain (without parser) took 61260.66 ms. Allocated memory was 303.6 MB in the beginning and 1.3 GB in the end (delta: 982.0 MB). Free memory was 257.9 MB in the beginning and 631.0 MB in the end (delta: -373.1 MB). Peak memory consumption was 608.9 MB. Max. memory is 3.6 GB. [2018-06-18 13:28:53,709 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 303.6 MB. Free memory is still 269.0 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-18 13:28:53,709 INFO ]: ChcToBoogie took 62.89 ms. Allocated memory is still 303.6 MB. Free memory was 256.9 MB in the beginning and 254.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-18 13:28:53,709 INFO ]: Boogie Preprocessor took 58.77 ms. Allocated memory is still 303.6 MB. Free memory was 254.9 MB in the beginning and 252.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-18 13:28:53,710 INFO ]: RCFGBuilder took 280.67 ms. Allocated memory is still 303.6 MB. Free memory was 252.9 MB in the beginning and 244.8 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 3.6 GB. [2018-06-18 13:28:53,710 INFO ]: TraceAbstraction took 60850.35 ms. Allocated memory was 303.6 MB in the beginning and 1.3 GB in the end (delta: 982.0 MB). Free memory was 244.8 MB in the beginning and 631.0 MB in the end (delta: -386.2 MB). Peak memory consumption was 595.8 MB. Max. memory is 3.6 GB. [2018-06-18 13:28:53,713 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 303.6 MB. Free memory is still 269.0 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 62.89 ms. Allocated memory is still 303.6 MB. Free memory was 256.9 MB in the beginning and 254.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 58.77 ms. Allocated memory is still 303.6 MB. Free memory was 254.9 MB in the beginning and 252.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 280.67 ms. Allocated memory is still 303.6 MB. Free memory was 252.9 MB in the beginning and 244.8 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 60850.35 ms. Allocated memory was 303.6 MB in the beginning and 1.3 GB in the end (delta: 982.0 MB). Free memory was 244.8 MB in the beginning and 631.0 MB in the end (delta: -386.2 MB). Peak memory consumption was 595.8 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 (29states) and interpolant automaton (currently 12 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 152. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 13 locations, 1 error locations. TIMEOUT Result, 60.7s OverallTime, 10 OverallIterations, 10 TraceHistogramMax, 19.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 130 SDtfs, 435 SDslu, 850 SDs, 0 SdLazy, 773 SolverSat, 529 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 435 GetRequests, 195 SyntacticMatches, 19 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1062 ImplicationChecksByTransitivity, 41.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 39.8s InterpolantComputationTime, 531 NumberOfCodeBlocks, 531 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 512 ConstructedInterpolants, 0 QuantifiedInterpolants, 4265532 SizeOfPredicates, 567 NumberOfNonLiveVariables, 1863 ConjunctsInSsa, 438 ConjunctsInUnsatCore, 19 InterpolantComputations, 1 PerfectInterpolantSequences, 332/1230 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/nested2.c.smt2_chcToBoogie_automizer.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-18_13-28-53-722.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/nested2.c.smt2_chcToBoogie_automizer.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-18_13-28-53-722.csv Completed graceful shutdown