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/AutomizerCInline_WitnessPrinter.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-61f4311 [2018-11-23 10:52:02,335 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:52:02,336 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:52:02,352 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:52:02,353 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:52:02,354 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:52:02,355 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:52:02,357 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:52:02,359 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:52:02,360 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:52:02,361 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:52:02,361 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:52:02,362 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:52:02,363 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:52:02,365 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:52:02,365 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:52:02,366 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:52:02,368 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:52:02,371 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:52:02,372 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:52:02,374 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:52:02,375 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:52:02,378 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:52:02,378 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:52:02,378 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:52:02,379 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:52:02,380 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:52:02,381 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:52:02,382 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:52:02,383 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:52:02,384 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:52:02,384 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:52:02,385 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:52:02,385 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:52:02,386 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:52:02,387 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:52:02,387 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-23 10:52:02,415 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:52:02,415 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:52:02,416 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:52:02,416 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:52:02,418 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:52:02,418 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:52:02,418 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:52:02,419 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:52:02,419 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:52:02,419 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:52:02,419 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:52:02,419 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:52:02,419 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:52:02,421 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:52:02,421 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:52:02,421 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:52:02,421 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:52:02,421 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:52:02,422 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:52:02,422 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:52:02,422 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:52:02,422 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:52:02,422 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:52:02,422 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:52:02,424 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:52:02,424 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:52:02,424 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:52:02,424 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:52:02,425 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:52:02,425 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:52:02,425 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:52:02,425 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:52:02,426 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:52:02,495 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:52:02,508 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:52:02,512 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:52:02,514 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:52:02,515 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:52:02,515 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-23 10:52:02,586 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37c7d9e20/a52b561a7acb4126a8836c135dd0b18e/FLAG4ebfdcbed [2018-11-23 10:52:03,065 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:52:03,066 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_1b_true-unreach-call_false-termination.cil.c [2018-11-23 10:52:03,074 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37c7d9e20/a52b561a7acb4126a8836c135dd0b18e/FLAG4ebfdcbed [2018-11-23 10:52:03,404 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37c7d9e20/a52b561a7acb4126a8836c135dd0b18e [2018-11-23 10:52:03,415 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:52:03,416 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:52:03,417 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:52:03,417 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:52:03,421 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:52:03,423 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:52:03" (1/1) ... [2018-11-23 10:52:03,426 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48c92180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:52:03, skipping insertion in model container [2018-11-23 10:52:03,426 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:52:03" (1/1) ... [2018-11-23 10:52:03,436 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:52:03,468 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:52:03,675 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:52:03,681 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:52:03,706 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:52:03,723 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:52:03,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:52:03 WrapperNode [2018-11-23 10:52:03,724 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:52:03,725 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:52:03,725 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:52:03,726 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:52:03,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:52:03" (1/1) ... [2018-11-23 10:52:03,743 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:52:03" (1/1) ... [2018-11-23 10:52:03,751 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:52:03,752 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:52:03,752 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:52:03,752 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:52:03,763 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:52:03" (1/1) ... [2018-11-23 10:52:03,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:52:03" (1/1) ... [2018-11-23 10:52:03,765 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:52:03" (1/1) ... [2018-11-23 10:52:03,765 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:52:03" (1/1) ... [2018-11-23 10:52:03,773 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:52:03" (1/1) ... [2018-11-23 10:52:03,781 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:52:03" (1/1) ... [2018-11-23 10:52:03,783 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:52:03" (1/1) ... [2018-11-23 10:52:03,785 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:52:03,786 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:52:03,786 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:52:03,786 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:52:03,787 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:52:03" (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-23 10:52:03,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:52:03,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:52:03,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:52:03,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:52:03,953 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:52:03,953 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:52:04,527 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:52:04,527 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 10:52:04,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:52:04 BoogieIcfgContainer [2018-11-23 10:52:04,528 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:52:04,529 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:52:04,529 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:52:04,533 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:52:04,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:52:03" (1/3) ... [2018-11-23 10:52:04,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@372c75e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:52:04, skipping insertion in model container [2018-11-23 10:52:04,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:52:03" (2/3) ... [2018-11-23 10:52:04,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@372c75e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:52:04, skipping insertion in model container [2018-11-23 10:52:04,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:52:04" (3/3) ... [2018-11-23 10:52:04,537 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_1b_true-unreach-call_false-termination.cil.c [2018-11-23 10:52:04,546 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:52:04,554 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:52:04,569 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:52:04,599 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:52:04,600 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:52:04,600 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:52:04,600 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:52:04,600 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:52:04,600 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:52:04,601 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:52:04,601 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:52:04,601 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:52:04,620 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-11-23 10:52:04,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 10:52:04,627 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:52:04,628 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:52:04,630 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:52:04,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:52:04,637 INFO L82 PathProgramCache]: Analyzing trace with hash -2134687016, now seen corresponding path program 1 times [2018-11-23 10:52:04,642 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:52:04,643 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-23 10:52:04,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:52:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:52:04,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:52:04,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:52:04,803 INFO L256 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {31#true} is VALID [2018-11-23 10:52:04,807 INFO L273 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2018-11-23 10:52:04,807 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #105#return; {31#true} is VALID [2018-11-23 10:52:04,808 INFO L256 TraceCheckUtils]: 3: Hoare triple {31#true} call #t~ret2 := main(); {31#true} is VALID [2018-11-23 10:52:04,813 INFO L273 TraceCheckUtils]: 4: Hoare triple {31#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; {48#(= (_ bv0 32) main_~blastFlag~0)} is VALID [2018-11-23 10:52:04,816 INFO L273 TraceCheckUtils]: 5: Hoare triple {48#(= (_ bv0 32) main_~blastFlag~0)} assume !false; {48#(= (_ bv0 32) main_~blastFlag~0)} is VALID [2018-11-23 10:52:04,817 INFO L273 TraceCheckUtils]: 6: Hoare triple {48#(= (_ bv0 32) main_~blastFlag~0)} assume ~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32); {32#false} is VALID [2018-11-23 10:52:04,817 INFO L273 TraceCheckUtils]: 7: Hoare triple {32#false} assume !false; {32#false} is VALID [2018-11-23 10:52:04,819 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-23 10:52:04,820 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:52:04,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:52:04,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:52:04,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-23 10:52:04,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:52:04,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:52:04,936 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:52:04,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:52:04,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:52:04,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:52:04,950 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 3 states. [2018-11-23 10:52:05,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:52:05,550 INFO L93 Difference]: Finished difference Result 69 states and 114 transitions. [2018-11-23 10:52:05,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:52:05,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-23 10:52:05,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:52:05,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:52:05,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2018-11-23 10:52:05,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:52:05,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2018-11-23 10:52:05,574 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 114 transitions. [2018-11-23 10:52:06,121 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:52:06,148 INFO L225 Difference]: With dead ends: 69 [2018-11-23 10:52:06,149 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 10:52:06,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-23 10:52:06,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 10:52:06,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-23 10:52:06,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:52:06,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2018-11-23 10:52:06,247 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-23 10:52:06,247 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-23 10:52:06,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:52:06,254 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2018-11-23 10:52:06,254 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 52 transitions. [2018-11-23 10:52:06,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:52:06,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:52:06,256 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-23 10:52:06,256 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-23 10:52:06,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:52:06,261 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2018-11-23 10:52:06,262 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 52 transitions. [2018-11-23 10:52:06,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:52:06,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:52:06,263 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:52:06,263 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:52:06,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 10:52:06,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2018-11-23 10:52:06,269 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 52 transitions. Word has length 8 [2018-11-23 10:52:06,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:52:06,270 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 52 transitions. [2018-11-23 10:52:06,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:52:06,270 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 52 transitions. [2018-11-23 10:52:06,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 10:52:06,271 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:52:06,271 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:52:06,271 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:52:06,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:52:06,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1966827798, now seen corresponding path program 1 times [2018-11-23 10:52:06,272 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:52:06,273 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-23 10:52:06,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:52:06,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:52:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:52:06,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:52:06,382 INFO L256 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2018-11-23 10:52:06,382 INFO L273 TraceCheckUtils]: 1: Hoare triple {279#true} assume true; {279#true} is VALID [2018-11-23 10:52:06,383 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {279#true} {279#true} #105#return; {279#true} is VALID [2018-11-23 10:52:06,383 INFO L256 TraceCheckUtils]: 3: Hoare triple {279#true} call #t~ret2 := main(); {279#true} is VALID [2018-11-23 10:52:06,383 INFO L273 TraceCheckUtils]: 4: Hoare triple {279#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; {279#true} is VALID [2018-11-23 10:52:06,384 INFO L273 TraceCheckUtils]: 5: Hoare triple {279#true} assume !false; {279#true} is VALID [2018-11-23 10:52:06,384 INFO L273 TraceCheckUtils]: 6: Hoare triple {279#true} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {279#true} is VALID [2018-11-23 10:52:06,384 INFO L273 TraceCheckUtils]: 7: Hoare triple {279#true} assume 8466bv32 == ~s__state~0; {279#true} is VALID [2018-11-23 10:52:06,385 INFO L273 TraceCheckUtils]: 8: Hoare triple {279#true} assume 0bv32 == ~blastFlag~0;~blastFlag~0 := 2bv32; {279#true} is VALID [2018-11-23 10:52:06,405 INFO L273 TraceCheckUtils]: 9: Hoare triple {279#true} assume 0bv32 != ~s__hit~0;~s__state~0 := 8656bv32; {311#(= (_ bv8656 32) main_~s__state~0)} is VALID [2018-11-23 10:52:06,410 INFO L273 TraceCheckUtils]: 10: Hoare triple {311#(= (_ bv8656 32) main_~s__state~0)} assume !false; {311#(= (_ bv8656 32) main_~s__state~0)} is VALID [2018-11-23 10:52:06,411 INFO L273 TraceCheckUtils]: 11: Hoare triple {311#(= (_ bv8656 32) main_~s__state~0)} assume ~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32); {280#false} is VALID [2018-11-23 10:52:06,411 INFO L273 TraceCheckUtils]: 12: Hoare triple {280#false} assume !false; {280#false} is VALID [2018-11-23 10:52:06,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:52:06,413 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:52:06,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:52:06,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:52:06,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 10:52:06,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:52:06,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:52:06,443 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:52:06,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:52:06,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:52:06,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:52:06,444 INFO L87 Difference]: Start difference. First operand 38 states and 52 transitions. Second operand 3 states. [2018-11-23 10:52:06,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:52:06,757 INFO L93 Difference]: Finished difference Result 85 states and 119 transitions. [2018-11-23 10:52:06,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:52:06,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 10:52:06,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:52:06,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:52:06,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2018-11-23 10:52:06,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:52:06,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2018-11-23 10:52:06,764 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 72 transitions. [2018-11-23 10:52:06,936 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-23 10:52:06,939 INFO L225 Difference]: With dead ends: 85 [2018-11-23 10:52:06,939 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 10:52:06,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-23 10:52:06,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 10:52:06,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2018-11-23 10:52:06,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:52:06,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 48 states. [2018-11-23 10:52:06,997 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 48 states. [2018-11-23 10:52:06,997 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 48 states. [2018-11-23 10:52:07,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:52:07,001 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2018-11-23 10:52:07,001 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2018-11-23 10:52:07,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:52:07,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:52:07,002 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 52 states. [2018-11-23 10:52:07,003 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 52 states. [2018-11-23 10:52:07,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:52:07,007 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2018-11-23 10:52:07,007 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2018-11-23 10:52:07,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:52:07,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:52:07,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:52:07,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:52:07,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:52:07,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2018-11-23 10:52:07,012 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 62 transitions. Word has length 13 [2018-11-23 10:52:07,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:52:07,012 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 62 transitions. [2018-11-23 10:52:07,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:52:07,013 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2018-11-23 10:52:07,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 10:52:07,014 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:52:07,014 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:52:07,014 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:52:07,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:52:07,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1966887380, now seen corresponding path program 1 times [2018-11-23 10:52:07,015 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:52:07,015 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-23 10:52:07,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:52:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:52:07,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:52:07,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:52:07,110 INFO L256 TraceCheckUtils]: 0: Hoare triple {603#true} call ULTIMATE.init(); {603#true} is VALID [2018-11-23 10:52:07,110 INFO L273 TraceCheckUtils]: 1: Hoare triple {603#true} assume true; {603#true} is VALID [2018-11-23 10:52:07,111 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {603#true} {603#true} #105#return; {603#true} is VALID [2018-11-23 10:52:07,112 INFO L256 TraceCheckUtils]: 3: Hoare triple {603#true} call #t~ret2 := main(); {603#true} is VALID [2018-11-23 10:52:07,112 INFO L273 TraceCheckUtils]: 4: Hoare triple {603#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; {603#true} is VALID [2018-11-23 10:52:07,112 INFO L273 TraceCheckUtils]: 5: Hoare triple {603#true} assume !false; {603#true} is VALID [2018-11-23 10:52:07,113 INFO L273 TraceCheckUtils]: 6: Hoare triple {603#true} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {603#true} is VALID [2018-11-23 10:52:07,113 INFO L273 TraceCheckUtils]: 7: Hoare triple {603#true} assume 8466bv32 == ~s__state~0; {603#true} is VALID [2018-11-23 10:52:07,114 INFO L273 TraceCheckUtils]: 8: Hoare triple {603#true} assume 0bv32 == ~blastFlag~0;~blastFlag~0 := 2bv32; {632#(= (_ bv2 32) main_~blastFlag~0)} is VALID [2018-11-23 10:52:07,115 INFO L273 TraceCheckUtils]: 9: Hoare triple {632#(= (_ bv2 32) main_~blastFlag~0)} assume !(0bv32 != ~s__hit~0);~s__state~0 := 8512bv32; {632#(= (_ bv2 32) main_~blastFlag~0)} is VALID [2018-11-23 10:52:07,124 INFO L273 TraceCheckUtils]: 10: Hoare triple {632#(= (_ bv2 32) main_~blastFlag~0)} assume !false; {632#(= (_ bv2 32) main_~blastFlag~0)} is VALID [2018-11-23 10:52:07,127 INFO L273 TraceCheckUtils]: 11: Hoare triple {632#(= (_ bv2 32) main_~blastFlag~0)} assume ~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32); {604#false} is VALID [2018-11-23 10:52:07,127 INFO L273 TraceCheckUtils]: 12: Hoare triple {604#false} assume !false; {604#false} is VALID [2018-11-23 10:52:07,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:52:07,129 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (4)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 10:52:07,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:52:07,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:52:07,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 10:52:07,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:52:07,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:52:07,172 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:52:07,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:52:07,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:52:07,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:52:07,174 INFO L87 Difference]: Start difference. First operand 48 states and 62 transitions. Second operand 3 states. [2018-11-23 10:52:07,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:52:07,472 INFO L93 Difference]: Finished difference Result 89 states and 122 transitions. [2018-11-23 10:52:07,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:52:07,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 10:52:07,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:52:07,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:52:07,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2018-11-23 10:52:07,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:52:07,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2018-11-23 10:52:07,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 83 transitions. [2018-11-23 10:52:07,586 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:52:07,590 INFO L225 Difference]: With dead ends: 89 [2018-11-23 10:52:07,590 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 10:52:07,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-23 10:52:07,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 10:52:07,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-23 10:52:07,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:52:07,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 66 states. [2018-11-23 10:52:07,649 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2018-11-23 10:52:07,649 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2018-11-23 10:52:07,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:52:07,653 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2018-11-23 10:52:07,653 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2018-11-23 10:52:07,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:52:07,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:52:07,654 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2018-11-23 10:52:07,655 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2018-11-23 10:52:07,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:52:07,659 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2018-11-23 10:52:07,659 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2018-11-23 10:52:07,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:52:07,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:52:07,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:52:07,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:52:07,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 10:52:07,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 85 transitions. [2018-11-23 10:52:07,664 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 85 transitions. Word has length 13 [2018-11-23 10:52:07,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:52:07,665 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 85 transitions. [2018-11-23 10:52:07,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:52:07,665 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2018-11-23 10:52:07,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 10:52:07,666 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:52:07,666 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:52:07,666 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:52:07,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:52:07,667 INFO L82 PathProgramCache]: Analyzing trace with hash 280007728, now seen corresponding path program 1 times [2018-11-23 10:52:07,667 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:52:07,667 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-23 10:52:07,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:52:07,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:52:07,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:52:07,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:52:07,780 INFO L256 TraceCheckUtils]: 0: Hoare triple {984#true} call ULTIMATE.init(); {984#true} is VALID [2018-11-23 10:52:07,780 INFO L273 TraceCheckUtils]: 1: Hoare triple {984#true} assume true; {984#true} is VALID [2018-11-23 10:52:07,781 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {984#true} {984#true} #105#return; {984#true} is VALID [2018-11-23 10:52:07,781 INFO L256 TraceCheckUtils]: 3: Hoare triple {984#true} call #t~ret2 := main(); {984#true} is VALID [2018-11-23 10:52:07,781 INFO L273 TraceCheckUtils]: 4: Hoare triple {984#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; {984#true} is VALID [2018-11-23 10:52:07,781 INFO L273 TraceCheckUtils]: 5: Hoare triple {984#true} assume !false; {984#true} is VALID [2018-11-23 10:52:07,782 INFO L273 TraceCheckUtils]: 6: Hoare triple {984#true} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {984#true} is VALID [2018-11-23 10:52:07,782 INFO L273 TraceCheckUtils]: 7: Hoare triple {984#true} assume 8466bv32 == ~s__state~0; {984#true} is VALID [2018-11-23 10:52:07,782 INFO L273 TraceCheckUtils]: 8: Hoare triple {984#true} assume 0bv32 == ~blastFlag~0;~blastFlag~0 := 2bv32; {984#true} is VALID [2018-11-23 10:52:07,783 INFO L273 TraceCheckUtils]: 9: Hoare triple {984#true} assume 0bv32 != ~s__hit~0;~s__state~0 := 8656bv32; {984#true} is VALID [2018-11-23 10:52:07,783 INFO L273 TraceCheckUtils]: 10: Hoare triple {984#true} assume !false; {984#true} is VALID [2018-11-23 10:52:07,783 INFO L273 TraceCheckUtils]: 11: Hoare triple {984#true} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {984#true} is VALID [2018-11-23 10:52:07,783 INFO L273 TraceCheckUtils]: 12: Hoare triple {984#true} assume !(8466bv32 == ~s__state~0); {984#true} is VALID [2018-11-23 10:52:07,784 INFO L273 TraceCheckUtils]: 13: Hoare triple {984#true} assume !(8512bv32 == ~s__state~0); {984#true} is VALID [2018-11-23 10:52:07,784 INFO L273 TraceCheckUtils]: 14: Hoare triple {984#true} assume !(8640bv32 == ~s__state~0); {984#true} is VALID [2018-11-23 10:52:07,784 INFO L273 TraceCheckUtils]: 15: Hoare triple {984#true} assume 8656bv32 == ~s__state~0; {984#true} is VALID [2018-11-23 10:52:07,785 INFO L273 TraceCheckUtils]: 16: Hoare triple {984#true} assume 2bv32 == ~blastFlag~0;~blastFlag~0 := 3bv32; {1037#(= (_ bv3 32) main_~blastFlag~0)} is VALID [2018-11-23 10:52:07,789 INFO L273 TraceCheckUtils]: 17: Hoare triple {1037#(= (_ bv3 32) main_~blastFlag~0)} assume !(4bv32 == ~blastFlag~0); {1037#(= (_ bv3 32) main_~blastFlag~0)} is VALID [2018-11-23 10:52:07,789 INFO L273 TraceCheckUtils]: 18: Hoare triple {1037#(= (_ bv3 32) main_~blastFlag~0)} assume 5bv32 == ~blastFlag~0; {985#false} is VALID [2018-11-23 10:52:07,790 INFO L273 TraceCheckUtils]: 19: Hoare triple {985#false} assume !false; {985#false} is VALID [2018-11-23 10:52:07,791 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 10:52:07,791 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:52:07,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:52:07,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:52:07,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 10:52:07,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:52:07,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:52:07,822 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:52:07,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:52:07,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:52:07,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:52:07,823 INFO L87 Difference]: Start difference. First operand 66 states and 85 transitions. Second operand 3 states. [2018-11-23 10:52:08,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:52:08,121 INFO L93 Difference]: Finished difference Result 129 states and 173 transitions. [2018-11-23 10:52:08,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:52:08,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 10:52:08,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:52:08,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:52:08,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2018-11-23 10:52:08,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:52:08,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2018-11-23 10:52:08,127 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 88 transitions. [2018-11-23 10:52:08,277 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:52:08,281 INFO L225 Difference]: With dead ends: 129 [2018-11-23 10:52:08,281 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 10:52:08,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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-23 10:52:08,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 10:52:08,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2018-11-23 10:52:08,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:52:08,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 86 states. [2018-11-23 10:52:08,388 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 86 states. [2018-11-23 10:52:08,388 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 86 states. [2018-11-23 10:52:08,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:52:08,392 INFO L93 Difference]: Finished difference Result 88 states and 112 transitions. [2018-11-23 10:52:08,392 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 112 transitions. [2018-11-23 10:52:08,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:52:08,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:52:08,393 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 88 states. [2018-11-23 10:52:08,394 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 88 states. [2018-11-23 10:52:08,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:52:08,398 INFO L93 Difference]: Finished difference Result 88 states and 112 transitions. [2018-11-23 10:52:08,398 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 112 transitions. [2018-11-23 10:52:08,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:52:08,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:52:08,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:52:08,400 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:52:08,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-23 10:52:08,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 111 transitions. [2018-11-23 10:52:08,403 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 111 transitions. Word has length 20 [2018-11-23 10:52:08,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:52:08,404 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 111 transitions. [2018-11-23 10:52:08,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:52:08,404 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 111 transitions. [2018-11-23 10:52:08,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 10:52:08,405 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:52:08,405 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:52:08,406 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:52:08,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:52:08,406 INFO L82 PathProgramCache]: Analyzing trace with hash 885328029, now seen corresponding path program 1 times [2018-11-23 10:52:08,406 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:52:08,407 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-23 10:52:08,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:52:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:52:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:52:08,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:52:08,507 INFO L256 TraceCheckUtils]: 0: Hoare triple {1509#true} call ULTIMATE.init(); {1509#true} is VALID [2018-11-23 10:52:08,507 INFO L273 TraceCheckUtils]: 1: Hoare triple {1509#true} assume true; {1509#true} is VALID [2018-11-23 10:52:08,508 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1509#true} {1509#true} #105#return; {1509#true} is VALID [2018-11-23 10:52:08,508 INFO L256 TraceCheckUtils]: 3: Hoare triple {1509#true} call #t~ret2 := main(); {1509#true} is VALID [2018-11-23 10:52:08,509 INFO L273 TraceCheckUtils]: 4: Hoare triple {1509#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; {1509#true} is VALID [2018-11-23 10:52:08,509 INFO L273 TraceCheckUtils]: 5: Hoare triple {1509#true} assume !false; {1509#true} is VALID [2018-11-23 10:52:08,509 INFO L273 TraceCheckUtils]: 6: Hoare triple {1509#true} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {1509#true} is VALID [2018-11-23 10:52:08,510 INFO L273 TraceCheckUtils]: 7: Hoare triple {1509#true} assume 8466bv32 == ~s__state~0; {1509#true} is VALID [2018-11-23 10:52:08,510 INFO L273 TraceCheckUtils]: 8: Hoare triple {1509#true} assume 0bv32 == ~blastFlag~0;~blastFlag~0 := 2bv32; {1509#true} is VALID [2018-11-23 10:52:08,510 INFO L273 TraceCheckUtils]: 9: Hoare triple {1509#true} assume 0bv32 != ~s__hit~0;~s__state~0 := 8656bv32; {1509#true} is VALID [2018-11-23 10:52:08,510 INFO L273 TraceCheckUtils]: 10: Hoare triple {1509#true} assume !false; {1509#true} is VALID [2018-11-23 10:52:08,511 INFO L273 TraceCheckUtils]: 11: Hoare triple {1509#true} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {1509#true} is VALID [2018-11-23 10:52:08,511 INFO L273 TraceCheckUtils]: 12: Hoare triple {1509#true} assume !(8466bv32 == ~s__state~0); {1509#true} is VALID [2018-11-23 10:52:08,511 INFO L273 TraceCheckUtils]: 13: Hoare triple {1509#true} assume !(8512bv32 == ~s__state~0); {1509#true} is VALID [2018-11-23 10:52:08,512 INFO L273 TraceCheckUtils]: 14: Hoare triple {1509#true} assume !(8640bv32 == ~s__state~0); {1509#true} is VALID [2018-11-23 10:52:08,512 INFO L273 TraceCheckUtils]: 15: Hoare triple {1509#true} assume 8656bv32 == ~s__state~0; {1509#true} is VALID [2018-11-23 10:52:08,512 INFO L273 TraceCheckUtils]: 16: Hoare triple {1509#true} assume 2bv32 == ~blastFlag~0;~blastFlag~0 := 3bv32; {1509#true} is VALID [2018-11-23 10:52:08,513 INFO L273 TraceCheckUtils]: 17: Hoare triple {1509#true} assume !(4bv32 == ~blastFlag~0); {1509#true} is VALID [2018-11-23 10:52:08,513 INFO L273 TraceCheckUtils]: 18: Hoare triple {1509#true} assume !(5bv32 == ~blastFlag~0); {1509#true} is VALID [2018-11-23 10:52:08,516 INFO L273 TraceCheckUtils]: 19: Hoare triple {1509#true} assume 0bv32 != ~s__hit~0;~s__state~0 := 8640bv32; {1571#(= (_ bv8640 32) main_~s__state~0)} is VALID [2018-11-23 10:52:08,521 INFO L273 TraceCheckUtils]: 20: Hoare triple {1571#(= (_ bv8640 32) main_~s__state~0)} assume !false; {1571#(= (_ bv8640 32) main_~s__state~0)} is VALID [2018-11-23 10:52:08,521 INFO L273 TraceCheckUtils]: 21: Hoare triple {1571#(= (_ bv8640 32) main_~s__state~0)} assume ~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32); {1510#false} is VALID [2018-11-23 10:52:08,522 INFO L273 TraceCheckUtils]: 22: Hoare triple {1510#false} assume !false; {1510#false} is VALID [2018-11-23 10:52:08,523 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 10:52:08,523 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:52:08,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:52:08,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:52:08,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 10:52:08,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:52:08,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:52:08,608 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:52:08,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:52:08,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:52:08,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:52:08,609 INFO L87 Difference]: Start difference. First operand 86 states and 111 transitions. Second operand 3 states. [2018-11-23 10:52:08,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:52:08,870 INFO L93 Difference]: Finished difference Result 162 states and 213 transitions. [2018-11-23 10:52:08,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:52:08,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 10:52:08,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:52:08,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:52:08,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2018-11-23 10:52:08,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:52:08,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2018-11-23 10:52:08,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 69 transitions. [2018-11-23 10:52:08,982 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:52:08,983 INFO L225 Difference]: With dead ends: 162 [2018-11-23 10:52:08,984 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 10:52:08,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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-23 10:52:08,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 10:52:09,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-11-23 10:52:09,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:52:09,055 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 63 states. [2018-11-23 10:52:09,055 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 63 states. [2018-11-23 10:52:09,055 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 63 states. [2018-11-23 10:52:09,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:52:09,058 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2018-11-23 10:52:09,059 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2018-11-23 10:52:09,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:52:09,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:52:09,059 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 63 states. [2018-11-23 10:52:09,060 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 63 states. [2018-11-23 10:52:09,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:52:09,062 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2018-11-23 10:52:09,062 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2018-11-23 10:52:09,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:52:09,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:52:09,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:52:09,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:52:09,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 10:52:09,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2018-11-23 10:52:09,066 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 23 [2018-11-23 10:52:09,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:52:09,066 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2018-11-23 10:52:09,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:52:09,067 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2018-11-23 10:52:09,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 10:52:09,068 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:52:09,068 INFO L402 BasicCegarLoop]: trace histogram [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-23 10:52:09,068 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:52:09,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:52:09,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1155086362, now seen corresponding path program 1 times [2018-11-23 10:52:09,069 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:52:09,069 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-23 10:52:09,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:52:09,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:52:09,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:52:09,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:52:09,185 INFO L256 TraceCheckUtils]: 0: Hoare triple {2002#true} call ULTIMATE.init(); {2002#true} is VALID [2018-11-23 10:52:09,185 INFO L273 TraceCheckUtils]: 1: Hoare triple {2002#true} assume true; {2002#true} is VALID [2018-11-23 10:52:09,186 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2002#true} {2002#true} #105#return; {2002#true} is VALID [2018-11-23 10:52:09,186 INFO L256 TraceCheckUtils]: 3: Hoare triple {2002#true} call #t~ret2 := main(); {2002#true} is VALID [2018-11-23 10:52:09,186 INFO L273 TraceCheckUtils]: 4: Hoare triple {2002#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; {2002#true} is VALID [2018-11-23 10:52:09,187 INFO L273 TraceCheckUtils]: 5: Hoare triple {2002#true} assume !false; {2002#true} is VALID [2018-11-23 10:52:09,187 INFO L273 TraceCheckUtils]: 6: Hoare triple {2002#true} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {2002#true} is VALID [2018-11-23 10:52:09,187 INFO L273 TraceCheckUtils]: 7: Hoare triple {2002#true} assume 8466bv32 == ~s__state~0; {2002#true} is VALID [2018-11-23 10:52:09,187 INFO L273 TraceCheckUtils]: 8: Hoare triple {2002#true} assume 0bv32 == ~blastFlag~0;~blastFlag~0 := 2bv32; {2002#true} is VALID [2018-11-23 10:52:09,188 INFO L273 TraceCheckUtils]: 9: Hoare triple {2002#true} assume 0bv32 != ~s__hit~0;~s__state~0 := 8656bv32; {2034#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:09,191 INFO L273 TraceCheckUtils]: 10: Hoare triple {2034#(not (= (_ bv0 32) main_~s__hit~0))} assume !false; {2034#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:09,191 INFO L273 TraceCheckUtils]: 11: Hoare triple {2034#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {2034#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:09,192 INFO L273 TraceCheckUtils]: 12: Hoare triple {2034#(not (= (_ bv0 32) main_~s__hit~0))} assume !(8466bv32 == ~s__state~0); {2034#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:09,192 INFO L273 TraceCheckUtils]: 13: Hoare triple {2034#(not (= (_ bv0 32) main_~s__hit~0))} assume !(8512bv32 == ~s__state~0); {2034#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:09,193 INFO L273 TraceCheckUtils]: 14: Hoare triple {2034#(not (= (_ bv0 32) main_~s__hit~0))} assume !(8640bv32 == ~s__state~0); {2034#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:09,193 INFO L273 TraceCheckUtils]: 15: Hoare triple {2034#(not (= (_ bv0 32) main_~s__hit~0))} assume 8656bv32 == ~s__state~0; {2034#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:09,197 INFO L273 TraceCheckUtils]: 16: Hoare triple {2034#(not (= (_ bv0 32) main_~s__hit~0))} assume 2bv32 == ~blastFlag~0;~blastFlag~0 := 3bv32; {2034#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:09,197 INFO L273 TraceCheckUtils]: 17: Hoare triple {2034#(not (= (_ bv0 32) main_~s__hit~0))} assume !(4bv32 == ~blastFlag~0); {2034#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:09,198 INFO L273 TraceCheckUtils]: 18: Hoare triple {2034#(not (= (_ bv0 32) main_~s__hit~0))} assume !(5bv32 == ~blastFlag~0); {2034#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:09,198 INFO L273 TraceCheckUtils]: 19: Hoare triple {2034#(not (= (_ bv0 32) main_~s__hit~0))} assume 0bv32 != ~s__hit~0;~s__state~0 := 8640bv32; {2034#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:09,199 INFO L273 TraceCheckUtils]: 20: Hoare triple {2034#(not (= (_ bv0 32) main_~s__hit~0))} assume !false; {2034#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:09,199 INFO L273 TraceCheckUtils]: 21: Hoare triple {2034#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {2034#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:09,199 INFO L273 TraceCheckUtils]: 22: Hoare triple {2034#(not (= (_ bv0 32) main_~s__hit~0))} assume !(8466bv32 == ~s__state~0); {2034#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:09,200 INFO L273 TraceCheckUtils]: 23: Hoare triple {2034#(not (= (_ bv0 32) main_~s__hit~0))} assume !(8512bv32 == ~s__state~0); {2034#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:09,200 INFO L273 TraceCheckUtils]: 24: Hoare triple {2034#(not (= (_ bv0 32) main_~s__hit~0))} assume 8640bv32 == ~s__state~0; {2034#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:09,201 INFO L273 TraceCheckUtils]: 25: Hoare triple {2034#(not (= (_ bv0 32) main_~s__hit~0))} assume 3bv32 == ~blastFlag~0;~blastFlag~0 := 4bv32; {2034#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:09,202 INFO L273 TraceCheckUtils]: 26: Hoare triple {2034#(not (= (_ bv0 32) main_~s__hit~0))} assume !(0bv32 != ~s__hit~0);~s__state~0 := 8656bv32; {2003#false} is VALID [2018-11-23 10:52:09,202 INFO L273 TraceCheckUtils]: 27: Hoare triple {2003#false} assume !false; {2003#false} is VALID [2018-11-23 10:52:09,202 INFO L273 TraceCheckUtils]: 28: Hoare triple {2003#false} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {2003#false} is VALID [2018-11-23 10:52:09,203 INFO L273 TraceCheckUtils]: 29: Hoare triple {2003#false} assume !(8466bv32 == ~s__state~0); {2003#false} is VALID [2018-11-23 10:52:09,203 INFO L273 TraceCheckUtils]: 30: Hoare triple {2003#false} assume !(8512bv32 == ~s__state~0); {2003#false} is VALID [2018-11-23 10:52:09,204 INFO L273 TraceCheckUtils]: 31: Hoare triple {2003#false} assume !(8640bv32 == ~s__state~0); {2003#false} is VALID [2018-11-23 10:52:09,204 INFO L273 TraceCheckUtils]: 32: Hoare triple {2003#false} assume 8656bv32 == ~s__state~0; {2003#false} is VALID [2018-11-23 10:52:09,205 INFO L273 TraceCheckUtils]: 33: Hoare triple {2003#false} assume !(2bv32 == ~blastFlag~0); {2003#false} is VALID [2018-11-23 10:52:09,205 INFO L273 TraceCheckUtils]: 34: Hoare triple {2003#false} assume !(4bv32 == ~blastFlag~0); {2003#false} is VALID [2018-11-23 10:52:09,205 INFO L273 TraceCheckUtils]: 35: Hoare triple {2003#false} assume 5bv32 == ~blastFlag~0; {2003#false} is VALID [2018-11-23 10:52:09,205 INFO L273 TraceCheckUtils]: 36: Hoare triple {2003#false} assume !false; {2003#false} is VALID [2018-11-23 10:52:09,209 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 10:52:09,209 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:52:09,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:52:09,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:52:09,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-23 10:52:09,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:52:09,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:52:09,249 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:52:09,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:52:09,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:52:09,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:52:09,250 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand 3 states. [2018-11-23 10:52:09,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:52:09,432 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2018-11-23 10:52:09,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:52:09,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-23 10:52:09,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:52:09,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:52:09,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2018-11-23 10:52:09,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:52:09,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2018-11-23 10:52:09,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2018-11-23 10:52:09,511 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:52:09,511 INFO L225 Difference]: With dead ends: 83 [2018-11-23 10:52:09,512 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 10:52:09,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 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-23 10:52:09,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 10:52:09,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 10:52:09,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:52:09,514 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 10:52:09,514 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 10:52:09,515 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 10:52:09,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:52:09,515 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 10:52:09,515 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 10:52:09,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:52:09,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:52:09,515 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 10:52:09,516 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 10:52:09,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:52:09,516 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 10:52:09,516 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 10:52:09,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:52:09,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:52:09,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:52:09,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:52:09,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 10:52:09,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 10:52:09,518 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2018-11-23 10:52:09,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:52:09,518 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 10:52:09,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:52:09,518 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 10:52:09,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:52:09,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 10:52:09,866 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 10:52:09,867 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 10:52:09,867 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 10:52:09,867 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 10:52:09,867 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 10:52:09,867 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 10:52:09,867 INFO L444 ceAbstractionStarter]: At program point L97(lines 9 141) the Hoare annotation is: false [2018-11-23 10:52:09,867 INFO L444 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-23 10:52:09,868 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 54 107) no Hoare annotation was computed. [2018-11-23 10:52:09,868 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 9 141) no Hoare annotation was computed. [2018-11-23 10:52:09,868 INFO L448 ceAbstractionStarter]: For program point L89-1(lines 54 107) no Hoare annotation was computed. [2018-11-23 10:52:09,868 INFO L448 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2018-11-23 10:52:09,868 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 139) no Hoare annotation was computed. [2018-11-23 10:52:09,868 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 54 107) no Hoare annotation was computed. [2018-11-23 10:52:09,869 INFO L448 ceAbstractionStarter]: For program point L70(lines 70 74) no Hoare annotation was computed. [2018-11-23 10:52:09,869 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 128) no Hoare annotation was computed. [2018-11-23 10:52:09,869 INFO L448 ceAbstractionStarter]: For program point L58-1(lines 54 107) no Hoare annotation was computed. [2018-11-23 10:52:09,869 INFO L448 ceAbstractionStarter]: For program point L50(lines 50 109) no Hoare annotation was computed. [2018-11-23 10:52:09,869 INFO L448 ceAbstractionStarter]: For program point L46(lines 46 111) no Hoare annotation was computed. [2018-11-23 10:52:09,869 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 9 141) no Hoare annotation was computed. [2018-11-23 10:52:09,869 INFO L451 ceAbstractionStarter]: At program point L137(lines 9 141) the Hoare annotation is: true [2018-11-23 10:52:09,869 INFO L444 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-23 10:52:09,870 INFO L448 ceAbstractionStarter]: For program point L96(lines 96 98) no Hoare annotation was computed. [2018-11-23 10:52:09,870 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 125) no Hoare annotation was computed. [2018-11-23 10:52:09,870 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 9 141) the Hoare annotation is: true [2018-11-23 10:52:09,870 INFO L444 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-23 10:52:09,870 INFO L444 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-23 10:52:09,870 INFO L444 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-23 10:52:09,872 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 10:52:09,874 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 10:52:09,874 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 10:52:09,874 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-23 10:52:09,874 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 10:52:09,874 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 10:52:09,875 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-23 10:52:09,875 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-23 10:52:09,875 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 10:52:09,875 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-23 10:52:09,875 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 10:52:09,875 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2018-11-23 10:52:09,875 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2018-11-23 10:52:09,876 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 10:52:09,876 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2018-11-23 10:52:09,876 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2018-11-23 10:52:09,876 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2018-11-23 10:52:09,876 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2018-11-23 10:52:09,876 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2018-11-23 10:52:09,876 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2018-11-23 10:52:09,876 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2018-11-23 10:52:09,876 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2018-11-23 10:52:09,877 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2018-11-23 10:52:09,877 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2018-11-23 10:52:09,877 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2018-11-23 10:52:09,877 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2018-11-23 10:52:09,877 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2018-11-23 10:52:09,877 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2018-11-23 10:52:09,877 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2018-11-23 10:52:09,877 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2018-11-23 10:52:09,877 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2018-11-23 10:52:09,877 WARN L170 areAnnotationChecker]: L89-1 has no Hoare annotation [2018-11-23 10:52:09,877 WARN L170 areAnnotationChecker]: L89-1 has no Hoare annotation [2018-11-23 10:52:09,878 WARN L170 areAnnotationChecker]: L89-1 has no Hoare annotation [2018-11-23 10:52:09,878 WARN L170 areAnnotationChecker]: L89-1 has no Hoare annotation [2018-11-23 10:52:09,878 WARN L170 areAnnotationChecker]: L93-1 has no Hoare annotation [2018-11-23 10:52:09,878 WARN L170 areAnnotationChecker]: L93-1 has no Hoare annotation [2018-11-23 10:52:09,878 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2018-11-23 10:52:09,878 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2018-11-23 10:52:09,878 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 10:52:09,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:52:09 BoogieIcfgContainer [2018-11-23 10:52:09,890 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 10:52:09,891 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 10:52:09,891 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 10:52:09,891 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 10:52:09,892 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:52:04" (3/4) ... [2018-11-23 10:52:09,896 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 10:52:09,903 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 10:52:09,904 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 10:52:09,909 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 10:52:09,909 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 10:52:09,909 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 10:52:09,970 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/ssh-simplified/s3_srvr_1b_true-unreach-call_false-termination.cil.c-witness.graphml [2018-11-23 10:52:09,970 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 10:52:09,975 INFO L168 Benchmark]: Toolchain (without parser) took 6559.48 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 760.7 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -379.0 MB). Peak memory consumption was 381.7 MB. Max. memory is 7.1 GB. [2018-11-23 10:52:09,977 INFO L168 Benchmark]: CDTParser took 0.25 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-23 10:52:09,977 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.63 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-23 10:52:09,978 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.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-23 10:52:09,978 INFO L168 Benchmark]: Boogie Preprocessor took 33.68 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-23 10:52:09,979 INFO L168 Benchmark]: RCFGBuilder took 742.63 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 760.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -793.5 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2018-11-23 10:52:09,979 INFO L168 Benchmark]: TraceAbstraction took 5361.14 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: 403.9 MB). Peak memory consumption was 403.9 MB. Max. memory is 7.1 GB. [2018-11-23 10:52:09,980 INFO L168 Benchmark]: Witness Printer took 79.89 ms. Allocated memory is still 2.3 GB. Free memory is still 1.8 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 10:52:09,983 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.25 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 307.63 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 Procedure Inliner took 26.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. * Boogie Preprocessor took 33.68 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 742.63 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 760.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -793.5 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5361.14 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: 403.9 MB). Peak memory consumption was 403.9 MB. Max. memory is 7.1 GB. * Witness Printer took 79.89 ms. Allocated memory is still 2.3 GB. Free memory is still 1.8 GB. There was no memory consumed. 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, 28 locations, 1 error locations. SAFE Result, 5.2s OverallTime, 6 OverallIterations, 4 TraceHistogramMax, 3.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 221 SDtfs, 73 SDslu, 115 SDs, 0 SdLazy, 91 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred 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.5s InterpolantComputationTime, 114 NumberOfCodeBlocks, 114 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 4626 SizeOfPredicates, 5 NumberOfNonLiveVariables, 183 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 42/42 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...