java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/llreve/square_twice_merged_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 17:54:09,066 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 17:54:09,069 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 17:54:09,081 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 17:54:09,082 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 17:54:09,083 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 17:54:09,084 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 17:54:09,085 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 17:54:09,087 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 17:54:09,088 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 17:54:09,088 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 17:54:09,089 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 17:54:09,090 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 17:54:09,090 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 17:54:09,091 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 17:54:09,094 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 17:54:09,094 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 17:54:09,096 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 17:54:09,107 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 17:54:09,108 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 17:54:09,109 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 17:54:09,115 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 17:54:09,117 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 17:54:09,117 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 17:54:09,117 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 17:54:09,120 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 17:54:09,121 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 17:54:09,122 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 17:54:09,122 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 17:54:09,123 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 17:54:09,124 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 17:54:09,124 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 17:54:09,124 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 17:54:09,125 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 17:54:09,125 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 17:54:09,126 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 17:54:09,126 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 17:54:09,151 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 17:54:09,151 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 17:54:09,152 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 17:54:09,152 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 17:54:09,153 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 17:54:09,153 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 17:54:09,153 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 17:54:09,153 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 17:54:09,154 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 17:54:09,155 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 17:54:09,155 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 17:54:09,155 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 17:54:09,155 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 17:54:09,155 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 17:54:09,155 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 17:54:09,156 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 17:54:09,156 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 17:54:09,156 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 17:54:09,156 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 17:54:09,156 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 17:54:09,156 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 17:54:09,159 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 17:54:09,160 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 17:54:09,202 INFO ]: Repository-Root is: /tmp [2018-06-26 17:54:09,218 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 17:54:09,225 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 17:54:09,227 INFO ]: Initializing SmtParser... [2018-06-26 17:54:09,227 INFO ]: SmtParser initialized [2018-06-26 17:54:09,228 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/square_twice_merged_safe.c-1.smt2 [2018-06-26 17:54:09,229 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-26 17:54:09,322 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/square_twice_merged_safe.c-1.smt2 unknown [2018-06-26 17:54:09,520 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/square_twice_merged_safe.c-1.smt2 [2018-06-26 17:54:09,524 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 17:54:09,536 INFO ]: Walking toolchain with 5 elements. [2018-06-26 17:54:09,536 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 17:54:09,536 INFO ]: Initializing ChcToBoogie... [2018-06-26 17:54:09,537 INFO ]: ChcToBoogie initialized [2018-06-26 17:54:09,540 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:54:09" (1/1) ... [2018-06-26 17:54:09,595 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:54:09 Unit [2018-06-26 17:54:09,595 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 17:54:09,595 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 17:54:09,596 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 17:54:09,596 INFO ]: Boogie Preprocessor initialized [2018-06-26 17:54:09,621 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:54:09" (1/1) ... [2018-06-26 17:54:09,621 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:54:09" (1/1) ... [2018-06-26 17:54:09,627 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:54:09" (1/1) ... [2018-06-26 17:54:09,627 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:54:09" (1/1) ... [2018-06-26 17:54:09,629 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:54:09" (1/1) ... [2018-06-26 17:54:09,632 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:54:09" (1/1) ... [2018-06-26 17:54:09,633 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:54:09" (1/1) ... [2018-06-26 17:54:09,637 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 17:54:09,638 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 17:54:09,638 INFO ]: Initializing RCFGBuilder... [2018-06-26 17:54:09,638 INFO ]: RCFGBuilder initialized [2018-06-26 17:54:09,639 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:54:09" (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-26 17:54:09,653 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 17:54:09,653 INFO ]: Found specification of procedure gotoProc [2018-06-26 17:54:09,654 INFO ]: Found implementation of procedure gotoProc [2018-06-26 17:54:09,654 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 17:54:09,654 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 17:54:09,654 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-26 17:54:09,936 INFO ]: Using library mode [2018-06-26 17:54:09,937 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:54:09 BoogieIcfgContainer [2018-06-26 17:54:09,937 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 17:54:09,937 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 17:54:09,937 INFO ]: Initializing BlockEncodingV2... [2018-06-26 17:54:09,938 INFO ]: BlockEncodingV2 initialized [2018-06-26 17:54:09,939 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:54:09" (1/1) ... [2018-06-26 17:54:09,956 INFO ]: Initial Icfg 13 locations, 17 edges [2018-06-26 17:54:09,958 INFO ]: Using Remove infeasible edges [2018-06-26 17:54:09,958 INFO ]: Using Maximize final states [2018-06-26 17:54:09,960 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 17:54:09,960 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 17:54:09,962 INFO ]: Using Remove sink states [2018-06-26 17:54:09,963 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 17:54:09,963 INFO ]: Using Use SBE [2018-06-26 17:54:09,969 INFO ]: SBE split 0 edges [2018-06-26 17:54:09,975 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 17:54:09,977 INFO ]: 0 new accepting states [2018-06-26 17:54:10,000 INFO ]: Removed 6 edges and 3 locations by large block encoding [2018-06-26 17:54:10,002 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 17:54:10,007 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 17:54:10,007 INFO ]: 0 new accepting states [2018-06-26 17:54:10,008 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 17:54:10,008 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 17:54:10,008 INFO ]: Encoded RCFG 8 locations, 12 edges [2018-06-26 17:54:10,008 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:54:10 BasicIcfg [2018-06-26 17:54:10,009 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 17:54:10,014 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 17:54:10,014 INFO ]: Initializing TraceAbstraction... [2018-06-26 17:54:10,018 INFO ]: TraceAbstraction initialized [2018-06-26 17:54:10,018 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:54:09" (1/4) ... [2018-06-26 17:54:10,019 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eb98d53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 05:54:10, skipping insertion in model container [2018-06-26 17:54:10,019 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:54:09" (2/4) ... [2018-06-26 17:54:10,019 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eb98d53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 05:54:10, skipping insertion in model container [2018-06-26 17:54:10,019 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:54:09" (3/4) ... [2018-06-26 17:54:10,020 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eb98d53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:54:10, skipping insertion in model container [2018-06-26 17:54:10,020 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:54:10" (4/4) ... [2018-06-26 17:54:10,022 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 17:54:10,031 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 17:54:10,039 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 17:54:10,089 INFO ]: Using default assertion order modulation [2018-06-26 17:54:10,090 INFO ]: Interprodecural is true [2018-06-26 17:54:10,090 INFO ]: Hoare is false [2018-06-26 17:54:10,090 INFO ]: Compute interpolants for FPandBP [2018-06-26 17:54:10,090 INFO ]: Backedges is TWOTRACK [2018-06-26 17:54:10,090 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 17:54:10,090 INFO ]: Difference is false [2018-06-26 17:54:10,090 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 17:54:10,090 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 17:54:10,104 INFO ]: Start isEmpty. Operand 8 states. [2018-06-26 17:54:10,124 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 17:54:10,125 INFO ]: Found error trace [2018-06-26 17:54:10,125 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:10,126 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:10,130 INFO ]: Analyzing trace with hash -1922653189, now seen corresponding path program 1 times [2018-06-26 17:54:10,132 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:10,133 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:10,166 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:10,166 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:54:10,166 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:10,209 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:10,266 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:10,267 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:54:10,267 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 17:54:10,268 INFO ]: Interpolant automaton has 3 states [2018-06-26 17:54:10,279 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 17:54:10,279 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:54:10,282 INFO ]: Start difference. First operand 8 states. Second operand 3 states. [2018-06-26 17:54:10,363 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:10,363 INFO ]: Finished difference Result 10 states and 17 transitions. [2018-06-26 17:54:10,363 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 17:54:10,364 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-26 17:54:10,364 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:10,371 INFO ]: With dead ends: 10 [2018-06-26 17:54:10,371 INFO ]: Without dead ends: 10 [2018-06-26 17:54:10,373 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:54:10,388 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-26 17:54:10,415 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-06-26 17:54:10,417 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 17:54:10,417 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2018-06-26 17:54:10,418 INFO ]: Start accepts. Automaton has 9 states and 13 transitions. Word has length 7 [2018-06-26 17:54:10,419 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:10,419 INFO ]: Abstraction has 9 states and 13 transitions. [2018-06-26 17:54:10,419 INFO ]: Interpolant automaton has 3 states. [2018-06-26 17:54:10,419 INFO ]: Start isEmpty. Operand 9 states and 13 transitions. [2018-06-26 17:54:10,419 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 17:54:10,419 INFO ]: Found error trace [2018-06-26 17:54:10,419 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:10,420 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:10,420 INFO ]: Analyzing trace with hash -1921729668, now seen corresponding path program 1 times [2018-06-26 17:54:10,420 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:10,420 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:10,421 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:10,421 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:54:10,421 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:10,428 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:10,563 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:10,563 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:54:10,563 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 17:54:10,565 INFO ]: Interpolant automaton has 4 states [2018-06-26 17:54:10,565 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 17:54:10,565 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 17:54:10,565 INFO ]: Start difference. First operand 9 states and 13 transitions. Second operand 4 states. [2018-06-26 17:54:10,867 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:10,867 INFO ]: Finished difference Result 13 states and 23 transitions. [2018-06-26 17:54:10,868 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 17:54:10,868 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-26 17:54:10,868 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:10,869 INFO ]: With dead ends: 13 [2018-06-26 17:54:10,869 INFO ]: Without dead ends: 13 [2018-06-26 17:54:10,870 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:54:10,870 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 17:54:10,871 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 11. [2018-06-26 17:54:10,871 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 17:54:10,872 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 18 transitions. [2018-06-26 17:54:10,872 INFO ]: Start accepts. Automaton has 11 states and 18 transitions. Word has length 7 [2018-06-26 17:54:10,872 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:10,872 INFO ]: Abstraction has 11 states and 18 transitions. [2018-06-26 17:54:10,872 INFO ]: Interpolant automaton has 4 states. [2018-06-26 17:54:10,872 INFO ]: Start isEmpty. Operand 11 states and 18 transitions. [2018-06-26 17:54:10,872 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:54:10,872 INFO ]: Found error trace [2018-06-26 17:54:10,872 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:10,872 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:10,872 INFO ]: Analyzing trace with hash -879261931, now seen corresponding path program 1 times [2018-06-26 17:54:10,872 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:10,873 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:10,874 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:10,874 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:54:10,875 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:10,888 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:10,924 INFO ]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:10,924 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:54:10,924 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 17:54:10,924 INFO ]: Interpolant automaton has 4 states [2018-06-26 17:54:10,924 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 17:54:10,924 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 17:54:10,925 INFO ]: Start difference. First operand 11 states and 18 transitions. Second operand 4 states. [2018-06-26 17:54:11,126 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:11,126 INFO ]: Finished difference Result 23 states and 36 transitions. [2018-06-26 17:54:11,126 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 17:54:11,126 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-26 17:54:11,127 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:11,128 INFO ]: With dead ends: 23 [2018-06-26 17:54:11,128 INFO ]: Without dead ends: 23 [2018-06-26 17:54:11,129 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:54:11,129 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-26 17:54:11,132 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 16. [2018-06-26 17:54:11,132 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-26 17:54:11,133 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 26 transitions. [2018-06-26 17:54:11,133 INFO ]: Start accepts. Automaton has 16 states and 26 transitions. Word has length 9 [2018-06-26 17:54:11,133 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:11,133 INFO ]: Abstraction has 16 states and 26 transitions. [2018-06-26 17:54:11,133 INFO ]: Interpolant automaton has 4 states. [2018-06-26 17:54:11,133 INFO ]: Start isEmpty. Operand 16 states and 26 transitions. [2018-06-26 17:54:11,134 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:54:11,134 INFO ]: Found error trace [2018-06-26 17:54:11,134 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:11,134 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:11,134 INFO ]: Analyzing trace with hash -878338410, now seen corresponding path program 1 times [2018-06-26 17:54:11,134 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:11,134 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:11,135 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:11,135 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:54:11,135 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:11,149 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:11,218 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:54:11,218 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:54:11,218 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 17:54:11,218 INFO ]: Interpolant automaton has 4 states [2018-06-26 17:54:11,218 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 17:54:11,218 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 17:54:11,218 INFO ]: Start difference. First operand 16 states and 26 transitions. Second operand 4 states. [2018-06-26 17:54:11,267 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:11,267 INFO ]: Finished difference Result 21 states and 36 transitions. [2018-06-26 17:54:11,267 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 17:54:11,267 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-26 17:54:11,268 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:11,268 INFO ]: With dead ends: 21 [2018-06-26 17:54:11,268 INFO ]: Without dead ends: 21 [2018-06-26 17:54:11,268 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:54:11,269 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-26 17:54:11,271 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 17. [2018-06-26 17:54:11,271 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-26 17:54:11,271 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 27 transitions. [2018-06-26 17:54:11,271 INFO ]: Start accepts. Automaton has 17 states and 27 transitions. Word has length 9 [2018-06-26 17:54:11,272 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:11,272 INFO ]: Abstraction has 17 states and 27 transitions. [2018-06-26 17:54:11,272 INFO ]: Interpolant automaton has 4 states. [2018-06-26 17:54:11,272 INFO ]: Start isEmpty. Operand 17 states and 27 transitions. [2018-06-26 17:54:11,272 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:54:11,272 INFO ]: Found error trace [2018-06-26 17:54:11,272 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:11,272 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:11,272 INFO ]: Analyzing trace with hash 1783249112, now seen corresponding path program 1 times [2018-06-26 17:54:11,272 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:11,272 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:11,273 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:11,273 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:54:11,273 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:11,289 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:11,351 INFO ]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:11,351 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:54:11,351 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 17:54:11,351 INFO ]: Interpolant automaton has 4 states [2018-06-26 17:54:11,351 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 17:54:11,351 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 17:54:11,352 INFO ]: Start difference. First operand 17 states and 27 transitions. Second operand 4 states. [2018-06-26 17:54:11,407 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:11,407 INFO ]: Finished difference Result 23 states and 31 transitions. [2018-06-26 17:54:11,408 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 17:54:11,408 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-26 17:54:11,408 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:11,408 INFO ]: With dead ends: 23 [2018-06-26 17:54:11,408 INFO ]: Without dead ends: 20 [2018-06-26 17:54:11,409 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:54:11,409 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-26 17:54:11,411 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 15. [2018-06-26 17:54:11,411 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-26 17:54:11,411 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2018-06-26 17:54:11,411 INFO ]: Start accepts. Automaton has 15 states and 20 transitions. Word has length 9 [2018-06-26 17:54:11,411 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:11,411 INFO ]: Abstraction has 15 states and 20 transitions. [2018-06-26 17:54:11,411 INFO ]: Interpolant automaton has 4 states. [2018-06-26 17:54:11,411 INFO ]: Start isEmpty. Operand 15 states and 20 transitions. [2018-06-26 17:54:11,412 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:54:11,412 INFO ]: Found error trace [2018-06-26 17:54:11,412 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:11,412 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:11,412 INFO ]: Analyzing trace with hash -1458952064, now seen corresponding path program 1 times [2018-06-26 17:54:11,412 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:11,412 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:11,414 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:11,414 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:54:11,414 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:11,431 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:11,603 INFO ]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:11,603 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:11,603 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-26 17:54:11,610 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:54:11,645 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:11,652 INFO ]: Computing forward predicates... [2018-06-26 17:54:11,781 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:54:11,802 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:11,802 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2018-06-26 17:54:11,802 INFO ]: Interpolant automaton has 10 states [2018-06-26 17:54:11,802 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 17:54:11,802 INFO ]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-06-26 17:54:11,802 INFO ]: Start difference. First operand 15 states and 20 transitions. Second operand 10 states. [2018-06-26 17:54:11,996 WARN ]: Spent 154.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-06-26 17:54:12,532 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:12,532 INFO ]: Finished difference Result 25 states and 33 transitions. [2018-06-26 17:54:12,532 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-26 17:54:12,532 INFO ]: Start accepts. Automaton has 10 states. Word has length 10 [2018-06-26 17:54:12,532 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:12,533 INFO ]: With dead ends: 25 [2018-06-26 17:54:12,533 INFO ]: Without dead ends: 25 [2018-06-26 17:54:12,533 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2018-06-26 17:54:12,533 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-26 17:54:12,535 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 18. [2018-06-26 17:54:12,535 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-26 17:54:12,536 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2018-06-26 17:54:12,536 INFO ]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 10 [2018-06-26 17:54:12,536 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:12,536 INFO ]: Abstraction has 18 states and 24 transitions. [2018-06-26 17:54:12,536 INFO ]: Interpolant automaton has 10 states. [2018-06-26 17:54:12,536 INFO ]: Start isEmpty. Operand 18 states and 24 transitions. [2018-06-26 17:54:12,537 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:54:12,537 INFO ]: Found error trace [2018-06-26 17:54:12,537 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:12,537 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:12,537 INFO ]: Analyzing trace with hash -525488355, now seen corresponding path program 1 times [2018-06-26 17:54:12,537 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:12,537 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:12,538 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:12,538 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:54:12,538 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:12,559 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:12,637 INFO ]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:12,638 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:12,638 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-26 17:54:12,647 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:54:12,669 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:12,671 INFO ]: Computing forward predicates... [2018-06-26 17:54:12,729 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:54:12,751 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:12,751 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2018-06-26 17:54:12,751 INFO ]: Interpolant automaton has 10 states [2018-06-26 17:54:12,751 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 17:54:12,751 INFO ]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-06-26 17:54:12,751 INFO ]: Start difference. First operand 18 states and 24 transitions. Second operand 10 states. [2018-06-26 17:54:13,017 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:13,017 INFO ]: Finished difference Result 22 states and 28 transitions. [2018-06-26 17:54:13,018 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-26 17:54:13,018 INFO ]: Start accepts. Automaton has 10 states. Word has length 10 [2018-06-26 17:54:13,018 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:13,018 INFO ]: With dead ends: 22 [2018-06-26 17:54:13,018 INFO ]: Without dead ends: 22 [2018-06-26 17:54:13,019 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2018-06-26 17:54:13,019 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-26 17:54:13,020 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 17. [2018-06-26 17:54:13,020 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-26 17:54:13,021 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2018-06-26 17:54:13,021 INFO ]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 10 [2018-06-26 17:54:13,021 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:13,021 INFO ]: Abstraction has 17 states and 22 transitions. [2018-06-26 17:54:13,021 INFO ]: Interpolant automaton has 10 states. [2018-06-26 17:54:13,021 INFO ]: Start isEmpty. Operand 17 states and 22 transitions. [2018-06-26 17:54:13,021 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 17:54:13,021 INFO ]: Found error trace [2018-06-26 17:54:13,022 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:13,022 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:13,022 INFO ]: Analyzing trace with hash 854659313, now seen corresponding path program 2 times [2018-06-26 17:54:13,022 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:13,022 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:13,022 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:13,022 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:54:13,023 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:13,039 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:13,102 INFO ]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-26 17:54:13,102 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:13,102 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-26 17:54:13,114 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:54:13,150 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:54:13,150 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:13,153 INFO ]: Computing forward predicates... [2018-06-26 17:54:13,315 INFO ]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 17:54:13,338 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:13,338 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2018-06-26 17:54:13,338 INFO ]: Interpolant automaton has 10 states [2018-06-26 17:54:13,338 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 17:54:13,338 INFO ]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-06-26 17:54:13,338 INFO ]: Start difference. First operand 17 states and 22 transitions. Second operand 10 states. [2018-06-26 17:54:13,582 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:13,582 INFO ]: Finished difference Result 29 states and 36 transitions. [2018-06-26 17:54:13,582 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-26 17:54:13,582 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-26 17:54:13,582 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:13,582 INFO ]: With dead ends: 29 [2018-06-26 17:54:13,582 INFO ]: Without dead ends: 15 [2018-06-26 17:54:13,583 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=277, Unknown=0, NotChecked=0, Total=420 [2018-06-26 17:54:13,583 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-26 17:54:13,584 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-26 17:54:13,584 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-26 17:54:13,584 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2018-06-26 17:54:13,584 INFO ]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 13 [2018-06-26 17:54:13,584 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:13,585 INFO ]: Abstraction has 15 states and 18 transitions. [2018-06-26 17:54:13,585 INFO ]: Interpolant automaton has 10 states. [2018-06-26 17:54:13,585 INFO ]: Start isEmpty. Operand 15 states and 18 transitions. [2018-06-26 17:54:13,585 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 17:54:13,585 INFO ]: Found error trace [2018-06-26 17:54:13,585 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:13,585 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:13,585 INFO ]: Analyzing trace with hash -241227468, now seen corresponding path program 2 times [2018-06-26 17:54:13,585 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:13,585 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:13,586 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:13,586 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:13,586 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:13,601 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:13,713 INFO ]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:13,713 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:13,713 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-26 17:54:13,719 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:54:13,740 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:54:13,740 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:13,742 INFO ]: Computing forward predicates... [2018-06-26 17:54:13,916 INFO ]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 17:54:13,936 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:13,937 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2018-06-26 17:54:13,937 INFO ]: Interpolant automaton has 15 states [2018-06-26 17:54:13,937 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-26 17:54:13,937 INFO ]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-06-26 17:54:13,937 INFO ]: Start difference. First operand 15 states and 18 transitions. Second operand 15 states. [2018-06-26 17:54:14,378 WARN ]: Spent 102.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-06-26 17:54:14,471 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:14,471 INFO ]: Finished difference Result 25 states and 30 transitions. [2018-06-26 17:54:14,472 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-26 17:54:14,472 INFO ]: Start accepts. Automaton has 15 states. Word has length 13 [2018-06-26 17:54:14,472 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:14,472 INFO ]: With dead ends: 25 [2018-06-26 17:54:14,472 INFO ]: Without dead ends: 25 [2018-06-26 17:54:14,473 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=199, Invalid=613, Unknown=0, NotChecked=0, Total=812 [2018-06-26 17:54:14,473 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-26 17:54:14,475 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 18. [2018-06-26 17:54:14,475 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-26 17:54:14,475 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-06-26 17:54:14,475 INFO ]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2018-06-26 17:54:14,475 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:14,475 INFO ]: Abstraction has 18 states and 21 transitions. [2018-06-26 17:54:14,475 INFO ]: Interpolant automaton has 15 states. [2018-06-26 17:54:14,475 INFO ]: Start isEmpty. Operand 18 states and 21 transitions. [2018-06-26 17:54:14,476 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-26 17:54:14,476 INFO ]: Found error trace [2018-06-26 17:54:14,476 INFO ]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:14,477 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:14,477 INFO ]: Analyzing trace with hash 2079346535, now seen corresponding path program 3 times [2018-06-26 17:54:14,477 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:14,477 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:14,478 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:14,478 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:14,478 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:14,518 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:14,631 INFO ]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:14,631 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:14,631 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-26 17:54:14,638 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:54:14,713 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-26 17:54:14,713 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:14,716 INFO ]: Computing forward predicates... [2018-06-26 17:54:15,021 INFO ]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:15,041 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:15,041 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2018-06-26 17:54:15,041 INFO ]: Interpolant automaton has 18 states [2018-06-26 17:54:15,041 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-26 17:54:15,042 INFO ]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-06-26 17:54:15,042 INFO ]: Start difference. First operand 18 states and 21 transitions. Second operand 18 states. [2018-06-26 17:54:15,343 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:15,343 INFO ]: Finished difference Result 31 states and 37 transitions. [2018-06-26 17:54:15,346 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-26 17:54:15,346 INFO ]: Start accepts. Automaton has 18 states. Word has length 16 [2018-06-26 17:54:15,346 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:15,346 INFO ]: With dead ends: 31 [2018-06-26 17:54:15,346 INFO ]: Without dead ends: 31 [2018-06-26 17:54:15,347 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2018-06-26 17:54:15,347 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-26 17:54:15,349 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 19. [2018-06-26 17:54:15,349 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-26 17:54:15,349 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-06-26 17:54:15,349 INFO ]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 16 [2018-06-26 17:54:15,349 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:15,349 INFO ]: Abstraction has 19 states and 22 transitions. [2018-06-26 17:54:15,349 INFO ]: Interpolant automaton has 18 states. [2018-06-26 17:54:15,349 INFO ]: Start isEmpty. Operand 19 states and 22 transitions. [2018-06-26 17:54:15,350 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 17:54:15,350 INFO ]: Found error trace [2018-06-26 17:54:15,350 INFO ]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:15,350 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:15,350 INFO ]: Analyzing trace with hash 34968015, now seen corresponding path program 4 times [2018-06-26 17:54:15,350 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:15,350 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:15,351 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:15,351 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:15,351 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:15,366 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:15,464 INFO ]: Checked inductivity of 22 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-26 17:54:15,464 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:15,464 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) [2018-06-26 17:54:15,479 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:15,510 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:54:15,510 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:15,512 INFO ]: Computing forward predicates... [2018-06-26 17:54:15,641 INFO ]: Checked inductivity of 22 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 17:54:15,661 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:15,661 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9] total 12 [2018-06-26 17:54:15,662 INFO ]: Interpolant automaton has 12 states [2018-06-26 17:54:15,662 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 17:54:15,662 INFO ]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-06-26 17:54:15,662 INFO ]: Start difference. First operand 19 states and 22 transitions. Second operand 12 states. [2018-06-26 17:54:16,138 WARN ]: Spent 117.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 12 [2018-06-26 17:54:16,161 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:16,161 INFO ]: Finished difference Result 26 states and 31 transitions. [2018-06-26 17:54:16,161 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-26 17:54:16,161 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-26 17:54:16,161 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:16,161 INFO ]: With dead ends: 26 [2018-06-26 17:54:16,161 INFO ]: Without dead ends: 0 [2018-06-26 17:54:16,162 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=284, Invalid=646, Unknown=0, NotChecked=0, Total=930 [2018-06-26 17:54:16,162 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-26 17:54:16,162 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-26 17:54:16,162 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-26 17:54:16,162 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-26 17:54:16,162 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-06-26 17:54:16,162 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:16,162 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-26 17:54:16,162 INFO ]: Interpolant automaton has 12 states. [2018-06-26 17:54:16,162 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-26 17:54:16,162 INFO ]: Finished isEmpty. No accepting run. [2018-06-26 17:54:16,164 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 17:54:16,166 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:54:16 BasicIcfg [2018-06-26 17:54:16,166 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 17:54:16,166 INFO ]: Toolchain (without parser) took 6641.53 ms. Allocated memory was 303.6 MB in the beginning and 372.8 MB in the end (delta: 69.2 MB). Free memory was 259.9 MB in the beginning and 204.7 MB in the end (delta: 55.2 MB). Peak memory consumption was 124.4 MB. Max. memory is 3.6 GB. [2018-06-26 17:54:16,167 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-26 17:54:16,168 INFO ]: ChcToBoogie took 58.66 ms. Allocated memory is still 303.6 MB. Free memory was 258.9 MB in the beginning and 256.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:54:16,168 INFO ]: Boogie Preprocessor took 41.48 ms. Allocated memory is still 303.6 MB. Free memory was 256.9 MB in the beginning and 255.9 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-26 17:54:16,168 INFO ]: RCFGBuilder took 299.00 ms. Allocated memory is still 303.6 MB. Free memory was 255.9 MB in the beginning and 245.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:54:16,169 INFO ]: BlockEncodingV2 took 71.59 ms. Allocated memory is still 303.6 MB. Free memory was 245.9 MB in the beginning and 243.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:54:16,169 INFO ]: TraceAbstraction took 6151.37 ms. Allocated memory was 303.6 MB in the beginning and 372.8 MB in the end (delta: 69.2 MB). Free memory was 243.9 MB in the beginning and 204.7 MB in the end (delta: 39.2 MB). Peak memory consumption was 108.4 MB. Max. memory is 3.6 GB. [2018-06-26 17:54:16,173 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 13 locations, 17 edges - StatisticsResult: Encoded RCFG 8 locations, 12 edges * 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 58.66 ms. Allocated memory is still 303.6 MB. Free memory was 258.9 MB in the beginning and 256.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 41.48 ms. Allocated memory is still 303.6 MB. Free memory was 256.9 MB in the beginning and 255.9 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 299.00 ms. Allocated memory is still 303.6 MB. Free memory was 255.9 MB in the beginning and 245.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 71.59 ms. Allocated memory is still 303.6 MB. Free memory was 245.9 MB in the beginning and 243.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 6151.37 ms. Allocated memory was 303.6 MB in the beginning and 372.8 MB in the end (delta: 69.2 MB). Free memory was 243.9 MB in the beginning and 204.7 MB in the end (delta: 39.2 MB). Peak memory consumption was 108.4 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 8 locations, 1 error locations. SAFE Result, 6.0s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 115 SDtfs, 93 SDslu, 288 SDs, 0 SdLazy, 669 SolverSat, 179 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 222 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=10, 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, 11 MinimizatonAttempts, 50 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 199 NumberOfCodeBlocks, 199 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 182 ConstructedInterpolants, 0 QuantifiedInterpolants, 6556 SizeOfPredicates, 66 NumberOfNonLiveVariables, 923 ConjunctsInSsa, 109 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 86/134 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_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_17-54-16-184.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/square_twice_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_17-54-16-184.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/square_twice_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_17-54-16-184.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/square_twice_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_17-54-16-184.csv Received shutdown request...