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/llreve-bench/smt2/faulty__barthe!.smt2' -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 21:38:28,893 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:38:28,895 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:38:28,910 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:38:28,911 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:38:28,912 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:38:28,915 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:38:28,917 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:38:28,918 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:38:28,919 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:38:28,921 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:38:28,921 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:38:28,922 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:38:28,923 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:38:28,923 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:38:28,926 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:38:28,928 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:38:28,937 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:38:28,939 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:38:28,940 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:38:28,941 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:38:28,945 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:38:28,946 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:38:28,946 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:38:28,947 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:38:28,947 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:38:28,951 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:38:28,951 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:38:28,952 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:38:28,952 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:38:28,953 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:38:28,953 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:38:28,954 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:38:28,957 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:38:28,958 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:38:28,958 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 21:38:28,972 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:38:28,972 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:38:28,973 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:38:28,973 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:38:28,974 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:38:28,974 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:38:28,974 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:38:28,974 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:38:28,975 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:38:28,975 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:38:28,975 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:38:28,975 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:38:28,975 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:38:28,976 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:38:28,976 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:38:28,976 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:38:28,976 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:38:28,976 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:38:28,976 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:38:28,977 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:38:28,977 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:38:28,978 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:38:28,978 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:38:29,024 INFO ]: Repository-Root is: /tmp [2018-06-24 21:38:29,040 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:38:29,044 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:38:29,045 INFO ]: Initializing SmtParser... [2018-06-24 21:38:29,045 INFO ]: SmtParser initialized [2018-06-24 21:38:29,047 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/faulty__barthe!.smt2 [2018-06-24 21:38:29,048 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-24 21:38:29,130 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/faulty__barthe!.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@287074ab [2018-06-24 21:38:29,285 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/faulty__barthe!.smt2 [2018-06-24 21:38:29,289 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:38:29,297 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:38:29,297 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:38:29,297 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:38:29,298 INFO ]: ChcToBoogie initialized [2018-06-24 21:38:29,304 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:38:29" (1/1) ... [2018-06-24 21:38:29,363 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:38:29 Unit [2018-06-24 21:38:29,363 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:38:29,364 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:38:29,364 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:38:29,364 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:38:29,386 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:38:29" (1/1) ... [2018-06-24 21:38:29,386 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:38:29" (1/1) ... [2018-06-24 21:38:29,392 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:38:29" (1/1) ... [2018-06-24 21:38:29,392 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:38:29" (1/1) ... [2018-06-24 21:38:29,394 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:38:29" (1/1) ... [2018-06-24 21:38:29,397 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:38:29" (1/1) ... [2018-06-24 21:38:29,398 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:38:29" (1/1) ... [2018-06-24 21:38:29,400 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:38:29,401 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:38:29,401 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:38:29,401 INFO ]: RCFGBuilder initialized [2018-06-24 21:38:29,402 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:38:29" (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-24 21:38:29,415 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:38:29,415 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:38:29,415 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:38:29,415 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:38:29,415 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:38:29,415 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-24 21:38:29,714 INFO ]: Using library mode [2018-06-24 21:38:29,714 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:38:29 BoogieIcfgContainer [2018-06-24 21:38:29,714 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:38:29,715 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:38:29,715 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:38:29,715 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:38:29,716 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:38:29" (1/1) ... [2018-06-24 21:38:29,732 INFO ]: Initial Icfg 10 locations, 12 edges [2018-06-24 21:38:29,733 INFO ]: Using Remove infeasible edges [2018-06-24 21:38:29,734 INFO ]: Using Maximize final states [2018-06-24 21:38:29,735 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:38:29,735 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:38:29,736 INFO ]: Using Remove sink states [2018-06-24 21:38:29,737 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:38:29,737 INFO ]: Using Use SBE [2018-06-24 21:38:29,744 INFO ]: SBE split 0 edges [2018-06-24 21:38:29,759 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 21:38:29,760 INFO ]: 0 new accepting states [2018-06-24 21:38:29,806 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-24 21:38:29,808 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:38:29,811 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:38:29,811 INFO ]: 0 new accepting states [2018-06-24 21:38:29,812 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:38:29,812 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:38:29,812 INFO ]: Encoded RCFG 6 locations, 8 edges [2018-06-24 21:38:29,812 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:38:29 BasicIcfg [2018-06-24 21:38:29,812 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:38:29,823 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:38:29,823 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:38:29,826 INFO ]: TraceAbstraction initialized [2018-06-24 21:38:29,827 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:38:29" (1/4) ... [2018-06-24 21:38:29,827 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@398fb6b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:38:29, skipping insertion in model container [2018-06-24 21:38:29,828 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:38:29" (2/4) ... [2018-06-24 21:38:29,828 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@398fb6b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:38:29, skipping insertion in model container [2018-06-24 21:38:29,828 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:38:29" (3/4) ... [2018-06-24 21:38:29,828 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@398fb6b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:38:29, skipping insertion in model container [2018-06-24 21:38:29,828 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:38:29" (4/4) ... [2018-06-24 21:38:29,829 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:38:29,846 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:38:29,862 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:38:29,911 INFO ]: Using default assertion order modulation [2018-06-24 21:38:29,912 INFO ]: Interprodecural is true [2018-06-24 21:38:29,912 INFO ]: Hoare is false [2018-06-24 21:38:29,912 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:38:29,912 INFO ]: Backedges is TWOTRACK [2018-06-24 21:38:29,912 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:38:29,912 INFO ]: Difference is false [2018-06-24 21:38:29,912 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:38:29,912 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:38:29,926 INFO ]: Start isEmpty. Operand 6 states. [2018-06-24 21:38:29,935 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:38:29,935 INFO ]: Found error trace [2018-06-24 21:38:29,936 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:38:29,936 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:38:29,943 INFO ]: Analyzing trace with hash 37311172, now seen corresponding path program 1 times [2018-06-24 21:38:29,944 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:38:29,944 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:38:29,978 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:29,978 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:38:29,978 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:30,024 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:30,074 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:38:30,076 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:38:30,076 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:38:30,078 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:38:30,091 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:38:30,092 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:38:30,094 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-24 21:38:30,192 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:38:30,193 INFO ]: Finished difference Result 7 states and 11 transitions. [2018-06-24 21:38:30,193 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:38:30,194 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:38:30,194 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:38:30,201 INFO ]: With dead ends: 7 [2018-06-24 21:38:30,201 INFO ]: Without dead ends: 7 [2018-06-24 21:38:30,203 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-24 21:38:30,216 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-24 21:38:30,232 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-24 21:38:30,233 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-24 21:38:30,233 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 11 transitions. [2018-06-24 21:38:30,235 INFO ]: Start accepts. Automaton has 7 states and 11 transitions. Word has length 5 [2018-06-24 21:38:30,235 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:38:30,235 INFO ]: Abstraction has 7 states and 11 transitions. [2018-06-24 21:38:30,235 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:38:30,235 INFO ]: Start isEmpty. Operand 7 states and 11 transitions. [2018-06-24 21:38:30,235 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:38:30,235 INFO ]: Found error trace [2018-06-24 21:38:30,235 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:38:30,235 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:38:30,236 INFO ]: Analyzing trace with hash 1156261132, now seen corresponding path program 1 times [2018-06-24 21:38:30,236 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:38:30,236 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:38:30,236 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:30,236 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:38:30,236 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:30,252 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:30,453 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:38:30,454 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:38:30,454 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) [2018-06-24 21:38:30,470 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:38:30,523 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:30,531 INFO ]: Computing forward predicates... [2018-06-24 21:38:30,631 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:38:30,651 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:38:30,651 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-06-24 21:38:30,651 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:38:30,651 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:38:30,651 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:38:30,652 INFO ]: Start difference. First operand 7 states and 11 transitions. Second operand 5 states. [2018-06-24 21:38:30,956 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:38:30,956 INFO ]: Finished difference Result 9 states and 16 transitions. [2018-06-24 21:38:30,957 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:38:30,957 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-24 21:38:30,957 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:38:30,957 INFO ]: With dead ends: 9 [2018-06-24 21:38:30,957 INFO ]: Without dead ends: 7 [2018-06-24 21:38:30,958 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 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-24 21:38:30,958 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-24 21:38:30,959 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-24 21:38:30,959 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-24 21:38:30,959 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-06-24 21:38:30,959 INFO ]: Start accepts. Automaton has 7 states and 9 transitions. Word has length 6 [2018-06-24 21:38:30,959 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:38:30,960 INFO ]: Abstraction has 7 states and 9 transitions. [2018-06-24 21:38:30,960 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:38:30,960 INFO ]: Start isEmpty. Operand 7 states and 9 transitions. [2018-06-24 21:38:30,960 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:38:30,960 INFO ]: Found error trace [2018-06-24 21:38:30,960 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:38:30,960 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:38:30,960 INFO ]: Analyzing trace with hash 1156290923, now seen corresponding path program 1 times [2018-06-24 21:38:30,960 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:38:30,960 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:38:30,961 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:30,961 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:38:30,961 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:30,975 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:31,064 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:38:31,064 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:38:31,065 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:38:31,065 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:38:31,065 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:38:31,065 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:38:31,065 INFO ]: Start difference. First operand 7 states and 9 transitions. Second operand 3 states. [2018-06-24 21:38:31,101 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:38:31,101 INFO ]: Finished difference Result 8 states and 11 transitions. [2018-06-24 21:38:31,101 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:38:31,101 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 21:38:31,101 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:38:31,102 INFO ]: With dead ends: 8 [2018-06-24 21:38:31,102 INFO ]: Without dead ends: 7 [2018-06-24 21:38:31,102 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 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-24 21:38:31,102 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-24 21:38:31,103 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-24 21:38:31,103 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-24 21:38:31,103 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-06-24 21:38:31,103 INFO ]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 6 [2018-06-24 21:38:31,104 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:38:31,104 INFO ]: Abstraction has 7 states and 7 transitions. [2018-06-24 21:38:31,104 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:38:31,104 INFO ]: Start isEmpty. Operand 7 states and 7 transitions. [2018-06-24 21:38:31,104 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:38:31,104 INFO ]: Found error trace [2018-06-24 21:38:31,104 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:38:31,104 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:38:31,104 INFO ]: Analyzing trace with hash 1156350505, now seen corresponding path program 1 times [2018-06-24 21:38:31,104 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:38:31,104 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:38:31,105 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:31,105 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:38:31,105 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:31,128 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:31,208 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:38:31,208 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:38:31,208 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-24 21:38:31,216 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:38:31,251 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:31,253 INFO ]: Computing forward predicates... [2018-06-24 21:38:31,289 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:38:31,308 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:38:31,308 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-24 21:38:31,309 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:38:31,309 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:38:31,309 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:38:31,309 INFO ]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2018-06-24 21:38:31,322 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:38:31,322 INFO ]: Finished difference Result 8 states and 8 transitions. [2018-06-24 21:38:31,322 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:38:31,323 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-24 21:38:31,323 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:38:31,323 INFO ]: With dead ends: 8 [2018-06-24 21:38:31,323 INFO ]: Without dead ends: 8 [2018-06-24 21:38:31,323 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:38:31,323 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-24 21:38:31,326 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-24 21:38:31,326 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 21:38:31,327 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-06-24 21:38:31,327 INFO ]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-06-24 21:38:31,327 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:38:31,327 INFO ]: Abstraction has 8 states and 8 transitions. [2018-06-24 21:38:31,327 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:38:31,327 INFO ]: Start isEmpty. Operand 8 states and 8 transitions. [2018-06-24 21:38:31,327 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:38:31,327 INFO ]: Found error trace [2018-06-24 21:38:31,327 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-24 21:38:31,327 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:38:31,327 INFO ]: Analyzing trace with hash 1486831460, now seen corresponding path program 2 times [2018-06-24 21:38:31,327 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:38:31,327 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:38:31,328 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:31,328 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:38:31,328 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:31,375 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:31,532 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:38:31,532 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:38:31,532 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-24 21:38:31,550 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:38:31,627 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:38:31,627 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:31,631 INFO ]: Computing forward predicates... [2018-06-24 21:38:31,749 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:38:31,769 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:38:31,769 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-24 21:38:31,770 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:38:31,770 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:38:31,770 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:38:31,770 INFO ]: Start difference. First operand 8 states and 8 transitions. Second operand 6 states. [2018-06-24 21:38:31,817 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:38:31,817 INFO ]: Finished difference Result 9 states and 9 transitions. [2018-06-24 21:38:31,817 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:38:31,817 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-24 21:38:31,817 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:38:31,818 INFO ]: With dead ends: 9 [2018-06-24 21:38:31,818 INFO ]: Without dead ends: 9 [2018-06-24 21:38:31,818 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:38:31,818 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 21:38:31,819 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-24 21:38:31,819 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 21:38:31,819 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-06-24 21:38:31,819 INFO ]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-06-24 21:38:31,819 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:38:31,819 INFO ]: Abstraction has 9 states and 9 transitions. [2018-06-24 21:38:31,819 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:38:31,819 INFO ]: Start isEmpty. Operand 9 states and 9 transitions. [2018-06-24 21:38:31,820 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:38:31,820 INFO ]: Found error trace [2018-06-24 21:38:31,820 INFO ]: trace histogram [3, 1, 1, 1, 1, 1] [2018-06-24 21:38:31,820 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:38:31,820 INFO ]: Analyzing trace with hash -1153160823, now seen corresponding path program 3 times [2018-06-24 21:38:31,820 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:38:31,820 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:38:31,821 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:31,821 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:38:31,821 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:31,855 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:32,123 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:38:32,123 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:38:32,123 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) [2018-06-24 21:38:32,136 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:38:32,198 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 21:38:32,198 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:32,201 INFO ]: Computing forward predicates... [2018-06-24 21:38:32,521 WARN ]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-06-24 21:38:32,991 WARN ]: Spent 297.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 31 [2018-06-24 21:38:32,997 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:38:33,017 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:38:33,017 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-24 21:38:33,017 INFO ]: Interpolant automaton has 8 states [2018-06-24 21:38:33,017 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 21:38:33,017 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:38:33,018 INFO ]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-06-24 21:38:33,073 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:38:33,073 INFO ]: Finished difference Result 10 states and 10 transitions. [2018-06-24 21:38:33,074 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 21:38:33,074 INFO ]: Start accepts. Automaton has 8 states. Word has length 8 [2018-06-24 21:38:33,074 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:38:33,074 INFO ]: With dead ends: 10 [2018-06-24 21:38:33,074 INFO ]: Without dead ends: 10 [2018-06-24 21:38:33,075 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:38:33,075 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 21:38:33,076 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-24 21:38:33,076 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 21:38:33,076 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-06-24 21:38:33,076 INFO ]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-06-24 21:38:33,076 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:38:33,076 INFO ]: Abstraction has 10 states and 10 transitions. [2018-06-24 21:38:33,076 INFO ]: Interpolant automaton has 8 states. [2018-06-24 21:38:33,076 INFO ]: Start isEmpty. Operand 10 states and 10 transitions. [2018-06-24 21:38:33,076 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:38:33,076 INFO ]: Found error trace [2018-06-24 21:38:33,076 INFO ]: trace histogram [4, 1, 1, 1, 1, 1] [2018-06-24 21:38:33,076 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:38:33,077 INFO ]: Analyzing trace with hash -1388542972, now seen corresponding path program 4 times [2018-06-24 21:38:33,077 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:38:33,077 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:38:33,077 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:33,077 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:38:33,077 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:33,113 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:33,375 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:38:33,375 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:38:33,375 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-24 21:38:33,384 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:38:33,412 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:38:33,412 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:33,415 INFO ]: Computing forward predicates... [2018-06-24 21:38:33,838 WARN ]: Spent 261.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 33 [2018-06-24 21:38:33,857 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:38:33,882 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:38:33,882 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-06-24 21:38:33,882 INFO ]: Interpolant automaton has 10 states [2018-06-24 21:38:33,883 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 21:38:33,883 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:38:33,883 INFO ]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2018-06-24 21:38:33,949 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:38:33,949 INFO ]: Finished difference Result 11 states and 11 transitions. [2018-06-24 21:38:33,950 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 21:38:33,950 INFO ]: Start accepts. Automaton has 10 states. Word has length 9 [2018-06-24 21:38:33,950 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:38:33,950 INFO ]: With dead ends: 11 [2018-06-24 21:38:33,950 INFO ]: Without dead ends: 11 [2018-06-24 21:38:33,951 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:38:33,951 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 21:38:33,952 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-24 21:38:33,952 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 21:38:33,952 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-06-24 21:38:33,952 INFO ]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-06-24 21:38:33,952 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:38:33,952 INFO ]: Abstraction has 11 states and 11 transitions. [2018-06-24 21:38:33,952 INFO ]: Interpolant automaton has 10 states. [2018-06-24 21:38:33,952 INFO ]: Start isEmpty. Operand 11 states and 11 transitions. [2018-06-24 21:38:33,952 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 21:38:33,952 INFO ]: Found error trace [2018-06-24 21:38:33,952 INFO ]: trace histogram [5, 1, 1, 1, 1, 1] [2018-06-24 21:38:33,953 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:38:33,953 INFO ]: Analyzing trace with hash -95454999, now seen corresponding path program 5 times [2018-06-24 21:38:33,953 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:38:33,953 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:38:33,953 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:33,953 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:38:33,953 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:33,991 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:34,327 WARN ]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-06-24 21:38:34,441 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:38:34,441 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:38:34,441 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:38:34,458 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:38:34,528 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-24 21:38:34,528 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:34,532 INFO ]: Computing forward predicates... [2018-06-24 21:38:34,943 WARN ]: Spent 102.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2018-06-24 21:38:35,394 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:38:35,414 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:38:35,414 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-24 21:38:35,414 INFO ]: Interpolant automaton has 14 states [2018-06-24 21:38:35,414 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 21:38:35,414 INFO ]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:38:35,414 INFO ]: Start difference. First operand 11 states and 11 transitions. Second operand 14 states. [2018-06-24 21:38:35,556 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:38:35,557 INFO ]: Finished difference Result 12 states and 12 transitions. [2018-06-24 21:38:35,557 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 21:38:35,557 INFO ]: Start accepts. Automaton has 14 states. Word has length 10 [2018-06-24 21:38:35,557 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:38:35,557 INFO ]: With dead ends: 12 [2018-06-24 21:38:35,557 INFO ]: Without dead ends: 12 [2018-06-24 21:38:35,558 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:38:35,558 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 21:38:35,559 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-24 21:38:35,559 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 21:38:35,559 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-06-24 21:38:35,559 INFO ]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-06-24 21:38:35,559 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:38:35,559 INFO ]: Abstraction has 12 states and 12 transitions. [2018-06-24 21:38:35,559 INFO ]: Interpolant automaton has 14 states. [2018-06-24 21:38:35,559 INFO ]: Start isEmpty. Operand 12 states and 12 transitions. [2018-06-24 21:38:35,559 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:38:35,560 INFO ]: Found error trace [2018-06-24 21:38:35,560 INFO ]: trace histogram [6, 1, 1, 1, 1, 1] [2018-06-24 21:38:35,560 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:38:35,560 INFO ]: Analyzing trace with hash 1335566500, now seen corresponding path program 6 times [2018-06-24 21:38:35,560 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:38:35,560 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:38:35,560 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:35,560 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:38:35,560 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:35,586 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:35,875 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:38:35,876 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:38:35,876 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:38:35,882 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:38:35,926 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-24 21:38:35,926 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:35,930 INFO ]: Computing forward predicates... [2018-06-24 21:38:36,384 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:38:36,403 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:38:36,403 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-06-24 21:38:36,403 INFO ]: Interpolant automaton has 14 states [2018-06-24 21:38:36,403 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 21:38:36,404 INFO ]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:38:36,404 INFO ]: Start difference. First operand 12 states and 12 transitions. Second operand 14 states. [2018-06-24 21:38:36,467 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:38:36,467 INFO ]: Finished difference Result 13 states and 13 transitions. [2018-06-24 21:38:36,468 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 21:38:36,468 INFO ]: Start accepts. Automaton has 14 states. Word has length 11 [2018-06-24 21:38:36,468 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:38:36,468 INFO ]: With dead ends: 13 [2018-06-24 21:38:36,468 INFO ]: Without dead ends: 13 [2018-06-24 21:38:36,468 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:38:36,468 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 21:38:36,470 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-24 21:38:36,470 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 21:38:36,470 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-06-24 21:38:36,470 INFO ]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-06-24 21:38:36,470 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:38:36,470 INFO ]: Abstraction has 13 states and 13 transitions. [2018-06-24 21:38:36,470 INFO ]: Interpolant automaton has 14 states. [2018-06-24 21:38:36,470 INFO ]: Start isEmpty. Operand 13 states and 13 transitions. [2018-06-24 21:38:36,470 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:38:36,470 INFO ]: Found error trace [2018-06-24 21:38:36,471 INFO ]: trace histogram [7, 1, 1, 1, 1, 1] [2018-06-24 21:38:36,471 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:38:36,471 INFO ]: Analyzing trace with hash -1547407287, now seen corresponding path program 7 times [2018-06-24 21:38:36,471 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:38:36,471 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:38:36,471 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:36,471 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:38:36,471 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:36,529 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:36,793 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:38:36,793 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:38:36,793 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:38:36,802 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:38:36,836 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:36,840 INFO ]: Computing forward predicates... [2018-06-24 21:38:37,492 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:38:37,524 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:38:37,524 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2018-06-24 21:38:37,524 INFO ]: Interpolant automaton has 16 states [2018-06-24 21:38:37,524 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 21:38:37,524 INFO ]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-06-24 21:38:37,524 INFO ]: Start difference. First operand 13 states and 13 transitions. Second operand 16 states. [2018-06-24 21:38:37,687 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:38:37,687 INFO ]: Finished difference Result 14 states and 14 transitions. [2018-06-24 21:38:37,688 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 21:38:37,688 INFO ]: Start accepts. Automaton has 16 states. Word has length 12 [2018-06-24 21:38:37,688 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:38:37,688 INFO ]: With dead ends: 14 [2018-06-24 21:38:37,688 INFO ]: Without dead ends: 14 [2018-06-24 21:38:37,688 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-06-24 21:38:37,689 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 21:38:37,690 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-24 21:38:37,690 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 21:38:37,690 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-06-24 21:38:37,690 INFO ]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-06-24 21:38:37,690 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:38:37,690 INFO ]: Abstraction has 14 states and 14 transitions. [2018-06-24 21:38:37,690 INFO ]: Interpolant automaton has 16 states. [2018-06-24 21:38:37,690 INFO ]: Start isEmpty. Operand 14 states and 14 transitions. [2018-06-24 21:38:37,691 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 21:38:37,691 INFO ]: Found error trace [2018-06-24 21:38:37,691 INFO ]: trace histogram [8, 1, 1, 1, 1, 1] [2018-06-24 21:38:37,691 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:38:37,691 INFO ]: Analyzing trace with hash -725281468, now seen corresponding path program 8 times [2018-06-24 21:38:37,691 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:38:37,691 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:38:37,692 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:37,692 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:38:37,692 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:37,750 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:38,010 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:38:38,011 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:38:38,011 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:38:38,017 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:38:38,047 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:38:38,047 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:38,051 INFO ]: Computing forward predicates... [2018-06-24 21:38:38,515 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:38:38,534 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:38:38,535 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2018-06-24 21:38:38,535 INFO ]: Interpolant automaton has 18 states [2018-06-24 21:38:38,535 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 21:38:38,535 INFO ]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-06-24 21:38:38,535 INFO ]: Start difference. First operand 14 states and 14 transitions. Second operand 18 states. [2018-06-24 21:38:38,726 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:38:38,726 INFO ]: Finished difference Result 15 states and 15 transitions. [2018-06-24 21:38:38,726 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 21:38:38,726 INFO ]: Start accepts. Automaton has 18 states. Word has length 13 [2018-06-24 21:38:38,726 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:38:38,726 INFO ]: With dead ends: 15 [2018-06-24 21:38:38,726 INFO ]: Without dead ends: 15 [2018-06-24 21:38:38,727 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-06-24 21:38:38,727 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-24 21:38:38,728 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-24 21:38:38,728 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 21:38:38,729 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-06-24 21:38:38,729 INFO ]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-06-24 21:38:38,729 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:38:38,729 INFO ]: Abstraction has 15 states and 15 transitions. [2018-06-24 21:38:38,729 INFO ]: Interpolant automaton has 18 states. [2018-06-24 21:38:38,729 INFO ]: Start isEmpty. Operand 15 states and 15 transitions. [2018-06-24 21:38:38,729 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 21:38:38,729 INFO ]: Found error trace [2018-06-24 21:38:38,729 INFO ]: trace histogram [9, 1, 1, 1, 1, 1] [2018-06-24 21:38:38,729 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:38:38,729 INFO ]: Analyzing trace with hash -1009184855, now seen corresponding path program 9 times [2018-06-24 21:38:38,729 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:38:38,729 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:38:38,730 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:38,730 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:38:38,730 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:38,779 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:39,520 WARN ]: Spent 217.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2018-06-24 21:38:39,762 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:38:39,762 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:38:39,762 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:38:39,768 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:38:39,809 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-24 21:38:39,809 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:39,813 INFO ]: Computing forward predicates... [2018-06-24 21:38:40,378 WARN ]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-06-24 21:38:41,100 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:38:41,119 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:38:41,119 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2018-06-24 21:38:41,119 INFO ]: Interpolant automaton has 20 states [2018-06-24 21:38:41,120 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 21:38:41,120 INFO ]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2018-06-24 21:38:41,120 INFO ]: Start difference. First operand 15 states and 15 transitions. Second operand 20 states. [2018-06-24 21:38:41,262 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:38:41,262 INFO ]: Finished difference Result 16 states and 16 transitions. [2018-06-24 21:38:41,262 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 21:38:41,262 INFO ]: Start accepts. Automaton has 20 states. Word has length 14 [2018-06-24 21:38:41,262 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:38:41,263 INFO ]: With dead ends: 16 [2018-06-24 21:38:41,263 INFO ]: Without dead ends: 16 [2018-06-24 21:38:41,263 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2018-06-24 21:38:41,263 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 21:38:41,264 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-24 21:38:41,264 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 21:38:41,265 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-06-24 21:38:41,265 INFO ]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-06-24 21:38:41,265 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:38:41,265 INFO ]: Abstraction has 16 states and 16 transitions. [2018-06-24 21:38:41,265 INFO ]: Interpolant automaton has 20 states. [2018-06-24 21:38:41,265 INFO ]: Start isEmpty. Operand 16 states and 16 transitions. [2018-06-24 21:38:41,265 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 21:38:41,265 INFO ]: Found error trace [2018-06-24 21:38:41,265 INFO ]: trace histogram [10, 1, 1, 1, 1, 1] [2018-06-24 21:38:41,265 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:38:41,266 INFO ]: Analyzing trace with hash -1220255260, now seen corresponding path program 10 times [2018-06-24 21:38:41,266 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:38:41,266 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:38:41,266 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:41,266 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:38:41,266 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:41,345 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:41,635 WARN ]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-24 21:38:42,138 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:38:42,138 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:38:42,138 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:38:42,144 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:38:42,194 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:38:42,194 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:42,199 INFO ]: Computing forward predicates... [2018-06-24 21:38:43,652 WARN ]: Spent 532.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 28 [2018-06-24 21:38:44,051 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:38:44,072 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:38:44,072 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-06-24 21:38:44,072 INFO ]: Interpolant automaton has 24 states [2018-06-24 21:38:44,072 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-24 21:38:44,073 INFO ]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2018-06-24 21:38:44,073 INFO ]: Start difference. First operand 16 states and 16 transitions. Second operand 24 states. [2018-06-24 21:38:45,012 WARN ]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2018-06-24 21:38:45,014 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:38:45,014 INFO ]: Finished difference Result 17 states and 17 transitions. [2018-06-24 21:38:45,014 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 21:38:45,014 INFO ]: Start accepts. Automaton has 24 states. Word has length 15 [2018-06-24 21:38:45,014 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:38:45,014 INFO ]: With dead ends: 17 [2018-06-24 21:38:45,014 INFO ]: Without dead ends: 17 [2018-06-24 21:38:45,015 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=97, Invalid=1093, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 21:38:45,015 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 21:38:45,016 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-24 21:38:45,016 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 21:38:45,017 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-06-24 21:38:45,017 INFO ]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-06-24 21:38:45,017 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:38:45,017 INFO ]: Abstraction has 17 states and 17 transitions. [2018-06-24 21:38:45,017 INFO ]: Interpolant automaton has 24 states. [2018-06-24 21:38:45,017 INFO ]: Start isEmpty. Operand 17 states and 17 transitions. [2018-06-24 21:38:45,017 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 21:38:45,017 INFO ]: Found error trace [2018-06-24 21:38:45,017 INFO ]: trace histogram [11, 1, 1, 1, 1, 1] [2018-06-24 21:38:45,017 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:38:45,018 INFO ]: Analyzing trace with hash 826496777, now seen corresponding path program 11 times [2018-06-24 21:38:45,018 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:38:45,018 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:38:45,018 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:45,018 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:38:45,018 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:45,113 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:45,437 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:38:45,438 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:38:45,438 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:38:45,443 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:38:45,495 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-24 21:38:45,495 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:38:45,501 INFO ]: Computing forward predicates... [2018-06-24 21:38:46,154 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:38:46,173 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:38:46,176 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2018-06-24 21:38:46,176 INFO ]: Interpolant automaton has 24 states [2018-06-24 21:38:46,176 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-24 21:38:46,176 INFO ]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2018-06-24 21:38:46,176 INFO ]: Start difference. First operand 17 states and 17 transitions. Second operand 24 states. [2018-06-24 21:38:46,480 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:38:46,480 INFO ]: Finished difference Result 18 states and 18 transitions. [2018-06-24 21:38:46,481 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 21:38:46,481 INFO ]: Start accepts. Automaton has 24 states. Word has length 16 [2018-06-24 21:38:46,481 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:38:46,481 INFO ]: With dead ends: 18 [2018-06-24 21:38:46,481 INFO ]: Without dead ends: 18 [2018-06-24 21:38:46,482 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2018-06-24 21:38:46,482 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-24 21:38:46,483 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-24 21:38:46,483 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-24 21:38:46,483 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-06-24 21:38:46,484 INFO ]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-06-24 21:38:46,484 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:38:46,484 INFO ]: Abstraction has 18 states and 18 transitions. [2018-06-24 21:38:46,484 INFO ]: Interpolant automaton has 24 states. [2018-06-24 21:38:46,484 INFO ]: Start isEmpty. Operand 18 states and 18 transitions. [2018-06-24 21:38:46,484 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 21:38:46,484 INFO ]: Found error trace [2018-06-24 21:38:46,484 INFO ]: trace histogram [12, 1, 1, 1, 1, 1] [2018-06-24 21:38:46,484 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:38:46,484 INFO ]: Analyzing trace with hash -148699516, now seen corresponding path program 12 times [2018-06-24 21:38:46,484 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:38:46,484 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:38:46,485 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:46,485 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:38:46,485 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:38:46,524 INFO ]: Conjunction of SSA is sat [2018-06-24 21:38:46,530 INFO ]: Counterexample might be feasible [2018-06-24 21:38:46,548 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:38:46,549 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:38:46 BasicIcfg [2018-06-24 21:38:46,549 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:38:46,642 INFO ]: Toolchain (without parser) took 17352.30 ms. Allocated memory was 303.0 MB in the beginning and 610.8 MB in the end (delta: 307.8 MB). Free memory was 259.4 MB in the beginning and 590.1 MB in the end (delta: -330.7 MB). Peak memory consumption was 134.3 MB. Max. memory is 3.6 GB. [2018-06-24 21:38:46,643 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 303.0 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:38:46,643 INFO ]: ChcToBoogie took 66.20 ms. Allocated memory is still 303.0 MB. Free memory was 259.4 MB in the beginning and 255.4 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:38:46,644 INFO ]: Boogie Preprocessor took 36.44 ms. Allocated memory is still 303.0 MB. Free memory is still 255.4 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:38:46,644 INFO ]: RCFGBuilder took 313.44 ms. Allocated memory is still 303.0 MB. Free memory was 255.4 MB in the beginning and 247.4 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:38:46,644 INFO ]: BlockEncodingV2 took 97.84 ms. Allocated memory is still 303.0 MB. Free memory was 247.4 MB in the beginning and 243.4 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:38:46,645 INFO ]: TraceAbstraction took 16725.91 ms. Allocated memory was 303.0 MB in the beginning and 473.4 MB in the end (delta: 170.4 MB). Free memory was 243.4 MB in the beginning and 295.5 MB in the end (delta: -52.0 MB). Peak memory consumption was 118.4 MB. Max. memory is 3.6 GB. [2018-06-24 21:38:46,648 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 12 edges - StatisticsResult: Encoded RCFG 6 locations, 8 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 ms. Allocated memory is still 303.0 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 66.20 ms. Allocated memory is still 303.0 MB. Free memory was 259.4 MB in the beginning and 255.4 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 36.44 ms. Allocated memory is still 303.0 MB. Free memory is still 255.4 MB. There was no memory consumed. Max. memory is 3.6 GB. * RCFGBuilder took 313.44 ms. Allocated memory is still 303.0 MB. Free memory was 255.4 MB in the beginning and 247.4 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 97.84 ms. Allocated memory is still 303.0 MB. Free memory was 247.4 MB in the beginning and 243.4 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 16725.91 ms. Allocated memory was 303.0 MB in the beginning and 473.4 MB in the end (delta: 170.4 MB). Free memory was 243.4 MB in the beginning and 295.5 MB in the end (delta: -52.0 MB). Peak memory consumption was 118.4 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call gotoProc(0, 0, 0, 0, 0, 0, 0, 0, 0); [L0] assume (!(hbv_False_1_Int == hbv_False_2_Int) && !(hbv_False_5_Int < hbv_False_6_Int)) && !(hbv_False_3_Int < hbv_False_4_Int); [L0] hhv_INV_MAIN_42_0_Int, hhv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hhv_INV_MAIN_42_3_Int, hhv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_5_Int, hhv_INV_MAIN_42_6_Int, hhv_INV_MAIN_42_7_Int := hbv_False_7_Int, hbv_False_5_Int, hbv_False_6_Int, hbv_False_1_Int, hbv_False_3_Int, hbv_False_8_Int, hbv_False_4_Int, hbv_False_2_Int; [L0] havoc hbv_False_5_Int, hbv_False_1_Int, hbv_False_3_Int, hbv_False_6_Int, hbv_False_8_Int, hbv_False_2_Int, hbv_False_7_Int, hbv_False_4_Int; [L0] assume (((((hhv_INV_MAIN_42_5_Int == (if hbv_INV_MAIN_42_2_Int == 10 then 10 else hbv_INV_MAIN_42_4_Int + 5) && hbv_INV_MAIN_42_2_Int < hhv_INV_MAIN_42_6_Int) && hhv_INV_MAIN_42_7_Int == hbv_INV_MAIN_42_5_Int + hbv_INV_MAIN_42_4_Int) && hhv_INV_MAIN_42_1_Int == hbv_INV_MAIN_42_1_Int + 1) && hhv_INV_MAIN_42_3_Int == hbv_INV_MAIN_42_3_Int + (5 * hbv_INV_MAIN_42_1_Int + hhv_INV_MAIN_42_0_Int)) && hbv_INV_MAIN_42_1_Int < hhv_INV_MAIN_42_2_Int) && hhv_INV_MAIN_42_4_Int == hbv_INV_MAIN_42_2_Int + 1; [L0] hhv_INV_MAIN_42_0_Int, hhv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hhv_INV_MAIN_42_3_Int, hhv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_5_Int, hhv_INV_MAIN_42_6_Int, hhv_INV_MAIN_42_7_Int := hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int; [L0] havoc hbv_INV_MAIN_42_1_Int, hbv_INV_MAIN_42_4_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_5_Int; [L0] assume (((((hhv_INV_MAIN_42_5_Int == (if hbv_INV_MAIN_42_2_Int == 10 then 10 else hbv_INV_MAIN_42_4_Int + 5) && hbv_INV_MAIN_42_2_Int < hhv_INV_MAIN_42_6_Int) && hhv_INV_MAIN_42_7_Int == hbv_INV_MAIN_42_5_Int + hbv_INV_MAIN_42_4_Int) && hhv_INV_MAIN_42_1_Int == hbv_INV_MAIN_42_1_Int + 1) && hhv_INV_MAIN_42_3_Int == hbv_INV_MAIN_42_3_Int + (5 * hbv_INV_MAIN_42_1_Int + hhv_INV_MAIN_42_0_Int)) && hbv_INV_MAIN_42_1_Int < hhv_INV_MAIN_42_2_Int) && hhv_INV_MAIN_42_4_Int == hbv_INV_MAIN_42_2_Int + 1; [L0] hhv_INV_MAIN_42_0_Int, hhv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hhv_INV_MAIN_42_3_Int, hhv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_5_Int, hhv_INV_MAIN_42_6_Int, hhv_INV_MAIN_42_7_Int := hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int; [L0] havoc hbv_INV_MAIN_42_1_Int, hbv_INV_MAIN_42_4_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_5_Int; [L0] assume (((((hhv_INV_MAIN_42_5_Int == (if hbv_INV_MAIN_42_2_Int == 10 then 10 else hbv_INV_MAIN_42_4_Int + 5) && hbv_INV_MAIN_42_2_Int < hhv_INV_MAIN_42_6_Int) && hhv_INV_MAIN_42_7_Int == hbv_INV_MAIN_42_5_Int + hbv_INV_MAIN_42_4_Int) && hhv_INV_MAIN_42_1_Int == hbv_INV_MAIN_42_1_Int + 1) && hhv_INV_MAIN_42_3_Int == hbv_INV_MAIN_42_3_Int + (5 * hbv_INV_MAIN_42_1_Int + hhv_INV_MAIN_42_0_Int)) && hbv_INV_MAIN_42_1_Int < hhv_INV_MAIN_42_2_Int) && hhv_INV_MAIN_42_4_Int == hbv_INV_MAIN_42_2_Int + 1; [L0] hhv_INV_MAIN_42_0_Int, hhv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hhv_INV_MAIN_42_3_Int, hhv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_5_Int, hhv_INV_MAIN_42_6_Int, hhv_INV_MAIN_42_7_Int := hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int; [L0] havoc hbv_INV_MAIN_42_1_Int, hbv_INV_MAIN_42_4_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_5_Int; [L0] assume (((((hhv_INV_MAIN_42_5_Int == (if hbv_INV_MAIN_42_2_Int == 10 then 10 else hbv_INV_MAIN_42_4_Int + 5) && hbv_INV_MAIN_42_2_Int < hhv_INV_MAIN_42_6_Int) && hhv_INV_MAIN_42_7_Int == hbv_INV_MAIN_42_5_Int + hbv_INV_MAIN_42_4_Int) && hhv_INV_MAIN_42_1_Int == hbv_INV_MAIN_42_1_Int + 1) && hhv_INV_MAIN_42_3_Int == hbv_INV_MAIN_42_3_Int + (5 * hbv_INV_MAIN_42_1_Int + hhv_INV_MAIN_42_0_Int)) && hbv_INV_MAIN_42_1_Int < hhv_INV_MAIN_42_2_Int) && hhv_INV_MAIN_42_4_Int == hbv_INV_MAIN_42_2_Int + 1; [L0] hhv_INV_MAIN_42_0_Int, hhv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hhv_INV_MAIN_42_3_Int, hhv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_5_Int, hhv_INV_MAIN_42_6_Int, hhv_INV_MAIN_42_7_Int := hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int; [L0] havoc hbv_INV_MAIN_42_1_Int, hbv_INV_MAIN_42_4_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_5_Int; [L0] assume (((((hhv_INV_MAIN_42_5_Int == (if hbv_INV_MAIN_42_2_Int == 10 then 10 else hbv_INV_MAIN_42_4_Int + 5) && hbv_INV_MAIN_42_2_Int < hhv_INV_MAIN_42_6_Int) && hhv_INV_MAIN_42_7_Int == hbv_INV_MAIN_42_5_Int + hbv_INV_MAIN_42_4_Int) && hhv_INV_MAIN_42_1_Int == hbv_INV_MAIN_42_1_Int + 1) && hhv_INV_MAIN_42_3_Int == hbv_INV_MAIN_42_3_Int + (5 * hbv_INV_MAIN_42_1_Int + hhv_INV_MAIN_42_0_Int)) && hbv_INV_MAIN_42_1_Int < hhv_INV_MAIN_42_2_Int) && hhv_INV_MAIN_42_4_Int == hbv_INV_MAIN_42_2_Int + 1; [L0] hhv_INV_MAIN_42_0_Int, hhv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hhv_INV_MAIN_42_3_Int, hhv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_5_Int, hhv_INV_MAIN_42_6_Int, hhv_INV_MAIN_42_7_Int := hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int; [L0] havoc hbv_INV_MAIN_42_1_Int, hbv_INV_MAIN_42_4_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_5_Int; [L0] assume (((((hhv_INV_MAIN_42_5_Int == (if hbv_INV_MAIN_42_2_Int == 10 then 10 else hbv_INV_MAIN_42_4_Int + 5) && hbv_INV_MAIN_42_2_Int < hhv_INV_MAIN_42_6_Int) && hhv_INV_MAIN_42_7_Int == hbv_INV_MAIN_42_5_Int + hbv_INV_MAIN_42_4_Int) && hhv_INV_MAIN_42_1_Int == hbv_INV_MAIN_42_1_Int + 1) && hhv_INV_MAIN_42_3_Int == hbv_INV_MAIN_42_3_Int + (5 * hbv_INV_MAIN_42_1_Int + hhv_INV_MAIN_42_0_Int)) && hbv_INV_MAIN_42_1_Int < hhv_INV_MAIN_42_2_Int) && hhv_INV_MAIN_42_4_Int == hbv_INV_MAIN_42_2_Int + 1; [L0] hhv_INV_MAIN_42_0_Int, hhv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hhv_INV_MAIN_42_3_Int, hhv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_5_Int, hhv_INV_MAIN_42_6_Int, hhv_INV_MAIN_42_7_Int := hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int; [L0] havoc hbv_INV_MAIN_42_1_Int, hbv_INV_MAIN_42_4_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_5_Int; [L0] assume (((((hhv_INV_MAIN_42_5_Int == (if hbv_INV_MAIN_42_2_Int == 10 then 10 else hbv_INV_MAIN_42_4_Int + 5) && hbv_INV_MAIN_42_2_Int < hhv_INV_MAIN_42_6_Int) && hhv_INV_MAIN_42_7_Int == hbv_INV_MAIN_42_5_Int + hbv_INV_MAIN_42_4_Int) && hhv_INV_MAIN_42_1_Int == hbv_INV_MAIN_42_1_Int + 1) && hhv_INV_MAIN_42_3_Int == hbv_INV_MAIN_42_3_Int + (5 * hbv_INV_MAIN_42_1_Int + hhv_INV_MAIN_42_0_Int)) && hbv_INV_MAIN_42_1_Int < hhv_INV_MAIN_42_2_Int) && hhv_INV_MAIN_42_4_Int == hbv_INV_MAIN_42_2_Int + 1; [L0] hhv_INV_MAIN_42_0_Int, hhv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hhv_INV_MAIN_42_3_Int, hhv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_5_Int, hhv_INV_MAIN_42_6_Int, hhv_INV_MAIN_42_7_Int := hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int; [L0] havoc hbv_INV_MAIN_42_1_Int, hbv_INV_MAIN_42_4_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_5_Int; [L0] assume (((((hhv_INV_MAIN_42_5_Int == (if hbv_INV_MAIN_42_2_Int == 10 then 10 else hbv_INV_MAIN_42_4_Int + 5) && hbv_INV_MAIN_42_2_Int < hhv_INV_MAIN_42_6_Int) && hhv_INV_MAIN_42_7_Int == hbv_INV_MAIN_42_5_Int + hbv_INV_MAIN_42_4_Int) && hhv_INV_MAIN_42_1_Int == hbv_INV_MAIN_42_1_Int + 1) && hhv_INV_MAIN_42_3_Int == hbv_INV_MAIN_42_3_Int + (5 * hbv_INV_MAIN_42_1_Int + hhv_INV_MAIN_42_0_Int)) && hbv_INV_MAIN_42_1_Int < hhv_INV_MAIN_42_2_Int) && hhv_INV_MAIN_42_4_Int == hbv_INV_MAIN_42_2_Int + 1; [L0] hhv_INV_MAIN_42_0_Int, hhv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hhv_INV_MAIN_42_3_Int, hhv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_5_Int, hhv_INV_MAIN_42_6_Int, hhv_INV_MAIN_42_7_Int := hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int; [L0] havoc hbv_INV_MAIN_42_1_Int, hbv_INV_MAIN_42_4_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_5_Int; [L0] assume (((((hhv_INV_MAIN_42_5_Int == (if hbv_INV_MAIN_42_2_Int == 10 then 10 else hbv_INV_MAIN_42_4_Int + 5) && hbv_INV_MAIN_42_2_Int < hhv_INV_MAIN_42_6_Int) && hhv_INV_MAIN_42_7_Int == hbv_INV_MAIN_42_5_Int + hbv_INV_MAIN_42_4_Int) && hhv_INV_MAIN_42_1_Int == hbv_INV_MAIN_42_1_Int + 1) && hhv_INV_MAIN_42_3_Int == hbv_INV_MAIN_42_3_Int + (5 * hbv_INV_MAIN_42_1_Int + hhv_INV_MAIN_42_0_Int)) && hbv_INV_MAIN_42_1_Int < hhv_INV_MAIN_42_2_Int) && hhv_INV_MAIN_42_4_Int == hbv_INV_MAIN_42_2_Int + 1; [L0] hhv_INV_MAIN_42_0_Int, hhv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hhv_INV_MAIN_42_3_Int, hhv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_5_Int, hhv_INV_MAIN_42_6_Int, hhv_INV_MAIN_42_7_Int := hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int; [L0] havoc hbv_INV_MAIN_42_1_Int, hbv_INV_MAIN_42_4_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_5_Int; [L0] assume (((((hhv_INV_MAIN_42_5_Int == (if hbv_INV_MAIN_42_2_Int == 10 then 10 else hbv_INV_MAIN_42_4_Int + 5) && hbv_INV_MAIN_42_2_Int < hhv_INV_MAIN_42_6_Int) && hhv_INV_MAIN_42_7_Int == hbv_INV_MAIN_42_5_Int + hbv_INV_MAIN_42_4_Int) && hhv_INV_MAIN_42_1_Int == hbv_INV_MAIN_42_1_Int + 1) && hhv_INV_MAIN_42_3_Int == hbv_INV_MAIN_42_3_Int + (5 * hbv_INV_MAIN_42_1_Int + hhv_INV_MAIN_42_0_Int)) && hbv_INV_MAIN_42_1_Int < hhv_INV_MAIN_42_2_Int) && hhv_INV_MAIN_42_4_Int == hbv_INV_MAIN_42_2_Int + 1; [L0] hhv_INV_MAIN_42_0_Int, hhv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hhv_INV_MAIN_42_3_Int, hhv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_5_Int, hhv_INV_MAIN_42_6_Int, hhv_INV_MAIN_42_7_Int := hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int; [L0] havoc hbv_INV_MAIN_42_1_Int, hbv_INV_MAIN_42_4_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_5_Int; [L0] assume (((((hhv_INV_MAIN_42_5_Int == (if hbv_INV_MAIN_42_2_Int == 10 then 10 else hbv_INV_MAIN_42_4_Int + 5) && hbv_INV_MAIN_42_2_Int < hhv_INV_MAIN_42_6_Int) && hhv_INV_MAIN_42_7_Int == hbv_INV_MAIN_42_5_Int + hbv_INV_MAIN_42_4_Int) && hhv_INV_MAIN_42_1_Int == hbv_INV_MAIN_42_1_Int + 1) && hhv_INV_MAIN_42_3_Int == hbv_INV_MAIN_42_3_Int + (5 * hbv_INV_MAIN_42_1_Int + hhv_INV_MAIN_42_0_Int)) && hbv_INV_MAIN_42_1_Int < hhv_INV_MAIN_42_2_Int) && hhv_INV_MAIN_42_4_Int == hbv_INV_MAIN_42_2_Int + 1; [L0] hhv_INV_MAIN_42_0_Int, hhv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hhv_INV_MAIN_42_3_Int, hhv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_5_Int, hhv_INV_MAIN_42_6_Int, hhv_INV_MAIN_42_7_Int := hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int; [L0] havoc hbv_INV_MAIN_42_1_Int, hbv_INV_MAIN_42_4_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_5_Int; [L0] assume (((((hhv_INV_MAIN_42_5_Int == (if hbv_INV_MAIN_42_2_Int == 10 then 10 else hbv_INV_MAIN_42_4_Int + 5) && hbv_INV_MAIN_42_2_Int < hhv_INV_MAIN_42_6_Int) && hhv_INV_MAIN_42_7_Int == hbv_INV_MAIN_42_5_Int + hbv_INV_MAIN_42_4_Int) && hhv_INV_MAIN_42_1_Int == hbv_INV_MAIN_42_1_Int + 1) && hhv_INV_MAIN_42_3_Int == hbv_INV_MAIN_42_3_Int + (5 * hbv_INV_MAIN_42_1_Int + hhv_INV_MAIN_42_0_Int)) && hbv_INV_MAIN_42_1_Int < hhv_INV_MAIN_42_2_Int) && hhv_INV_MAIN_42_4_Int == hbv_INV_MAIN_42_2_Int + 1; [L0] hhv_INV_MAIN_42_0_Int, hhv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hhv_INV_MAIN_42_3_Int, hhv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_5_Int, hhv_INV_MAIN_42_6_Int, hhv_INV_MAIN_42_7_Int := hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int; [L0] havoc hbv_INV_MAIN_42_1_Int, hbv_INV_MAIN_42_4_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_5_Int; [L0] RET call gotoProc(0, 0, 0, 0, 0, 0, 0, 0, 0); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. UNSAFE Result, 16.6s OverallTime, 15 OverallIterations, 12 TraceHistogramMax, 2.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 72 SDtfs, 0 SDslu, 366 SDs, 0 SdLazy, 1242 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 239 GetRequests, 75 SyntacticMatches, 8 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 11.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=14, 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, 14 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 12.2s InterpolantComputationTime, 282 NumberOfCodeBlocks, 282 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 239 ConstructedInterpolants, 0 QuantifiedInterpolants, 72509 SizeOfPredicates, 69 NumberOfNonLiveVariables, 2554 ConjunctsInSsa, 1408 ConjunctsInUnsatCore, 26 InterpolantComputations, 3 PerfectInterpolantSequences, 2/575 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/faulty__barthe!.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_21-38-46-664.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/faulty__barthe!.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_21-38-46-664.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/faulty__barthe!.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_21-38-46-664.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/faulty__barthe!.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_21-38-46-664.csv Received shutdown request...