java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_1b_true-unreach-call_false-termination.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:14:32,286 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:14:32,289 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:14:32,305 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:14:32,305 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:14:32,306 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:14:32,307 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:14:32,309 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:14:32,311 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:14:32,312 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:14:32,313 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:14:32,313 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:14:32,314 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:14:32,315 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:14:32,316 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:14:32,317 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:14:32,318 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:14:32,325 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:14:32,327 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:14:32,332 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:14:32,336 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:14:32,337 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:14:32,341 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:14:32,341 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:14:32,342 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:14:32,343 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:14:32,344 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:14:32,348 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:14:32,349 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:14:32,350 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:14:32,350 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:14:32,351 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:14:32,351 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:14:32,351 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:14:32,352 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:14:32,354 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:14:32,354 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-14 16:14:32,382 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:14:32,382 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:14:32,383 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:14:32,383 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:14:32,387 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:14:32,387 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:14:32,387 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:14:32,387 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:14:32,388 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:14:32,388 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:14:32,388 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:14:32,388 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:14:32,388 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:14:32,390 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:14:32,390 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 16:14:32,390 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 16:14:32,390 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:14:32,390 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:14:32,392 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:14:32,392 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:14:32,392 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:14:32,392 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:14:32,392 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:14:32,393 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:14:32,393 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:14:32,393 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:14:32,393 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:14:32,393 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 16:14:32,394 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:14:32,394 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 16:14:32,395 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 16:14:32,395 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:14:32,447 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:14:32,461 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:14:32,466 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:14:32,467 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:14:32,468 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:14:32,469 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_1b_true-unreach-call_false-termination.cil.c [2018-11-14 16:14:32,533 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81c205600/12c267f72978423aba17bf13ff46993f/FLAGaae40b7fd [2018-11-14 16:14:33,013 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:14:33,014 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_1b_true-unreach-call_false-termination.cil.c [2018-11-14 16:14:33,022 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81c205600/12c267f72978423aba17bf13ff46993f/FLAGaae40b7fd [2018-11-14 16:14:33,036 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81c205600/12c267f72978423aba17bf13ff46993f [2018-11-14 16:14:33,046 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:14:33,048 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:14:33,049 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:14:33,049 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:14:33,053 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:14:33,054 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:14:33" (1/1) ... [2018-11-14 16:14:33,057 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c853408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:14:33, skipping insertion in model container [2018-11-14 16:14:33,058 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:14:33" (1/1) ... [2018-11-14 16:14:33,067 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:14:33,099 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:14:33,327 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:14:33,336 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:14:33,370 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:14:33,393 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:14:33,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:14:33 WrapperNode [2018-11-14 16:14:33,394 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:14:33,394 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:14:33,395 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:14:33,395 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:14:33,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:14:33" (1/1) ... [2018-11-14 16:14:33,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:14:33" (1/1) ... [2018-11-14 16:14:33,417 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:14:33" (1/1) ... [2018-11-14 16:14:33,418 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:14:33" (1/1) ... [2018-11-14 16:14:33,426 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:14:33" (1/1) ... [2018-11-14 16:14:33,434 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:14:33" (1/1) ... [2018-11-14 16:14:33,435 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:14:33" (1/1) ... [2018-11-14 16:14:33,437 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:14:33,438 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:14:33,438 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:14:33,438 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:14:33,439 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:14:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:14:33,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:14:33,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:14:33,597 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:14:33,597 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:14:33,597 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-11-14 16:14:33,597 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 16:14:33,597 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2018-11-14 16:14:33,597 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2018-11-14 16:14:33,597 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:14:33,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:14:33,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:14:34,157 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:14:34,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:14:34 BoogieIcfgContainer [2018-11-14 16:14:34,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:14:34,159 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:14:34,159 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:14:34,162 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:14:34,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:14:33" (1/3) ... [2018-11-14 16:14:34,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@683e2ccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:14:34, skipping insertion in model container [2018-11-14 16:14:34,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:14:33" (2/3) ... [2018-11-14 16:14:34,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@683e2ccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:14:34, skipping insertion in model container [2018-11-14 16:14:34,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:14:34" (3/3) ... [2018-11-14 16:14:34,166 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_1b_true-unreach-call_false-termination.cil.c [2018-11-14 16:14:34,176 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:14:34,185 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:14:34,202 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:14:34,236 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:14:34,236 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:14:34,237 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:14:34,237 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:14:34,237 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:14:34,237 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:14:34,237 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:14:34,237 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:14:34,238 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:14:34,257 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-14 16:14:34,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-14 16:14:34,264 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:14:34,265 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:14:34,268 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:14:34,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:14:34,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1652704230, now seen corresponding path program 1 times [2018-11-14 16:14:34,278 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:14:34,279 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:14:34,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:14:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:14:34,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:14:34,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:14:34,478 INFO L256 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2018-11-14 16:14:34,481 INFO L273 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2018-11-14 16:14:34,482 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #106#return; {32#true} is VALID [2018-11-14 16:14:34,482 INFO L256 TraceCheckUtils]: 3: Hoare triple {32#true} call #t~ret2 := main(); {32#true} is VALID [2018-11-14 16:14:34,495 INFO L273 TraceCheckUtils]: 4: Hoare triple {32#true} havoc ~s__state~0;~s__hit~0 := #t~nondet0;havoc #t~nondet0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466bv32;~blastFlag~0 := 0bv32; {49#(= (_ bv0 32) main_~blastFlag~0)} is VALID [2018-11-14 16:14:34,496 INFO L273 TraceCheckUtils]: 5: Hoare triple {49#(= (_ bv0 32) main_~blastFlag~0)} assume true; {49#(= (_ bv0 32) main_~blastFlag~0)} is VALID [2018-11-14 16:14:34,505 INFO L273 TraceCheckUtils]: 6: Hoare triple {49#(= (_ bv0 32) main_~blastFlag~0)} assume !false; {49#(= (_ bv0 32) main_~blastFlag~0)} is VALID [2018-11-14 16:14:34,506 INFO L273 TraceCheckUtils]: 7: Hoare triple {49#(= (_ bv0 32) main_~blastFlag~0)} assume ~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32); {33#false} is VALID [2018-11-14 16:14:34,506 INFO L273 TraceCheckUtils]: 8: Hoare triple {33#false} assume !false; {33#false} is VALID [2018-11-14 16:14:34,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:14:34,509 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:14:34,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:14:34,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:14:34,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-14 16:14:34,519 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:14:34,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:14:34,590 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:14:34,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:14:34,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:14:34,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:14:34,600 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2018-11-14 16:14:35,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:14:35,235 INFO L93 Difference]: Finished difference Result 72 states and 117 transitions. [2018-11-14 16:14:35,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:14:35,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-14 16:14:35,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:14:35,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:14:35,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2018-11-14 16:14:35,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:14:35,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2018-11-14 16:14:35,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 117 transitions. [2018-11-14 16:14:35,848 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:14:35,862 INFO L225 Difference]: With dead ends: 72 [2018-11-14 16:14:35,862 INFO L226 Difference]: Without dead ends: 40 [2018-11-14 16:14:35,865 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-11-14 16:14:35,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-14 16:14:35,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-14 16:14:35,962 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:14:35,963 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-14 16:14:35,964 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-14 16:14:35,964 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-14 16:14:35,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:14:35,970 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2018-11-14 16:14:35,970 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2018-11-14 16:14:35,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:14:35,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:14:35,971 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-14 16:14:35,972 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-14 16:14:35,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:14:35,977 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2018-11-14 16:14:35,977 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2018-11-14 16:14:35,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:14:35,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:14:35,979 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:14:35,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:14:35,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-14 16:14:35,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2018-11-14 16:14:35,984 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 54 transitions. Word has length 9 [2018-11-14 16:14:35,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:14:35,985 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 54 transitions. [2018-11-14 16:14:35,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:14:35,985 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2018-11-14 16:14:35,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 16:14:35,986 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:14:35,987 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:14:35,987 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:14:35,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:14:35,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1430507829, now seen corresponding path program 1 times [2018-11-14 16:14:35,988 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:14:35,988 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:14:36,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:14:36,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:14:36,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:14:36,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:14:36,079 INFO L256 TraceCheckUtils]: 0: Hoare triple {292#true} call ULTIMATE.init(); {292#true} is VALID [2018-11-14 16:14:36,079 INFO L273 TraceCheckUtils]: 1: Hoare triple {292#true} assume true; {292#true} is VALID [2018-11-14 16:14:36,079 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {292#true} {292#true} #106#return; {292#true} is VALID [2018-11-14 16:14:36,080 INFO L256 TraceCheckUtils]: 3: Hoare triple {292#true} call #t~ret2 := main(); {292#true} is VALID [2018-11-14 16:14:36,080 INFO L273 TraceCheckUtils]: 4: Hoare triple {292#true} havoc ~s__state~0;~s__hit~0 := #t~nondet0;havoc #t~nondet0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466bv32;~blastFlag~0 := 0bv32; {292#true} is VALID [2018-11-14 16:14:36,081 INFO L273 TraceCheckUtils]: 5: Hoare triple {292#true} assume true; {292#true} is VALID [2018-11-14 16:14:36,081 INFO L273 TraceCheckUtils]: 6: Hoare triple {292#true} assume !false; {292#true} is VALID [2018-11-14 16:14:36,081 INFO L273 TraceCheckUtils]: 7: Hoare triple {292#true} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {292#true} is VALID [2018-11-14 16:14:36,082 INFO L273 TraceCheckUtils]: 8: Hoare triple {292#true} assume ~s__state~0 == 8466bv32; {292#true} is VALID [2018-11-14 16:14:36,082 INFO L273 TraceCheckUtils]: 9: Hoare triple {292#true} assume ~blastFlag~0 == 0bv32;~blastFlag~0 := 2bv32; {292#true} is VALID [2018-11-14 16:14:36,084 INFO L273 TraceCheckUtils]: 10: Hoare triple {292#true} assume ~s__hit~0 != 0bv32;~s__state~0 := 8656bv32; {327#(= (_ bv8656 32) main_~s__state~0)} is VALID [2018-11-14 16:14:36,101 INFO L273 TraceCheckUtils]: 11: Hoare triple {327#(= (_ bv8656 32) main_~s__state~0)} assume true; {327#(= (_ bv8656 32) main_~s__state~0)} is VALID [2018-11-14 16:14:36,110 INFO L273 TraceCheckUtils]: 12: Hoare triple {327#(= (_ bv8656 32) main_~s__state~0)} assume !false; {327#(= (_ bv8656 32) main_~s__state~0)} is VALID [2018-11-14 16:14:36,118 INFO L273 TraceCheckUtils]: 13: Hoare triple {327#(= (_ bv8656 32) main_~s__state~0)} assume ~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32); {293#false} is VALID [2018-11-14 16:14:36,118 INFO L273 TraceCheckUtils]: 14: Hoare triple {293#false} assume !false; {293#false} is VALID [2018-11-14 16:14:36,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:14:36,120 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:14:36,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:14:36,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:14:36,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-14 16:14:36,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:14:36,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:14:36,152 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:14:36,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:14:36,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:14:36,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:14:36,153 INFO L87 Difference]: Start difference. First operand 40 states and 54 transitions. Second operand 3 states. [2018-11-14 16:14:36,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:14:36,433 INFO L93 Difference]: Finished difference Result 91 states and 125 transitions. [2018-11-14 16:14:36,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:14:36,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-14 16:14:36,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:14:36,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:14:36,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2018-11-14 16:14:36,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:14:36,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2018-11-14 16:14:36,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 75 transitions. [2018-11-14 16:14:36,622 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:14:36,625 INFO L225 Difference]: With dead ends: 91 [2018-11-14 16:14:36,625 INFO L226 Difference]: Without dead ends: 56 [2018-11-14 16:14:36,626 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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-11-14 16:14:36,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-14 16:14:36,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2018-11-14 16:14:36,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:14:36,682 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 52 states. [2018-11-14 16:14:36,682 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 52 states. [2018-11-14 16:14:36,682 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 52 states. [2018-11-14 16:14:36,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:14:36,686 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2018-11-14 16:14:36,686 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2018-11-14 16:14:36,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:14:36,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:14:36,688 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 56 states. [2018-11-14 16:14:36,688 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 56 states. [2018-11-14 16:14:36,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:14:36,692 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2018-11-14 16:14:36,692 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2018-11-14 16:14:36,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:14:36,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:14:36,693 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:14:36,694 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:14:36,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-14 16:14:36,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2018-11-14 16:14:36,697 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 15 [2018-11-14 16:14:36,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:14:36,698 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2018-11-14 16:14:36,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:14:36,698 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2018-11-14 16:14:36,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 16:14:36,699 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:14:36,699 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:14:36,699 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:14:36,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:14:36,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1432354871, now seen corresponding path program 1 times [2018-11-14 16:14:36,700 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:14:36,700 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:14:36,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:14:36,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:14:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:14:36,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:14:36,804 INFO L256 TraceCheckUtils]: 0: Hoare triple {640#true} call ULTIMATE.init(); {640#true} is VALID [2018-11-14 16:14:36,805 INFO L273 TraceCheckUtils]: 1: Hoare triple {640#true} assume true; {640#true} is VALID [2018-11-14 16:14:36,805 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {640#true} {640#true} #106#return; {640#true} is VALID [2018-11-14 16:14:36,805 INFO L256 TraceCheckUtils]: 3: Hoare triple {640#true} call #t~ret2 := main(); {640#true} is VALID [2018-11-14 16:14:36,805 INFO L273 TraceCheckUtils]: 4: Hoare triple {640#true} havoc ~s__state~0;~s__hit~0 := #t~nondet0;havoc #t~nondet0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466bv32;~blastFlag~0 := 0bv32; {640#true} is VALID [2018-11-14 16:14:36,806 INFO L273 TraceCheckUtils]: 5: Hoare triple {640#true} assume true; {640#true} is VALID [2018-11-14 16:14:36,806 INFO L273 TraceCheckUtils]: 6: Hoare triple {640#true} assume !false; {640#true} is VALID [2018-11-14 16:14:36,806 INFO L273 TraceCheckUtils]: 7: Hoare triple {640#true} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {640#true} is VALID [2018-11-14 16:14:36,806 INFO L273 TraceCheckUtils]: 8: Hoare triple {640#true} assume ~s__state~0 == 8466bv32; {640#true} is VALID [2018-11-14 16:14:36,809 INFO L273 TraceCheckUtils]: 9: Hoare triple {640#true} assume ~blastFlag~0 == 0bv32;~blastFlag~0 := 2bv32; {672#(= (_ bv2 32) main_~blastFlag~0)} is VALID [2018-11-14 16:14:36,809 INFO L273 TraceCheckUtils]: 10: Hoare triple {672#(= (_ bv2 32) main_~blastFlag~0)} assume !(~s__hit~0 != 0bv32);~s__state~0 := 8512bv32; {672#(= (_ bv2 32) main_~blastFlag~0)} is VALID [2018-11-14 16:14:36,810 INFO L273 TraceCheckUtils]: 11: Hoare triple {672#(= (_ bv2 32) main_~blastFlag~0)} assume true; {672#(= (_ bv2 32) main_~blastFlag~0)} is VALID [2018-11-14 16:14:36,812 INFO L273 TraceCheckUtils]: 12: Hoare triple {672#(= (_ bv2 32) main_~blastFlag~0)} assume !false; {672#(= (_ bv2 32) main_~blastFlag~0)} is VALID [2018-11-14 16:14:36,812 INFO L273 TraceCheckUtils]: 13: Hoare triple {672#(= (_ bv2 32) main_~blastFlag~0)} assume ~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32); {641#false} is VALID [2018-11-14 16:14:36,813 INFO L273 TraceCheckUtils]: 14: Hoare triple {641#false} assume !false; {641#false} is VALID [2018-11-14 16:14:36,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:14:36,815 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:14:36,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:14:36,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:14:36,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-14 16:14:36,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:14:36,821 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:14:36,855 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:14:36,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:14:36,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:14:36,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:14:36,857 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand 3 states. [2018-11-14 16:14:37,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:14:37,114 INFO L93 Difference]: Finished difference Result 97 states and 130 transitions. [2018-11-14 16:14:37,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:14:37,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-14 16:14:37,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:14:37,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:14:37,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2018-11-14 16:14:37,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:14:37,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2018-11-14 16:14:37,120 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 86 transitions. [2018-11-14 16:14:37,294 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:14:37,299 INFO L225 Difference]: With dead ends: 97 [2018-11-14 16:14:37,299 INFO L226 Difference]: Without dead ends: 72 [2018-11-14 16:14:37,300 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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-11-14 16:14:37,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-14 16:14:37,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-11-14 16:14:37,354 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:14:37,354 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 72 states. [2018-11-14 16:14:37,354 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2018-11-14 16:14:37,355 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2018-11-14 16:14:37,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:14:37,359 INFO L93 Difference]: Finished difference Result 72 states and 91 transitions. [2018-11-14 16:14:37,359 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2018-11-14 16:14:37,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:14:37,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:14:37,360 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2018-11-14 16:14:37,361 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2018-11-14 16:14:37,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:14:37,365 INFO L93 Difference]: Finished difference Result 72 states and 91 transitions. [2018-11-14 16:14:37,365 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2018-11-14 16:14:37,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:14:37,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:14:37,368 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:14:37,368 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:14:37,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-14 16:14:37,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 91 transitions. [2018-11-14 16:14:37,372 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 91 transitions. Word has length 15 [2018-11-14 16:14:37,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:14:37,372 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 91 transitions. [2018-11-14 16:14:37,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:14:37,373 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2018-11-14 16:14:37,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 16:14:37,374 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:14:37,374 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:14:37,374 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:14:37,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:14:37,375 INFO L82 PathProgramCache]: Analyzing trace with hash -590266670, now seen corresponding path program 1 times [2018-11-14 16:14:37,375 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:14:37,375 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:14:37,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:14:37,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:14:37,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:14:37,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:14:37,468 INFO L256 TraceCheckUtils]: 0: Hoare triple {1053#true} call ULTIMATE.init(); {1053#true} is VALID [2018-11-14 16:14:37,468 INFO L273 TraceCheckUtils]: 1: Hoare triple {1053#true} assume true; {1053#true} is VALID [2018-11-14 16:14:37,469 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1053#true} {1053#true} #106#return; {1053#true} is VALID [2018-11-14 16:14:37,469 INFO L256 TraceCheckUtils]: 3: Hoare triple {1053#true} call #t~ret2 := main(); {1053#true} is VALID [2018-11-14 16:14:37,469 INFO L273 TraceCheckUtils]: 4: Hoare triple {1053#true} havoc ~s__state~0;~s__hit~0 := #t~nondet0;havoc #t~nondet0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466bv32;~blastFlag~0 := 0bv32; {1053#true} is VALID [2018-11-14 16:14:37,470 INFO L273 TraceCheckUtils]: 5: Hoare triple {1053#true} assume true; {1053#true} is VALID [2018-11-14 16:14:37,470 INFO L273 TraceCheckUtils]: 6: Hoare triple {1053#true} assume !false; {1053#true} is VALID [2018-11-14 16:14:37,470 INFO L273 TraceCheckUtils]: 7: Hoare triple {1053#true} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {1053#true} is VALID [2018-11-14 16:14:37,470 INFO L273 TraceCheckUtils]: 8: Hoare triple {1053#true} assume ~s__state~0 == 8466bv32; {1053#true} is VALID [2018-11-14 16:14:37,471 INFO L273 TraceCheckUtils]: 9: Hoare triple {1053#true} assume ~blastFlag~0 == 0bv32;~blastFlag~0 := 2bv32; {1053#true} is VALID [2018-11-14 16:14:37,471 INFO L273 TraceCheckUtils]: 10: Hoare triple {1053#true} assume ~s__hit~0 != 0bv32;~s__state~0 := 8656bv32; {1053#true} is VALID [2018-11-14 16:14:37,472 INFO L273 TraceCheckUtils]: 11: Hoare triple {1053#true} assume true; {1053#true} is VALID [2018-11-14 16:14:37,472 INFO L273 TraceCheckUtils]: 12: Hoare triple {1053#true} assume !false; {1053#true} is VALID [2018-11-14 16:14:37,472 INFO L273 TraceCheckUtils]: 13: Hoare triple {1053#true} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {1053#true} is VALID [2018-11-14 16:14:37,473 INFO L273 TraceCheckUtils]: 14: Hoare triple {1053#true} assume !(~s__state~0 == 8466bv32); {1053#true} is VALID [2018-11-14 16:14:37,473 INFO L273 TraceCheckUtils]: 15: Hoare triple {1053#true} assume !(~s__state~0 == 8512bv32); {1053#true} is VALID [2018-11-14 16:14:37,473 INFO L273 TraceCheckUtils]: 16: Hoare triple {1053#true} assume !(~s__state~0 == 8640bv32); {1053#true} is VALID [2018-11-14 16:14:37,474 INFO L273 TraceCheckUtils]: 17: Hoare triple {1053#true} assume ~s__state~0 == 8656bv32; {1053#true} is VALID [2018-11-14 16:14:37,483 INFO L273 TraceCheckUtils]: 18: Hoare triple {1053#true} assume ~blastFlag~0 == 2bv32;~blastFlag~0 := 3bv32; {1112#(= (_ bv3 32) main_~blastFlag~0)} is VALID [2018-11-14 16:14:37,485 INFO L273 TraceCheckUtils]: 19: Hoare triple {1112#(= (_ bv3 32) main_~blastFlag~0)} assume !(~blastFlag~0 == 4bv32); {1112#(= (_ bv3 32) main_~blastFlag~0)} is VALID [2018-11-14 16:14:37,485 INFO L273 TraceCheckUtils]: 20: Hoare triple {1112#(= (_ bv3 32) main_~blastFlag~0)} assume ~blastFlag~0 == 5bv32; {1054#false} is VALID [2018-11-14 16:14:37,486 INFO L273 TraceCheckUtils]: 21: Hoare triple {1054#false} assume !false; {1054#false} is VALID [2018-11-14 16:14:37,487 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 16:14:37,487 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:14:37,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:14:37,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:14:37,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-14 16:14:37,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:14:37,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:14:37,521 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:14:37,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:14:37,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:14:37,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:14:37,522 INFO L87 Difference]: Start difference. First operand 72 states and 91 transitions. Second operand 3 states. [2018-11-14 16:14:37,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:14:37,828 INFO L93 Difference]: Finished difference Result 141 states and 185 transitions. [2018-11-14 16:14:37,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:14:37,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-14 16:14:37,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:14:37,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:14:37,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2018-11-14 16:14:37,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:14:37,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2018-11-14 16:14:37,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 91 transitions. [2018-11-14 16:14:37,993 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:14:37,998 INFO L225 Difference]: With dead ends: 141 [2018-11-14 16:14:37,999 INFO L226 Difference]: Without dead ends: 96 [2018-11-14 16:14:38,000 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-11-14 16:14:38,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-14 16:14:38,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-11-14 16:14:38,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:14:38,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 94 states. [2018-11-14 16:14:38,101 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 94 states. [2018-11-14 16:14:38,101 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 94 states. [2018-11-14 16:14:38,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:14:38,105 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2018-11-14 16:14:38,105 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 120 transitions. [2018-11-14 16:14:38,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:14:38,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:14:38,106 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 96 states. [2018-11-14 16:14:38,107 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 96 states. [2018-11-14 16:14:38,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:14:38,112 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2018-11-14 16:14:38,112 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 120 transitions. [2018-11-14 16:14:38,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:14:38,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:14:38,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:14:38,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:14:38,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-14 16:14:38,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 119 transitions. [2018-11-14 16:14:38,117 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 119 transitions. Word has length 22 [2018-11-14 16:14:38,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:14:38,118 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 119 transitions. [2018-11-14 16:14:38,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:14:38,118 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 119 transitions. [2018-11-14 16:14:38,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 16:14:38,119 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:14:38,119 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:14:38,120 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:14:38,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:14:38,120 INFO L82 PathProgramCache]: Analyzing trace with hash -2071970430, now seen corresponding path program 1 times [2018-11-14 16:14:38,120 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:14:38,121 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:14:38,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:14:38,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:14:38,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:14:38,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:14:38,256 INFO L256 TraceCheckUtils]: 0: Hoare triple {1620#true} call ULTIMATE.init(); {1620#true} is VALID [2018-11-14 16:14:38,257 INFO L273 TraceCheckUtils]: 1: Hoare triple {1620#true} assume true; {1620#true} is VALID [2018-11-14 16:14:38,258 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1620#true} {1620#true} #106#return; {1620#true} is VALID [2018-11-14 16:14:38,258 INFO L256 TraceCheckUtils]: 3: Hoare triple {1620#true} call #t~ret2 := main(); {1620#true} is VALID [2018-11-14 16:14:38,259 INFO L273 TraceCheckUtils]: 4: Hoare triple {1620#true} havoc ~s__state~0;~s__hit~0 := #t~nondet0;havoc #t~nondet0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466bv32;~blastFlag~0 := 0bv32; {1620#true} is VALID [2018-11-14 16:14:38,259 INFO L273 TraceCheckUtils]: 5: Hoare triple {1620#true} assume true; {1620#true} is VALID [2018-11-14 16:14:38,259 INFO L273 TraceCheckUtils]: 6: Hoare triple {1620#true} assume !false; {1620#true} is VALID [2018-11-14 16:14:38,259 INFO L273 TraceCheckUtils]: 7: Hoare triple {1620#true} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {1620#true} is VALID [2018-11-14 16:14:38,260 INFO L273 TraceCheckUtils]: 8: Hoare triple {1620#true} assume ~s__state~0 == 8466bv32; {1620#true} is VALID [2018-11-14 16:14:38,260 INFO L273 TraceCheckUtils]: 9: Hoare triple {1620#true} assume ~blastFlag~0 == 0bv32;~blastFlag~0 := 2bv32; {1620#true} is VALID [2018-11-14 16:14:38,260 INFO L273 TraceCheckUtils]: 10: Hoare triple {1620#true} assume ~s__hit~0 != 0bv32;~s__state~0 := 8656bv32; {1620#true} is VALID [2018-11-14 16:14:38,260 INFO L273 TraceCheckUtils]: 11: Hoare triple {1620#true} assume true; {1620#true} is VALID [2018-11-14 16:14:38,261 INFO L273 TraceCheckUtils]: 12: Hoare triple {1620#true} assume !false; {1620#true} is VALID [2018-11-14 16:14:38,261 INFO L273 TraceCheckUtils]: 13: Hoare triple {1620#true} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {1620#true} is VALID [2018-11-14 16:14:38,261 INFO L273 TraceCheckUtils]: 14: Hoare triple {1620#true} assume !(~s__state~0 == 8466bv32); {1620#true} is VALID [2018-11-14 16:14:38,262 INFO L273 TraceCheckUtils]: 15: Hoare triple {1620#true} assume !(~s__state~0 == 8512bv32); {1620#true} is VALID [2018-11-14 16:14:38,262 INFO L273 TraceCheckUtils]: 16: Hoare triple {1620#true} assume !(~s__state~0 == 8640bv32); {1620#true} is VALID [2018-11-14 16:14:38,262 INFO L273 TraceCheckUtils]: 17: Hoare triple {1620#true} assume ~s__state~0 == 8656bv32; {1620#true} is VALID [2018-11-14 16:14:38,262 INFO L273 TraceCheckUtils]: 18: Hoare triple {1620#true} assume ~blastFlag~0 == 2bv32;~blastFlag~0 := 3bv32; {1620#true} is VALID [2018-11-14 16:14:38,263 INFO L273 TraceCheckUtils]: 19: Hoare triple {1620#true} assume !(~blastFlag~0 == 4bv32); {1620#true} is VALID [2018-11-14 16:14:38,263 INFO L273 TraceCheckUtils]: 20: Hoare triple {1620#true} assume !(~blastFlag~0 == 5bv32); {1620#true} is VALID [2018-11-14 16:14:38,265 INFO L273 TraceCheckUtils]: 21: Hoare triple {1620#true} assume ~s__hit~0 != 0bv32;~s__state~0 := 8640bv32; {1688#(= (_ bv8640 32) main_~s__state~0)} is VALID [2018-11-14 16:14:38,265 INFO L273 TraceCheckUtils]: 22: Hoare triple {1688#(= (_ bv8640 32) main_~s__state~0)} assume true; {1688#(= (_ bv8640 32) main_~s__state~0)} is VALID [2018-11-14 16:14:38,267 INFO L273 TraceCheckUtils]: 23: Hoare triple {1688#(= (_ bv8640 32) main_~s__state~0)} assume !false; {1688#(= (_ bv8640 32) main_~s__state~0)} is VALID [2018-11-14 16:14:38,267 INFO L273 TraceCheckUtils]: 24: Hoare triple {1688#(= (_ bv8640 32) main_~s__state~0)} assume ~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32); {1621#false} is VALID [2018-11-14 16:14:38,268 INFO L273 TraceCheckUtils]: 25: Hoare triple {1621#false} assume !false; {1621#false} is VALID [2018-11-14 16:14:38,269 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 16:14:38,269 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:14:38,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:14:38,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:14:38,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-14 16:14:38,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:14:38,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:14:38,296 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:14:38,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:14:38,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:14:38,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:14:38,297 INFO L87 Difference]: Start difference. First operand 94 states and 119 transitions. Second operand 3 states. [2018-11-14 16:14:38,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:14:38,508 INFO L93 Difference]: Finished difference Result 179 states and 230 transitions. [2018-11-14 16:14:38,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:14:38,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-14 16:14:38,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:14:38,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:14:38,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2018-11-14 16:14:38,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:14:38,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2018-11-14 16:14:38,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 72 transitions. [2018-11-14 16:14:38,600 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:14:38,602 INFO L225 Difference]: With dead ends: 179 [2018-11-14 16:14:38,602 INFO L226 Difference]: Without dead ends: 70 [2018-11-14 16:14:38,604 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 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-11-14 16:14:38,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-14 16:14:38,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-11-14 16:14:38,646 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:14:38,646 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 70 states. [2018-11-14 16:14:38,646 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2018-11-14 16:14:38,646 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2018-11-14 16:14:38,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:14:38,649 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2018-11-14 16:14:38,649 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2018-11-14 16:14:38,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:14:38,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:14:38,650 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2018-11-14 16:14:38,650 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2018-11-14 16:14:38,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:14:38,653 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2018-11-14 16:14:38,653 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2018-11-14 16:14:38,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:14:38,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:14:38,654 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:14:38,654 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:14:38,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-14 16:14:38,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2018-11-14 16:14:38,657 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 26 [2018-11-14 16:14:38,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:14:38,657 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2018-11-14 16:14:38,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:14:38,658 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2018-11-14 16:14:38,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-14 16:14:38,658 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:14:38,659 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:14:38,659 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:14:38,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:14:38,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1346446477, now seen corresponding path program 1 times [2018-11-14 16:14:38,660 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:14:38,660 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:14:38,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:14:38,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:14:38,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:14:38,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:14:38,799 INFO L256 TraceCheckUtils]: 0: Hoare triple {2160#true} call ULTIMATE.init(); {2160#true} is VALID [2018-11-14 16:14:38,799 INFO L273 TraceCheckUtils]: 1: Hoare triple {2160#true} assume true; {2160#true} is VALID [2018-11-14 16:14:38,800 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2160#true} {2160#true} #106#return; {2160#true} is VALID [2018-11-14 16:14:38,800 INFO L256 TraceCheckUtils]: 3: Hoare triple {2160#true} call #t~ret2 := main(); {2160#true} is VALID [2018-11-14 16:14:38,800 INFO L273 TraceCheckUtils]: 4: Hoare triple {2160#true} havoc ~s__state~0;~s__hit~0 := #t~nondet0;havoc #t~nondet0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466bv32;~blastFlag~0 := 0bv32; {2160#true} is VALID [2018-11-14 16:14:38,800 INFO L273 TraceCheckUtils]: 5: Hoare triple {2160#true} assume true; {2160#true} is VALID [2018-11-14 16:14:38,801 INFO L273 TraceCheckUtils]: 6: Hoare triple {2160#true} assume !false; {2160#true} is VALID [2018-11-14 16:14:38,801 INFO L273 TraceCheckUtils]: 7: Hoare triple {2160#true} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {2160#true} is VALID [2018-11-14 16:14:38,801 INFO L273 TraceCheckUtils]: 8: Hoare triple {2160#true} assume ~s__state~0 == 8466bv32; {2160#true} is VALID [2018-11-14 16:14:38,801 INFO L273 TraceCheckUtils]: 9: Hoare triple {2160#true} assume ~blastFlag~0 == 0bv32;~blastFlag~0 := 2bv32; {2160#true} is VALID [2018-11-14 16:14:38,802 INFO L273 TraceCheckUtils]: 10: Hoare triple {2160#true} assume ~s__hit~0 != 0bv32;~s__state~0 := 8656bv32; {2195#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:38,802 INFO L273 TraceCheckUtils]: 11: Hoare triple {2195#(not (= (_ bv0 32) main_~s__hit~0))} assume true; {2195#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:38,803 INFO L273 TraceCheckUtils]: 12: Hoare triple {2195#(not (= (_ bv0 32) main_~s__hit~0))} assume !false; {2195#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:38,803 INFO L273 TraceCheckUtils]: 13: Hoare triple {2195#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {2195#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:38,804 INFO L273 TraceCheckUtils]: 14: Hoare triple {2195#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~s__state~0 == 8466bv32); {2195#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:38,804 INFO L273 TraceCheckUtils]: 15: Hoare triple {2195#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~s__state~0 == 8512bv32); {2195#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:38,805 INFO L273 TraceCheckUtils]: 16: Hoare triple {2195#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~s__state~0 == 8640bv32); {2195#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:38,805 INFO L273 TraceCheckUtils]: 17: Hoare triple {2195#(not (= (_ bv0 32) main_~s__hit~0))} assume ~s__state~0 == 8656bv32; {2195#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:38,806 INFO L273 TraceCheckUtils]: 18: Hoare triple {2195#(not (= (_ bv0 32) main_~s__hit~0))} assume ~blastFlag~0 == 2bv32;~blastFlag~0 := 3bv32; {2195#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:38,813 INFO L273 TraceCheckUtils]: 19: Hoare triple {2195#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~blastFlag~0 == 4bv32); {2195#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:38,815 INFO L273 TraceCheckUtils]: 20: Hoare triple {2195#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~blastFlag~0 == 5bv32); {2195#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:38,815 INFO L273 TraceCheckUtils]: 21: Hoare triple {2195#(not (= (_ bv0 32) main_~s__hit~0))} assume ~s__hit~0 != 0bv32;~s__state~0 := 8640bv32; {2195#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:38,818 INFO L273 TraceCheckUtils]: 22: Hoare triple {2195#(not (= (_ bv0 32) main_~s__hit~0))} assume true; {2195#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:38,818 INFO L273 TraceCheckUtils]: 23: Hoare triple {2195#(not (= (_ bv0 32) main_~s__hit~0))} assume !false; {2195#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:38,820 INFO L273 TraceCheckUtils]: 24: Hoare triple {2195#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {2195#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:38,820 INFO L273 TraceCheckUtils]: 25: Hoare triple {2195#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~s__state~0 == 8466bv32); {2195#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:38,821 INFO L273 TraceCheckUtils]: 26: Hoare triple {2195#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~s__state~0 == 8512bv32); {2195#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:38,821 INFO L273 TraceCheckUtils]: 27: Hoare triple {2195#(not (= (_ bv0 32) main_~s__hit~0))} assume ~s__state~0 == 8640bv32; {2195#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:38,822 INFO L273 TraceCheckUtils]: 28: Hoare triple {2195#(not (= (_ bv0 32) main_~s__hit~0))} assume ~blastFlag~0 == 3bv32;~blastFlag~0 := 4bv32; {2195#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-14 16:14:38,823 INFO L273 TraceCheckUtils]: 29: Hoare triple {2195#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~s__hit~0 != 0bv32);~s__state~0 := 8656bv32; {2161#false} is VALID [2018-11-14 16:14:38,823 INFO L273 TraceCheckUtils]: 30: Hoare triple {2161#false} assume true; {2161#false} is VALID [2018-11-14 16:14:38,823 INFO L273 TraceCheckUtils]: 31: Hoare triple {2161#false} assume !false; {2161#false} is VALID [2018-11-14 16:14:38,824 INFO L273 TraceCheckUtils]: 32: Hoare triple {2161#false} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {2161#false} is VALID [2018-11-14 16:14:38,824 INFO L273 TraceCheckUtils]: 33: Hoare triple {2161#false} assume !(~s__state~0 == 8466bv32); {2161#false} is VALID [2018-11-14 16:14:38,825 INFO L273 TraceCheckUtils]: 34: Hoare triple {2161#false} assume !(~s__state~0 == 8512bv32); {2161#false} is VALID [2018-11-14 16:14:38,825 INFO L273 TraceCheckUtils]: 35: Hoare triple {2161#false} assume !(~s__state~0 == 8640bv32); {2161#false} is VALID [2018-11-14 16:14:38,825 INFO L273 TraceCheckUtils]: 36: Hoare triple {2161#false} assume ~s__state~0 == 8656bv32; {2161#false} is VALID [2018-11-14 16:14:38,826 INFO L273 TraceCheckUtils]: 37: Hoare triple {2161#false} assume !(~blastFlag~0 == 2bv32); {2161#false} is VALID [2018-11-14 16:14:38,826 INFO L273 TraceCheckUtils]: 38: Hoare triple {2161#false} assume !(~blastFlag~0 == 4bv32); {2161#false} is VALID [2018-11-14 16:14:38,826 INFO L273 TraceCheckUtils]: 39: Hoare triple {2161#false} assume ~blastFlag~0 == 5bv32; {2161#false} is VALID [2018-11-14 16:14:38,827 INFO L273 TraceCheckUtils]: 40: Hoare triple {2161#false} assume !false; {2161#false} is VALID [2018-11-14 16:14:38,831 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-14 16:14:38,831 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:14:38,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:14:38,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:14:38,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-11-14 16:14:38,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:14:38,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:14:38,898 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:14:38,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:14:38,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:14:38,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:14:38,900 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand 3 states. [2018-11-14 16:14:39,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:14:39,044 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2018-11-14 16:14:39,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:14:39,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-11-14 16:14:39,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:14:39,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:14:39,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-14 16:14:39,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:14:39,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-14 16:14:39,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2018-11-14 16:14:39,197 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:14:39,198 INFO L225 Difference]: With dead ends: 92 [2018-11-14 16:14:39,198 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 16:14:39,199 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 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-11-14 16:14:39,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 16:14:39,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 16:14:39,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:14:39,200 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 16:14:39,200 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 16:14:39,200 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 16:14:39,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:14:39,201 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 16:14:39,201 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 16:14:39,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:14:39,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:14:39,202 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 16:14:39,202 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 16:14:39,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:14:39,202 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 16:14:39,202 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 16:14:39,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:14:39,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:14:39,203 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:14:39,203 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:14:39,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 16:14:39,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 16:14:39,203 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2018-11-14 16:14:39,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:14:39,204 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 16:14:39,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:14:39,204 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 16:14:39,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:14:39,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 16:14:39,548 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-14 16:14:39,548 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 16:14:39,548 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 16:14:39,548 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 16:14:39,549 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 16:14:39,549 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 16:14:39,549 INFO L421 ceAbstractionStarter]: At program point L97(lines 9 141) the Hoare annotation is: false [2018-11-14 16:14:39,549 INFO L421 ceAbstractionStarter]: At program point L31(lines 30 125) the Hoare annotation is: (or (= (_ bv0 32) main_~blastFlag~0) (= (_ bv2 32) main_~blastFlag~0)) [2018-11-14 16:14:39,549 INFO L425 ceAbstractionStarter]: For program point L93-1(lines 54 107) no Hoare annotation was computed. [2018-11-14 16:14:39,549 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 9 141) no Hoare annotation was computed. [2018-11-14 16:14:39,549 INFO L425 ceAbstractionStarter]: For program point L89-1(lines 54 107) no Hoare annotation was computed. [2018-11-14 16:14:39,549 INFO L425 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2018-11-14 16:14:39,549 INFO L425 ceAbstractionStarter]: For program point L78-1(lines 54 107) no Hoare annotation was computed. [2018-11-14 16:14:39,550 INFO L425 ceAbstractionStarter]: For program point L70(lines 70 74) no Hoare annotation was computed. [2018-11-14 16:14:39,550 INFO L425 ceAbstractionStarter]: For program point L25(lines 25 128) no Hoare annotation was computed. [2018-11-14 16:14:39,550 INFO L425 ceAbstractionStarter]: For program point L58-1(lines 54 107) no Hoare annotation was computed. [2018-11-14 16:14:39,550 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 139) no Hoare annotation was computed. [2018-11-14 16:14:39,550 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 109) no Hoare annotation was computed. [2018-11-14 16:14:39,550 INFO L425 ceAbstractionStarter]: For program point L46(lines 46 111) no Hoare annotation was computed. [2018-11-14 16:14:39,550 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 9 141) no Hoare annotation was computed. [2018-11-14 16:14:39,551 INFO L428 ceAbstractionStarter]: At program point L137(lines 9 141) the Hoare annotation is: true [2018-11-14 16:14:39,551 INFO L421 ceAbstractionStarter]: At program point L100(lines 18 135) the Hoare annotation is: (or (= (_ bv0 32) main_~blastFlag~0) (= (_ bv2 32) main_~blastFlag~0) (and (= (_ bv3 32) main_~blastFlag~0) (not (= (_ bv0 32) main_~s__hit~0)) (= (_ bv8640 32) main_~s__state~0))) [2018-11-14 16:14:39,551 INFO L425 ceAbstractionStarter]: For program point L96(lines 96 98) no Hoare annotation was computed. [2018-11-14 16:14:39,551 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 125) no Hoare annotation was computed. [2018-11-14 16:14:39,551 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 9 141) the Hoare annotation is: true [2018-11-14 16:14:39,551 INFO L421 ceAbstractionStarter]: At program point L26(lines 25 128) the Hoare annotation is: (or (= (_ bv0 32) main_~blastFlag~0) (= (_ bv2 32) main_~blastFlag~0)) [2018-11-14 16:14:39,552 INFO L421 ceAbstractionStarter]: At program point L51(lines 50 109) the Hoare annotation is: (let ((.cse0 (= (_ bv8656 32) main_~s__state~0))) (or (and (= (_ bv0 32) main_~blastFlag~0) .cse0) (and .cse0 (= (_ bv2 32) main_~blastFlag~0)))) [2018-11-14 16:14:39,552 INFO L425 ceAbstractionStarter]: For program point L18-1(lines 18 135) no Hoare annotation was computed. [2018-11-14 16:14:39,552 INFO L421 ceAbstractionStarter]: At program point L47(lines 46 111) the Hoare annotation is: (let ((.cse0 (= (_ bv8640 32) main_~s__state~0))) (or (and (= (_ bv3 32) main_~blastFlag~0) (not (= (_ bv0 32) main_~s__hit~0)) .cse0) (and (= (_ bv0 32) main_~blastFlag~0) .cse0) (and (= (_ bv2 32) main_~blastFlag~0) .cse0))) [2018-11-14 16:14:39,554 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 16:14:39,555 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 16:14:39,555 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 16:14:39,556 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2018-11-14 16:14:39,556 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 16:14:39,556 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2018-11-14 16:14:39,556 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2018-11-14 16:14:39,556 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 16:14:39,556 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-14 16:14:39,556 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-14 16:14:39,557 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 16:14:39,557 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-14 16:14:39,557 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 16:14:39,557 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2018-11-14 16:14:39,557 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2018-11-14 16:14:39,557 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 16:14:39,557 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2018-11-14 16:14:39,557 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2018-11-14 16:14:39,557 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2018-11-14 16:14:39,558 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2018-11-14 16:14:39,558 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2018-11-14 16:14:39,558 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2018-11-14 16:14:39,558 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2018-11-14 16:14:39,558 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2018-11-14 16:14:39,558 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2018-11-14 16:14:39,558 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2018-11-14 16:14:39,558 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2018-11-14 16:14:39,558 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2018-11-14 16:14:39,558 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2018-11-14 16:14:39,558 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2018-11-14 16:14:39,559 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2018-11-14 16:14:39,559 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2018-11-14 16:14:39,559 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2018-11-14 16:14:39,559 WARN L170 areAnnotationChecker]: L89-1 has no Hoare annotation [2018-11-14 16:14:39,559 WARN L170 areAnnotationChecker]: L89-1 has no Hoare annotation [2018-11-14 16:14:39,559 WARN L170 areAnnotationChecker]: L89-1 has no Hoare annotation [2018-11-14 16:14:39,559 WARN L170 areAnnotationChecker]: L89-1 has no Hoare annotation [2018-11-14 16:14:39,559 WARN L170 areAnnotationChecker]: L93-1 has no Hoare annotation [2018-11-14 16:14:39,559 WARN L170 areAnnotationChecker]: L93-1 has no Hoare annotation [2018-11-14 16:14:39,560 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2018-11-14 16:14:39,560 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2018-11-14 16:14:39,560 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 16:14:39,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 04:14:39 BoogieIcfgContainer [2018-11-14 16:14:39,573 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 16:14:39,574 INFO L168 Benchmark]: Toolchain (without parser) took 6527.65 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 752.9 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -379.8 MB). Peak memory consumption was 373.1 MB. Max. memory is 7.1 GB. [2018-11-14 16:14:39,576 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 16:14:39,577 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-14 16:14:39,578 INFO L168 Benchmark]: Boogie Preprocessor took 43.05 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 16:14:39,578 INFO L168 Benchmark]: RCFGBuilder took 720.47 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 752.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -787.4 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2018-11-14 16:14:39,579 INFO L168 Benchmark]: TraceAbstraction took 5413.86 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 397.0 MB). Peak memory consumption was 397.0 MB. Max. memory is 7.1 GB. [2018-11-14 16:14:39,583 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 345.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.05 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 720.47 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 752.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -787.4 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5413.86 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 397.0 MB). Peak memory consumption was 397.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 139]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (0bv32 == blastFlag && 8656bv32 == s__state) || (8656bv32 == s__state && 2bv32 == blastFlag) - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (0bv32 == blastFlag || 2bv32 == blastFlag) || ((3bv32 == blastFlag && !(0bv32 == s__hit)) && 8640bv32 == s__state) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: 0bv32 == blastFlag || 2bv32 == blastFlag - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (((3bv32 == blastFlag && !(0bv32 == s__hit)) && 8640bv32 == s__state) || (0bv32 == blastFlag && 8640bv32 == s__state)) || (2bv32 == blastFlag && 8640bv32 == s__state) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 0bv32 == blastFlag || 2bv32 == blastFlag - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. SAFE Result, 5.3s OverallTime, 6 OverallIterations, 4 TraceHistogramMax, 3.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 232 SDtfs, 74 SDslu, 121 SDs, 0 SdLazy, 91 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=4, 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.4s AutomataMinimizationTime, 6 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 11 PreInvPairs, 31 NumberOfFragments, 79 HoareAnnotationTreeSize, 11 FomulaSimplifications, 50 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 122 ConstructedInterpolants, 0 QuantifiedInterpolants, 5880 SizeOfPredicates, 5 NumberOfNonLiveVariables, 197 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 54/54 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...