/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops/veris.c_NetBSD-libc_loop.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 03:36:02,266 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 03:36:02,269 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 03:36:02,303 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 03:36:02,304 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 03:36:02,305 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 03:36:02,306 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 03:36:02,307 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 03:36:02,308 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 03:36:02,309 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 03:36:02,310 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 03:36:02,311 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 03:36:02,311 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 03:36:02,312 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 03:36:02,313 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 03:36:02,313 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 03:36:02,314 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 03:36:02,315 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 03:36:02,316 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 03:36:02,317 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 03:36:02,318 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 03:36:02,319 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 03:36:02,320 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 03:36:02,321 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 03:36:02,322 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 03:36:02,324 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 03:36:02,324 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 03:36:02,324 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 03:36:02,325 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 03:36:02,325 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 03:36:02,326 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 03:36:02,326 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 03:36:02,327 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 03:36:02,328 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 03:36:02,328 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 03:36:02,329 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 03:36:02,329 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 03:36:02,330 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 03:36:02,330 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 03:36:02,330 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 03:36:02,331 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 03:36:02,335 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 03:36:02,336 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 03:36:02,343 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 03:36:02,343 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 03:36:02,344 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 03:36:02,344 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 03:36:02,344 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 03:36:02,345 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 03:36:02,345 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 03:36:02,345 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 03:36:02,345 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 03:36:02,345 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 03:36:02,345 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 03:36:02,345 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 03:36:02,345 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 03:36:02,345 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 03:36:02,346 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 03:36:02,346 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 03:36:02,346 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 03:36:02,346 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 03:36:02,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:36:02,346 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 03:36:02,346 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 03:36:02,346 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 03:36:02,346 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 03:36:02,346 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 03:36:02,346 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 03:36:02,346 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 03:36:02,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 03:36:02,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 03:36:02,579 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 03:36:02,580 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 03:36:02,581 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 03:36:02,582 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/veris.c_NetBSD-libc_loop.i [2022-04-08 03:36:02,639 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93903c1df/7867bc68c6a6414885f0a1a87ec6a5c7/FLAG517b2a1df [2022-04-08 03:36:03,014 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 03:36:03,014 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/veris.c_NetBSD-libc_loop.i [2022-04-08 03:36:03,019 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93903c1df/7867bc68c6a6414885f0a1a87ec6a5c7/FLAG517b2a1df [2022-04-08 03:36:03,033 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93903c1df/7867bc68c6a6414885f0a1a87ec6a5c7 [2022-04-08 03:36:03,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 03:36:03,037 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 03:36:03,042 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 03:36:03,043 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 03:36:03,045 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 03:36:03,046 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:36:03" (1/1) ... [2022-04-08 03:36:03,047 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@714f127b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:36:03, skipping insertion in model container [2022-04-08 03:36:03,047 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:36:03" (1/1) ... [2022-04-08 03:36:03,053 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 03:36:03,066 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 03:36:03,275 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/veris.c_NetBSD-libc_loop.i[825,838] [2022-04-08 03:36:03,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:36:03,311 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 03:36:03,323 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/veris.c_NetBSD-libc_loop.i[825,838] [2022-04-08 03:36:03,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:36:03,348 INFO L208 MainTranslator]: Completed translation [2022-04-08 03:36:03,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:36:03 WrapperNode [2022-04-08 03:36:03,349 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 03:36:03,351 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 03:36:03,351 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 03:36:03,351 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 03:36:03,361 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:36:03" (1/1) ... [2022-04-08 03:36:03,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:36:03" (1/1) ... [2022-04-08 03:36:03,371 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:36:03" (1/1) ... [2022-04-08 03:36:03,372 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:36:03" (1/1) ... [2022-04-08 03:36:03,385 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:36:03" (1/1) ... [2022-04-08 03:36:03,388 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:36:03" (1/1) ... [2022-04-08 03:36:03,389 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:36:03" (1/1) ... [2022-04-08 03:36:03,391 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 03:36:03,392 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 03:36:03,392 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 03:36:03,392 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 03:36:03,393 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:36:03" (1/1) ... [2022-04-08 03:36:03,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:36:03,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:36:03,429 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 03:36:03,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 03:36:03,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 03:36:03,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 03:36:03,475 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 03:36:03,475 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 03:36:03,475 INFO L138 BoogieDeclarations]: Found implementation of procedure glob2 [2022-04-08 03:36:03,475 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 03:36:03,475 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 03:36:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 03:36:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 03:36:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 03:36:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 03:36:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 03:36:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 03:36:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure glob2 [2022-04-08 03:36:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 03:36:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 03:36:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-08 03:36:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 03:36:03,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 03:36:03,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 03:36:03,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 03:36:03,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 03:36:03,543 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 03:36:03,545 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 03:36:03,652 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 03:36:03,658 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 03:36:03,658 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 03:36:03,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:36:03 BoogieIcfgContainer [2022-04-08 03:36:03,660 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 03:36:03,661 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 03:36:03,661 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 03:36:03,664 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 03:36:03,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 03:36:03" (1/3) ... [2022-04-08 03:36:03,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fcf151c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:36:03, skipping insertion in model container [2022-04-08 03:36:03,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:36:03" (2/3) ... [2022-04-08 03:36:03,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fcf151c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:36:03, skipping insertion in model container [2022-04-08 03:36:03,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:36:03" (3/3) ... [2022-04-08 03:36:03,667 INFO L111 eAbstractionObserver]: Analyzing ICFG veris.c_NetBSD-libc_loop.i [2022-04-08 03:36:03,671 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 03:36:03,671 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 03:36:03,708 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 03:36:03,713 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 03:36:03,714 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 03:36:03,742 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 03:36:03,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-08 03:36:03,758 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:36:03,759 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:36:03,759 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:36:03,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:36:03,764 INFO L85 PathProgramCache]: Analyzing trace with hash 49640583, now seen corresponding path program 1 times [2022-04-08 03:36:03,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:36:03,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [352870375] [2022-04-08 03:36:03,788 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:36:03,789 INFO L85 PathProgramCache]: Analyzing trace with hash 49640583, now seen corresponding path program 2 times [2022-04-08 03:36:03,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:36:03,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038723285] [2022-04-08 03:36:03,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:36:03,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:36:03,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:36:04,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:36:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:36:04,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);~tmp~0.base, ~tmp~0.offset := 0, 0; {29#true} is VALID [2022-04-08 03:36:04,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-08 03:36:04,118 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #50#return; {29#true} is VALID [2022-04-08 03:36:04,120 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {39#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:36:04,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);~tmp~0.base, ~tmp~0.offset := 0, 0; {29#true} is VALID [2022-04-08 03:36:04,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-08 03:36:04,121 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #50#return; {29#true} is VALID [2022-04-08 03:36:04,121 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret3 := main(); {29#true} is VALID [2022-04-08 03:36:04,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#true} call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.allocOnStack(8);~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4;~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4; {34#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset))} is VALID [2022-04-08 03:36:04,125 INFO L272 TraceCheckUtils]: 6: Hoare triple {34#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset))} call #t~ret2 := glob2(~#pathbuf~0.base, ~#pathbuf~0.offset, ~bound~0.base, ~bound~0.offset); {35#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset))} is VALID [2022-04-08 03:36:04,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset))} ~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; {36#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-08 03:36:04,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {36#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-08 03:36:04,129 INFO L272 TraceCheckUtils]: 9: Hoare triple {36#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {37#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:36:04,130 INFO L290 TraceCheckUtils]: 10: Hoare triple {37#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {38#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:36:04,130 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {30#false} is VALID [2022-04-08 03:36:04,131 INFO L290 TraceCheckUtils]: 12: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-04-08 03:36:04,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:36:04,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:36:04,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038723285] [2022-04-08 03:36:04,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038723285] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:36:04,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:36:04,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 03:36:04,135 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:36:04,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [352870375] [2022-04-08 03:36:04,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [352870375] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:36:04,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:36:04,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 03:36:04,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335860665] [2022-04-08 03:36:04,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:36:04,143 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-08 03:36:04,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:36:04,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:36:04,166 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:36:04,166 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 03:36:04,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:36:04,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 03:36:04,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-08 03:36:04,196 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:36:04,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:36:04,921 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2022-04-08 03:36:04,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 03:36:04,928 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-08 03:36:04,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:36:04,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:36:04,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-04-08 03:36:04,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:36:04,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-04-08 03:36:04,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 64 transitions. [2022-04-08 03:36:05,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:36:05,039 INFO L225 Difference]: With dead ends: 55 [2022-04-08 03:36:05,040 INFO L226 Difference]: Without dead ends: 26 [2022-04-08 03:36:05,042 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-04-08 03:36:05,046 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 42 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 03:36:05,047 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 57 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 03:36:05,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-08 03:36:05,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2022-04-08 03:36:05,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:36:05,097 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:36:05,098 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:36:05,098 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:36:05,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:36:05,101 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-08 03:36:05,101 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-08 03:36:05,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:36:05,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:36:05,102 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-08 03:36:05,103 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-08 03:36:05,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:36:05,105 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-08 03:36:05,105 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-08 03:36:05,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:36:05,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:36:05,106 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:36:05,106 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:36:05,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:36:05,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-04-08 03:36:05,110 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 13 [2022-04-08 03:36:05,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:36:05,111 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-04-08 03:36:05,111 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:36:05,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 24 transitions. [2022-04-08 03:36:05,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:36:05,141 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-08 03:36:05,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 03:36:05,142 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:36:05,142 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:36:05,143 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 03:36:05,143 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:36:05,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:36:05,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1781648093, now seen corresponding path program 1 times [2022-04-08 03:36:05,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:36:05,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1597239642] [2022-04-08 03:36:05,320 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:36:05,320 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:36:05,321 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:36:05,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1781648093, now seen corresponding path program 2 times [2022-04-08 03:36:05,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:36:05,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777677194] [2022-04-08 03:36:05,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:36:05,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:36:05,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:36:05,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:36:05,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:36:05,464 INFO L290 TraceCheckUtils]: 0: Hoare triple {277#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);~tmp~0.base, ~tmp~0.offset := 0, 0; {262#true} is VALID [2022-04-08 03:36:05,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-08 03:36:05,464 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {262#true} {262#true} #50#return; {262#true} is VALID [2022-04-08 03:36:05,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-08 03:36:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:36:05,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {262#true} ~cond := #in~cond; {262#true} is VALID [2022-04-08 03:36:05,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} assume !(0 == ~cond); {262#true} is VALID [2022-04-08 03:36:05,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-08 03:36:05,475 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {262#true} {269#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #46#return; {269#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-08 03:36:05,476 INFO L272 TraceCheckUtils]: 0: Hoare triple {262#true} call ULTIMATE.init(); {277#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:36:05,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {277#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);~tmp~0.base, ~tmp~0.offset := 0, 0; {262#true} is VALID [2022-04-08 03:36:05,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-08 03:36:05,477 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {262#true} {262#true} #50#return; {262#true} is VALID [2022-04-08 03:36:05,477 INFO L272 TraceCheckUtils]: 4: Hoare triple {262#true} call #t~ret3 := main(); {262#true} is VALID [2022-04-08 03:36:05,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {262#true} call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.allocOnStack(8);~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4;~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4; {267#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset))} is VALID [2022-04-08 03:36:05,479 INFO L272 TraceCheckUtils]: 6: Hoare triple {267#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset))} call #t~ret2 := glob2(~#pathbuf~0.base, ~#pathbuf~0.offset, ~bound~0.base, ~bound~0.offset); {268#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset))} is VALID [2022-04-08 03:36:05,480 INFO L290 TraceCheckUtils]: 7: Hoare triple {268#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset))} ~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; {269#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-08 03:36:05,481 INFO L290 TraceCheckUtils]: 8: Hoare triple {269#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {269#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-08 03:36:05,481 INFO L272 TraceCheckUtils]: 9: Hoare triple {269#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {262#true} is VALID [2022-04-08 03:36:05,481 INFO L290 TraceCheckUtils]: 10: Hoare triple {262#true} ~cond := #in~cond; {262#true} is VALID [2022-04-08 03:36:05,482 INFO L290 TraceCheckUtils]: 11: Hoare triple {262#true} assume !(0 == ~cond); {262#true} is VALID [2022-04-08 03:36:05,482 INFO L290 TraceCheckUtils]: 12: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-08 03:36:05,483 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {262#true} {269#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #46#return; {269#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-08 03:36:05,483 INFO L290 TraceCheckUtils]: 14: Hoare triple {269#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call write~int(1, ~p~0.base, ~p~0.offset, 4); {269#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-08 03:36:05,484 INFO L290 TraceCheckUtils]: 15: Hoare triple {269#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #t~post1.base, #t~post1.offset := ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := #t~post1.base, 4 + #t~post1.offset;havoc #t~post1.base, #t~post1.offset; {274#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} is VALID [2022-04-08 03:36:05,485 INFO L290 TraceCheckUtils]: 16: Hoare triple {274#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {274#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} is VALID [2022-04-08 03:36:05,486 INFO L272 TraceCheckUtils]: 17: Hoare triple {274#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {275#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:36:05,486 INFO L290 TraceCheckUtils]: 18: Hoare triple {275#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {276#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:36:05,487 INFO L290 TraceCheckUtils]: 19: Hoare triple {276#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {263#false} is VALID [2022-04-08 03:36:05,487 INFO L290 TraceCheckUtils]: 20: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-04-08 03:36:05,488 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:36:05,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:36:05,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777677194] [2022-04-08 03:36:05,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777677194] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:36:05,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541466864] [2022-04-08 03:36:05,489 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:36:05,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:36:05,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:36:05,495 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:36:05,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 03:36:05,561 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 03:36:05,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:36:05,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-08 03:36:05,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:36:05,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:36:05,957 INFO L272 TraceCheckUtils]: 0: Hoare triple {262#true} call ULTIMATE.init(); {262#true} is VALID [2022-04-08 03:36:05,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);~tmp~0.base, ~tmp~0.offset := 0, 0; {262#true} is VALID [2022-04-08 03:36:05,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-08 03:36:05,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {262#true} {262#true} #50#return; {262#true} is VALID [2022-04-08 03:36:05,964 INFO L272 TraceCheckUtils]: 4: Hoare triple {262#true} call #t~ret3 := main(); {262#true} is VALID [2022-04-08 03:36:05,965 INFO L290 TraceCheckUtils]: 5: Hoare triple {262#true} call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.allocOnStack(8);~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4;~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4; {296#(and (<= main_~bound~0.offset ~tmp~0.offset) (= ~tmp~0.base main_~bound~0.base))} is VALID [2022-04-08 03:36:05,967 INFO L272 TraceCheckUtils]: 6: Hoare triple {296#(and (<= main_~bound~0.offset ~tmp~0.offset) (= ~tmp~0.base main_~bound~0.base))} call #t~ret2 := glob2(~#pathbuf~0.base, ~#pathbuf~0.offset, ~bound~0.base, ~bound~0.offset); {300#(and (= ~tmp~0.base |glob2_#in~pathlim.base|) (<= |glob2_#in~pathlim.offset| ~tmp~0.offset))} is VALID [2022-04-08 03:36:05,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {300#(and (= ~tmp~0.base |glob2_#in~pathlim.base|) (<= |glob2_#in~pathlim.offset| ~tmp~0.offset))} ~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; {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-08 03:36:05,970 INFO L290 TraceCheckUtils]: 8: Hoare triple {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-08 03:36:05,971 INFO L272 TraceCheckUtils]: 9: Hoare triple {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {262#true} is VALID [2022-04-08 03:36:05,971 INFO L290 TraceCheckUtils]: 10: Hoare triple {262#true} ~cond := #in~cond; {262#true} is VALID [2022-04-08 03:36:05,971 INFO L290 TraceCheckUtils]: 11: Hoare triple {262#true} assume !(0 == ~cond); {262#true} is VALID [2022-04-08 03:36:05,971 INFO L290 TraceCheckUtils]: 12: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-08 03:36:05,972 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {262#true} {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} #46#return; {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-08 03:36:05,973 INFO L290 TraceCheckUtils]: 14: Hoare triple {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} call write~int(1, ~p~0.base, ~p~0.offset, 4); {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-08 03:36:05,973 INFO L290 TraceCheckUtils]: 15: Hoare triple {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} #t~post1.base, #t~post1.offset := ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := #t~post1.base, 4 + #t~post1.offset;havoc #t~post1.base, #t~post1.offset; {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-08 03:36:05,974 INFO L290 TraceCheckUtils]: 16: Hoare triple {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {274#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} is VALID [2022-04-08 03:36:05,975 INFO L272 TraceCheckUtils]: 17: Hoare triple {274#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {335#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:36:05,975 INFO L290 TraceCheckUtils]: 18: Hoare triple {335#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {339#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:36:05,976 INFO L290 TraceCheckUtils]: 19: Hoare triple {339#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {263#false} is VALID [2022-04-08 03:36:05,976 INFO L290 TraceCheckUtils]: 20: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-04-08 03:36:05,976 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 03:36:05,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:36:06,402 INFO L290 TraceCheckUtils]: 20: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-04-08 03:36:06,403 INFO L290 TraceCheckUtils]: 19: Hoare triple {339#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {263#false} is VALID [2022-04-08 03:36:06,403 INFO L290 TraceCheckUtils]: 18: Hoare triple {335#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {339#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:36:06,404 INFO L272 TraceCheckUtils]: 17: Hoare triple {274#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {335#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:36:06,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {274#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} is VALID [2022-04-08 03:36:06,406 INFO L290 TraceCheckUtils]: 15: Hoare triple {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} #t~post1.base, #t~post1.offset := ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := #t~post1.base, 4 + #t~post1.offset;havoc #t~post1.base, #t~post1.offset; {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-08 03:36:06,406 INFO L290 TraceCheckUtils]: 14: Hoare triple {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} call write~int(1, ~p~0.base, ~p~0.offset, 4); {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-08 03:36:06,407 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {262#true} {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} #46#return; {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-08 03:36:06,407 INFO L290 TraceCheckUtils]: 12: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-08 03:36:06,408 INFO L290 TraceCheckUtils]: 11: Hoare triple {262#true} assume !(0 == ~cond); {262#true} is VALID [2022-04-08 03:36:06,408 INFO L290 TraceCheckUtils]: 10: Hoare triple {262#true} ~cond := #in~cond; {262#true} is VALID [2022-04-08 03:36:06,408 INFO L272 TraceCheckUtils]: 9: Hoare triple {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {262#true} is VALID [2022-04-08 03:36:06,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-08 03:36:06,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {300#(and (= ~tmp~0.base |glob2_#in~pathlim.base|) (<= |glob2_#in~pathlim.offset| ~tmp~0.offset))} ~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; {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-08 03:36:06,410 INFO L272 TraceCheckUtils]: 6: Hoare triple {296#(and (<= main_~bound~0.offset ~tmp~0.offset) (= ~tmp~0.base main_~bound~0.base))} call #t~ret2 := glob2(~#pathbuf~0.base, ~#pathbuf~0.offset, ~bound~0.base, ~bound~0.offset); {300#(and (= ~tmp~0.base |glob2_#in~pathlim.base|) (<= |glob2_#in~pathlim.offset| ~tmp~0.offset))} is VALID [2022-04-08 03:36:06,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {262#true} call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.allocOnStack(8);~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4;~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4; {296#(and (<= main_~bound~0.offset ~tmp~0.offset) (= ~tmp~0.base main_~bound~0.base))} is VALID [2022-04-08 03:36:06,411 INFO L272 TraceCheckUtils]: 4: Hoare triple {262#true} call #t~ret3 := main(); {262#true} is VALID [2022-04-08 03:36:06,412 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {262#true} {262#true} #50#return; {262#true} is VALID [2022-04-08 03:36:06,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-08 03:36:06,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);~tmp~0.base, ~tmp~0.offset := 0, 0; {262#true} is VALID [2022-04-08 03:36:06,412 INFO L272 TraceCheckUtils]: 0: Hoare triple {262#true} call ULTIMATE.init(); {262#true} is VALID [2022-04-08 03:36:06,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 03:36:06,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541466864] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:36:06,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:36:06,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 14 [2022-04-08 03:36:06,414 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:36:06,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1597239642] [2022-04-08 03:36:06,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1597239642] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:36:06,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:36:06,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 03:36:06,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653639089] [2022-04-08 03:36:06,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:36:06,415 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-08 03:36:06,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:36:06,416 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:36:06,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:36:06,435 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 03:36:06,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:36:06,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 03:36:06,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-04-08 03:36:06,436 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:36:06,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:36:06,866 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-08 03:36:06,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 03:36:06,867 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-08 03:36:06,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:36:06,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:36:06,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 33 transitions. [2022-04-08 03:36:06,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:36:06,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 33 transitions. [2022-04-08 03:36:06,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 33 transitions. [2022-04-08 03:36:06,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:36:06,917 INFO L225 Difference]: With dead ends: 36 [2022-04-08 03:36:06,917 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 03:36:06,918 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2022-04-08 03:36:06,920 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 32 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:36:06,924 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 39 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:36:06,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 03:36:06,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-08 03:36:06,947 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:36:06,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 03:36:06,950 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 03:36:06,951 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 03:36:06,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:36:06,956 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-08 03:36:06,956 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-08 03:36:06,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:36:06,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:36:06,957 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-08 03:36:06,958 INFO L87 Difference]: Start difference. First operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-08 03:36:06,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:36:06,963 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-08 03:36:06,964 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-08 03:36:06,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:36:06,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:36:06,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:36:06,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:36:06,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 03:36:06,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2022-04-08 03:36:06,968 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 21 [2022-04-08 03:36:06,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:36:06,969 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2022-04-08 03:36:06,969 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:36:06,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 32 transitions. [2022-04-08 03:36:07,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:36:07,015 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-08 03:36:07,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 03:36:07,017 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:36:07,017 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:36:07,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 03:36:07,235 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:36:07,236 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:36:07,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:36:07,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1581946061, now seen corresponding path program 3 times [2022-04-08 03:36:07,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:36:07,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2139399804] [2022-04-08 03:36:07,311 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:36:07,311 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:36:07,312 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:36:07,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1581946061, now seen corresponding path program 4 times [2022-04-08 03:36:07,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:36:07,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747609831] [2022-04-08 03:36:07,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:36:07,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:36:07,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:36:07,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:36:07,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:36:07,484 INFO L290 TraceCheckUtils]: 0: Hoare triple {644#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);~tmp~0.base, ~tmp~0.offset := 0, 0; {625#true} is VALID [2022-04-08 03:36:07,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {625#true} assume true; {625#true} is VALID [2022-04-08 03:36:07,485 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {625#true} {625#true} #50#return; {625#true} is VALID [2022-04-08 03:36:07,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-08 03:36:07,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:36:07,493 INFO L290 TraceCheckUtils]: 0: Hoare triple {625#true} ~cond := #in~cond; {625#true} is VALID [2022-04-08 03:36:07,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {625#true} assume !(0 == ~cond); {625#true} is VALID [2022-04-08 03:36:07,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {625#true} assume true; {625#true} is VALID [2022-04-08 03:36:07,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {625#true} {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #46#return; {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-08 03:36:07,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-08 03:36:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:36:07,504 INFO L290 TraceCheckUtils]: 0: Hoare triple {625#true} ~cond := #in~cond; {625#true} is VALID [2022-04-08 03:36:07,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {625#true} assume !(0 == ~cond); {625#true} is VALID [2022-04-08 03:36:07,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {625#true} assume true; {625#true} is VALID [2022-04-08 03:36:07,505 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {625#true} {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #46#return; {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-08 03:36:07,506 INFO L272 TraceCheckUtils]: 0: Hoare triple {625#true} call ULTIMATE.init(); {644#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:36:07,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {644#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);~tmp~0.base, ~tmp~0.offset := 0, 0; {625#true} is VALID [2022-04-08 03:36:07,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {625#true} assume true; {625#true} is VALID [2022-04-08 03:36:07,506 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {625#true} {625#true} #50#return; {625#true} is VALID [2022-04-08 03:36:07,507 INFO L272 TraceCheckUtils]: 4: Hoare triple {625#true} call #t~ret3 := main(); {625#true} is VALID [2022-04-08 03:36:07,508 INFO L290 TraceCheckUtils]: 5: Hoare triple {625#true} call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.allocOnStack(8);~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4;~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4; {630#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= main_~bound~0.offset ~tmp~0.offset))} is VALID [2022-04-08 03:36:07,509 INFO L272 TraceCheckUtils]: 6: Hoare triple {630#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= main_~bound~0.offset ~tmp~0.offset))} call #t~ret2 := glob2(~#pathbuf~0.base, ~#pathbuf~0.offset, ~bound~0.base, ~bound~0.offset); {631#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= |glob2_#in~pathlim.offset| ~tmp~0.offset))} is VALID [2022-04-08 03:36:07,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {631#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= |glob2_#in~pathlim.offset| ~tmp~0.offset))} ~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; {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-08 03:36:07,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-08 03:36:07,511 INFO L272 TraceCheckUtils]: 9: Hoare triple {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {625#true} is VALID [2022-04-08 03:36:07,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {625#true} ~cond := #in~cond; {625#true} is VALID [2022-04-08 03:36:07,511 INFO L290 TraceCheckUtils]: 11: Hoare triple {625#true} assume !(0 == ~cond); {625#true} is VALID [2022-04-08 03:36:07,511 INFO L290 TraceCheckUtils]: 12: Hoare triple {625#true} assume true; {625#true} is VALID [2022-04-08 03:36:07,512 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {625#true} {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #46#return; {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-08 03:36:07,514 INFO L290 TraceCheckUtils]: 14: Hoare triple {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call write~int(1, ~p~0.base, ~p~0.offset, 4); {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-08 03:36:07,514 INFO L290 TraceCheckUtils]: 15: Hoare triple {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #t~post1.base, #t~post1.offset := ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := #t~post1.base, 4 + #t~post1.offset;havoc #t~post1.base, #t~post1.offset; {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-08 03:36:07,515 INFO L290 TraceCheckUtils]: 16: Hoare triple {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-08 03:36:07,516 INFO L272 TraceCheckUtils]: 17: Hoare triple {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {625#true} is VALID [2022-04-08 03:36:07,517 INFO L290 TraceCheckUtils]: 18: Hoare triple {625#true} ~cond := #in~cond; {625#true} is VALID [2022-04-08 03:36:07,523 INFO L290 TraceCheckUtils]: 19: Hoare triple {625#true} assume !(0 == ~cond); {625#true} is VALID [2022-04-08 03:36:07,524 INFO L290 TraceCheckUtils]: 20: Hoare triple {625#true} assume true; {625#true} is VALID [2022-04-08 03:36:07,525 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {625#true} {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #46#return; {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-08 03:36:07,525 INFO L290 TraceCheckUtils]: 22: Hoare triple {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call write~int(1, ~p~0.base, ~p~0.offset, 4); {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-08 03:36:07,526 INFO L290 TraceCheckUtils]: 23: Hoare triple {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #t~post1.base, #t~post1.offset := ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := #t~post1.base, 4 + #t~post1.offset;havoc #t~post1.base, #t~post1.offset; {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-08 03:36:07,528 INFO L290 TraceCheckUtils]: 24: Hoare triple {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {641#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} is VALID [2022-04-08 03:36:07,529 INFO L272 TraceCheckUtils]: 25: Hoare triple {641#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {642#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:36:07,533 INFO L290 TraceCheckUtils]: 26: Hoare triple {642#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {643#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:36:07,533 INFO L290 TraceCheckUtils]: 27: Hoare triple {643#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {626#false} is VALID [2022-04-08 03:36:07,534 INFO L290 TraceCheckUtils]: 28: Hoare triple {626#false} assume !false; {626#false} is VALID [2022-04-08 03:36:07,534 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 03:36:07,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:36:07,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747609831] [2022-04-08 03:36:07,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747609831] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:36:07,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518540617] [2022-04-08 03:36:07,535 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 03:36:07,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:36:07,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:36:07,538 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:36:07,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 03:36:07,592 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 03:36:07,593 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:36:07,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 03:36:07,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:36:07,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:36:07,823 INFO L272 TraceCheckUtils]: 0: Hoare triple {625#true} call ULTIMATE.init(); {625#true} is VALID [2022-04-08 03:36:07,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {625#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);~tmp~0.base, ~tmp~0.offset := 0, 0; {625#true} is VALID [2022-04-08 03:36:07,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {625#true} assume true; {625#true} is VALID [2022-04-08 03:36:07,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {625#true} {625#true} #50#return; {625#true} is VALID [2022-04-08 03:36:07,824 INFO L272 TraceCheckUtils]: 4: Hoare triple {625#true} call #t~ret3 := main(); {625#true} is VALID [2022-04-08 03:36:07,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {625#true} call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.allocOnStack(8);~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4;~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4; {663#(<= main_~bound~0.offset (+ 4 |main_~#pathbuf~0.offset|))} is VALID [2022-04-08 03:36:07,826 INFO L272 TraceCheckUtils]: 6: Hoare triple {663#(<= main_~bound~0.offset (+ 4 |main_~#pathbuf~0.offset|))} call #t~ret2 := glob2(~#pathbuf~0.base, ~#pathbuf~0.offset, ~bound~0.base, ~bound~0.offset); {667#(<= |glob2_#in~pathlim.offset| (+ |glob2_#in~pathbuf.offset| 4))} is VALID [2022-04-08 03:36:07,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {667#(<= |glob2_#in~pathlim.offset| (+ |glob2_#in~pathbuf.offset| 4))} ~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; {671#(<= glob2_~pathlim.offset (+ 4 glob2_~p~0.offset))} is VALID [2022-04-08 03:36:07,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {671#(<= glob2_~pathlim.offset (+ 4 glob2_~p~0.offset))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {671#(<= glob2_~pathlim.offset (+ 4 glob2_~p~0.offset))} is VALID [2022-04-08 03:36:07,828 INFO L272 TraceCheckUtils]: 9: Hoare triple {671#(<= glob2_~pathlim.offset (+ 4 glob2_~p~0.offset))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {625#true} is VALID [2022-04-08 03:36:07,828 INFO L290 TraceCheckUtils]: 10: Hoare triple {625#true} ~cond := #in~cond; {625#true} is VALID [2022-04-08 03:36:07,828 INFO L290 TraceCheckUtils]: 11: Hoare triple {625#true} assume !(0 == ~cond); {625#true} is VALID [2022-04-08 03:36:07,828 INFO L290 TraceCheckUtils]: 12: Hoare triple {625#true} assume true; {625#true} is VALID [2022-04-08 03:36:07,829 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {625#true} {671#(<= glob2_~pathlim.offset (+ 4 glob2_~p~0.offset))} #46#return; {671#(<= glob2_~pathlim.offset (+ 4 glob2_~p~0.offset))} is VALID [2022-04-08 03:36:07,829 INFO L290 TraceCheckUtils]: 14: Hoare triple {671#(<= glob2_~pathlim.offset (+ 4 glob2_~p~0.offset))} call write~int(1, ~p~0.base, ~p~0.offset, 4); {671#(<= glob2_~pathlim.offset (+ 4 glob2_~p~0.offset))} is VALID [2022-04-08 03:36:07,830 INFO L290 TraceCheckUtils]: 15: Hoare triple {671#(<= glob2_~pathlim.offset (+ 4 glob2_~p~0.offset))} #t~post1.base, #t~post1.offset := ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := #t~post1.base, 4 + #t~post1.offset;havoc #t~post1.base, #t~post1.offset; {696#(<= glob2_~pathlim.offset glob2_~p~0.offset)} is VALID [2022-04-08 03:36:07,830 INFO L290 TraceCheckUtils]: 16: Hoare triple {696#(<= glob2_~pathlim.offset glob2_~p~0.offset)} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {696#(<= glob2_~pathlim.offset glob2_~p~0.offset)} is VALID [2022-04-08 03:36:07,830 INFO L272 TraceCheckUtils]: 17: Hoare triple {696#(<= glob2_~pathlim.offset glob2_~p~0.offset)} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {625#true} is VALID [2022-04-08 03:36:07,830 INFO L290 TraceCheckUtils]: 18: Hoare triple {625#true} ~cond := #in~cond; {625#true} is VALID [2022-04-08 03:36:07,830 INFO L290 TraceCheckUtils]: 19: Hoare triple {625#true} assume !(0 == ~cond); {625#true} is VALID [2022-04-08 03:36:07,831 INFO L290 TraceCheckUtils]: 20: Hoare triple {625#true} assume true; {625#true} is VALID [2022-04-08 03:36:07,831 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {625#true} {696#(<= glob2_~pathlim.offset glob2_~p~0.offset)} #46#return; {696#(<= glob2_~pathlim.offset glob2_~p~0.offset)} is VALID [2022-04-08 03:36:07,832 INFO L290 TraceCheckUtils]: 22: Hoare triple {696#(<= glob2_~pathlim.offset glob2_~p~0.offset)} call write~int(1, ~p~0.base, ~p~0.offset, 4); {696#(<= glob2_~pathlim.offset glob2_~p~0.offset)} is VALID [2022-04-08 03:36:07,832 INFO L290 TraceCheckUtils]: 23: Hoare triple {696#(<= glob2_~pathlim.offset glob2_~p~0.offset)} #t~post1.base, #t~post1.offset := ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := #t~post1.base, 4 + #t~post1.offset;havoc #t~post1.base, #t~post1.offset; {721#(<= (+ 4 glob2_~pathlim.offset) glob2_~p~0.offset)} is VALID [2022-04-08 03:36:07,833 INFO L290 TraceCheckUtils]: 24: Hoare triple {721#(<= (+ 4 glob2_~pathlim.offset) glob2_~p~0.offset)} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {626#false} is VALID [2022-04-08 03:36:07,833 INFO L272 TraceCheckUtils]: 25: Hoare triple {626#false} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {626#false} is VALID [2022-04-08 03:36:07,833 INFO L290 TraceCheckUtils]: 26: Hoare triple {626#false} ~cond := #in~cond; {626#false} is VALID [2022-04-08 03:36:07,833 INFO L290 TraceCheckUtils]: 27: Hoare triple {626#false} assume 0 == ~cond; {626#false} is VALID [2022-04-08 03:36:07,833 INFO L290 TraceCheckUtils]: 28: Hoare triple {626#false} assume !false; {626#false} is VALID [2022-04-08 03:36:07,834 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 03:36:07,834 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 03:36:07,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518540617] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:36:07,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 03:36:07,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2022-04-08 03:36:07,834 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:36:07,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2139399804] [2022-04-08 03:36:07,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2139399804] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:36:07,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:36:07,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:36:07,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657742798] [2022-04-08 03:36:07,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:36:07,835 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2022-04-08 03:36:07,836 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:36:07,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:36:07,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:36:07,854 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 03:36:07,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:36:07,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 03:36:07,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-04-08 03:36:07,856 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:36:08,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:36:08,029 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-08 03:36:08,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 03:36:08,030 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2022-04-08 03:36:08,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:36:08,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:36:08,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-04-08 03:36:08,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:36:08,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-04-08 03:36:08,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 32 transitions. [2022-04-08 03:36:08,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:36:08,057 INFO L225 Difference]: With dead ends: 35 [2022-04-08 03:36:08,057 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 03:36:08,057 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2022-04-08 03:36:08,058 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 3 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:36:08,059 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 51 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:36:08,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 03:36:08,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 03:36:08,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:36:08,060 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 03:36:08,060 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 03:36:08,060 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 03:36:08,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:36:08,060 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 03:36:08,060 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 03:36:08,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:36:08,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:36:08,060 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 03:36:08,061 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 03:36:08,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:36:08,061 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 03:36:08,061 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 03:36:08,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:36:08,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:36:08,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:36:08,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:36:08,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 03:36:08,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 03:36:08,061 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2022-04-08 03:36:08,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:36:08,062 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 03:36:08,062 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:36:08,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 03:36:08,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:36:08,062 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 03:36:08,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:36:08,064 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 03:36:08,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 03:36:08,290 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-08 03:36:08,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 03:36:08,577 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-08 03:36:08,577 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-08 03:36:08,577 INFO L882 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-08 03:36:08,577 INFO L878 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: (let ((.cse1 (= ~tmp~0.base glob2_~p~0.base)) (.cse2 (+ |glob2_#in~pathbuf.offset| 4))) (or (let ((.cse0 (+ 4 glob2_~p~0.offset))) (and (<= .cse0 ~tmp~0.offset) .cse1 (<= glob2_~pathlim.offset .cse0))) (and (<= glob2_~pathlim.offset glob2_~p~0.offset) .cse1 (<= glob2_~p~0.offset ~tmp~0.offset)) (not (= ~tmp~0.base |glob2_#in~pathbuf.base|)) (not (<= .cse2 ~tmp~0.offset)) (not (<= |glob2_#in~pathlim.offset| .cse2)))) [2022-04-08 03:36:08,577 INFO L885 garLoopResultBuilder]: At program point glob2ENTRY(lines 25 36) the Hoare annotation is: true [2022-04-08 03:36:08,578 INFO L878 garLoopResultBuilder]: At program point L31-1(line 31) the Hoare annotation is: (let ((.cse1 (+ |glob2_#in~pathbuf.offset| 4))) (or (let ((.cse0 (+ 4 glob2_~p~0.offset))) (and (<= .cse0 ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~pathlim.offset .cse0))) (not (= ~tmp~0.base |glob2_#in~pathbuf.base|)) (<= glob2_~pathlim.offset glob2_~p~0.offset) (not (<= .cse1 ~tmp~0.offset)) (not (<= |glob2_#in~pathlim.offset| .cse1)))) [2022-04-08 03:36:08,578 INFO L878 garLoopResultBuilder]: At program point L29-2(lines 29 33) the Hoare annotation is: (let ((.cse1 (+ |glob2_#in~pathbuf.offset| 4))) (or (let ((.cse0 (+ 4 glob2_~p~0.offset))) (and (<= .cse0 ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~pathlim.offset .cse0))) (not (= ~tmp~0.base |glob2_#in~pathbuf.base|)) (<= glob2_~pathlim.offset glob2_~p~0.offset) (not (<= .cse1 ~tmp~0.offset)) (not (<= |glob2_#in~pathlim.offset| .cse1)))) [2022-04-08 03:36:08,578 INFO L878 garLoopResultBuilder]: At program point L29-3(lines 29 33) the Hoare annotation is: (let ((.cse1 (= ~tmp~0.base glob2_~p~0.base)) (.cse2 (+ |glob2_#in~pathbuf.offset| 4))) (or (let ((.cse0 (+ 4 glob2_~p~0.offset))) (and (<= .cse0 ~tmp~0.offset) .cse1 (<= glob2_~pathlim.offset .cse0))) (and (<= glob2_~pathlim.offset glob2_~p~0.offset) .cse1 (<= glob2_~p~0.offset ~tmp~0.offset)) (not (= ~tmp~0.base |glob2_#in~pathbuf.base|)) (not (<= .cse2 ~tmp~0.offset)) (not (<= |glob2_#in~pathlim.offset| .cse2)) (<= (+ 4 glob2_~pathlim.offset) glob2_~p~0.offset))) [2022-04-08 03:36:08,578 INFO L885 garLoopResultBuilder]: At program point L29-4(lines 29 33) the Hoare annotation is: true [2022-04-08 03:36:08,578 INFO L885 garLoopResultBuilder]: At program point glob2EXIT(lines 25 36) the Hoare annotation is: true [2022-04-08 03:36:08,578 INFO L885 garLoopResultBuilder]: At program point glob2FINAL(lines 25 36) the Hoare annotation is: true [2022-04-08 03:36:08,578 INFO L878 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (let ((.cse0 (+ 4 |main_~#pathbuf~0.offset|))) (and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= main_~bound~0.offset .cse0) (<= .cse0 ~tmp~0.offset))) [2022-04-08 03:36:08,578 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 38 49) the Hoare annotation is: (and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base)) [2022-04-08 03:36:08,579 INFO L878 garLoopResultBuilder]: At program point L46-1(line 46) the Hoare annotation is: (and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset)) [2022-04-08 03:36:08,579 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 38 49) the Hoare annotation is: true [2022-04-08 03:36:08,579 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 38 49) the Hoare annotation is: true [2022-04-08 03:36:08,579 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 03:36:08,579 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 03:36:08,579 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 03:36:08,579 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 03:36:08,579 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 03:36:08,579 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 03:36:08,579 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 03:36:08,580 INFO L878 garLoopResultBuilder]: At program point L16(line 16) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 03:36:08,580 INFO L878 garLoopResultBuilder]: At program point L15(lines 15 17) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-08 03:36:08,580 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 19) the Hoare annotation is: true [2022-04-08 03:36:08,580 INFO L878 garLoopResultBuilder]: At program point L15-2(lines 14 19) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-08 03:36:08,580 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 19) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-08 03:36:08,580 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 03:36:08,583 INFO L719 BasicCegarLoop]: Path program histogram: [4, 2] [2022-04-08 03:36:08,584 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 03:36:08,588 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 03:36:08,588 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 03:36:08,590 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-08 03:36:08,603 INFO L163 areAnnotationChecker]: CFG has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 03:36:08,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 03:36:08 BoogieIcfgContainer [2022-04-08 03:36:08,613 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 03:36:08,614 INFO L158 Benchmark]: Toolchain (without parser) took 5577.18ms. Allocated memory was 175.1MB in the beginning and 246.4MB in the end (delta: 71.3MB). Free memory was 119.7MB in the beginning and 114.4MB in the end (delta: 5.3MB). Peak memory consumption was 77.0MB. Max. memory is 8.0GB. [2022-04-08 03:36:08,614 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 175.1MB. Free memory is still 136.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 03:36:08,615 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.95ms. Allocated memory is still 175.1MB. Free memory was 119.4MB in the beginning and 149.3MB in the end (delta: -29.9MB). Peak memory consumption was 7.5MB. Max. memory is 8.0GB. [2022-04-08 03:36:08,615 INFO L158 Benchmark]: Boogie Preprocessor took 40.09ms. Allocated memory is still 175.1MB. Free memory was 149.3MB in the beginning and 147.7MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-04-08 03:36:08,615 INFO L158 Benchmark]: RCFGBuilder took 268.55ms. Allocated memory is still 175.1MB. Free memory was 147.7MB in the beginning and 136.1MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 03:36:08,615 INFO L158 Benchmark]: TraceAbstraction took 4951.62ms. Allocated memory was 175.1MB in the beginning and 246.4MB in the end (delta: 71.3MB). Free memory was 135.7MB in the beginning and 114.4MB in the end (delta: 21.3MB). Peak memory consumption was 93.5MB. Max. memory is 8.0GB. [2022-04-08 03:36:08,617 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 175.1MB. Free memory is still 136.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 307.95ms. Allocated memory is still 175.1MB. Free memory was 119.4MB in the beginning and 149.3MB in the end (delta: -29.9MB). Peak memory consumption was 7.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.09ms. Allocated memory is still 175.1MB. Free memory was 149.3MB in the beginning and 147.7MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 268.55ms. Allocated memory is still 175.1MB. Free memory was 147.7MB in the beginning and 136.1MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 4951.62ms. Allocated memory was 175.1MB in the beginning and 246.4MB in the end (delta: 71.3MB). Free memory was 135.7MB in the beginning and 114.4MB in the end (delta: 21.3MB). Peak memory consumption was 93.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.9s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 79 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 77 mSDsluCounter, 147 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 106 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 224 IncrementalHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 41 mSDtfsCounter, 224 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 121 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=2, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 44 PreInvPairs, 68 NumberOfFragments, 241 HoareAnnotationTreeSize, 44 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 26 FomulaSimplificationsInter, 487 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((4 + p <= tmp && tmp == p) && pathlim <= 4 + p) || ((pathlim <= p && tmp == p) && p <= tmp)) || !(tmp == pathbuf)) || !(pathbuf + 4 <= tmp)) || !(pathlim <= pathbuf + 4)) || 4 + pathlim <= p - ProcedureContractResult [Line: 25]: Procedure Contract for glob2 Derived contract for procedure glob2: 1 - ProcedureContractResult [Line: 38]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) RESULT: Ultimate proved your program to be correct! [2022-04-08 03:36:08,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...