/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/verisec_NetBSD-libc_loop.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 13:19:08,944 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 13:19:08,945 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 13:19:08,994 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 13:19:08,994 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 13:19:08,995 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 13:19:08,997 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 13:19:08,999 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 13:19:09,000 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 13:19:09,003 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 13:19:09,004 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 13:19:09,005 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 13:19:09,005 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 13:19:09,007 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 13:19:09,008 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 13:19:09,010 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 13:19:09,010 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 13:19:09,011 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 13:19:09,012 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 13:19:09,016 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 13:19:09,017 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 13:19:09,018 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 13:19:09,018 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 13:19:09,019 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 13:19:09,020 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 13:19:09,025 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 13:19:09,025 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 13:19:09,025 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 13:19:09,025 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 13:19:09,026 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 13:19:09,027 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 13:19:09,027 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 13:19:09,028 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 13:19:09,028 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 13:19:09,029 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 13:19:09,029 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 13:19:09,029 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 13:19:09,030 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 13:19:09,030 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 13:19:09,030 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 13:19:09,030 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 13:19:09,032 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 13:19:09,032 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-14 13:19:09,059 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 13:19:09,059 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 13:19:09,059 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-14 13:19:09,059 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-14 13:19:09,060 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-14 13:19:09,060 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-14 13:19:09,060 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-14 13:19:09,060 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-14 13:19:09,060 INFO L138 SettingsManager]: * Use SBE=true [2022-04-14 13:19:09,061 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 13:19:09,061 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 13:19:09,061 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 13:19:09,061 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 13:19:09,061 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 13:19:09,061 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 13:19:09,061 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 13:19:09,061 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 13:19:09,062 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 13:19:09,062 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 13:19:09,062 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 13:19:09,062 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 13:19:09,062 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 13:19:09,062 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 13:19:09,062 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 13:19:09,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 13:19:09,062 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 13:19:09,062 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-14 13:19:09,062 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-14 13:19:09,062 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 13:19:09,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-14 13:19:09,063 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-14 13:19:09,063 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-14 13:19:09,063 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-14 13:19:09,063 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-14 13:19:09,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 13:19:09,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 13:19:09,273 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 13:19:09,274 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 13:19:09,274 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 13:19:09,275 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/verisec_NetBSD-libc_loop.i [2022-04-14 13:19:09,328 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ac8b0ee9/000a5f9084a840009fee8fb1659f8966/FLAG0686f224a [2022-04-14 13:19:09,713 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 13:19:09,713 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/verisec_NetBSD-libc_loop.i [2022-04-14 13:19:09,720 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ac8b0ee9/000a5f9084a840009fee8fb1659f8966/FLAG0686f224a [2022-04-14 13:19:09,732 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ac8b0ee9/000a5f9084a840009fee8fb1659f8966 [2022-04-14 13:19:09,734 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 13:19:09,735 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-14 13:19:09,738 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 13:19:09,738 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 13:19:09,750 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 13:19:09,751 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:19:09" (1/1) ... [2022-04-14 13:19:09,752 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dc6c347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:19:09, skipping insertion in model container [2022-04-14 13:19:09,752 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:19:09" (1/1) ... [2022-04-14 13:19:09,757 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 13:19:09,766 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 13:19:09,874 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/verisec_NetBSD-libc_loop.i[825,838] [2022-04-14 13:19:09,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 13:19:09,900 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 13:19:09,913 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/verisec_NetBSD-libc_loop.i[825,838] [2022-04-14 13:19:09,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 13:19:09,925 INFO L208 MainTranslator]: Completed translation [2022-04-14 13:19:09,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:19:09 WrapperNode [2022-04-14 13:19:09,925 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 13:19:09,926 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 13:19:09,926 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 13:19:09,926 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 13:19:09,932 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:19:09" (1/1) ... [2022-04-14 13:19:09,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:19:09" (1/1) ... [2022-04-14 13:19:09,936 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:19:09" (1/1) ... [2022-04-14 13:19:09,936 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:19:09" (1/1) ... [2022-04-14 13:19:09,941 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:19:09" (1/1) ... [2022-04-14 13:19:09,943 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:19:09" (1/1) ... [2022-04-14 13:19:09,944 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:19:09" (1/1) ... [2022-04-14 13:19:09,945 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 13:19:09,946 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 13:19:09,946 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 13:19:09,946 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 13:19:09,947 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:19:09" (1/1) ... [2022-04-14 13:19:09,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 13:19:09,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 13:19:09,968 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-14 13:19:09,979 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-14 13:19:09,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 13:19:09,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 13:19:09,991 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 13:19:09,992 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 13:19:09,992 INFO L138 BoogieDeclarations]: Found implementation of procedure glob2 [2022-04-14 13:19:09,992 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 13:19:09,992 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 13:19:09,992 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 13:19:09,992 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-14 13:19:09,992 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-14 13:19:09,992 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 13:19:09,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 13:19:09,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 13:19:09,992 INFO L130 BoogieDeclarations]: Found specification of procedure glob2 [2022-04-14 13:19:09,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 13:19:09,993 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 13:19:09,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-14 13:19:09,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 13:19:09,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 13:19:09,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 13:19:09,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 13:19:09,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 13:19:10,038 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 13:19:10,039 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 13:19:10,124 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 13:19:10,129 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 13:19:10,129 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 13:19:10,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 01:19:10 BoogieIcfgContainer [2022-04-14 13:19:10,130 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 13:19:10,131 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 13:19:10,131 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 13:19:10,134 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 13:19:10,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:19:09" (1/3) ... [2022-04-14 13:19:10,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@310461fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:19:10, skipping insertion in model container [2022-04-14 13:19:10,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:19:09" (2/3) ... [2022-04-14 13:19:10,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@310461fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:19:10, skipping insertion in model container [2022-04-14 13:19:10,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 01:19:10" (3/3) ... [2022-04-14 13:19:10,135 INFO L111 eAbstractionObserver]: Analyzing ICFG verisec_NetBSD-libc_loop.i [2022-04-14 13:19:10,139 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-14 13:19:10,139 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 13:19:10,167 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 13:19:10,171 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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-14 13:19:10,172 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 13:19:10,186 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-14 13:19:10,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-14 13:19:10,189 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 13:19:10,189 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 13:19:10,190 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 13:19:10,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 13:19:10,193 INFO L85 PathProgramCache]: Analyzing trace with hash 49640583, now seen corresponding path program 1 times [2022-04-14 13:19:10,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 13:19:10,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843101270] [2022-04-14 13:19:10,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 13:19:10,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 13:19:10,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 13:19:10,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 13:19:10,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 13:19:10,553 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-14 13:19:10,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-14 13:19:10,553 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #50#return; {29#true} is VALID [2022-04-14 13:19:10,555 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-14 13:19:10,555 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-14 13:19:10,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-14 13:19:10,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #50#return; {29#true} is VALID [2022-04-14 13:19:10,556 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret3 := main(); {29#true} is VALID [2022-04-14 13:19:10,558 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, 32 + ~#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-14 13:19:10,560 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-14 13:19:10,561 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-14 13:19:10,562 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-14 13:19:10,565 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-14 13:19:10,566 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-14 13:19:10,567 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {30#false} is VALID [2022-04-14 13:19:10,567 INFO L290 TraceCheckUtils]: 12: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-04-14 13:19:10,567 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-14 13:19:10,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 13:19:10,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843101270] [2022-04-14 13:19:10,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843101270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 13:19:10,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 13:19:10,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-14 13:19:10,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134092973] [2022-04-14 13:19:10,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 13:19:10,575 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-14 13:19:10,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 13:19:10,579 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-14 13:19:10,613 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-14 13:19:10,613 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 13:19:10,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 13:19:10,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 13:19:10,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-14 13:19:10,639 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-14 13:19:11,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 13:19:11,058 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2022-04-14 13:19:11,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-14 13:19:11,058 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-14 13:19:11,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 13:19:11,059 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-14 13:19:11,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-04-14 13:19:11,065 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-14 13:19:11,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-04-14 13:19:11,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 64 transitions. [2022-04-14 13:19:11,145 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-14 13:19:11,150 INFO L225 Difference]: With dead ends: 55 [2022-04-14 13:19:11,150 INFO L226 Difference]: Without dead ends: 26 [2022-04-14 13:19:11,152 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-14 13:19:11,154 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 42 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-14 13:19:11,155 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.1s Time] [2022-04-14 13:19:11,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-14 13:19:11,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2022-04-14 13:19:11,177 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 13:19:11,178 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-14 13:19:11,178 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-14 13:19:11,179 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-14 13:19:11,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 13:19:11,180 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-14 13:19:11,181 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-14 13:19:11,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 13:19:11,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 13:19:11,181 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-14 13:19:11,181 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-14 13:19:11,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 13:19:11,183 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-14 13:19:11,183 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-14 13:19:11,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 13:19:11,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 13:19:11,183 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 13:19:11,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 13:19:11,184 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-14 13:19:11,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-04-14 13:19:11,186 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 13 [2022-04-14 13:19:11,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 13:19:11,186 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-04-14 13:19:11,186 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-14 13:19:11,186 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-14 13:19:11,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-14 13:19:11,187 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 13:19:11,187 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-14 13:19:11,187 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 13:19:11,187 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 13:19:11,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 13:19:11,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1781648093, now seen corresponding path program 1 times [2022-04-14 13:19:11,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 13:19:11,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814218823] [2022-04-14 13:19:11,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 13:19:11,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 13:19:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 13:19:11,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 13:19:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 13:19:11,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {225#(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; {210#true} is VALID [2022-04-14 13:19:11,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {210#true} assume true; {210#true} is VALID [2022-04-14 13:19:11,289 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {210#true} {210#true} #50#return; {210#true} is VALID [2022-04-14 13:19:11,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-14 13:19:11,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 13:19:11,294 INFO L290 TraceCheckUtils]: 0: Hoare triple {210#true} ~cond := #in~cond; {210#true} is VALID [2022-04-14 13:19:11,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {210#true} assume !(0 == ~cond); {210#true} is VALID [2022-04-14 13:19:11,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {210#true} assume true; {210#true} is VALID [2022-04-14 13:19:11,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {210#true} {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #46#return; {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-14 13:19:11,307 INFO L272 TraceCheckUtils]: 0: Hoare triple {210#true} call ULTIMATE.init(); {225#(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-14 13:19:11,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {225#(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; {210#true} is VALID [2022-04-14 13:19:11,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {210#true} assume true; {210#true} is VALID [2022-04-14 13:19:11,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {210#true} {210#true} #50#return; {210#true} is VALID [2022-04-14 13:19:11,308 INFO L272 TraceCheckUtils]: 4: Hoare triple {210#true} call #t~ret3 := main(); {210#true} is VALID [2022-04-14 13:19:11,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {210#true} call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.allocOnStack(8);~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, 32 + ~#pathbuf~0.offset - 4;~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4; {215#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset))} is VALID [2022-04-14 13:19:11,310 INFO L272 TraceCheckUtils]: 6: Hoare triple {215#(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); {216#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset))} is VALID [2022-04-14 13:19:11,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {216#(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; {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-14 13:19:11,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {217#(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); {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-14 13:19:11,311 INFO L272 TraceCheckUtils]: 9: Hoare triple {217#(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)); {210#true} is VALID [2022-04-14 13:19:11,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {210#true} ~cond := #in~cond; {210#true} is VALID [2022-04-14 13:19:11,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {210#true} assume !(0 == ~cond); {210#true} is VALID [2022-04-14 13:19:11,312 INFO L290 TraceCheckUtils]: 12: Hoare triple {210#true} assume true; {210#true} is VALID [2022-04-14 13:19:11,312 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {210#true} {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #46#return; {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-14 13:19:11,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {217#(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); {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-14 13:19:11,314 INFO L290 TraceCheckUtils]: 15: Hoare triple {217#(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; {222#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} is VALID [2022-04-14 13:19:11,314 INFO L290 TraceCheckUtils]: 16: Hoare triple {222#(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); {222#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} is VALID [2022-04-14 13:19:11,315 INFO L272 TraceCheckUtils]: 17: Hoare triple {222#(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)); {223#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 13:19:11,315 INFO L290 TraceCheckUtils]: 18: Hoare triple {223#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {224#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 13:19:11,315 INFO L290 TraceCheckUtils]: 19: Hoare triple {224#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {211#false} is VALID [2022-04-14 13:19:11,316 INFO L290 TraceCheckUtils]: 20: Hoare triple {211#false} assume !false; {211#false} is VALID [2022-04-14 13:19:11,316 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-14 13:19:11,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 13:19:11,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814218823] [2022-04-14 13:19:11,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814218823] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 13:19:11,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365035924] [2022-04-14 13:19:11,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 13:19:11,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 13:19:11,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 13:19:11,337 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-14 13:19:11,340 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-14 13:19:11,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 13:19:11,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-14 13:19:11,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 13:19:11,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 13:19:11,623 INFO L272 TraceCheckUtils]: 0: Hoare triple {210#true} call ULTIMATE.init(); {210#true} is VALID [2022-04-14 13:19:11,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {210#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; {210#true} is VALID [2022-04-14 13:19:11,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {210#true} assume true; {210#true} is VALID [2022-04-14 13:19:11,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {210#true} {210#true} #50#return; {210#true} is VALID [2022-04-14 13:19:11,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {210#true} call #t~ret3 := main(); {210#true} is VALID [2022-04-14 13:19:11,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {210#true} call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.allocOnStack(8);~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, 32 + ~#pathbuf~0.offset - 4;~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4; {215#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset))} is VALID [2022-04-14 13:19:11,627 INFO L272 TraceCheckUtils]: 6: Hoare triple {215#(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); {216#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset))} is VALID [2022-04-14 13:19:11,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {216#(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; {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-14 13:19:11,628 INFO L290 TraceCheckUtils]: 8: Hoare triple {217#(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); {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-14 13:19:11,628 INFO L272 TraceCheckUtils]: 9: Hoare triple {217#(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)); {210#true} is VALID [2022-04-14 13:19:11,628 INFO L290 TraceCheckUtils]: 10: Hoare triple {210#true} ~cond := #in~cond; {210#true} is VALID [2022-04-14 13:19:11,628 INFO L290 TraceCheckUtils]: 11: Hoare triple {210#true} assume !(0 == ~cond); {210#true} is VALID [2022-04-14 13:19:11,628 INFO L290 TraceCheckUtils]: 12: Hoare triple {210#true} assume true; {210#true} is VALID [2022-04-14 13:19:11,629 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {210#true} {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #46#return; {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-14 13:19:11,629 INFO L290 TraceCheckUtils]: 14: Hoare triple {217#(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); {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-14 13:19:11,630 INFO L290 TraceCheckUtils]: 15: Hoare triple {217#(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; {222#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} is VALID [2022-04-14 13:19:11,630 INFO L290 TraceCheckUtils]: 16: Hoare triple {222#(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); {222#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} is VALID [2022-04-14 13:19:11,631 INFO L272 TraceCheckUtils]: 17: Hoare triple {222#(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)); {280#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 13:19:11,632 INFO L290 TraceCheckUtils]: 18: Hoare triple {280#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {284#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 13:19:11,632 INFO L290 TraceCheckUtils]: 19: Hoare triple {284#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {211#false} is VALID [2022-04-14 13:19:11,632 INFO L290 TraceCheckUtils]: 20: Hoare triple {211#false} assume !false; {211#false} is VALID [2022-04-14 13:19:11,632 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-14 13:19:11,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 13:19:11,972 INFO L290 TraceCheckUtils]: 20: Hoare triple {211#false} assume !false; {211#false} is VALID [2022-04-14 13:19:11,972 INFO L290 TraceCheckUtils]: 19: Hoare triple {284#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {211#false} is VALID [2022-04-14 13:19:11,973 INFO L290 TraceCheckUtils]: 18: Hoare triple {280#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {284#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 13:19:11,973 INFO L272 TraceCheckUtils]: 17: Hoare triple {222#(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)); {280#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 13:19:11,974 INFO L290 TraceCheckUtils]: 16: Hoare triple {222#(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); {222#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} is VALID [2022-04-14 13:19:11,975 INFO L290 TraceCheckUtils]: 15: Hoare triple {217#(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; {222#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} is VALID [2022-04-14 13:19:11,975 INFO L290 TraceCheckUtils]: 14: Hoare triple {217#(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); {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-14 13:19:11,976 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {210#true} {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #46#return; {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-14 13:19:11,978 INFO L290 TraceCheckUtils]: 12: Hoare triple {210#true} assume true; {210#true} is VALID [2022-04-14 13:19:11,978 INFO L290 TraceCheckUtils]: 11: Hoare triple {210#true} assume !(0 == ~cond); {210#true} is VALID [2022-04-14 13:19:11,978 INFO L290 TraceCheckUtils]: 10: Hoare triple {210#true} ~cond := #in~cond; {210#true} is VALID [2022-04-14 13:19:11,979 INFO L272 TraceCheckUtils]: 9: Hoare triple {217#(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)); {210#true} is VALID [2022-04-14 13:19:11,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {217#(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); {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-14 13:19:11,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {216#(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; {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-14 13:19:11,981 INFO L272 TraceCheckUtils]: 6: Hoare triple {215#(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); {216#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset))} is VALID [2022-04-14 13:19:11,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {210#true} call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.allocOnStack(8);~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, 32 + ~#pathbuf~0.offset - 4;~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4; {215#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset))} is VALID [2022-04-14 13:19:11,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {210#true} call #t~ret3 := main(); {210#true} is VALID [2022-04-14 13:19:11,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {210#true} {210#true} #50#return; {210#true} is VALID [2022-04-14 13:19:11,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {210#true} assume true; {210#true} is VALID [2022-04-14 13:19:11,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {210#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; {210#true} is VALID [2022-04-14 13:19:11,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {210#true} call ULTIMATE.init(); {210#true} is VALID [2022-04-14 13:19:11,984 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-14 13:19:11,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365035924] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 13:19:11,985 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-14 13:19:11,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 11 [2022-04-14 13:19:11,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671369203] [2022-04-14 13:19:11,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-14 13:19:11,988 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-14 13:19:11,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 13:19:11,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 13:19:12,006 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-14 13:19:12,007 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-14 13:19:12,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 13:19:12,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-14 13:19:12,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-04-14 13:19:12,009 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 13:19:12,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 13:19:12,334 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-14 13:19:12,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-14 13:19:12,334 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-14 13:19:12,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 13:19:12,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 13:19:12,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 33 transitions. [2022-04-14 13:19:12,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 13:19:12,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 33 transitions. [2022-04-14 13:19:12,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 33 transitions. [2022-04-14 13:19:12,380 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-14 13:19:12,382 INFO L225 Difference]: With dead ends: 36 [2022-04-14 13:19:12,382 INFO L226 Difference]: Without dead ends: 34 [2022-04-14 13:19:12,382 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2022-04-14 13:19:12,384 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 34 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 13:19:12,384 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 40 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 13:19:12,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-14 13:19:12,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-14 13:19:12,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 13:19:12,397 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-14 13:19:12,398 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-14 13:19:12,399 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-14 13:19:12,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 13:19:12,403 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-14 13:19:12,403 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-14 13:19:12,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 13:19:12,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 13:19:12,403 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-14 13:19:12,404 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-14 13:19:12,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 13:19:12,408 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-14 13:19:12,408 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-14 13:19:12,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 13:19:12,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 13:19:12,409 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 13:19:12,409 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 13:19:12,409 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-14 13:19:12,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2022-04-14 13:19:12,412 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 21 [2022-04-14 13:19:12,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 13:19:12,412 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2022-04-14 13:19:12,413 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 13:19:12,413 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-14 13:19:12,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-14 13:19:12,414 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 13:19:12,414 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-14 13:19:12,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-14 13:19:12,627 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-14 13:19:12,627 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 13:19:12,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 13:19:12,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1581946061, now seen corresponding path program 2 times [2022-04-14 13:19:12,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 13:19:12,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26138780] [2022-04-14 13:19:12,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 13:19:12,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 13:19:12,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-14 13:19:12,662 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-14 13:19:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-14 13:19:12,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-14 13:19:12,722 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-14 13:19:12,723 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 13:19:12,724 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-14 13:19:12,727 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1] [2022-04-14 13:19:12,730 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 13:19:12,778 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-14 13:19:12,778 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-14 13:19:12,778 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-14 13:19:12,778 WARN L170 areAnnotationChecker]: glob2ENTRY has no Hoare annotation [2022-04-14 13:19:12,778 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-14 13:19:12,778 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-14 13:19:12,778 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-14 13:19:12,778 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-14 13:19:12,778 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-14 13:19:12,779 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-14 13:19:12,779 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2022-04-14 13:19:12,779 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2022-04-14 13:19:12,779 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2022-04-14 13:19:12,779 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-14 13:19:12,779 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-14 13:19:12,779 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-14 13:19:12,779 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-14 13:19:12,779 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-14 13:19:12,779 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-14 13:19:12,779 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-14 13:19:12,779 WARN L170 areAnnotationChecker]: L29-4 has no Hoare annotation [2022-04-14 13:19:12,779 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-14 13:19:12,779 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-14 13:19:12,779 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-14 13:19:12,779 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-04-14 13:19:12,779 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-14 13:19:12,779 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-14 13:19:12,779 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-14 13:19:12,779 WARN L170 areAnnotationChecker]: glob2FINAL has no Hoare annotation [2022-04-14 13:19:12,779 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2022-04-14 13:19:12,779 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-14 13:19:12,779 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 13:19:12,779 WARN L170 areAnnotationChecker]: glob2EXIT has no Hoare annotation [2022-04-14 13:19:12,779 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2022-04-14 13:19:12,780 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-14 13:19:12,780 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-14 13:19:12,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 01:19:12 BoogieIcfgContainer [2022-04-14 13:19:12,780 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 13:19:12,781 INFO L158 Benchmark]: Toolchain (without parser) took 3045.88ms. Allocated memory was 177.2MB in the beginning and 222.3MB in the end (delta: 45.1MB). Free memory was 119.1MB in the beginning and 160.6MB in the end (delta: -41.5MB). Peak memory consumption was 4.8MB. Max. memory is 8.0GB. [2022-04-14 13:19:12,781 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 177.2MB. Free memory is still 136.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 13:19:12,781 INFO L158 Benchmark]: CACSL2BoogieTranslator took 187.54ms. Allocated memory was 177.2MB in the beginning and 222.3MB in the end (delta: 45.1MB). Free memory was 118.9MB in the beginning and 192.3MB in the end (delta: -73.4MB). Peak memory consumption was 7.1MB. Max. memory is 8.0GB. [2022-04-14 13:19:12,782 INFO L158 Benchmark]: Boogie Preprocessor took 19.59ms. Allocated memory is still 222.3MB. Free memory was 192.3MB in the beginning and 190.5MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-14 13:19:12,782 INFO L158 Benchmark]: RCFGBuilder took 184.31ms. Allocated memory is still 222.3MB. Free memory was 190.3MB in the beginning and 179.1MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-14 13:19:12,782 INFO L158 Benchmark]: TraceAbstraction took 2648.84ms. Allocated memory is still 222.3MB. Free memory was 178.5MB in the beginning and 160.6MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-04-14 13:19:12,785 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.09ms. Allocated memory is still 177.2MB. Free memory is still 136.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 187.54ms. Allocated memory was 177.2MB in the beginning and 222.3MB in the end (delta: 45.1MB). Free memory was 118.9MB in the beginning and 192.3MB in the end (delta: -73.4MB). Peak memory consumption was 7.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.59ms. Allocated memory is still 222.3MB. Free memory was 192.3MB in the beginning and 190.5MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 184.31ms. Allocated memory is still 222.3MB. Free memory was 190.3MB in the beginning and 179.1MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 2648.84ms. Allocated memory is still 222.3MB. Free memory was 178.5MB in the beginning and 160.6MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. 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 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L23] Char *tmp; VAL [\old(tmp)=50, \old(tmp)=52, tmp={0:0}] [L40] Char pathbuf[1 +1]; [L42] Char *bound = pathbuf + sizeof(pathbuf) - 1; [L44] tmp = pathbuf + sizeof(pathbuf)/sizeof(*pathbuf) - 1 VAL [\old(tmp)=0, \old(tmp)=0, bound={3:28}, pathbuf={3:0}, tmp={3:4}] [L46] CALL glob2 (pathbuf, bound) VAL [\old(tmp)=0, \old(tmp)=0, pathbuf={3:0}, pathlim={3:28}, tmp={3:4}] [L27] Char *p; [L29] p = pathbuf VAL [\old(tmp)=0, \old(tmp)=0, p={3:0}, pathbuf={3:0}, pathbuf={3:0}, pathlim={3:28}, pathlim={3:28}, tmp={3:4}] [L29] COND TRUE p <= pathlim VAL [\old(tmp)=0, \old(tmp)=0, p={3:0}, pathbuf={3:0}, pathbuf={3:0}, pathlim={3:28}, pathlim={3:28}, tmp={3:4}] [L31] CALL __VERIFIER_assert(p<=tmp) VAL [\old(cond)=1, \old(tmp)=0, \old(tmp)=0, tmp={3:4}] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(tmp)=0, \old(tmp)=0, cond=1, tmp={3:4}] [L31] RET __VERIFIER_assert(p<=tmp) VAL [\old(tmp)=0, \old(tmp)=0, p={3:0}, pathbuf={3:0}, pathbuf={3:0}, pathlim={3:28}, pathlim={3:28}, tmp={3:4}] [L32] *p = 1 VAL [\old(tmp)=0, \old(tmp)=0, p={3:0}, pathbuf={3:0}, pathbuf={3:0}, pathlim={3:28}, pathlim={3:28}, tmp={3:4}] [L29] p++ VAL [\old(tmp)=0, \old(tmp)=0, p={3:4}, pathbuf={3:0}, pathbuf={3:0}, pathlim={3:28}, pathlim={3:28}, tmp={3:4}] [L29] COND TRUE p <= pathlim VAL [\old(tmp)=0, \old(tmp)=0, p={3:4}, pathbuf={3:0}, pathbuf={3:0}, pathlim={3:28}, pathlim={3:28}, tmp={3:4}] [L31] CALL __VERIFIER_assert(p<=tmp) VAL [\old(cond)=1, \old(tmp)=0, \old(tmp)=0, tmp={3:4}] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(tmp)=0, \old(tmp)=0, cond=1, tmp={3:4}] [L31] RET __VERIFIER_assert(p<=tmp) VAL [\old(tmp)=0, \old(tmp)=0, p={3:4}, pathbuf={3:0}, pathbuf={3:0}, pathlim={3:28}, pathlim={3:28}, tmp={3:4}] [L32] *p = 1 VAL [\old(tmp)=0, \old(tmp)=0, p={3:4}, pathbuf={3:0}, pathbuf={3:0}, pathlim={3:28}, pathlim={3:28}, tmp={3:4}] [L29] p++ VAL [\old(tmp)=0, \old(tmp)=0, p={3:8}, pathbuf={3:0}, pathbuf={3:0}, pathlim={3:28}, pathlim={3:28}, tmp={3:4}] [L29] COND TRUE p <= pathlim VAL [\old(tmp)=0, \old(tmp)=0, p={3:8}, pathbuf={3:0}, pathbuf={3:0}, pathlim={3:28}, pathlim={3:28}, tmp={3:4}] [L31] CALL __VERIFIER_assert(p<=tmp) VAL [\old(cond)=0, \old(tmp)=0, \old(tmp)=0, tmp={3:4}] [L15] COND TRUE !(cond) VAL [\old(cond)=0, \old(tmp)=0, \old(tmp)=0, cond=0, tmp={3:4}] [L16] reach_error() VAL [\old(cond)=0, \old(tmp)=0, \old(tmp)=0, cond=0, tmp={3:4}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 78 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 97 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 70 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 194 IncrementalHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 27 mSDtfsCounter, 194 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=2, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 84 NumberOfCodeBlocks, 84 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 72 ConstructedInterpolants, 0 QuantifiedInterpolants, 328 SizeOfPredicates, 6 NumberOfNonLiveVariables, 133 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 6/12 InterpolantCoveringCapability, 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 RESULT: Ultimate proved your program to be incorrect! [2022-04-14 13:19:12,827 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...