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/loops/veris.c_NetBSD-libc__loop_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:26:26,409 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:26:26,412 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:26:26,432 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:26:26,432 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:26:26,433 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:26:26,434 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:26:26,436 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:26:26,438 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:26:26,439 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:26:26,440 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:26:26,440 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:26:26,441 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:26:26,442 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:26:26,443 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:26:26,444 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:26:26,445 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:26:26,447 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:26:26,449 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:26:26,451 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:26:26,452 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:26:26,453 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:26:26,456 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:26:26,456 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:26:26,457 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:26:26,462 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:26:26,463 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:26:26,464 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:26:26,464 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:26:26,465 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:26:26,469 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:26:26,471 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:26:26,471 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:26:26,471 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:26:26,473 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:26:26,474 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:26:26,474 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 11:26:26,505 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:26:26,505 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:26:26,506 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:26:26,506 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:26:26,507 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:26:26,507 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:26:26,508 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:26:26,508 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:26:26,508 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:26:26,508 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:26:26,508 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:26:26,509 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:26:26,509 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:26:26,509 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:26:26,509 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:26:26,509 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:26:26,510 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:26:26,511 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:26:26,511 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:26:26,511 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:26:26,511 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:26:26,512 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:26:26,512 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:26:26,512 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:26:26,512 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:26:26,512 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:26:26,514 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:26:26,514 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:26:26,514 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:26:26,514 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:26:26,515 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:26:26,515 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:26:26,515 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:26:26,590 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:26:26,604 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:26:26,610 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:26:26,612 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:26:26,612 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:26:26,613 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/veris.c_NetBSD-libc__loop_true-unreach-call_true-termination.i [2018-11-23 11:26:26,693 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3795d74a7/56e14217deac4c63867faf02bbf252d8/FLAGb60f87c58 [2018-11-23 11:26:27,176 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:26:27,177 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/veris.c_NetBSD-libc__loop_true-unreach-call_true-termination.i [2018-11-23 11:26:27,183 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3795d74a7/56e14217deac4c63867faf02bbf252d8/FLAGb60f87c58 [2018-11-23 11:26:27,534 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3795d74a7/56e14217deac4c63867faf02bbf252d8 [2018-11-23 11:26:27,544 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:26:27,545 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:26:27,546 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:26:27,546 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:26:27,550 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:26:27,552 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:26:27" (1/1) ... [2018-11-23 11:26:27,555 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65764f94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:27, skipping insertion in model container [2018-11-23 11:26:27,555 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:26:27" (1/1) ... [2018-11-23 11:26:27,564 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:26:27,584 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:26:27,832 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:26:27,853 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:26:27,883 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:26:27,913 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:26:27,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:27 WrapperNode [2018-11-23 11:26:27,914 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:26:27,915 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:26:27,915 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:26:27,915 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:26:27,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:27" (1/1) ... [2018-11-23 11:26:27,940 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:27" (1/1) ... [2018-11-23 11:26:27,951 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:26:27,951 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:26:27,951 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:26:27,951 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:26:27,962 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:27" (1/1) ... [2018-11-23 11:26:27,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:27" (1/1) ... [2018-11-23 11:26:27,964 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:27" (1/1) ... [2018-11-23 11:26:27,966 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:27" (1/1) ... [2018-11-23 11:26:27,982 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:27" (1/1) ... [2018-11-23 11:26:27,987 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:27" (1/1) ... [2018-11-23 11:26:27,989 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:27" (1/1) ... [2018-11-23 11:26:27,991 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:26:27,992 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:26:27,992 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:26:27,992 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:26:27,993 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:27" (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 11:26:28,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:26:28,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:26:28,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:26:28,122 INFO L130 BoogieDeclarations]: Found specification of procedure glob2 [2018-11-23 11:26:28,123 INFO L138 BoogieDeclarations]: Found implementation of procedure glob2 [2018-11-23 11:26:28,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:26:28,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:26:28,123 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:26:28,123 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:26:28,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:26:28,124 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:26:28,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:26:28,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:26:28,642 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:26:28,642 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:26:28,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:26:28 BoogieIcfgContainer [2018-11-23 11:26:28,643 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:26:28,644 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:26:28,644 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:26:28,647 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:26:28,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:26:27" (1/3) ... [2018-11-23 11:26:28,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e038458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:26:28, skipping insertion in model container [2018-11-23 11:26:28,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:27" (2/3) ... [2018-11-23 11:26:28,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e038458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:26:28, skipping insertion in model container [2018-11-23 11:26:28,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:26:28" (3/3) ... [2018-11-23 11:26:28,651 INFO L112 eAbstractionObserver]: Analyzing ICFG veris.c_NetBSD-libc__loop_true-unreach-call_true-termination.i [2018-11-23 11:26:28,662 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:26:28,670 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:26:28,689 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:26:28,718 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:26:28,719 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:26:28,719 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:26:28,719 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:26:28,720 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:26:28,720 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:26:28,720 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:26:28,720 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:26:28,720 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:26:28,739 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-11-23 11:26:28,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:26:28,744 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:26:28,746 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:26:28,748 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:26:28,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:26:28,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1626450083, now seen corresponding path program 1 times [2018-11-23 11:26:28,760 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:26:28,761 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 11:26:28,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:26:28,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:28,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:28,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:29,507 INFO L256 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {29#true} is VALID [2018-11-23 11:26:29,511 INFO L273 TraceCheckUtils]: 1: Hoare triple {29#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~tmp~0.base, ~tmp~0.offset := 0bv32, 0bv32; {29#true} is VALID [2018-11-23 11:26:29,511 INFO L273 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2018-11-23 11:26:29,512 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #41#return; {29#true} is VALID [2018-11-23 11:26:29,512 INFO L256 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret2 := main(); {29#true} is VALID [2018-11-23 11:26:29,513 INFO L273 TraceCheckUtils]: 5: Hoare triple {29#true} call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.alloc(8bv32);~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, ~bvsub32(~bvadd32(8bv32, ~#pathbuf~0.offset), 4bv32);~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, ~bvsub32(~bvadd32(8bv32, ~#pathbuf~0.offset), 4bv32); {49#(and (= (_ bv0 32) |main_~#pathbuf~0.offset|) (= (bvadd |main_~#pathbuf~0.offset| (_ bv4 32)) ~tmp~0.offset) (= ~tmp~0.base |main_~#pathbuf~0.base|))} is VALID [2018-11-23 11:26:29,515 INFO L256 TraceCheckUtils]: 6: Hoare triple {49#(and (= (_ bv0 32) |main_~#pathbuf~0.offset|) (= (bvadd |main_~#pathbuf~0.offset| (_ bv4 32)) ~tmp~0.offset) (= ~tmp~0.base |main_~#pathbuf~0.base|))} call #t~ret1 := glob2(~#pathbuf~0.base, ~#pathbuf~0.offset, ~bound~0.base, ~bound~0.offset); {53#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= |glob2_#in~pathbuf.offset| (_ bv0 32)) (= ~tmp~0.base |glob2_#in~pathbuf.base|))} is VALID [2018-11-23 11:26:29,521 INFO L273 TraceCheckUtils]: 7: Hoare triple {53#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= |glob2_#in~pathbuf.offset| (_ bv0 32)) (= ~tmp~0.base |glob2_#in~pathbuf.base|))} ~pathbuf.base, ~pathbuf.offset := #in~pathbuf.base, #in~pathbuf.offset;~pathlim.base, ~pathlim.offset := #in~pathlim.base, #in~pathlim.offset;havoc ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := ~pathbuf.base, ~pathbuf.offset; {57#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv0 32) glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2018-11-23 11:26:29,523 INFO L273 TraceCheckUtils]: 8: Hoare triple {57#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv0 32) glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} assume !!(~p~0.base == ~pathlim.base && ~bvsle32(~p~0.offset, ~pathlim.offset)); {57#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv0 32) glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2018-11-23 11:26:29,525 INFO L256 TraceCheckUtils]: 9: Hoare triple {57#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv0 32) glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~bvsle32(~p~0.offset, ~tmp~0.offset) then 1bv32 else 0bv32)); {64#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:29,527 INFO L273 TraceCheckUtils]: 10: Hoare triple {64#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {68#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:29,530 INFO L273 TraceCheckUtils]: 11: Hoare triple {68#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {30#false} is VALID [2018-11-23 11:26:29,530 INFO L273 TraceCheckUtils]: 12: Hoare triple {30#false} assume !false; {30#false} is VALID [2018-11-23 11:26:29,534 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 11:26:29,535 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:26:29,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:26:29,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:26:29,548 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-11-23 11:26:29,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:26:29,557 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:26:29,620 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 11:26:29,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:26:29,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:26:29,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:26:29,634 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 7 states. [2018-11-23 11:26:31,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:31,191 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2018-11-23 11:26:31,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:26:31,192 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-11-23 11:26:31,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:26:31,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:26:31,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2018-11-23 11:26:31,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:26:31,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2018-11-23 11:26:31,214 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 64 transitions. [2018-11-23 11:26:31,371 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:31,384 INFO L225 Difference]: With dead ends: 55 [2018-11-23 11:26:31,384 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 11:26:31,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:26:31,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 11:26:31,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-11-23 11:26:31,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:26:31,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 24 states. [2018-11-23 11:26:31,519 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 24 states. [2018-11-23 11:26:31,519 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 24 states. [2018-11-23 11:26:31,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:31,523 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-23 11:26:31,524 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-23 11:26:31,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:31,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:31,525 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 26 states. [2018-11-23 11:26:31,525 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 26 states. [2018-11-23 11:26:31,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:31,529 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-23 11:26:31,529 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-23 11:26:31,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:31,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:31,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:26:31,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:26:31,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:26:31,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-23 11:26:31,535 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 13 [2018-11-23 11:26:31,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:26:31,535 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-11-23 11:26:31,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:26:31,536 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-23 11:26:31,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:26:31,537 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:26:31,537 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:26:31,537 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:26:31,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:26:31,538 INFO L82 PathProgramCache]: Analyzing trace with hash -519824651, now seen corresponding path program 1 times [2018-11-23 11:26:31,538 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:26:31,539 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 11:26:31,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:26:31,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:31,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:31,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:31,924 INFO L256 TraceCheckUtils]: 0: Hoare triple {236#true} call ULTIMATE.init(); {236#true} is VALID [2018-11-23 11:26:31,924 INFO L273 TraceCheckUtils]: 1: Hoare triple {236#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~tmp~0.base, ~tmp~0.offset := 0bv32, 0bv32; {236#true} is VALID [2018-11-23 11:26:31,925 INFO L273 TraceCheckUtils]: 2: Hoare triple {236#true} assume true; {236#true} is VALID [2018-11-23 11:26:31,925 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {236#true} {236#true} #41#return; {236#true} is VALID [2018-11-23 11:26:31,926 INFO L256 TraceCheckUtils]: 4: Hoare triple {236#true} call #t~ret2 := main(); {236#true} is VALID [2018-11-23 11:26:31,927 INFO L273 TraceCheckUtils]: 5: Hoare triple {236#true} call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.alloc(8bv32);~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, ~bvsub32(~bvadd32(8bv32, ~#pathbuf~0.offset), 4bv32);~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, ~bvsub32(~bvadd32(8bv32, ~#pathbuf~0.offset), 4bv32); {256#(and (= (_ bv0 32) |main_~#pathbuf~0.offset|) (= (bvadd |main_~#pathbuf~0.offset| (_ bv4 32)) ~tmp~0.offset) (= ~tmp~0.base |main_~#pathbuf~0.base|))} is VALID [2018-11-23 11:26:31,929 INFO L256 TraceCheckUtils]: 6: Hoare triple {256#(and (= (_ bv0 32) |main_~#pathbuf~0.offset|) (= (bvadd |main_~#pathbuf~0.offset| (_ bv4 32)) ~tmp~0.offset) (= ~tmp~0.base |main_~#pathbuf~0.base|))} call #t~ret1 := glob2(~#pathbuf~0.base, ~#pathbuf~0.offset, ~bound~0.base, ~bound~0.offset); {260#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= |glob2_#in~pathbuf.offset| (_ bv0 32)) (= ~tmp~0.base |glob2_#in~pathbuf.base|))} is VALID [2018-11-23 11:26:31,930 INFO L273 TraceCheckUtils]: 7: Hoare triple {260#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= |glob2_#in~pathbuf.offset| (_ bv0 32)) (= ~tmp~0.base |glob2_#in~pathbuf.base|))} ~pathbuf.base, ~pathbuf.offset := #in~pathbuf.base, #in~pathbuf.offset;~pathlim.base, ~pathlim.offset := #in~pathlim.base, #in~pathlim.offset;havoc ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := ~pathbuf.base, ~pathbuf.offset; {264#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv0 32) glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2018-11-23 11:26:31,931 INFO L273 TraceCheckUtils]: 8: Hoare triple {264#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv0 32) glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} assume !!(~p~0.base == ~pathlim.base && ~bvsle32(~p~0.offset, ~pathlim.offset)); {264#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv0 32) glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2018-11-23 11:26:31,933 INFO L256 TraceCheckUtils]: 9: Hoare triple {264#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv0 32) glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~bvsle32(~p~0.offset, ~tmp~0.offset) then 1bv32 else 0bv32)); {271#(= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:31,935 INFO L273 TraceCheckUtils]: 10: Hoare triple {271#(= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32))} ~cond := #in~cond; {271#(= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:31,936 INFO L273 TraceCheckUtils]: 11: Hoare triple {271#(= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32))} assume !(0bv32 == ~cond); {271#(= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:31,937 INFO L273 TraceCheckUtils]: 12: Hoare triple {271#(= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32))} assume true; {271#(= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:31,937 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {271#(= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32))} {264#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv0 32) glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #39#return; {264#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv0 32) glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2018-11-23 11:26:31,938 INFO L273 TraceCheckUtils]: 14: Hoare triple {264#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv0 32) glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32); {264#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv0 32) glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2018-11-23 11:26:31,940 INFO L273 TraceCheckUtils]: 15: Hoare triple {264#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv0 32) glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #t~post0.base, #t~post0.offset := ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := #t~post0.base, ~bvadd32(4bv32, #t~post0.offset);havoc #t~post0.base, #t~post0.offset; {290#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv4 32) glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2018-11-23 11:26:31,941 INFO L273 TraceCheckUtils]: 16: Hoare triple {290#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv4 32) glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} assume !!(~p~0.base == ~pathlim.base && ~bvsle32(~p~0.offset, ~pathlim.offset)); {290#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv4 32) glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2018-11-23 11:26:31,943 INFO L256 TraceCheckUtils]: 17: Hoare triple {290#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv4 32) glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~bvsle32(~p~0.offset, ~tmp~0.offset) then 1bv32 else 0bv32)); {297#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:31,943 INFO L273 TraceCheckUtils]: 18: Hoare triple {297#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {301#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:31,944 INFO L273 TraceCheckUtils]: 19: Hoare triple {301#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {237#false} is VALID [2018-11-23 11:26:31,944 INFO L273 TraceCheckUtils]: 20: Hoare triple {237#false} assume !false; {237#false} is VALID [2018-11-23 11:26:31,947 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:26:31,947 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:26:32,574 INFO L273 TraceCheckUtils]: 20: Hoare triple {237#false} assume !false; {237#false} is VALID [2018-11-23 11:26:32,575 INFO L273 TraceCheckUtils]: 19: Hoare triple {311#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {237#false} is VALID [2018-11-23 11:26:32,576 INFO L273 TraceCheckUtils]: 18: Hoare triple {315#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {311#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:26:32,578 INFO L256 TraceCheckUtils]: 17: Hoare triple {319#(and (bvsle glob2_~p~0.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~bvsle32(~p~0.offset, ~tmp~0.offset) then 1bv32 else 0bv32)); {315#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:26:32,579 INFO L273 TraceCheckUtils]: 16: Hoare triple {319#(and (bvsle glob2_~p~0.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} assume !!(~p~0.base == ~pathlim.base && ~bvsle32(~p~0.offset, ~pathlim.offset)); {319#(and (bvsle glob2_~p~0.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2018-11-23 11:26:32,602 INFO L273 TraceCheckUtils]: 15: Hoare triple {326#(and (bvsle (bvadd glob2_~p~0.offset (_ bv4 32)) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #t~post0.base, #t~post0.offset := ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := #t~post0.base, ~bvadd32(4bv32, #t~post0.offset);havoc #t~post0.base, #t~post0.offset; {319#(and (bvsle glob2_~p~0.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2018-11-23 11:26:32,603 INFO L273 TraceCheckUtils]: 14: Hoare triple {326#(and (bvsle (bvadd glob2_~p~0.offset (_ bv4 32)) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32); {326#(and (bvsle (bvadd glob2_~p~0.offset (_ bv4 32)) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2018-11-23 11:26:32,604 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {236#true} {326#(and (bvsle (bvadd glob2_~p~0.offset (_ bv4 32)) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #39#return; {326#(and (bvsle (bvadd glob2_~p~0.offset (_ bv4 32)) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2018-11-23 11:26:32,604 INFO L273 TraceCheckUtils]: 12: Hoare triple {236#true} assume true; {236#true} is VALID [2018-11-23 11:26:32,605 INFO L273 TraceCheckUtils]: 11: Hoare triple {236#true} assume !(0bv32 == ~cond); {236#true} is VALID [2018-11-23 11:26:32,605 INFO L273 TraceCheckUtils]: 10: Hoare triple {236#true} ~cond := #in~cond; {236#true} is VALID [2018-11-23 11:26:32,605 INFO L256 TraceCheckUtils]: 9: Hoare triple {326#(and (bvsle (bvadd glob2_~p~0.offset (_ bv4 32)) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~bvsle32(~p~0.offset, ~tmp~0.offset) then 1bv32 else 0bv32)); {236#true} is VALID [2018-11-23 11:26:32,612 INFO L273 TraceCheckUtils]: 8: Hoare triple {326#(and (bvsle (bvadd glob2_~p~0.offset (_ bv4 32)) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} assume !!(~p~0.base == ~pathlim.base && ~bvsle32(~p~0.offset, ~pathlim.offset)); {326#(and (bvsle (bvadd glob2_~p~0.offset (_ bv4 32)) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2018-11-23 11:26:32,613 INFO L273 TraceCheckUtils]: 7: Hoare triple {351#(and (bvsle (bvadd |glob2_#in~pathbuf.offset| (_ bv4 32)) ~tmp~0.offset) (= ~tmp~0.base |glob2_#in~pathbuf.base|))} ~pathbuf.base, ~pathbuf.offset := #in~pathbuf.base, #in~pathbuf.offset;~pathlim.base, ~pathlim.offset := #in~pathlim.base, #in~pathlim.offset;havoc ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := ~pathbuf.base, ~pathbuf.offset; {326#(and (bvsle (bvadd glob2_~p~0.offset (_ bv4 32)) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2018-11-23 11:26:32,616 INFO L256 TraceCheckUtils]: 6: Hoare triple {355#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (bvsle (bvadd |main_~#pathbuf~0.offset| (_ bv4 32)) ~tmp~0.offset))} call #t~ret1 := glob2(~#pathbuf~0.base, ~#pathbuf~0.offset, ~bound~0.base, ~bound~0.offset); {351#(and (bvsle (bvadd |glob2_#in~pathbuf.offset| (_ bv4 32)) ~tmp~0.offset) (= ~tmp~0.base |glob2_#in~pathbuf.base|))} is VALID [2018-11-23 11:26:32,619 INFO L273 TraceCheckUtils]: 5: Hoare triple {236#true} call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.alloc(8bv32);~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, ~bvsub32(~bvadd32(8bv32, ~#pathbuf~0.offset), 4bv32);~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, ~bvsub32(~bvadd32(8bv32, ~#pathbuf~0.offset), 4bv32); {355#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (bvsle (bvadd |main_~#pathbuf~0.offset| (_ bv4 32)) ~tmp~0.offset))} is VALID [2018-11-23 11:26:32,619 INFO L256 TraceCheckUtils]: 4: Hoare triple {236#true} call #t~ret2 := main(); {236#true} is VALID [2018-11-23 11:26:32,620 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {236#true} {236#true} #41#return; {236#true} is VALID [2018-11-23 11:26:32,620 INFO L273 TraceCheckUtils]: 2: Hoare triple {236#true} assume true; {236#true} is VALID [2018-11-23 11:26:32,620 INFO L273 TraceCheckUtils]: 1: Hoare triple {236#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~tmp~0.base, ~tmp~0.offset := 0bv32, 0bv32; {236#true} is VALID [2018-11-23 11:26:32,620 INFO L256 TraceCheckUtils]: 0: Hoare triple {236#true} call ULTIMATE.init(); {236#true} is VALID [2018-11-23 11:26:32,622 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:26:32,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:26:32,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-11-23 11:26:32,630 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2018-11-23 11:26:32,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:26:32,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:26:32,723 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:32,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:26:32,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:26:32,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:26:32,725 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 15 states. [2018-11-23 11:26:33,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:33,993 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-23 11:26:33,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:26:33,993 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2018-11-23 11:26:33,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:26:33,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:26:33,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 33 transitions. [2018-11-23 11:26:33,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:26:34,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 33 transitions. [2018-11-23 11:26:34,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 33 transitions. [2018-11-23 11:26:34,082 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 11:26:34,085 INFO L225 Difference]: With dead ends: 36 [2018-11-23 11:26:34,085 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 11:26:34,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:26:34,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 11:26:34,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-23 11:26:34,175 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:26:34,176 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2018-11-23 11:26:34,176 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2018-11-23 11:26:34,176 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2018-11-23 11:26:34,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:34,180 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-23 11:26:34,180 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-23 11:26:34,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:34,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:34,181 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2018-11-23 11:26:34,182 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2018-11-23 11:26:34,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:34,184 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-23 11:26:34,185 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-23 11:26:34,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:34,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:34,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:26:34,186 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:26:34,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:26:34,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-11-23 11:26:34,189 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 21 [2018-11-23 11:26:34,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:26:34,189 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-11-23 11:26:34,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 11:26:34,190 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-23 11:26:34,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 11:26:34,191 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:26:34,191 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:26:34,191 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:26:34,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:26:34,192 INFO L82 PathProgramCache]: Analyzing trace with hash -2027370867, now seen corresponding path program 2 times [2018-11-23 11:26:34,192 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:26:34,192 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 11:26:34,212 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:26:34,248 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 11:26:34,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:26:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:34,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:34,526 INFO L256 TraceCheckUtils]: 0: Hoare triple {553#true} call ULTIMATE.init(); {553#true} is VALID [2018-11-23 11:26:34,526 INFO L273 TraceCheckUtils]: 1: Hoare triple {553#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~tmp~0.base, ~tmp~0.offset := 0bv32, 0bv32; {553#true} is VALID [2018-11-23 11:26:34,527 INFO L273 TraceCheckUtils]: 2: Hoare triple {553#true} assume true; {553#true} is VALID [2018-11-23 11:26:34,527 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {553#true} {553#true} #41#return; {553#true} is VALID [2018-11-23 11:26:34,528 INFO L256 TraceCheckUtils]: 4: Hoare triple {553#true} call #t~ret2 := main(); {553#true} is VALID [2018-11-23 11:26:34,529 INFO L273 TraceCheckUtils]: 5: Hoare triple {553#true} call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.alloc(8bv32);~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, ~bvsub32(~bvadd32(8bv32, ~#pathbuf~0.offset), 4bv32);~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, ~bvsub32(~bvadd32(8bv32, ~#pathbuf~0.offset), 4bv32); {573#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv4 32) main_~bound~0.offset) (= ~tmp~0.base main_~bound~0.base))} is VALID [2018-11-23 11:26:34,530 INFO L256 TraceCheckUtils]: 6: Hoare triple {573#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv4 32) main_~bound~0.offset) (= ~tmp~0.base main_~bound~0.base))} call #t~ret1 := glob2(~#pathbuf~0.base, ~#pathbuf~0.offset, ~bound~0.base, ~bound~0.offset); {577#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv4 32) |glob2_#in~pathlim.offset|) (= ~tmp~0.base |glob2_#in~pathlim.base|))} is VALID [2018-11-23 11:26:34,533 INFO L273 TraceCheckUtils]: 7: Hoare triple {577#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv4 32) |glob2_#in~pathlim.offset|) (= ~tmp~0.base |glob2_#in~pathlim.base|))} ~pathbuf.base, ~pathbuf.offset := #in~pathbuf.base, #in~pathbuf.offset;~pathlim.base, ~pathlim.offset := #in~pathlim.base, #in~pathlim.offset;havoc ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := ~pathbuf.base, ~pathbuf.offset; {581#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= glob2_~pathlim.base ~tmp~0.base) (= (_ bv4 32) glob2_~pathlim.offset))} is VALID [2018-11-23 11:26:34,535 INFO L273 TraceCheckUtils]: 8: Hoare triple {581#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= glob2_~pathlim.base ~tmp~0.base) (= (_ bv4 32) glob2_~pathlim.offset))} assume !!(~p~0.base == ~pathlim.base && ~bvsle32(~p~0.offset, ~pathlim.offset)); {581#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= glob2_~pathlim.base ~tmp~0.base) (= (_ bv4 32) glob2_~pathlim.offset))} is VALID [2018-11-23 11:26:34,536 INFO L256 TraceCheckUtils]: 9: Hoare triple {581#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= glob2_~pathlim.base ~tmp~0.base) (= (_ bv4 32) glob2_~pathlim.offset))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~bvsle32(~p~0.offset, ~tmp~0.offset) then 1bv32 else 0bv32)); {588#(= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:34,537 INFO L273 TraceCheckUtils]: 10: Hoare triple {588#(= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32))} ~cond := #in~cond; {588#(= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:34,537 INFO L273 TraceCheckUtils]: 11: Hoare triple {588#(= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32))} assume !(0bv32 == ~cond); {588#(= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:34,538 INFO L273 TraceCheckUtils]: 12: Hoare triple {588#(= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32))} assume true; {588#(= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:34,540 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {588#(= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32))} {581#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= glob2_~pathlim.base ~tmp~0.base) (= (_ bv4 32) glob2_~pathlim.offset))} #39#return; {581#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= glob2_~pathlim.base ~tmp~0.base) (= (_ bv4 32) glob2_~pathlim.offset))} is VALID [2018-11-23 11:26:34,542 INFO L273 TraceCheckUtils]: 14: Hoare triple {581#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= glob2_~pathlim.base ~tmp~0.base) (= (_ bv4 32) glob2_~pathlim.offset))} call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32); {581#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= glob2_~pathlim.base ~tmp~0.base) (= (_ bv4 32) glob2_~pathlim.offset))} is VALID [2018-11-23 11:26:34,545 INFO L273 TraceCheckUtils]: 15: Hoare triple {581#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= glob2_~pathlim.base ~tmp~0.base) (= (_ bv4 32) glob2_~pathlim.offset))} #t~post0.base, #t~post0.offset := ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := #t~post0.base, ~bvadd32(4bv32, #t~post0.offset);havoc #t~post0.base, #t~post0.offset; {581#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= glob2_~pathlim.base ~tmp~0.base) (= (_ bv4 32) glob2_~pathlim.offset))} is VALID [2018-11-23 11:26:34,550 INFO L273 TraceCheckUtils]: 16: Hoare triple {581#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= glob2_~pathlim.base ~tmp~0.base) (= (_ bv4 32) glob2_~pathlim.offset))} assume !!(~p~0.base == ~pathlim.base && ~bvsle32(~p~0.offset, ~pathlim.offset)); {581#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= glob2_~pathlim.base ~tmp~0.base) (= (_ bv4 32) glob2_~pathlim.offset))} is VALID [2018-11-23 11:26:34,551 INFO L256 TraceCheckUtils]: 17: Hoare triple {581#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= glob2_~pathlim.base ~tmp~0.base) (= (_ bv4 32) glob2_~pathlim.offset))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~bvsle32(~p~0.offset, ~tmp~0.offset) then 1bv32 else 0bv32)); {588#(= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:34,552 INFO L273 TraceCheckUtils]: 18: Hoare triple {588#(= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32))} ~cond := #in~cond; {588#(= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:34,552 INFO L273 TraceCheckUtils]: 19: Hoare triple {588#(= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32))} assume !(0bv32 == ~cond); {588#(= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:34,553 INFO L273 TraceCheckUtils]: 20: Hoare triple {588#(= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32))} assume true; {588#(= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:34,554 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {588#(= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32))} {581#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= glob2_~pathlim.base ~tmp~0.base) (= (_ bv4 32) glob2_~pathlim.offset))} #39#return; {581#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= glob2_~pathlim.base ~tmp~0.base) (= (_ bv4 32) glob2_~pathlim.offset))} is VALID [2018-11-23 11:26:34,556 INFO L273 TraceCheckUtils]: 22: Hoare triple {581#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= glob2_~pathlim.base ~tmp~0.base) (= (_ bv4 32) glob2_~pathlim.offset))} call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32); {581#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= glob2_~pathlim.base ~tmp~0.base) (= (_ bv4 32) glob2_~pathlim.offset))} is VALID [2018-11-23 11:26:34,557 INFO L273 TraceCheckUtils]: 23: Hoare triple {581#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= glob2_~pathlim.base ~tmp~0.base) (= (_ bv4 32) glob2_~pathlim.offset))} #t~post0.base, #t~post0.offset := ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := #t~post0.base, ~bvadd32(4bv32, #t~post0.offset);havoc #t~post0.base, #t~post0.offset; {581#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= glob2_~pathlim.base ~tmp~0.base) (= (_ bv4 32) glob2_~pathlim.offset))} is VALID [2018-11-23 11:26:34,559 INFO L273 TraceCheckUtils]: 24: Hoare triple {581#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= glob2_~pathlim.base ~tmp~0.base) (= (_ bv4 32) glob2_~pathlim.offset))} assume !!(~p~0.base == ~pathlim.base && ~bvsle32(~p~0.offset, ~pathlim.offset)); {634#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (bvsle glob2_~p~0.offset (_ bv4 32)) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2018-11-23 11:26:34,561 INFO L256 TraceCheckUtils]: 25: Hoare triple {634#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (bvsle glob2_~p~0.offset (_ bv4 32)) (= ~tmp~0.base glob2_~p~0.base))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~bvsle32(~p~0.offset, ~tmp~0.offset) then 1bv32 else 0bv32)); {638#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:34,562 INFO L273 TraceCheckUtils]: 26: Hoare triple {638#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {642#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:34,563 INFO L273 TraceCheckUtils]: 27: Hoare triple {642#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {554#false} is VALID [2018-11-23 11:26:34,564 INFO L273 TraceCheckUtils]: 28: Hoare triple {554#false} assume !false; {554#false} is VALID [2018-11-23 11:26:34,569 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 11:26:34,569 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:26:35,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:26:35,118 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:26:35,130 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:26:35,166 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 11:26:35,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:26:35,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:35,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:35,350 INFO L256 TraceCheckUtils]: 0: Hoare triple {553#true} call ULTIMATE.init(); {553#true} is VALID [2018-11-23 11:26:35,351 INFO L273 TraceCheckUtils]: 1: Hoare triple {553#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~tmp~0.base, ~tmp~0.offset := 0bv32, 0bv32; {553#true} is VALID [2018-11-23 11:26:35,351 INFO L273 TraceCheckUtils]: 2: Hoare triple {553#true} assume true; {553#true} is VALID [2018-11-23 11:26:35,351 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {553#true} {553#true} #41#return; {553#true} is VALID [2018-11-23 11:26:35,352 INFO L256 TraceCheckUtils]: 4: Hoare triple {553#true} call #t~ret2 := main(); {553#true} is VALID [2018-11-23 11:26:35,353 INFO L273 TraceCheckUtils]: 5: Hoare triple {553#true} call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.alloc(8bv32);~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, ~bvsub32(~bvadd32(8bv32, ~#pathbuf~0.offset), 4bv32);~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, ~bvsub32(~bvadd32(8bv32, ~#pathbuf~0.offset), 4bv32); {573#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv4 32) main_~bound~0.offset) (= ~tmp~0.base main_~bound~0.base))} is VALID [2018-11-23 11:26:35,354 INFO L256 TraceCheckUtils]: 6: Hoare triple {573#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv4 32) main_~bound~0.offset) (= ~tmp~0.base main_~bound~0.base))} call #t~ret1 := glob2(~#pathbuf~0.base, ~#pathbuf~0.offset, ~bound~0.base, ~bound~0.offset); {577#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv4 32) |glob2_#in~pathlim.offset|) (= ~tmp~0.base |glob2_#in~pathlim.base|))} is VALID [2018-11-23 11:26:35,355 INFO L273 TraceCheckUtils]: 7: Hoare triple {577#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv4 32) |glob2_#in~pathlim.offset|) (= ~tmp~0.base |glob2_#in~pathlim.base|))} ~pathbuf.base, ~pathbuf.offset := #in~pathbuf.base, #in~pathbuf.offset;~pathlim.base, ~pathlim.offset := #in~pathlim.base, #in~pathlim.offset;havoc ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := ~pathbuf.base, ~pathbuf.offset; {581#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= glob2_~pathlim.base ~tmp~0.base) (= (_ bv4 32) glob2_~pathlim.offset))} is VALID [2018-11-23 11:26:35,355 INFO L273 TraceCheckUtils]: 8: Hoare triple {581#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= glob2_~pathlim.base ~tmp~0.base) (= (_ bv4 32) glob2_~pathlim.offset))} assume !!(~p~0.base == ~pathlim.base && ~bvsle32(~p~0.offset, ~pathlim.offset)); {581#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= glob2_~pathlim.base ~tmp~0.base) (= (_ bv4 32) glob2_~pathlim.offset))} is VALID [2018-11-23 11:26:35,363 INFO L256 TraceCheckUtils]: 9: Hoare triple {581#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= glob2_~pathlim.base ~tmp~0.base) (= (_ bv4 32) glob2_~pathlim.offset))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~bvsle32(~p~0.offset, ~tmp~0.offset) then 1bv32 else 0bv32)); {588#(= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:35,363 INFO L273 TraceCheckUtils]: 10: Hoare triple {588#(= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32))} ~cond := #in~cond; {588#(= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:35,364 INFO L273 TraceCheckUtils]: 11: Hoare triple {588#(= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32))} assume !(0bv32 == ~cond); {588#(= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:35,365 INFO L273 TraceCheckUtils]: 12: Hoare triple {588#(= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32))} assume true; {588#(= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:35,368 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {588#(= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32))} {581#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= glob2_~pathlim.base ~tmp~0.base) (= (_ bv4 32) glob2_~pathlim.offset))} #39#return; {581#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= glob2_~pathlim.base ~tmp~0.base) (= (_ bv4 32) glob2_~pathlim.offset))} is VALID [2018-11-23 11:26:35,369 INFO L273 TraceCheckUtils]: 14: Hoare triple {581#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= glob2_~pathlim.base ~tmp~0.base) (= (_ bv4 32) glob2_~pathlim.offset))} call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32); {581#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= glob2_~pathlim.base ~tmp~0.base) (= (_ bv4 32) glob2_~pathlim.offset))} is VALID [2018-11-23 11:26:35,370 INFO L273 TraceCheckUtils]: 15: Hoare triple {581#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= glob2_~pathlim.base ~tmp~0.base) (= (_ bv4 32) glob2_~pathlim.offset))} #t~post0.base, #t~post0.offset := ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := #t~post0.base, ~bvadd32(4bv32, #t~post0.offset);havoc #t~post0.base, #t~post0.offset; {581#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= glob2_~pathlim.base ~tmp~0.base) (= (_ bv4 32) glob2_~pathlim.offset))} is VALID [2018-11-23 11:26:35,371 INFO L273 TraceCheckUtils]: 16: Hoare triple {581#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= glob2_~pathlim.base ~tmp~0.base) (= (_ bv4 32) glob2_~pathlim.offset))} assume !!(~p~0.base == ~pathlim.base && ~bvsle32(~p~0.offset, ~pathlim.offset)); {581#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= glob2_~pathlim.base ~tmp~0.base) (= (_ bv4 32) glob2_~pathlim.offset))} is VALID [2018-11-23 11:26:35,372 INFO L256 TraceCheckUtils]: 17: Hoare triple {581#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= glob2_~pathlim.base ~tmp~0.base) (= (_ bv4 32) glob2_~pathlim.offset))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~bvsle32(~p~0.offset, ~tmp~0.offset) then 1bv32 else 0bv32)); {588#(= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:35,372 INFO L273 TraceCheckUtils]: 18: Hoare triple {588#(= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32))} ~cond := #in~cond; {588#(= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:35,373 INFO L273 TraceCheckUtils]: 19: Hoare triple {588#(= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32))} assume !(0bv32 == ~cond); {588#(= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:35,379 INFO L273 TraceCheckUtils]: 20: Hoare triple {588#(= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32))} assume true; {588#(= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:35,384 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {588#(= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32))} {581#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= glob2_~pathlim.base ~tmp~0.base) (= (_ bv4 32) glob2_~pathlim.offset))} #39#return; {581#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= glob2_~pathlim.base ~tmp~0.base) (= (_ bv4 32) glob2_~pathlim.offset))} is VALID [2018-11-23 11:26:35,385 INFO L273 TraceCheckUtils]: 22: Hoare triple {581#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= glob2_~pathlim.base ~tmp~0.base) (= (_ bv4 32) glob2_~pathlim.offset))} call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32); {581#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= glob2_~pathlim.base ~tmp~0.base) (= (_ bv4 32) glob2_~pathlim.offset))} is VALID [2018-11-23 11:26:35,390 INFO L273 TraceCheckUtils]: 23: Hoare triple {581#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= glob2_~pathlim.base ~tmp~0.base) (= (_ bv4 32) glob2_~pathlim.offset))} #t~post0.base, #t~post0.offset := ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := #t~post0.base, ~bvadd32(4bv32, #t~post0.offset);havoc #t~post0.base, #t~post0.offset; {581#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= glob2_~pathlim.base ~tmp~0.base) (= (_ bv4 32) glob2_~pathlim.offset))} is VALID [2018-11-23 11:26:35,390 INFO L273 TraceCheckUtils]: 24: Hoare triple {581#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (= glob2_~pathlim.base ~tmp~0.base) (= (_ bv4 32) glob2_~pathlim.offset))} assume !!(~p~0.base == ~pathlim.base && ~bvsle32(~p~0.offset, ~pathlim.offset)); {634#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (bvsle glob2_~p~0.offset (_ bv4 32)) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2018-11-23 11:26:35,392 INFO L256 TraceCheckUtils]: 25: Hoare triple {634#(and (= (bvadd ~tmp~0.offset (_ bv4294967292 32)) (_ bv0 32)) (bvsle glob2_~p~0.offset (_ bv4 32)) (= ~tmp~0.base glob2_~p~0.base))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~bvsle32(~p~0.offset, ~tmp~0.offset) then 1bv32 else 0bv32)); {638#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:35,393 INFO L273 TraceCheckUtils]: 26: Hoare triple {638#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {642#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:35,393 INFO L273 TraceCheckUtils]: 27: Hoare triple {642#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {554#false} is VALID [2018-11-23 11:26:35,394 INFO L273 TraceCheckUtils]: 28: Hoare triple {554#false} assume !false; {554#false} is VALID [2018-11-23 11:26:35,398 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 11:26:35,398 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:26:35,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:26:35,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-23 11:26:35,599 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-11-23 11:26:35,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:26:35,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:26:35,657 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 11:26:35,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:26:35,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:26:35,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:26:35,658 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 9 states. [2018-11-23 11:26:36,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:36,162 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-23 11:26:36,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:26:36,162 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-11-23 11:26:36,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:26:36,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:26:36,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 18 transitions. [2018-11-23 11:26:36,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:26:36,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 18 transitions. [2018-11-23 11:26:36,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 18 transitions. [2018-11-23 11:26:36,197 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 11:26:36,197 INFO L225 Difference]: With dead ends: 32 [2018-11-23 11:26:36,197 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 11:26:36,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:26:36,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 11:26:36,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 11:26:36,199 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:26:36,200 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 11:26:36,200 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:26:36,200 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:26:36,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:36,200 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:26:36,200 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:26:36,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:36,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:36,201 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:26:36,201 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:26:36,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:36,201 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:26:36,201 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:26:36,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:36,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:36,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:26:36,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:26:36,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 11:26:36,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 11:26:36,203 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-11-23 11:26:36,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:26:36,203 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:26:36,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:26:36,203 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:26:36,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:36,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 11:26:36,705 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:26:36,706 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:26:36,706 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:26:36,706 INFO L451 ceAbstractionStarter]: At program point glob2ENTRY(lines 14 25) the Hoare annotation is: true [2018-11-23 11:26:36,706 INFO L448 ceAbstractionStarter]: For program point glob2EXIT(lines 14 25) no Hoare annotation was computed. [2018-11-23 11:26:36,706 INFO L444 ceAbstractionStarter]: At program point L20(line 20) the Hoare annotation is: (or (not (= (_ bv4 32) |glob2_#in~pathlim.offset|)) (not (= ~tmp~0.base |glob2_#in~pathlim.base|)) (not (= |glob2_#in~pathbuf.offset| (_ bv0 32))) (not (= (_ bv4 32) ~tmp~0.offset)) (not (= ~tmp~0.base |glob2_#in~pathbuf.base|)) (and (bvsle glob2_~p~0.offset (_ bv4 32)) (= glob2_~pathlim.base ~tmp~0.base) (= ~tmp~0.base glob2_~p~0.base) (= (_ bv4 32) glob2_~pathlim.offset))) [2018-11-23 11:26:36,706 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-11-23 11:26:36,706 INFO L448 ceAbstractionStarter]: For program point L18-2(lines 18 22) no Hoare annotation was computed. [2018-11-23 11:26:36,706 INFO L444 ceAbstractionStarter]: At program point L18-3(lines 18 22) the Hoare annotation is: (or (and (= glob2_~pathlim.base ~tmp~0.base) (= (_ bv4 32) glob2_~pathlim.offset)) (not (= (_ bv4 32) |glob2_#in~pathlim.offset|)) (not (= ~tmp~0.base |glob2_#in~pathlim.base|)) (not (= |glob2_#in~pathbuf.offset| (_ bv0 32))) (not (= (_ bv4 32) ~tmp~0.offset)) (not (= ~tmp~0.base |glob2_#in~pathbuf.base|))) [2018-11-23 11:26:36,707 INFO L448 ceAbstractionStarter]: For program point L18-4(lines 18 22) no Hoare annotation was computed. [2018-11-23 11:26:36,707 INFO L448 ceAbstractionStarter]: For program point glob2FINAL(lines 14 25) no Hoare annotation was computed. [2018-11-23 11:26:36,707 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:26:36,707 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 11:26:36,707 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:26:36,707 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:26:36,707 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 27 38) the Hoare annotation is: true [2018-11-23 11:26:36,708 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 27 38) no Hoare annotation was computed. [2018-11-23 11:26:36,708 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 27 38) no Hoare annotation was computed. [2018-11-23 11:26:36,708 INFO L444 ceAbstractionStarter]: At program point L35(line 35) the Hoare annotation is: (and (= (_ bv0 32) |main_~#pathbuf~0.offset|) (= (bvadd |main_~#pathbuf~0.offset| (_ bv4 32)) ~tmp~0.offset) (= ~tmp~0.base |main_~#pathbuf~0.base|) (= (_ bv4 32) main_~bound~0.offset) (= ~tmp~0.base main_~bound~0.base)) [2018-11-23 11:26:36,708 INFO L448 ceAbstractionStarter]: For program point L35-1(line 35) no Hoare annotation was computed. [2018-11-23 11:26:36,708 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-23 11:26:36,708 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-23 11:26:36,709 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-23 11:26:36,709 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-23 11:26:36,709 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-23 11:26:36,709 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-23 11:26:36,711 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:26:36,715 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:26:36,715 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:26:36,715 WARN L170 areAnnotationChecker]: L18-4 has no Hoare annotation [2018-11-23 11:26:36,715 WARN L170 areAnnotationChecker]: L18-4 has no Hoare annotation [2018-11-23 11:26:36,717 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:26:36,717 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2018-11-23 11:26:36,717 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:26:36,717 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:26:36,717 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:26:36,717 WARN L170 areAnnotationChecker]: L18-4 has no Hoare annotation [2018-11-23 11:26:36,717 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2018-11-23 11:26:36,718 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:26:36,718 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2018-11-23 11:26:36,718 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:26:36,719 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:26:36,719 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 11:26:36,719 WARN L170 areAnnotationChecker]: glob2FINAL has no Hoare annotation [2018-11-23 11:26:36,719 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2018-11-23 11:26:36,720 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:26:36,720 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:26:36,720 WARN L170 areAnnotationChecker]: glob2EXIT has no Hoare annotation [2018-11-23 11:26:36,720 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2018-11-23 11:26:36,720 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:26:36,720 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 11:26:36,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:26:36 BoogieIcfgContainer [2018-11-23 11:26:36,734 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:26:36,734 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:26:36,734 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:26:36,735 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:26:36,735 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:26:28" (3/4) ... [2018-11-23 11:26:36,739 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 11:26:36,746 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 11:26:36,747 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure glob2 [2018-11-23 11:26:36,747 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 11:26:36,747 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 11:26:36,752 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2018-11-23 11:26:36,752 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-23 11:26:36,752 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 11:26:36,799 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loops/veris.c_NetBSD-libc__loop_true-unreach-call_true-termination.i-witness.graphml [2018-11-23 11:26:36,799 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:26:36,801 INFO L168 Benchmark]: Toolchain (without parser) took 9256.08 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 721.4 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -171.1 MB). Peak memory consumption was 550.3 MB. Max. memory is 7.1 GB. [2018-11-23 11:26:36,803 INFO L168 Benchmark]: CDTParser took 0.23 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 11:26:36,803 INFO L168 Benchmark]: CACSL2BoogieTranslator took 368.16 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 11:26:36,804 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.88 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 11:26:36,804 INFO L168 Benchmark]: Boogie Preprocessor took 40.59 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 11:26:36,805 INFO L168 Benchmark]: RCFGBuilder took 651.18 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 721.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -744.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. [2018-11-23 11:26:36,806 INFO L168 Benchmark]: TraceAbstraction took 8090.10 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 562.4 MB). Peak memory consumption was 562.4 MB. Max. memory is 7.1 GB. [2018-11-23 11:26:36,807 INFO L168 Benchmark]: Witness Printer took 64.91 ms. Allocated memory is still 2.3 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:26:36,811 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.23 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 368.16 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 35.88 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 40.59 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 651.18 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 721.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -744.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8090.10 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 562.4 MB). Peak memory consumption was 562.4 MB. Max. memory is 7.1 GB. * Witness Printer took 64.91 ms. Allocated memory is still 2.3 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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: 18]: Loop Invariant Derived loop invariant: (((((pathlim == tmp && 4bv32 == pathlim) || !(4bv32 == pathlim)) || !(tmp == pathlim)) || !(pathbuf == 0bv32)) || !(4bv32 == tmp)) || !(tmp == pathbuf) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 26 locations, 1 error locations. SAFE Result, 8.0s OverallTime, 3 OverallIterations, 3 TraceHistogramMax, 3.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 38 SDtfs, 48 SDslu, 198 SDs, 0 SdLazy, 253 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=2, 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.2s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 12 PreInvPairs, 18 NumberOfFragments, 90 HoareAnnotationTreeSize, 12 FomulaSimplifications, 128 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 102 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 92 NumberOfCodeBlocks, 60 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 16328 SizeOfPredicates, 32 NumberOfNonLiveVariables, 252 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 22/40 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...