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/llreve/square_twice_merged_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:04:10,713 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:04:10,715 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:04:10,735 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:04:10,735 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:04:10,737 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:04:10,738 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:04:10,742 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:04:10,744 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:04:10,745 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:04:10,746 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:04:10,746 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:04:10,747 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:04:10,748 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:04:10,749 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:04:10,750 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:04:10,752 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:04:10,763 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:04:10,765 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:04:10,765 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:04:10,766 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:04:10,768 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:04:10,769 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:04:10,769 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:04:10,770 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:04:10,770 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:04:10,771 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:04:10,772 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:04:10,773 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:04:10,773 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:04:10,773 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:04:10,774 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:04:10,774 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:04:10,777 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:04:10,778 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:04:10,778 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 11:04:10,791 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:04:10,791 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:04:10,792 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:04:10,792 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:04:10,793 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:04:10,793 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:04:10,794 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:04:10,794 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:04:10,794 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:04:10,794 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:04:10,795 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:04:10,795 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:04:10,795 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:04:10,795 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:04:10,795 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:04:10,796 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:04:10,796 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:04:10,796 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:04:10,796 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:04:10,798 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:04:10,798 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:04:10,833 INFO ]: Repository-Root is: /tmp [2018-06-22 11:04:10,849 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:04:10,856 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:04:10,858 INFO ]: Initializing SmtParser... [2018-06-22 11:04:10,859 INFO ]: SmtParser initialized [2018-06-22 11:04:10,859 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/square_twice_merged_safe.c-1.smt2 [2018-06-22 11:04:10,860 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 11:04:10,981 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/square_twice_merged_safe.c-1.smt2 unknown [2018-06-22 11:04:11,187 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/square_twice_merged_safe.c-1.smt2 [2018-06-22 11:04:11,192 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:04:11,198 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:04:11,199 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:04:11,199 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:04:11,199 INFO ]: ChcToBoogie initialized [2018-06-22 11:04:11,202 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:04:11" (1/1) ... [2018-06-22 11:04:11,256 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:04:11 Unit [2018-06-22 11:04:11,256 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:04:11,259 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:04:11,259 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:04:11,259 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:04:11,282 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:04:11" (1/1) ... [2018-06-22 11:04:11,282 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:04:11" (1/1) ... [2018-06-22 11:04:11,293 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:04:11" (1/1) ... [2018-06-22 11:04:11,293 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:04:11" (1/1) ... [2018-06-22 11:04:11,296 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:04:11" (1/1) ... [2018-06-22 11:04:11,298 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:04:11" (1/1) ... [2018-06-22 11:04:11,299 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:04:11" (1/1) ... [2018-06-22 11:04:11,300 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:04:11,301 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:04:11,301 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:04:11,301 INFO ]: RCFGBuilder initialized [2018-06-22 11:04:11,302 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:04:11" (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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:04:11,311 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:04:11,311 INFO ]: Found specification of procedure False [2018-06-22 11:04:11,311 INFO ]: Found implementation of procedure False [2018-06-22 11:04:11,311 INFO ]: Specification and implementation of procedure inv_main18 given in one single declaration [2018-06-22 11:04:11,311 INFO ]: Found specification of procedure inv_main18 [2018-06-22 11:04:11,312 INFO ]: Found implementation of procedure inv_main18 [2018-06-22 11:04:11,312 INFO ]: Specification and implementation of procedure inv_main12 given in one single declaration [2018-06-22 11:04:11,312 INFO ]: Found specification of procedure inv_main12 [2018-06-22 11:04:11,312 INFO ]: Found implementation of procedure inv_main12 [2018-06-22 11:04:11,312 INFO ]: Specification and implementation of procedure inv_main5 given in one single declaration [2018-06-22 11:04:11,312 INFO ]: Found specification of procedure inv_main5 [2018-06-22 11:04:11,312 INFO ]: Found implementation of procedure inv_main5 [2018-06-22 11:04:11,312 INFO ]: Specification and implementation of procedure inv_main4 given in one single declaration [2018-06-22 11:04:11,312 INFO ]: Found specification of procedure inv_main4 [2018-06-22 11:04:11,312 INFO ]: Found implementation of procedure inv_main4 [2018-06-22 11:04:11,312 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:04:11,312 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:04:11,312 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 11:04:11,593 INFO ]: Using library mode [2018-06-22 11:04:11,594 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:04:11 BoogieIcfgContainer [2018-06-22 11:04:11,594 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:04:11,595 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:04:11,595 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:04:11,598 INFO ]: TraceAbstraction initialized [2018-06-22 11:04:11,599 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:04:11" (1/3) ... [2018-06-22 11:04:11,600 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a86c476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:04:11, skipping insertion in model container [2018-06-22 11:04:11,600 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:04:11" (2/3) ... [2018-06-22 11:04:11,600 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a86c476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:04:11, skipping insertion in model container [2018-06-22 11:04:11,600 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:04:11" (3/3) ... [2018-06-22 11:04:11,602 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:04:11,611 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:04:11,620 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:04:11,657 INFO ]: Using default assertion order modulation [2018-06-22 11:04:11,658 INFO ]: Interprodecural is true [2018-06-22 11:04:11,658 INFO ]: Hoare is false [2018-06-22 11:04:11,658 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:04:11,658 INFO ]: Backedges is TWOTRACK [2018-06-22 11:04:11,658 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:04:11,658 INFO ]: Difference is false [2018-06-22 11:04:11,658 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:04:11,658 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:04:11,673 INFO ]: Start isEmpty. Operand 29 states. [2018-06-22 11:04:11,686 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:04:11,686 INFO ]: Found error trace [2018-06-22 11:04:11,687 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 11:04:11,687 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:04:11,693 INFO ]: Analyzing trace with hash -1216836322, now seen corresponding path program 1 times [2018-06-22 11:04:11,695 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:04:11,695 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:04:11,732 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:11,732 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:04:11,732 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:11,777 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:11,945 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:04:11,947 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:04:11,947 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:04:11,949 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:04:11,960 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:04:11,961 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:04:11,962 INFO ]: Start difference. First operand 29 states. Second operand 4 states. [2018-06-22 11:04:12,124 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:04:12,124 INFO ]: Finished difference Result 31 states and 43 transitions. [2018-06-22 11:04:12,125 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:04:12,126 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 11:04:12,126 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:04:12,135 INFO ]: With dead ends: 31 [2018-06-22 11:04:12,135 INFO ]: Without dead ends: 31 [2018-06-22 11:04:12,136 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:04:12,151 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:04:12,177 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-06-22 11:04:12,178 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 11:04:12,180 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2018-06-22 11:04:12,181 INFO ]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 21 [2018-06-22 11:04:12,182 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:04:12,182 INFO ]: Abstraction has 29 states and 40 transitions. [2018-06-22 11:04:12,182 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:04:12,182 INFO ]: Start isEmpty. Operand 29 states and 40 transitions. [2018-06-22 11:04:12,184 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:04:12,184 INFO ]: Found error trace [2018-06-22 11:04:12,184 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 11:04:12,184 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:04:12,185 INFO ]: Analyzing trace with hash -1364837164, now seen corresponding path program 1 times [2018-06-22 11:04:12,185 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:04:12,185 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:04:12,186 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:12,186 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:04:12,186 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:12,201 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:12,368 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:04:12,368 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:04:12,369 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:04:12,370 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:04:12,370 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:04:12,371 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:04:12,371 INFO ]: Start difference. First operand 29 states and 40 transitions. Second operand 6 states. [2018-06-22 11:04:12,857 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:04:12,857 INFO ]: Finished difference Result 35 states and 49 transitions. [2018-06-22 11:04:12,858 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:04:12,858 INFO ]: Start accepts. Automaton has 6 states. Word has length 21 [2018-06-22 11:04:12,858 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:04:12,859 INFO ]: With dead ends: 35 [2018-06-22 11:04:12,859 INFO ]: Without dead ends: 35 [2018-06-22 11:04:12,860 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:04:12,860 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 11:04:12,871 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-06-22 11:04:12,871 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:04:12,872 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2018-06-22 11:04:12,872 INFO ]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 21 [2018-06-22 11:04:12,872 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:04:12,872 INFO ]: Abstraction has 33 states and 46 transitions. [2018-06-22 11:04:12,872 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:04:12,872 INFO ]: Start isEmpty. Operand 33 states and 46 transitions. [2018-06-22 11:04:12,873 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:04:12,873 INFO ]: Found error trace [2018-06-22 11:04:12,873 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 11:04:12,874 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:04:12,874 INFO ]: Analyzing trace with hash 856646905, now seen corresponding path program 1 times [2018-06-22 11:04:12,874 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:04:12,874 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:04:12,875 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:12,875 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:04:12,875 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:12,885 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:12,946 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:04:12,946 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:04:12,947 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:04:12,947 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:04:12,947 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:04:12,947 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:04:12,947 INFO ]: Start difference. First operand 33 states and 46 transitions. Second operand 4 states. [2018-06-22 11:04:13,001 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:04:13,002 INFO ]: Finished difference Result 35 states and 47 transitions. [2018-06-22 11:04:13,002 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:04:13,002 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 11:04:13,002 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:04:13,004 INFO ]: With dead ends: 35 [2018-06-22 11:04:13,004 INFO ]: Without dead ends: 35 [2018-06-22 11:04:13,004 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-22 11:04:13,004 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 11:04:13,013 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-06-22 11:04:13,013 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:04:13,014 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2018-06-22 11:04:13,014 INFO ]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 21 [2018-06-22 11:04:13,014 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:04:13,014 INFO ]: Abstraction has 33 states and 44 transitions. [2018-06-22 11:04:13,014 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:04:13,014 INFO ]: Start isEmpty. Operand 33 states and 44 transitions. [2018-06-22 11:04:13,017 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:04:13,017 INFO ]: Found error trace [2018-06-22 11:04:13,017 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 11:04:13,017 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:04:13,017 INFO ]: Analyzing trace with hash -1592176527, now seen corresponding path program 1 times [2018-06-22 11:04:13,017 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:04:13,017 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:04:13,018 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:13,018 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:04:13,018 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:13,022 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:13,149 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:04:13,149 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:04:13,149 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:04:13,149 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:04:13,150 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:04:13,150 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:04:13,150 INFO ]: Start difference. First operand 33 states and 44 transitions. Second operand 5 states. [2018-06-22 11:04:13,183 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:04:13,183 INFO ]: Finished difference Result 37 states and 51 transitions. [2018-06-22 11:04:13,183 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:04:13,183 INFO ]: Start accepts. Automaton has 5 states. Word has length 21 [2018-06-22 11:04:13,183 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:04:13,186 INFO ]: With dead ends: 37 [2018-06-22 11:04:13,186 INFO ]: Without dead ends: 37 [2018-06-22 11:04:13,186 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:04:13,186 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 11:04:13,194 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-06-22 11:04:13,194 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 11:04:13,196 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2018-06-22 11:04:13,196 INFO ]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 21 [2018-06-22 11:04:13,197 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:04:13,197 INFO ]: Abstraction has 37 states and 51 transitions. [2018-06-22 11:04:13,197 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:04:13,197 INFO ]: Start isEmpty. Operand 37 states and 51 transitions. [2018-06-22 11:04:13,198 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:04:13,198 INFO ]: Found error trace [2018-06-22 11:04:13,198 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:04:13,199 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:04:13,199 INFO ]: Analyzing trace with hash 70316825, now seen corresponding path program 1 times [2018-06-22 11:04:13,199 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:04:13,199 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:04:13,200 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:13,200 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:04:13,200 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:13,216 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:13,350 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:04:13,350 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:04:13,350 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:04:13,351 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:04:13,351 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:04:13,351 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:04:13,351 INFO ]: Start difference. First operand 37 states and 51 transitions. Second operand 6 states. [2018-06-22 11:04:13,473 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:04:13,473 INFO ]: Finished difference Result 43 states and 58 transitions. [2018-06-22 11:04:13,473 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:04:13,473 INFO ]: Start accepts. Automaton has 6 states. Word has length 25 [2018-06-22 11:04:13,473 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:04:13,475 INFO ]: With dead ends: 43 [2018-06-22 11:04:13,475 INFO ]: Without dead ends: 43 [2018-06-22 11:04:13,475 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:04:13,475 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 11:04:13,483 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-06-22 11:04:13,483 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 11:04:13,484 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2018-06-22 11:04:13,485 INFO ]: Start accepts. Automaton has 39 states and 53 transitions. Word has length 25 [2018-06-22 11:04:13,485 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:04:13,485 INFO ]: Abstraction has 39 states and 53 transitions. [2018-06-22 11:04:13,485 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:04:13,485 INFO ]: Start isEmpty. Operand 39 states and 53 transitions. [2018-06-22 11:04:13,486 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:04:13,486 INFO ]: Found error trace [2018-06-22 11:04:13,486 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, 1, 1, 1, 1] [2018-06-22 11:04:13,486 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:04:13,487 INFO ]: Analyzing trace with hash -126872360, now seen corresponding path program 1 times [2018-06-22 11:04:13,487 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:04:13,487 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:04:13,488 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:13,488 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:04:13,488 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:13,499 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:13,723 INFO ]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:04:13,723 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:04:13,723 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:04:13,723 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:04:13,723 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:04:13,723 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:04:13,723 INFO ]: Start difference. First operand 39 states and 53 transitions. Second operand 5 states. [2018-06-22 11:04:14,029 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:04:14,029 INFO ]: Finished difference Result 59 states and 85 transitions. [2018-06-22 11:04:14,030 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:04:14,030 INFO ]: Start accepts. Automaton has 5 states. Word has length 29 [2018-06-22 11:04:14,030 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:04:14,031 INFO ]: With dead ends: 59 [2018-06-22 11:04:14,031 INFO ]: Without dead ends: 57 [2018-06-22 11:04:14,031 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:04:14,032 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-22 11:04:14,041 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 51. [2018-06-22 11:04:14,041 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 11:04:14,043 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 76 transitions. [2018-06-22 11:04:14,043 INFO ]: Start accepts. Automaton has 51 states and 76 transitions. Word has length 29 [2018-06-22 11:04:14,043 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:04:14,043 INFO ]: Abstraction has 51 states and 76 transitions. [2018-06-22 11:04:14,043 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:04:14,043 INFO ]: Start isEmpty. Operand 51 states and 76 transitions. [2018-06-22 11:04:14,044 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:04:14,045 INFO ]: Found error trace [2018-06-22 11:04:14,045 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, 1, 1, 1, 1] [2018-06-22 11:04:14,045 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:04:14,045 INFO ]: Analyzing trace with hash -479778307, now seen corresponding path program 1 times [2018-06-22 11:04:14,045 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:04:14,045 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:04:14,046 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:14,046 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:04:14,046 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:14,055 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:14,098 INFO ]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:04:14,098 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:04:14,098 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:04:14,098 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:04:14,099 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:04:14,099 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:04:14,099 INFO ]: Start difference. First operand 51 states and 76 transitions. Second operand 5 states. [2018-06-22 11:04:14,273 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:04:14,273 INFO ]: Finished difference Result 80 states and 129 transitions. [2018-06-22 11:04:14,273 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:04:14,273 INFO ]: Start accepts. Automaton has 5 states. Word has length 29 [2018-06-22 11:04:14,274 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:04:14,277 INFO ]: With dead ends: 80 [2018-06-22 11:04:14,277 INFO ]: Without dead ends: 74 [2018-06-22 11:04:14,277 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:04:14,277 INFO ]: Start minimizeSevpa. Operand 74 states. [2018-06-22 11:04:14,293 INFO ]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-06-22 11:04:14,293 INFO ]: Start removeUnreachable. Operand 74 states. [2018-06-22 11:04:14,295 INFO ]: Finished removeUnreachable. Reduced from 74 states to 74 states and 115 transitions. [2018-06-22 11:04:14,295 INFO ]: Start accepts. Automaton has 74 states and 115 transitions. Word has length 29 [2018-06-22 11:04:14,295 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:04:14,295 INFO ]: Abstraction has 74 states and 115 transitions. [2018-06-22 11:04:14,295 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:04:14,295 INFO ]: Start isEmpty. Operand 74 states and 115 transitions. [2018-06-22 11:04:14,297 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:04:14,297 INFO ]: Found error trace [2018-06-22 11:04:14,298 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, 1, 1, 1, 1] [2018-06-22 11:04:14,298 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:04:14,299 INFO ]: Analyzing trace with hash -832684254, now seen corresponding path program 1 times [2018-06-22 11:04:14,299 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:04:14,299 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:04:14,299 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:14,299 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:04:14,299 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:14,307 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:14,348 INFO ]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:04:14,348 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:04:14,348 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:04:14,348 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:04:14,348 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:04:14,348 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:04:14,348 INFO ]: Start difference. First operand 74 states and 115 transitions. Second operand 5 states. [2018-06-22 11:04:14,497 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:04:14,497 INFO ]: Finished difference Result 78 states and 115 transitions. [2018-06-22 11:04:14,498 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:04:14,498 INFO ]: Start accepts. Automaton has 5 states. Word has length 29 [2018-06-22 11:04:14,498 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:04:14,499 INFO ]: With dead ends: 78 [2018-06-22 11:04:14,499 INFO ]: Without dead ends: 71 [2018-06-22 11:04:14,499 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:04:14,500 INFO ]: Start minimizeSevpa. Operand 71 states. [2018-06-22 11:04:14,512 INFO ]: Finished minimizeSevpa. Reduced states from 71 to 65. [2018-06-22 11:04:14,512 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-22 11:04:14,514 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 96 transitions. [2018-06-22 11:04:14,514 INFO ]: Start accepts. Automaton has 65 states and 96 transitions. Word has length 29 [2018-06-22 11:04:14,514 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:04:14,514 INFO ]: Abstraction has 65 states and 96 transitions. [2018-06-22 11:04:14,514 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:04:14,514 INFO ]: Start isEmpty. Operand 65 states and 96 transitions. [2018-06-22 11:04:14,515 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:04:14,515 INFO ]: Found error trace [2018-06-22 11:04:14,515 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:04:14,515 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:04:14,516 INFO ]: Analyzing trace with hash 697241930, now seen corresponding path program 1 times [2018-06-22 11:04:14,516 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:04:14,516 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:04:14,516 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:14,516 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:04:14,516 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:14,528 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:14,627 INFO ]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:04:14,627 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:04:14,627 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 11:04:14,640 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:04:14,680 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:14,687 INFO ]: Computing forward predicates... [2018-06-22 11:04:14,770 INFO ]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:04:14,794 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:04:14,794 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2018-06-22 11:04:14,794 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:04:14,794 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:04:14,794 INFO ]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:04:14,794 INFO ]: Start difference. First operand 65 states and 96 transitions. Second operand 9 states. [2018-06-22 11:04:14,969 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:04:14,969 INFO ]: Finished difference Result 65 states and 88 transitions. [2018-06-22 11:04:14,970 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:04:14,970 INFO ]: Start accepts. Automaton has 9 states. Word has length 33 [2018-06-22 11:04:14,970 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:04:14,971 INFO ]: With dead ends: 65 [2018-06-22 11:04:14,971 INFO ]: Without dead ends: 55 [2018-06-22 11:04:14,971 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:04:14,971 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-22 11:04:14,978 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 53. [2018-06-22 11:04:14,978 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 11:04:14,981 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 69 transitions. [2018-06-22 11:04:14,981 INFO ]: Start accepts. Automaton has 53 states and 69 transitions. Word has length 33 [2018-06-22 11:04:14,981 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:04:14,981 INFO ]: Abstraction has 53 states and 69 transitions. [2018-06-22 11:04:14,981 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:04:14,981 INFO ]: Start isEmpty. Operand 53 states and 69 transitions. [2018-06-22 11:04:14,982 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:04:14,982 INFO ]: Found error trace [2018-06-22 11:04:14,982 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:04:14,982 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:04:14,983 INFO ]: Analyzing trace with hash 879769373, now seen corresponding path program 1 times [2018-06-22 11:04:14,983 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:04:14,983 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:04:14,983 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:14,983 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:04:14,983 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:15,008 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:15,259 INFO ]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:04:15,259 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:04:15,259 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 11:04:15,266 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:04:15,296 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:15,301 INFO ]: Computing forward predicates... [2018-06-22 11:04:15,397 INFO ]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:04:15,418 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:04:15,418 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-22 11:04:15,418 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:04:15,418 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:04:15,418 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:04:15,418 INFO ]: Start difference. First operand 53 states and 69 transitions. Second operand 8 states. [2018-06-22 11:04:15,525 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:04:15,525 INFO ]: Finished difference Result 61 states and 77 transitions. [2018-06-22 11:04:15,528 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:04:15,528 INFO ]: Start accepts. Automaton has 8 states. Word has length 33 [2018-06-22 11:04:15,528 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:04:15,529 INFO ]: With dead ends: 61 [2018-06-22 11:04:15,529 INFO ]: Without dead ends: 54 [2018-06-22 11:04:15,530 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:04:15,530 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-22 11:04:15,544 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 48. [2018-06-22 11:04:15,544 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 11:04:15,545 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2018-06-22 11:04:15,545 INFO ]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 33 [2018-06-22 11:04:15,545 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:04:15,545 INFO ]: Abstraction has 48 states and 59 transitions. [2018-06-22 11:04:15,545 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:04:15,545 INFO ]: Start isEmpty. Operand 48 states and 59 transitions. [2018-06-22 11:04:15,546 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:04:15,546 INFO ]: Found error trace [2018-06-22 11:04:15,546 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:04:15,546 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:04:15,546 INFO ]: Analyzing trace with hash -2097683035, now seen corresponding path program 1 times [2018-06-22 11:04:15,546 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:04:15,546 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:04:15,547 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:15,547 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:04:15,547 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:15,573 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:15,746 INFO ]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:04:15,746 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:04:15,746 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 11:04:15,755 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:04:15,786 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:15,789 INFO ]: Computing forward predicates... [2018-06-22 11:04:15,973 INFO ]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:04:15,993 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:04:15,993 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2018-06-22 11:04:15,993 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:04:15,994 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:04:15,994 INFO ]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:04:15,994 INFO ]: Start difference. First operand 48 states and 59 transitions. Second operand 9 states. [2018-06-22 11:04:16,138 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:04:16,139 INFO ]: Finished difference Result 38 states and 47 transitions. [2018-06-22 11:04:16,139 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:04:16,139 INFO ]: Start accepts. Automaton has 9 states. Word has length 33 [2018-06-22 11:04:16,139 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:04:16,139 INFO ]: With dead ends: 38 [2018-06-22 11:04:16,139 INFO ]: Without dead ends: 0 [2018-06-22 11:04:16,140 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:04:16,140 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 11:04:16,140 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 11:04:16,140 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 11:04:16,140 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 11:04:16,140 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2018-06-22 11:04:16,140 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:04:16,140 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 11:04:16,140 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:04:16,140 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 11:04:16,140 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 11:04:16,144 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:04:16 BoogieIcfgContainer [2018-06-22 11:04:16,144 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:04:16,145 INFO ]: Toolchain (without parser) took 4952.81 ms. Allocated memory was 303.0 MB in the beginning and 340.8 MB in the end (delta: 37.7 MB). Free memory was 258.4 MB in the beginning and 289.6 MB in the end (delta: -31.1 MB). Peak memory consumption was 6.6 MB. Max. memory is 3.6 GB. [2018-06-22 11:04:16,147 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 303.0 MB. Free memory is still 268.5 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:04:16,147 INFO ]: ChcToBoogie took 59.66 ms. Allocated memory is still 303.0 MB. Free memory was 258.4 MB in the beginning and 256.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:04:16,148 INFO ]: Boogie Preprocessor took 41.53 ms. Allocated memory is still 303.0 MB. Free memory was 256.4 MB in the beginning and 255.4 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-22 11:04:16,150 INFO ]: RCFGBuilder took 293.12 ms. Allocated memory is still 303.0 MB. Free memory was 255.4 MB in the beginning and 246.3 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 3.6 GB. [2018-06-22 11:04:16,150 INFO ]: TraceAbstraction took 4549.33 ms. Allocated memory was 303.0 MB in the beginning and 340.8 MB in the end (delta: 37.7 MB). Free memory was 246.3 MB in the beginning and 289.6 MB in the end (delta: -43.2 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:04:16,155 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 303.0 MB. Free memory is still 268.5 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 59.66 ms. Allocated memory is still 303.0 MB. Free memory was 258.4 MB in the beginning and 256.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 41.53 ms. Allocated memory is still 303.0 MB. Free memory was 256.4 MB in the beginning and 255.4 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 293.12 ms. Allocated memory is still 303.0 MB. Free memory was 255.4 MB in the beginning and 246.3 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 4549.33 ms. Allocated memory was 303.0 MB in the beginning and 340.8 MB in the end (delta: 37.7 MB). Free memory was 246.3 MB in the beginning and 289.6 MB in the end (delta: -43.2 MB). There was no memory consumed. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 29 locations, 1 error locations. SAFE Result, 4.4s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 385 SDtfs, 31 SDslu, 1081 SDs, 0 SdLazy, 402 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 166 GetRequests, 110 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 30 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 394 NumberOfCodeBlocks, 394 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 380 ConstructedInterpolants, 0 QuantifiedInterpolants, 22784 SizeOfPredicates, 13 NumberOfNonLiveVariables, 380 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 67/75 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/square_twice_merged_safe.c-1.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-04-16-171.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/square_twice_merged_safe.c-1.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-04-16-171.csv Received shutdown request...