./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-atomic/time_var_mutex.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-atomic/time_var_mutex.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1985bb251db70a1c798d345be7e1671f9dcc6a359b969ca99d23e0003d9a3770 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:10:15,190 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:10:15,191 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:10:15,217 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:10:15,218 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:10:15,220 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:10:15,221 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:10:15,223 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:10:15,225 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:10:15,228 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:10:15,228 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:10:15,229 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:10:15,229 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:10:15,231 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:10:15,232 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:10:15,234 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:10:15,235 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:10:15,236 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:10:15,237 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:10:15,241 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:10:15,242 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:10:15,242 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:10:15,244 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:10:15,244 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:10:15,248 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:10:15,249 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:10:15,249 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:10:15,250 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:10:15,250 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:10:15,250 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:10:15,251 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:10:15,252 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:10:15,253 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:10:15,253 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:10:15,254 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:10:15,254 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:10:15,255 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:10:15,255 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:10:15,255 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:10:15,256 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:10:15,256 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:10:15,257 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 20:10:15,285 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:10:15,286 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:10:15,286 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:10:15,286 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:10:15,287 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:10:15,287 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:10:15,288 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:10:15,288 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:10:15,288 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:10:15,288 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:10:15,289 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:10:15,289 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:10:15,289 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:10:15,289 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:10:15,289 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:10:15,289 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:10:15,290 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:10:15,290 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:10:15,290 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:10:15,290 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:10:15,290 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:10:15,290 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:10:15,290 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:10:15,291 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:10:15,291 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:10:15,291 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:10:15,291 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:10:15,292 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:10:15,292 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:10:15,293 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:10:15,293 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:10:15,293 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:10:15,293 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:10:15,293 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1985bb251db70a1c798d345be7e1671f9dcc6a359b969ca99d23e0003d9a3770 [2022-02-20 20:10:15,492 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:10:15,507 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:10:15,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:10:15,509 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:10:15,510 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:10:15,510 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/time_var_mutex.i [2022-02-20 20:10:15,552 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71f0aae27/4e507d8c0aaf44578d6ba3408eef28b8/FLAGbae605581 [2022-02-20 20:10:15,941 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:10:15,945 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/time_var_mutex.i [2022-02-20 20:10:15,960 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71f0aae27/4e507d8c0aaf44578d6ba3408eef28b8/FLAGbae605581 [2022-02-20 20:10:15,972 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71f0aae27/4e507d8c0aaf44578d6ba3408eef28b8 [2022-02-20 20:10:15,973 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:10:15,974 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:10:15,976 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:10:15,976 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:10:15,978 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:10:15,978 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:10:15" (1/1) ... [2022-02-20 20:10:15,979 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@721648ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:10:15, skipping insertion in model container [2022-02-20 20:10:15,979 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:10:15" (1/1) ... [2022-02-20 20:10:15,984 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:10:16,022 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:10:16,259 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/time_var_mutex.i[30247,30260] [2022-02-20 20:10:16,263 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/time_var_mutex.i[30452,30465] [2022-02-20 20:10:16,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:10:16,279 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:10:16,335 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/time_var_mutex.i[30247,30260] [2022-02-20 20:10:16,338 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/time_var_mutex.i[30452,30465] [2022-02-20 20:10:16,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:10:16,372 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:10:16,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:10:16 WrapperNode [2022-02-20 20:10:16,372 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:10:16,374 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:10:16,374 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:10:16,374 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:10:16,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:10:16" (1/1) ... [2022-02-20 20:10:16,390 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:10:16" (1/1) ... [2022-02-20 20:10:16,405 INFO L137 Inliner]: procedures = 169, calls = 34, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2022-02-20 20:10:16,407 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:10:16,408 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:10:16,408 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:10:16,408 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:10:16,413 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:10:16" (1/1) ... [2022-02-20 20:10:16,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:10:16" (1/1) ... [2022-02-20 20:10:16,424 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:10:16" (1/1) ... [2022-02-20 20:10:16,424 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:10:16" (1/1) ... [2022-02-20 20:10:16,430 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:10:16" (1/1) ... [2022-02-20 20:10:16,441 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:10:16" (1/1) ... [2022-02-20 20:10:16,444 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:10:16" (1/1) ... [2022-02-20 20:10:16,453 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:10:16,454 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:10:16,454 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:10:16,454 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:10:16,464 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:10:16" (1/1) ... [2022-02-20 20:10:16,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:10:16,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:10:16,486 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-02-20 20:10:16,504 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-02-20 20:10:16,520 INFO L130 BoogieDeclarations]: Found specification of procedure allocator [2022-02-20 20:10:16,520 INFO L138 BoogieDeclarations]: Found implementation of procedure allocator [2022-02-20 20:10:16,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 20:10:16,521 INFO L130 BoogieDeclarations]: Found specification of procedure de_allocator [2022-02-20 20:10:16,522 INFO L138 BoogieDeclarations]: Found implementation of procedure de_allocator [2022-02-20 20:10:16,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 20:10:16,522 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-02-20 20:10:16,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:10:16,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 20:10:16,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 20:10:16,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:10:16,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:10:16,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:10:16,524 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-20 20:10:16,643 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:10:16,648 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:10:16,800 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:10:16,808 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:10:16,808 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 20:10:16,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:10:16 BoogieIcfgContainer [2022-02-20 20:10:16,810 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:10:16,812 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:10:16,812 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:10:16,836 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:10:16,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:10:15" (1/3) ... [2022-02-20 20:10:16,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d3332b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:10:16, skipping insertion in model container [2022-02-20 20:10:16,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:10:16" (2/3) ... [2022-02-20 20:10:16,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d3332b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:10:16, skipping insertion in model container [2022-02-20 20:10:16,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:10:16" (3/3) ... [2022-02-20 20:10:16,838 INFO L111 eAbstractionObserver]: Analyzing ICFG time_var_mutex.i [2022-02-20 20:10:16,842 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-20 20:10:16,842 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:10:16,842 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 20:10:16,842 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-20 20:10:16,890 WARN L322 ript$VariableManager]: TermVariabe |allocatorThread1of1ForFork0_#in~_.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,890 WARN L322 ript$VariableManager]: TermVariabe |allocatorThread1of1ForFork0_#in~_.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,890 WARN L322 ript$VariableManager]: TermVariabe allocatorThread1of1ForFork0_~_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,890 WARN L322 ript$VariableManager]: TermVariabe allocatorThread1of1ForFork0_~_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,891 WARN L322 ript$VariableManager]: TermVariabe |allocatorThread1of1ForFork0_#in~_.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,891 WARN L322 ript$VariableManager]: TermVariabe |allocatorThread1of1ForFork0_#in~_.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,891 WARN L322 ript$VariableManager]: TermVariabe allocatorThread1of1ForFork0_~_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,891 WARN L322 ript$VariableManager]: TermVariabe allocatorThread1of1ForFork0_~_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,891 WARN L322 ript$VariableManager]: TermVariabe |allocatorThread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,892 WARN L322 ript$VariableManager]: TermVariabe |allocatorThread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,892 WARN L322 ript$VariableManager]: TermVariabe |allocatorThread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,892 WARN L322 ript$VariableManager]: TermVariabe |allocatorThread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,892 WARN L322 ript$VariableManager]: TermVariabe |allocatorThread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,893 WARN L322 ript$VariableManager]: TermVariabe |allocatorThread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,893 WARN L322 ript$VariableManager]: TermVariabe |allocatorThread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,893 WARN L322 ript$VariableManager]: TermVariabe |allocatorThread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,893 WARN L322 ript$VariableManager]: TermVariabe |allocatorThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,894 WARN L322 ript$VariableManager]: TermVariabe |allocatorThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,894 WARN L322 ript$VariableManager]: TermVariabe |allocatorThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,894 WARN L322 ript$VariableManager]: TermVariabe |allocatorThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,894 WARN L322 ript$VariableManager]: TermVariabe |de_allocatorThread1of1ForFork1_#in~_.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,894 WARN L322 ript$VariableManager]: TermVariabe |de_allocatorThread1of1ForFork1_#in~_.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,894 WARN L322 ript$VariableManager]: TermVariabe de_allocatorThread1of1ForFork1_~_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,894 WARN L322 ript$VariableManager]: TermVariabe de_allocatorThread1of1ForFork1_~_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,895 WARN L322 ript$VariableManager]: TermVariabe |de_allocatorThread1of1ForFork1_#in~_.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,895 WARN L322 ript$VariableManager]: TermVariabe |de_allocatorThread1of1ForFork1_#in~_.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,895 WARN L322 ript$VariableManager]: TermVariabe de_allocatorThread1of1ForFork1_~_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,895 WARN L322 ript$VariableManager]: TermVariabe de_allocatorThread1of1ForFork1_~_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,895 WARN L322 ript$VariableManager]: TermVariabe |de_allocatorThread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,895 WARN L322 ript$VariableManager]: TermVariabe |de_allocatorThread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,896 WARN L322 ript$VariableManager]: TermVariabe |de_allocatorThread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,896 WARN L322 ript$VariableManager]: TermVariabe |de_allocatorThread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,897 WARN L322 ript$VariableManager]: TermVariabe |de_allocatorThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,897 WARN L322 ript$VariableManager]: TermVariabe |de_allocatorThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,897 WARN L322 ript$VariableManager]: TermVariabe |de_allocatorThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,897 WARN L322 ript$VariableManager]: TermVariabe |de_allocatorThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,900 WARN L322 ript$VariableManager]: TermVariabe |allocatorThread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,900 WARN L322 ript$VariableManager]: TermVariabe |allocatorThread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,900 WARN L322 ript$VariableManager]: TermVariabe |allocatorThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,900 WARN L322 ript$VariableManager]: TermVariabe allocatorThread1of1ForFork0_~_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,900 WARN L322 ript$VariableManager]: TermVariabe allocatorThread1of1ForFork0_~_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,901 WARN L322 ript$VariableManager]: TermVariabe |allocatorThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,903 WARN L322 ript$VariableManager]: TermVariabe de_allocatorThread1of1ForFork1_~_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,903 WARN L322 ript$VariableManager]: TermVariabe |de_allocatorThread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,903 WARN L322 ript$VariableManager]: TermVariabe de_allocatorThread1of1ForFork1_~_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,903 WARN L322 ript$VariableManager]: TermVariabe |de_allocatorThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,903 WARN L322 ript$VariableManager]: TermVariabe |de_allocatorThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:16,910 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-02-20 20:10:16,940 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:10:16,944 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 20:10:16,945 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-02-20 20:10:16,952 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 104 places, 102 transitions, 220 flow [2022-02-20 20:10:16,995 INFO L129 PetriNetUnfolder]: 5/100 cut-off events. [2022-02-20 20:10:16,995 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-02-20 20:10:16,998 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 100 events. 5/100 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 98 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 71. Up to 3 conditions per place. [2022-02-20 20:10:16,999 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 102 transitions, 220 flow [2022-02-20 20:10:17,003 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 90 transitions, 189 flow [2022-02-20 20:10:17,027 INFO L129 PetriNetUnfolder]: 1/62 cut-off events. [2022-02-20 20:10:17,030 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:10:17,030 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:10:17,031 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:10:17,031 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION === [allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION, de_allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-20 20:10:17,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:10:17,037 INFO L85 PathProgramCache]: Analyzing trace with hash 2073878886, now seen corresponding path program 1 times [2022-02-20 20:10:17,043 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:10:17,044 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713324316] [2022-02-20 20:10:17,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:10:17,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:10:17,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:10:17,332 INFO L290 TraceCheckUtils]: 0: Hoare triple {107#true} [204] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {107#true} is VALID [2022-02-20 20:10:17,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {107#true} [147] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {107#true} is VALID [2022-02-20 20:10:17,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {107#true} [209] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] {107#true} is VALID [2022-02-20 20:10:17,332 INFO L290 TraceCheckUtils]: 3: Hoare triple {107#true} [211] L-1-2-->L16: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {107#true} is VALID [2022-02-20 20:10:17,332 INFO L290 TraceCheckUtils]: 4: Hoare triple {107#true} [192] L16-->L16-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {107#true} is VALID [2022-02-20 20:10:17,333 INFO L290 TraceCheckUtils]: 5: Hoare triple {107#true} [125] L16-1-->L16-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {107#true} is VALID [2022-02-20 20:10:17,333 INFO L290 TraceCheckUtils]: 6: Hoare triple {107#true} [220] L16-2-->L16-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {107#true} is VALID [2022-02-20 20:10:17,333 INFO L290 TraceCheckUtils]: 7: Hoare triple {107#true} [199] L16-3-->L16-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= (select |v_#length_2| 2) 17)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {107#true} is VALID [2022-02-20 20:10:17,333 INFO L290 TraceCheckUtils]: 8: Hoare triple {107#true} [156] L16-4-->L689: Formula: (= v_~block~0_7 0) InVars {} OutVars{~block~0=v_~block~0_7} AuxVars[] AssignedVars[~block~0] {107#true} is VALID [2022-02-20 20:10:17,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {107#true} [183] L689-->L690: Formula: (= v_~busy~0_4 0) InVars {} OutVars{~busy~0=v_~busy~0_4} AuxVars[] AssignedVars[~busy~0] {107#true} is VALID [2022-02-20 20:10:17,336 INFO L290 TraceCheckUtils]: 10: Hoare triple {107#true} [167] L690-->L691: Formula: (= v_~inode~0_4 0) InVars {} OutVars{~inode~0=v_~inode~0_4} AuxVars[] AssignedVars[~inode~0] {109#(= ~inode~0 0)} is VALID [2022-02-20 20:10:17,337 INFO L290 TraceCheckUtils]: 11: Hoare triple {109#(= ~inode~0 0)} [143] L691-->L691-1: Formula: (and (= |v_~#m_inode~0.base_3| 3) (= |v_~#m_inode~0.offset_3| 0)) InVars {} OutVars{~#m_inode~0.offset=|v_~#m_inode~0.offset_3|, ~#m_inode~0.base=|v_~#m_inode~0.base_3|} AuxVars[] AssignedVars[~#m_inode~0.offset, ~#m_inode~0.base] {109#(= ~inode~0 0)} is VALID [2022-02-20 20:10:17,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {109#(= ~inode~0 0)} [223] L691-1-->L691-2: Formula: (and (= (select |v_#length_3| 3) 24) (= (select |v_#valid_4| 3) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {109#(= ~inode~0 0)} is VALID [2022-02-20 20:10:17,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {109#(= ~inode~0 0)} [141] L691-2-->L691-3: Formula: (= (select (select |v_#memory_int_3| |v_~#m_inode~0.base_4|) |v_~#m_inode~0.offset_4|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#m_inode~0.base=|v_~#m_inode~0.base_4|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_4|} OutVars{#memory_int=|v_#memory_int_3|, ~#m_inode~0.base=|v_~#m_inode~0.base_4|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_4|} AuxVars[] AssignedVars[] {109#(= ~inode~0 0)} is VALID [2022-02-20 20:10:17,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {109#(= ~inode~0 0)} [166] L691-3-->L691-4: Formula: (= (select (select |v_#memory_int_4| |v_~#m_inode~0.base_5|) (+ |v_~#m_inode~0.offset_5| 4)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#m_inode~0.base=|v_~#m_inode~0.base_5|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_5|} OutVars{#memory_int=|v_#memory_int_4|, ~#m_inode~0.base=|v_~#m_inode~0.base_5|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_5|} AuxVars[] AssignedVars[] {109#(= ~inode~0 0)} is VALID [2022-02-20 20:10:17,341 INFO L290 TraceCheckUtils]: 15: Hoare triple {109#(= ~inode~0 0)} [212] L691-4-->L691-5: Formula: (= (select (select |v_#memory_int_5| |v_~#m_inode~0.base_6|) (+ 8 |v_~#m_inode~0.offset_6|)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#m_inode~0.base=|v_~#m_inode~0.base_6|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_6|} OutVars{#memory_int=|v_#memory_int_5|, ~#m_inode~0.base=|v_~#m_inode~0.base_6|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_6|} AuxVars[] AssignedVars[] {109#(= ~inode~0 0)} is VALID [2022-02-20 20:10:17,342 INFO L290 TraceCheckUtils]: 16: Hoare triple {109#(= ~inode~0 0)} [184] L691-5-->L691-6: Formula: (= 0 (select (select |v_#memory_int_6| |v_~#m_inode~0.base_7|) (+ 12 |v_~#m_inode~0.offset_7|))) InVars {#memory_int=|v_#memory_int_6|, ~#m_inode~0.base=|v_~#m_inode~0.base_7|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_7|} OutVars{#memory_int=|v_#memory_int_6|, ~#m_inode~0.base=|v_~#m_inode~0.base_7|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_7|} AuxVars[] AssignedVars[] {109#(= ~inode~0 0)} is VALID [2022-02-20 20:10:17,343 INFO L290 TraceCheckUtils]: 17: Hoare triple {109#(= ~inode~0 0)} [191] L691-6-->L691-7: Formula: (= (select (select |v_#memory_int_7| |v_~#m_inode~0.base_8|) (+ 16 |v_~#m_inode~0.offset_8|)) 0) InVars {#memory_int=|v_#memory_int_7|, ~#m_inode~0.base=|v_~#m_inode~0.base_8|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_8|} OutVars{#memory_int=|v_#memory_int_7|, ~#m_inode~0.base=|v_~#m_inode~0.base_8|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_8|} AuxVars[] AssignedVars[] {109#(= ~inode~0 0)} is VALID [2022-02-20 20:10:17,343 INFO L290 TraceCheckUtils]: 18: Hoare triple {109#(= ~inode~0 0)} [189] L691-7-->L692: Formula: (and (= |v_~#m_busy~0.base_5| 4) (= |v_~#m_busy~0.offset_5| 0)) InVars {} OutVars{~#m_busy~0.offset=|v_~#m_busy~0.offset_5|, ~#m_busy~0.base=|v_~#m_busy~0.base_5|} AuxVars[] AssignedVars[~#m_busy~0.offset, ~#m_busy~0.base] {109#(= ~inode~0 0)} is VALID [2022-02-20 20:10:17,344 INFO L290 TraceCheckUtils]: 19: Hoare triple {109#(= ~inode~0 0)} [142] L692-->L692-1: Formula: (and (= (select |v_#length_4| 4) 24) (= (select |v_#valid_5| 4) 1)) InVars {#length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] {109#(= ~inode~0 0)} is VALID [2022-02-20 20:10:17,344 INFO L290 TraceCheckUtils]: 20: Hoare triple {109#(= ~inode~0 0)} [151] L692-1-->L692-2: Formula: (= (select (select |v_#memory_int_8| |v_~#m_busy~0.base_6|) |v_~#m_busy~0.offset_6|) 0) InVars {#memory_int=|v_#memory_int_8|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_6|, ~#m_busy~0.base=|v_~#m_busy~0.base_6|} OutVars{#memory_int=|v_#memory_int_8|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_6|, ~#m_busy~0.base=|v_~#m_busy~0.base_6|} AuxVars[] AssignedVars[] {109#(= ~inode~0 0)} is VALID [2022-02-20 20:10:17,347 INFO L290 TraceCheckUtils]: 21: Hoare triple {109#(= ~inode~0 0)} [133] L692-2-->L692-3: Formula: (= (select (select |v_#memory_int_9| |v_~#m_busy~0.base_7|) (+ |v_~#m_busy~0.offset_7| 4)) 0) InVars {#memory_int=|v_#memory_int_9|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_7|, ~#m_busy~0.base=|v_~#m_busy~0.base_7|} OutVars{#memory_int=|v_#memory_int_9|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_7|, ~#m_busy~0.base=|v_~#m_busy~0.base_7|} AuxVars[] AssignedVars[] {109#(= ~inode~0 0)} is VALID [2022-02-20 20:10:17,348 INFO L290 TraceCheckUtils]: 22: Hoare triple {109#(= ~inode~0 0)} [195] L692-3-->L692-4: Formula: (= (select (select |v_#memory_int_10| |v_~#m_busy~0.base_8|) (+ |v_~#m_busy~0.offset_8| 8)) 0) InVars {#memory_int=|v_#memory_int_10|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_8|, ~#m_busy~0.base=|v_~#m_busy~0.base_8|} OutVars{#memory_int=|v_#memory_int_10|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_8|, ~#m_busy~0.base=|v_~#m_busy~0.base_8|} AuxVars[] AssignedVars[] {109#(= ~inode~0 0)} is VALID [2022-02-20 20:10:17,348 INFO L290 TraceCheckUtils]: 23: Hoare triple {109#(= ~inode~0 0)} [181] L692-4-->L692-5: Formula: (= (select (select |v_#memory_int_11| |v_~#m_busy~0.base_9|) (+ |v_~#m_busy~0.offset_9| 12)) 0) InVars {#memory_int=|v_#memory_int_11|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_9|, ~#m_busy~0.base=|v_~#m_busy~0.base_9|} OutVars{#memory_int=|v_#memory_int_11|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_9|, ~#m_busy~0.base=|v_~#m_busy~0.base_9|} AuxVars[] AssignedVars[] {109#(= ~inode~0 0)} is VALID [2022-02-20 20:10:17,349 INFO L290 TraceCheckUtils]: 24: Hoare triple {109#(= ~inode~0 0)} [146] L692-5-->L692-6: Formula: (= (select (select |v_#memory_int_12| |v_~#m_busy~0.base_10|) (+ 16 |v_~#m_busy~0.offset_10|)) 0) InVars {#memory_int=|v_#memory_int_12|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_10|, ~#m_busy~0.base=|v_~#m_busy~0.base_10|} OutVars{#memory_int=|v_#memory_int_12|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_10|, ~#m_busy~0.base=|v_~#m_busy~0.base_10|} AuxVars[] AssignedVars[] {109#(= ~inode~0 0)} is VALID [2022-02-20 20:10:17,349 INFO L290 TraceCheckUtils]: 25: Hoare triple {109#(= ~inode~0 0)} [221] L692-6-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {109#(= ~inode~0 0)} is VALID [2022-02-20 20:10:17,350 INFO L290 TraceCheckUtils]: 26: Hoare triple {109#(= ~inode~0 0)} [216] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {109#(= ~inode~0 0)} is VALID [2022-02-20 20:10:17,350 INFO L290 TraceCheckUtils]: 27: Hoare triple {109#(= ~inode~0 0)} [153] L-1-4-->L-1-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {109#(= ~inode~0 0)} is VALID [2022-02-20 20:10:17,351 INFO L290 TraceCheckUtils]: 28: Hoare triple {109#(= ~inode~0 0)} [128] L-1-5-->L716: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_#t~pre8#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem10#1, ULTIMATE.start_main_~#t2~0#1.base] {109#(= ~inode~0 0)} is VALID [2022-02-20 20:10:17,352 INFO L290 TraceCheckUtils]: 29: Hoare triple {109#(= ~inode~0 0)} [155] L716-->L716-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4) |v_#length_5|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_main_~#t1~0#1.base_2|)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] {109#(= ~inode~0 0)} is VALID [2022-02-20 20:10:17,352 INFO L290 TraceCheckUtils]: 30: Hoare triple {109#(= ~inode~0 0)} [201] L716-1-->L716-2: Formula: (and (= (store |v_#length_8| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4) |v_#length_7|) (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] {109#(= ~inode~0 0)} is VALID [2022-02-20 20:10:17,353 INFO L290 TraceCheckUtils]: 31: Hoare triple {109#(= ~inode~0 0)} [194] L716-2-->L717: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {109#(= ~inode~0 0)} is VALID [2022-02-20 20:10:17,353 INFO L290 TraceCheckUtils]: 32: Hoare triple {109#(= ~inode~0 0)} [129] L717-->L717-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (= v_~busy~0_5 v_~inode~0_5) 1 0)) InVars {~inode~0=v_~inode~0_5, ~busy~0=v_~busy~0_5} OutVars{~inode~0=v_~inode~0_5, ~busy~0=v_~busy~0_5, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {109#(= ~inode~0 0)} is VALID [2022-02-20 20:10:17,353 INFO L290 TraceCheckUtils]: 33: Hoare triple {109#(= ~inode~0 0)} [168] L717-1-->L2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {109#(= ~inode~0 0)} is VALID [2022-02-20 20:10:17,354 INFO L290 TraceCheckUtils]: 34: Hoare triple {109#(= ~inode~0 0)} [176] L2-->L3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {109#(= ~inode~0 0)} is VALID [2022-02-20 20:10:17,354 INFO L290 TraceCheckUtils]: 35: Hoare triple {109#(= ~inode~0 0)} [171] L3-->L2-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] {109#(= ~inode~0 0)} is VALID [2022-02-20 20:10:17,355 INFO L290 TraceCheckUtils]: 36: Hoare triple {109#(= ~inode~0 0)} [139] L2-1-->L718: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {109#(= ~inode~0 0)} is VALID [2022-02-20 20:10:17,355 INFO L290 TraceCheckUtils]: 37: Hoare triple {109#(= ~inode~0 0)} [188] L718-->L719: Formula: (= |v_#pthreadsMutex_13| (store |v_#pthreadsMutex_14| |v_~#m_inode~0.base_9| (store (select |v_#pthreadsMutex_14| |v_~#m_inode~0.base_9|) |v_~#m_inode~0.offset_9| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_14|, ~#m_inode~0.base=|v_~#m_inode~0.base_9|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_9|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_13|, ~#m_inode~0.base=|v_~#m_inode~0.base_9|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_9|} AuxVars[] AssignedVars[#pthreadsMutex] {109#(= ~inode~0 0)} is VALID [2022-02-20 20:10:17,356 INFO L290 TraceCheckUtils]: 38: Hoare triple {109#(= ~inode~0 0)} [178] L719-->L720: Formula: (= |v_#pthreadsMutex_15| (store |v_#pthreadsMutex_16| |v_~#m_busy~0.base_11| (store (select |v_#pthreadsMutex_16| |v_~#m_busy~0.base_11|) |v_~#m_busy~0.offset_11| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_16|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_11|, ~#m_busy~0.base=|v_~#m_busy~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_15|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_11|, ~#m_busy~0.base=|v_~#m_busy~0.base_11|} AuxVars[] AssignedVars[#pthreadsMutex] {109#(= ~inode~0 0)} is VALID [2022-02-20 20:10:17,357 INFO L290 TraceCheckUtils]: 39: Hoare triple {109#(= ~inode~0 0)} [136] L720-->L720-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {109#(= ~inode~0 0)} is VALID [2022-02-20 20:10:17,357 INFO L290 TraceCheckUtils]: 40: Hoare triple {109#(= ~inode~0 0)} [152] L720-1-->L720-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {109#(= ~inode~0 0)} is VALID [2022-02-20 20:10:17,358 INFO L290 TraceCheckUtils]: 41: Hoare triple {109#(= ~inode~0 0)} [200] L720-2-->L720-3: Formula: (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_13|) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {109#(= ~inode~0 0)} is VALID [2022-02-20 20:10:17,358 INFO L290 TraceCheckUtils]: 42: Hoare triple {109#(= ~inode~0 0)} [258] L720-3-->allocatorENTRY: Formula: (and (= v_allocatorThread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_allocatorThread1of1ForFork0_thidvar0_2) (= |v_allocatorThread1of1ForFork0_#in~_.base_4| 0) (= |v_allocatorThread1of1ForFork0_#in~_.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{allocatorThread1of1ForFork0_#t~nondet3=|v_allocatorThread1of1ForFork0_#t~nondet3_6|, allocatorThread1of1ForFork0_#t~nondet4=|v_allocatorThread1of1ForFork0_#t~nondet4_6|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, allocatorThread1of1ForFork0_#res.offset=|v_allocatorThread1of1ForFork0_#res.offset_4|, allocatorThread1of1ForFork0_~_.base=v_allocatorThread1of1ForFork0_~_.base_4, allocatorThread1of1ForFork0_~_.offset=v_allocatorThread1of1ForFork0_~_.offset_4, allocatorThread1of1ForFork0_#in~_.base=|v_allocatorThread1of1ForFork0_#in~_.base_4|, allocatorThread1of1ForFork0_#in~_.offset=|v_allocatorThread1of1ForFork0_#in~_.offset_4|, allocatorThread1of1ForFork0_#res.base=|v_allocatorThread1of1ForFork0_#res.base_4|, allocatorThread1of1ForFork0_thidvar1=v_allocatorThread1of1ForFork0_thidvar1_2, allocatorThread1of1ForFork0_thidvar0=v_allocatorThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[allocatorThread1of1ForFork0_#t~nondet3, allocatorThread1of1ForFork0_#t~nondet4, allocatorThread1of1ForFork0_#res.offset, allocatorThread1of1ForFork0_~_.base, allocatorThread1of1ForFork0_~_.offset, allocatorThread1of1ForFork0_#in~_.base, allocatorThread1of1ForFork0_#in~_.offset, allocatorThread1of1ForFork0_#res.base, allocatorThread1of1ForFork0_thidvar1, allocatorThread1of1ForFork0_thidvar0] {109#(= ~inode~0 0)} is VALID [2022-02-20 20:10:17,359 INFO L290 TraceCheckUtils]: 43: Hoare triple {109#(= ~inode~0 0)} [224] allocatorENTRY-->L694: Formula: (and (= |v_allocatorThread1of1ForFork0_#in~_.base_1| v_allocatorThread1of1ForFork0_~_.base_1) (= |v_allocatorThread1of1ForFork0_#in~_.offset_1| v_allocatorThread1of1ForFork0_~_.offset_1)) InVars {allocatorThread1of1ForFork0_#in~_.offset=|v_allocatorThread1of1ForFork0_#in~_.offset_1|, allocatorThread1of1ForFork0_#in~_.base=|v_allocatorThread1of1ForFork0_#in~_.base_1|} OutVars{allocatorThread1of1ForFork0_#in~_.offset=|v_allocatorThread1of1ForFork0_#in~_.offset_1|, allocatorThread1of1ForFork0_~_.base=v_allocatorThread1of1ForFork0_~_.base_1, allocatorThread1of1ForFork0_~_.offset=v_allocatorThread1of1ForFork0_~_.offset_1, allocatorThread1of1ForFork0_#in~_.base=|v_allocatorThread1of1ForFork0_#in~_.base_1|} AuxVars[] AssignedVars[allocatorThread1of1ForFork0_~_.base, allocatorThread1of1ForFork0_~_.offset] {109#(= ~inode~0 0)} is VALID [2022-02-20 20:10:17,360 INFO L290 TraceCheckUtils]: 44: Hoare triple {109#(= ~inode~0 0)} [225] L694-->L694-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#m_inode~0.base_1|))) (and (= (select .cse0 |v_~#m_inode~0.offset_1|) 0) (= |v_#pthreadsMutex_1| (store |v_#pthreadsMutex_2| |v_~#m_inode~0.base_1| (store .cse0 |v_~#m_inode~0.offset_1| 1))) (= |v_allocatorThread1of1ForFork0_#t~nondet3_1| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2|, ~#m_inode~0.base=|v_~#m_inode~0.base_1|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_1|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_1|, allocatorThread1of1ForFork0_#t~nondet3=|v_allocatorThread1of1ForFork0_#t~nondet3_1|, ~#m_inode~0.base=|v_~#m_inode~0.base_1|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_1|} AuxVars[] AssignedVars[#pthreadsMutex, allocatorThread1of1ForFork0_#t~nondet3] {109#(= ~inode~0 0)} is VALID [2022-02-20 20:10:17,360 INFO L290 TraceCheckUtils]: 45: Hoare triple {109#(= ~inode~0 0)} [226] L694-1-->L695: Formula: true InVars {} OutVars{allocatorThread1of1ForFork0_#t~nondet3=|v_allocatorThread1of1ForFork0_#t~nondet3_3|} AuxVars[] AssignedVars[allocatorThread1of1ForFork0_#t~nondet3] {109#(= ~inode~0 0)} is VALID [2022-02-20 20:10:17,361 INFO L290 TraceCheckUtils]: 46: Hoare triple {109#(= ~inode~0 0)} [228] L695-->L695-2: Formula: (not (= v_~inode~0_3 0)) InVars {~inode~0=v_~inode~0_3} OutVars{~inode~0=v_~inode~0_3} AuxVars[] AssignedVars[] {108#false} is VALID [2022-02-20 20:10:17,361 INFO L290 TraceCheckUtils]: 47: Hoare triple {108#false} [230] L695-2-->L702: Formula: (= v_~block~0_1 1) InVars {} OutVars{~block~0=v_~block~0_1} AuxVars[] AssignedVars[~block~0] {108#false} is VALID [2022-02-20 20:10:17,361 INFO L290 TraceCheckUtils]: 48: Hoare triple {108#false} [232] L702-->L702-1: Formula: (not (= v_~block~0_2 1)) InVars {~block~0=v_~block~0_2} OutVars{~block~0=v_~block~0_2} AuxVars[] AssignedVars[] {108#false} is VALID [2022-02-20 20:10:17,364 INFO L290 TraceCheckUtils]: 49: Hoare triple {108#false} [235] L702-1-->allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {108#false} is VALID [2022-02-20 20:10:17,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:10:17,365 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:10:17,365 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713324316] [2022-02-20 20:10:17,366 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713324316] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:10:17,366 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:10:17,366 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 20:10:17,368 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808772965] [2022-02-20 20:10:17,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:10:17,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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) Word has length 50 [2022-02-20 20:10:17,379 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:10:17,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-02-20 20:10:17,426 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:10:17,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 20:10:17,427 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:10:17,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 20:10:17,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 20:10:17,450 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 102 [2022-02-20 20:10:17,455 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 90 transitions, 189 flow. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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-02-20 20:10:17,455 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:10:17,455 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 102 [2022-02-20 20:10:17,456 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:10:17,509 INFO L129 PetriNetUnfolder]: 3/99 cut-off events. [2022-02-20 20:10:17,509 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-02-20 20:10:17,510 INFO L84 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 99 events. 3/99 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 126 event pairs, 1 based on Foata normal form. 6/99 useless extension candidates. Maximal degree in co-relation 65. Up to 7 conditions per place. [2022-02-20 20:10:17,511 INFO L132 encePairwiseOnDemand]: 96/102 looper letters, 6 selfloop transitions, 2 changer transitions 1/85 dead transitions. [2022-02-20 20:10:17,511 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 85 transitions, 198 flow [2022-02-20 20:10:17,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 20:10:17,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-02-20 20:10:17,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 277 transitions. [2022-02-20 20:10:17,532 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9052287581699346 [2022-02-20 20:10:17,533 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 277 transitions. [2022-02-20 20:10:17,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 277 transitions. [2022-02-20 20:10:17,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:10:17,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 277 transitions. [2022-02-20 20:10:17,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 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-02-20 20:10:17,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 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-02-20 20:10:17,546 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 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-02-20 20:10:17,548 INFO L186 Difference]: Start difference. First operand has 92 places, 90 transitions, 189 flow. Second operand 3 states and 277 transitions. [2022-02-20 20:10:17,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 85 transitions, 198 flow [2022-02-20 20:10:17,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 85 transitions, 192 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-02-20 20:10:17,554 INFO L242 Difference]: Finished difference. Result has 89 places, 83 transitions, 174 flow [2022-02-20 20:10:17,555 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=89, PETRI_TRANSITIONS=83} [2022-02-20 20:10:17,557 INFO L334 CegarLoopForPetriNet]: 92 programPoint places, -3 predicate places. [2022-02-20 20:10:17,558 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 89 places, 83 transitions, 174 flow [2022-02-20 20:10:17,592 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 997 states, 993 states have (on average 2.526686807653575) internal successors, (2509), 996 states have internal predecessors, (2509), 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-02-20 20:10:17,595 INFO L78 Accepts]: Start accepts. Automaton has has 997 states, 993 states have (on average 2.526686807653575) internal successors, (2509), 996 states have internal predecessors, (2509), 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) Word has length 50 [2022-02-20 20:10:17,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:10:17,596 INFO L470 AbstractCegarLoop]: Abstraction has has 89 places, 83 transitions, 174 flow [2022-02-20 20:10:17,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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-02-20 20:10:17,596 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:10:17,597 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:10:17,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:10:17,597 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION === [allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION, de_allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-20 20:10:17,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:10:17,598 INFO L85 PathProgramCache]: Analyzing trace with hash -517979552, now seen corresponding path program 1 times [2022-02-20 20:10:17,598 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:10:17,598 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619911913] [2022-02-20 20:10:17,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:10:17,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:10:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:10:17,684 INFO L290 TraceCheckUtils]: 0: Hoare triple {1109#true} [204] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1109#true} is VALID [2022-02-20 20:10:17,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {1109#true} [147] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1109#true} is VALID [2022-02-20 20:10:17,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {1109#true} [209] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] {1109#true} is VALID [2022-02-20 20:10:17,686 INFO L290 TraceCheckUtils]: 3: Hoare triple {1109#true} [211] L-1-2-->L16: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {1109#true} is VALID [2022-02-20 20:10:17,686 INFO L290 TraceCheckUtils]: 4: Hoare triple {1109#true} [192] L16-->L16-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {1109#true} is VALID [2022-02-20 20:10:17,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {1109#true} [125] L16-1-->L16-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {1109#true} is VALID [2022-02-20 20:10:17,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {1109#true} [220] L16-2-->L16-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {1109#true} is VALID [2022-02-20 20:10:17,687 INFO L290 TraceCheckUtils]: 7: Hoare triple {1109#true} [199] L16-3-->L16-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= (select |v_#length_2| 2) 17)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {1109#true} is VALID [2022-02-20 20:10:17,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {1109#true} [156] L16-4-->L689: Formula: (= v_~block~0_7 0) InVars {} OutVars{~block~0=v_~block~0_7} AuxVars[] AssignedVars[~block~0] {1109#true} is VALID [2022-02-20 20:10:17,687 INFO L290 TraceCheckUtils]: 9: Hoare triple {1109#true} [183] L689-->L690: Formula: (= v_~busy~0_4 0) InVars {} OutVars{~busy~0=v_~busy~0_4} AuxVars[] AssignedVars[~busy~0] {1109#true} is VALID [2022-02-20 20:10:17,687 INFO L290 TraceCheckUtils]: 10: Hoare triple {1109#true} [167] L690-->L691: Formula: (= v_~inode~0_4 0) InVars {} OutVars{~inode~0=v_~inode~0_4} AuxVars[] AssignedVars[~inode~0] {1109#true} is VALID [2022-02-20 20:10:17,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {1109#true} [143] L691-->L691-1: Formula: (and (= |v_~#m_inode~0.base_3| 3) (= |v_~#m_inode~0.offset_3| 0)) InVars {} OutVars{~#m_inode~0.offset=|v_~#m_inode~0.offset_3|, ~#m_inode~0.base=|v_~#m_inode~0.base_3|} AuxVars[] AssignedVars[~#m_inode~0.offset, ~#m_inode~0.base] {1109#true} is VALID [2022-02-20 20:10:17,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {1109#true} [223] L691-1-->L691-2: Formula: (and (= (select |v_#length_3| 3) 24) (= (select |v_#valid_4| 3) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {1109#true} is VALID [2022-02-20 20:10:17,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {1109#true} [141] L691-2-->L691-3: Formula: (= (select (select |v_#memory_int_3| |v_~#m_inode~0.base_4|) |v_~#m_inode~0.offset_4|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#m_inode~0.base=|v_~#m_inode~0.base_4|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_4|} OutVars{#memory_int=|v_#memory_int_3|, ~#m_inode~0.base=|v_~#m_inode~0.base_4|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_4|} AuxVars[] AssignedVars[] {1109#true} is VALID [2022-02-20 20:10:17,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {1109#true} [166] L691-3-->L691-4: Formula: (= (select (select |v_#memory_int_4| |v_~#m_inode~0.base_5|) (+ |v_~#m_inode~0.offset_5| 4)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#m_inode~0.base=|v_~#m_inode~0.base_5|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_5|} OutVars{#memory_int=|v_#memory_int_4|, ~#m_inode~0.base=|v_~#m_inode~0.base_5|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_5|} AuxVars[] AssignedVars[] {1109#true} is VALID [2022-02-20 20:10:17,688 INFO L290 TraceCheckUtils]: 15: Hoare triple {1109#true} [212] L691-4-->L691-5: Formula: (= (select (select |v_#memory_int_5| |v_~#m_inode~0.base_6|) (+ 8 |v_~#m_inode~0.offset_6|)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#m_inode~0.base=|v_~#m_inode~0.base_6|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_6|} OutVars{#memory_int=|v_#memory_int_5|, ~#m_inode~0.base=|v_~#m_inode~0.base_6|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_6|} AuxVars[] AssignedVars[] {1109#true} is VALID [2022-02-20 20:10:17,689 INFO L290 TraceCheckUtils]: 16: Hoare triple {1109#true} [184] L691-5-->L691-6: Formula: (= 0 (select (select |v_#memory_int_6| |v_~#m_inode~0.base_7|) (+ 12 |v_~#m_inode~0.offset_7|))) InVars {#memory_int=|v_#memory_int_6|, ~#m_inode~0.base=|v_~#m_inode~0.base_7|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_7|} OutVars{#memory_int=|v_#memory_int_6|, ~#m_inode~0.base=|v_~#m_inode~0.base_7|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_7|} AuxVars[] AssignedVars[] {1109#true} is VALID [2022-02-20 20:10:17,689 INFO L290 TraceCheckUtils]: 17: Hoare triple {1109#true} [191] L691-6-->L691-7: Formula: (= (select (select |v_#memory_int_7| |v_~#m_inode~0.base_8|) (+ 16 |v_~#m_inode~0.offset_8|)) 0) InVars {#memory_int=|v_#memory_int_7|, ~#m_inode~0.base=|v_~#m_inode~0.base_8|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_8|} OutVars{#memory_int=|v_#memory_int_7|, ~#m_inode~0.base=|v_~#m_inode~0.base_8|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_8|} AuxVars[] AssignedVars[] {1109#true} is VALID [2022-02-20 20:10:17,689 INFO L290 TraceCheckUtils]: 18: Hoare triple {1109#true} [189] L691-7-->L692: Formula: (and (= |v_~#m_busy~0.base_5| 4) (= |v_~#m_busy~0.offset_5| 0)) InVars {} OutVars{~#m_busy~0.offset=|v_~#m_busy~0.offset_5|, ~#m_busy~0.base=|v_~#m_busy~0.base_5|} AuxVars[] AssignedVars[~#m_busy~0.offset, ~#m_busy~0.base] {1109#true} is VALID [2022-02-20 20:10:17,689 INFO L290 TraceCheckUtils]: 19: Hoare triple {1109#true} [142] L692-->L692-1: Formula: (and (= (select |v_#length_4| 4) 24) (= (select |v_#valid_5| 4) 1)) InVars {#length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] {1109#true} is VALID [2022-02-20 20:10:17,689 INFO L290 TraceCheckUtils]: 20: Hoare triple {1109#true} [151] L692-1-->L692-2: Formula: (= (select (select |v_#memory_int_8| |v_~#m_busy~0.base_6|) |v_~#m_busy~0.offset_6|) 0) InVars {#memory_int=|v_#memory_int_8|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_6|, ~#m_busy~0.base=|v_~#m_busy~0.base_6|} OutVars{#memory_int=|v_#memory_int_8|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_6|, ~#m_busy~0.base=|v_~#m_busy~0.base_6|} AuxVars[] AssignedVars[] {1109#true} is VALID [2022-02-20 20:10:17,690 INFO L290 TraceCheckUtils]: 21: Hoare triple {1109#true} [133] L692-2-->L692-3: Formula: (= (select (select |v_#memory_int_9| |v_~#m_busy~0.base_7|) (+ |v_~#m_busy~0.offset_7| 4)) 0) InVars {#memory_int=|v_#memory_int_9|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_7|, ~#m_busy~0.base=|v_~#m_busy~0.base_7|} OutVars{#memory_int=|v_#memory_int_9|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_7|, ~#m_busy~0.base=|v_~#m_busy~0.base_7|} AuxVars[] AssignedVars[] {1109#true} is VALID [2022-02-20 20:10:17,690 INFO L290 TraceCheckUtils]: 22: Hoare triple {1109#true} [195] L692-3-->L692-4: Formula: (= (select (select |v_#memory_int_10| |v_~#m_busy~0.base_8|) (+ |v_~#m_busy~0.offset_8| 8)) 0) InVars {#memory_int=|v_#memory_int_10|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_8|, ~#m_busy~0.base=|v_~#m_busy~0.base_8|} OutVars{#memory_int=|v_#memory_int_10|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_8|, ~#m_busy~0.base=|v_~#m_busy~0.base_8|} AuxVars[] AssignedVars[] {1109#true} is VALID [2022-02-20 20:10:17,690 INFO L290 TraceCheckUtils]: 23: Hoare triple {1109#true} [181] L692-4-->L692-5: Formula: (= (select (select |v_#memory_int_11| |v_~#m_busy~0.base_9|) (+ |v_~#m_busy~0.offset_9| 12)) 0) InVars {#memory_int=|v_#memory_int_11|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_9|, ~#m_busy~0.base=|v_~#m_busy~0.base_9|} OutVars{#memory_int=|v_#memory_int_11|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_9|, ~#m_busy~0.base=|v_~#m_busy~0.base_9|} AuxVars[] AssignedVars[] {1109#true} is VALID [2022-02-20 20:10:17,690 INFO L290 TraceCheckUtils]: 24: Hoare triple {1109#true} [146] L692-5-->L692-6: Formula: (= (select (select |v_#memory_int_12| |v_~#m_busy~0.base_10|) (+ 16 |v_~#m_busy~0.offset_10|)) 0) InVars {#memory_int=|v_#memory_int_12|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_10|, ~#m_busy~0.base=|v_~#m_busy~0.base_10|} OutVars{#memory_int=|v_#memory_int_12|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_10|, ~#m_busy~0.base=|v_~#m_busy~0.base_10|} AuxVars[] AssignedVars[] {1109#true} is VALID [2022-02-20 20:10:17,690 INFO L290 TraceCheckUtils]: 25: Hoare triple {1109#true} [221] L692-6-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1109#true} is VALID [2022-02-20 20:10:17,691 INFO L290 TraceCheckUtils]: 26: Hoare triple {1109#true} [216] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1109#true} is VALID [2022-02-20 20:10:17,691 INFO L290 TraceCheckUtils]: 27: Hoare triple {1109#true} [153] L-1-4-->L-1-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {1109#true} is VALID [2022-02-20 20:10:17,691 INFO L290 TraceCheckUtils]: 28: Hoare triple {1109#true} [128] L-1-5-->L716: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_#t~pre8#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem10#1, ULTIMATE.start_main_~#t2~0#1.base] {1109#true} is VALID [2022-02-20 20:10:17,694 INFO L290 TraceCheckUtils]: 29: Hoare triple {1109#true} [155] L716-->L716-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4) |v_#length_5|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_main_~#t1~0#1.base_2|)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] {1109#true} is VALID [2022-02-20 20:10:17,694 INFO L290 TraceCheckUtils]: 30: Hoare triple {1109#true} [201] L716-1-->L716-2: Formula: (and (= (store |v_#length_8| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4) |v_#length_7|) (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] {1109#true} is VALID [2022-02-20 20:10:17,694 INFO L290 TraceCheckUtils]: 31: Hoare triple {1109#true} [194] L716-2-->L717: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1109#true} is VALID [2022-02-20 20:10:17,694 INFO L290 TraceCheckUtils]: 32: Hoare triple {1109#true} [129] L717-->L717-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (= v_~busy~0_5 v_~inode~0_5) 1 0)) InVars {~inode~0=v_~inode~0_5, ~busy~0=v_~busy~0_5} OutVars{~inode~0=v_~inode~0_5, ~busy~0=v_~busy~0_5, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {1109#true} is VALID [2022-02-20 20:10:17,695 INFO L290 TraceCheckUtils]: 33: Hoare triple {1109#true} [168] L717-1-->L2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {1109#true} is VALID [2022-02-20 20:10:17,695 INFO L290 TraceCheckUtils]: 34: Hoare triple {1109#true} [176] L2-->L3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {1109#true} is VALID [2022-02-20 20:10:17,695 INFO L290 TraceCheckUtils]: 35: Hoare triple {1109#true} [171] L3-->L2-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] {1109#true} is VALID [2022-02-20 20:10:17,695 INFO L290 TraceCheckUtils]: 36: Hoare triple {1109#true} [139] L2-1-->L718: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1109#true} is VALID [2022-02-20 20:10:17,695 INFO L290 TraceCheckUtils]: 37: Hoare triple {1109#true} [188] L718-->L719: Formula: (= |v_#pthreadsMutex_13| (store |v_#pthreadsMutex_14| |v_~#m_inode~0.base_9| (store (select |v_#pthreadsMutex_14| |v_~#m_inode~0.base_9|) |v_~#m_inode~0.offset_9| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_14|, ~#m_inode~0.base=|v_~#m_inode~0.base_9|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_9|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_13|, ~#m_inode~0.base=|v_~#m_inode~0.base_9|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_9|} AuxVars[] AssignedVars[#pthreadsMutex] {1109#true} is VALID [2022-02-20 20:10:17,695 INFO L290 TraceCheckUtils]: 38: Hoare triple {1109#true} [178] L719-->L720: Formula: (= |v_#pthreadsMutex_15| (store |v_#pthreadsMutex_16| |v_~#m_busy~0.base_11| (store (select |v_#pthreadsMutex_16| |v_~#m_busy~0.base_11|) |v_~#m_busy~0.offset_11| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_16|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_11|, ~#m_busy~0.base=|v_~#m_busy~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_15|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_11|, ~#m_busy~0.base=|v_~#m_busy~0.base_11|} AuxVars[] AssignedVars[#pthreadsMutex] {1109#true} is VALID [2022-02-20 20:10:17,698 INFO L290 TraceCheckUtils]: 39: Hoare triple {1109#true} [136] L720-->L720-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {1109#true} is VALID [2022-02-20 20:10:17,698 INFO L290 TraceCheckUtils]: 40: Hoare triple {1109#true} [152] L720-1-->L720-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {1109#true} is VALID [2022-02-20 20:10:17,698 INFO L290 TraceCheckUtils]: 41: Hoare triple {1109#true} [200] L720-2-->L720-3: Formula: (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_13|) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {1109#true} is VALID [2022-02-20 20:10:17,698 INFO L290 TraceCheckUtils]: 42: Hoare triple {1109#true} [258] L720-3-->allocatorENTRY: Formula: (and (= v_allocatorThread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_allocatorThread1of1ForFork0_thidvar0_2) (= |v_allocatorThread1of1ForFork0_#in~_.base_4| 0) (= |v_allocatorThread1of1ForFork0_#in~_.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{allocatorThread1of1ForFork0_#t~nondet3=|v_allocatorThread1of1ForFork0_#t~nondet3_6|, allocatorThread1of1ForFork0_#t~nondet4=|v_allocatorThread1of1ForFork0_#t~nondet4_6|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, allocatorThread1of1ForFork0_#res.offset=|v_allocatorThread1of1ForFork0_#res.offset_4|, allocatorThread1of1ForFork0_~_.base=v_allocatorThread1of1ForFork0_~_.base_4, allocatorThread1of1ForFork0_~_.offset=v_allocatorThread1of1ForFork0_~_.offset_4, allocatorThread1of1ForFork0_#in~_.base=|v_allocatorThread1of1ForFork0_#in~_.base_4|, allocatorThread1of1ForFork0_#in~_.offset=|v_allocatorThread1of1ForFork0_#in~_.offset_4|, allocatorThread1of1ForFork0_#res.base=|v_allocatorThread1of1ForFork0_#res.base_4|, allocatorThread1of1ForFork0_thidvar1=v_allocatorThread1of1ForFork0_thidvar1_2, allocatorThread1of1ForFork0_thidvar0=v_allocatorThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[allocatorThread1of1ForFork0_#t~nondet3, allocatorThread1of1ForFork0_#t~nondet4, allocatorThread1of1ForFork0_#res.offset, allocatorThread1of1ForFork0_~_.base, allocatorThread1of1ForFork0_~_.offset, allocatorThread1of1ForFork0_#in~_.base, allocatorThread1of1ForFork0_#in~_.offset, allocatorThread1of1ForFork0_#res.base, allocatorThread1of1ForFork0_thidvar1, allocatorThread1of1ForFork0_thidvar0] {1109#true} is VALID [2022-02-20 20:10:17,699 INFO L290 TraceCheckUtils]: 43: Hoare triple {1109#true} [224] allocatorENTRY-->L694: Formula: (and (= |v_allocatorThread1of1ForFork0_#in~_.base_1| v_allocatorThread1of1ForFork0_~_.base_1) (= |v_allocatorThread1of1ForFork0_#in~_.offset_1| v_allocatorThread1of1ForFork0_~_.offset_1)) InVars {allocatorThread1of1ForFork0_#in~_.offset=|v_allocatorThread1of1ForFork0_#in~_.offset_1|, allocatorThread1of1ForFork0_#in~_.base=|v_allocatorThread1of1ForFork0_#in~_.base_1|} OutVars{allocatorThread1of1ForFork0_#in~_.offset=|v_allocatorThread1of1ForFork0_#in~_.offset_1|, allocatorThread1of1ForFork0_~_.base=v_allocatorThread1of1ForFork0_~_.base_1, allocatorThread1of1ForFork0_~_.offset=v_allocatorThread1of1ForFork0_~_.offset_1, allocatorThread1of1ForFork0_#in~_.base=|v_allocatorThread1of1ForFork0_#in~_.base_1|} AuxVars[] AssignedVars[allocatorThread1of1ForFork0_~_.base, allocatorThread1of1ForFork0_~_.offset] {1109#true} is VALID [2022-02-20 20:10:17,699 INFO L290 TraceCheckUtils]: 44: Hoare triple {1109#true} [225] L694-->L694-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#m_inode~0.base_1|))) (and (= (select .cse0 |v_~#m_inode~0.offset_1|) 0) (= |v_#pthreadsMutex_1| (store |v_#pthreadsMutex_2| |v_~#m_inode~0.base_1| (store .cse0 |v_~#m_inode~0.offset_1| 1))) (= |v_allocatorThread1of1ForFork0_#t~nondet3_1| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2|, ~#m_inode~0.base=|v_~#m_inode~0.base_1|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_1|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_1|, allocatorThread1of1ForFork0_#t~nondet3=|v_allocatorThread1of1ForFork0_#t~nondet3_1|, ~#m_inode~0.base=|v_~#m_inode~0.base_1|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_1|} AuxVars[] AssignedVars[#pthreadsMutex, allocatorThread1of1ForFork0_#t~nondet3] {1109#true} is VALID [2022-02-20 20:10:17,699 INFO L290 TraceCheckUtils]: 45: Hoare triple {1109#true} [226] L694-1-->L695: Formula: true InVars {} OutVars{allocatorThread1of1ForFork0_#t~nondet3=|v_allocatorThread1of1ForFork0_#t~nondet3_3|} AuxVars[] AssignedVars[allocatorThread1of1ForFork0_#t~nondet3] {1109#true} is VALID [2022-02-20 20:10:17,699 INFO L290 TraceCheckUtils]: 46: Hoare triple {1109#true} [227] L695-->L696: Formula: (= v_~inode~0_1 0) InVars {~inode~0=v_~inode~0_1} OutVars{~inode~0=v_~inode~0_1} AuxVars[] AssignedVars[] {1109#true} is VALID [2022-02-20 20:10:17,699 INFO L290 TraceCheckUtils]: 47: Hoare triple {1109#true} [229] L696-->L696-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_4| |v_~#m_busy~0.base_1|))) (and (= (select .cse0 |v_~#m_busy~0.offset_1|) 0) (= |v_allocatorThread1of1ForFork0_#t~nondet4_1| 0) (= |v_#pthreadsMutex_3| (store |v_#pthreadsMutex_4| |v_~#m_busy~0.base_1| (store .cse0 |v_~#m_busy~0.offset_1| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_4|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_1|, ~#m_busy~0.base=|v_~#m_busy~0.base_1|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_3|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_1|, allocatorThread1of1ForFork0_#t~nondet4=|v_allocatorThread1of1ForFork0_#t~nondet4_1|, ~#m_busy~0.base=|v_~#m_busy~0.base_1|} AuxVars[] AssignedVars[#pthreadsMutex, allocatorThread1of1ForFork0_#t~nondet4] {1109#true} is VALID [2022-02-20 20:10:17,700 INFO L290 TraceCheckUtils]: 48: Hoare triple {1109#true} [231] L696-1-->L697: Formula: true InVars {} OutVars{allocatorThread1of1ForFork0_#t~nondet4=|v_allocatorThread1of1ForFork0_#t~nondet4_3|} AuxVars[] AssignedVars[allocatorThread1of1ForFork0_#t~nondet4] {1109#true} is VALID [2022-02-20 20:10:17,700 INFO L290 TraceCheckUtils]: 49: Hoare triple {1109#true} [234] L697-->L698: Formula: (= v_~busy~0_1 1) InVars {} OutVars{~busy~0=v_~busy~0_1} AuxVars[] AssignedVars[~busy~0] {1109#true} is VALID [2022-02-20 20:10:17,700 INFO L290 TraceCheckUtils]: 50: Hoare triple {1109#true} [238] L698-->L699: Formula: (= |v_#pthreadsMutex_5| (store |v_#pthreadsMutex_6| |v_~#m_busy~0.base_2| (store (select |v_#pthreadsMutex_6| |v_~#m_busy~0.base_2|) |v_~#m_busy~0.offset_2| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_6|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_2|, ~#m_busy~0.base=|v_~#m_busy~0.base_2|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_5|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_2|, ~#m_busy~0.base=|v_~#m_busy~0.base_2|} AuxVars[] AssignedVars[#pthreadsMutex] {1109#true} is VALID [2022-02-20 20:10:17,701 INFO L290 TraceCheckUtils]: 51: Hoare triple {1109#true} [241] L699-->L695-2: Formula: (= v_~inode~0_2 1) InVars {} OutVars{~inode~0=v_~inode~0_2} AuxVars[] AssignedVars[~inode~0] {1109#true} is VALID [2022-02-20 20:10:17,701 INFO L290 TraceCheckUtils]: 52: Hoare triple {1109#true} [230] L695-2-->L702: Formula: (= v_~block~0_1 1) InVars {} OutVars{~block~0=v_~block~0_1} AuxVars[] AssignedVars[~block~0] {1111#(= ~block~0 1)} is VALID [2022-02-20 20:10:17,719 INFO L290 TraceCheckUtils]: 53: Hoare triple {1111#(= ~block~0 1)} [232] L702-->L702-1: Formula: (not (= v_~block~0_2 1)) InVars {~block~0=v_~block~0_2} OutVars{~block~0=v_~block~0_2} AuxVars[] AssignedVars[] {1110#false} is VALID [2022-02-20 20:10:17,719 INFO L290 TraceCheckUtils]: 54: Hoare triple {1110#false} [235] L702-1-->allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1110#false} is VALID [2022-02-20 20:10:17,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:10:17,720 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:10:17,720 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619911913] [2022-02-20 20:10:17,720 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619911913] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:10:17,720 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:10:17,720 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 20:10:17,721 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740895665] [2022-02-20 20:10:17,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:10:17,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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) Word has length 55 [2022-02-20 20:10:17,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:10:17,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-02-20 20:10:17,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:10:17,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 20:10:17,760 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:10:17,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 20:10:17,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 20:10:17,761 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 102 [2022-02-20 20:10:17,762 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 83 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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-02-20 20:10:17,762 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:10:17,762 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 102 [2022-02-20 20:10:17,762 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:10:17,800 INFO L129 PetriNetUnfolder]: 13/148 cut-off events. [2022-02-20 20:10:17,800 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-02-20 20:10:17,801 INFO L84 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 148 events. 13/148 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 395 event pairs, 2 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 143. Up to 24 conditions per place. [2022-02-20 20:10:17,801 INFO L132 encePairwiseOnDemand]: 97/102 looper letters, 12 selfloop transitions, 3 changer transitions 1/88 dead transitions. [2022-02-20 20:10:17,801 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 88 transitions, 217 flow [2022-02-20 20:10:17,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 20:10:17,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-02-20 20:10:17,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 275 transitions. [2022-02-20 20:10:17,805 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8986928104575164 [2022-02-20 20:10:17,805 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 275 transitions. [2022-02-20 20:10:17,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 275 transitions. [2022-02-20 20:10:17,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:10:17,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 275 transitions. [2022-02-20 20:10:17,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 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-02-20 20:10:17,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 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-02-20 20:10:17,807 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 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-02-20 20:10:17,807 INFO L186 Difference]: Start difference. First operand has 89 places, 83 transitions, 174 flow. Second operand 3 states and 275 transitions. [2022-02-20 20:10:17,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 88 transitions, 217 flow [2022-02-20 20:10:17,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 88 transitions, 213 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-02-20 20:10:17,809 INFO L242 Difference]: Finished difference. Result has 90 places, 84 transitions, 192 flow [2022-02-20 20:10:17,810 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=90, PETRI_TRANSITIONS=84} [2022-02-20 20:10:17,810 INFO L334 CegarLoopForPetriNet]: 92 programPoint places, -2 predicate places. [2022-02-20 20:10:17,810 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 84 transitions, 192 flow [2022-02-20 20:10:17,828 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1106 states, 1100 states have (on average 2.4154545454545455) internal successors, (2657), 1105 states have internal predecessors, (2657), 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-02-20 20:10:17,831 INFO L78 Accepts]: Start accepts. Automaton has has 1106 states, 1100 states have (on average 2.4154545454545455) internal successors, (2657), 1105 states have internal predecessors, (2657), 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) Word has length 55 [2022-02-20 20:10:17,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:10:17,831 INFO L470 AbstractCegarLoop]: Abstraction has has 90 places, 84 transitions, 192 flow [2022-02-20 20:10:17,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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-02-20 20:10:17,832 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:10:17,832 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:10:17,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:10:17,833 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting de_allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION === [allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION, de_allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-20 20:10:17,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:10:17,834 INFO L85 PathProgramCache]: Analyzing trace with hash 2030798540, now seen corresponding path program 1 times [2022-02-20 20:10:17,834 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:10:17,834 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563004134] [2022-02-20 20:10:17,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:10:17,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:10:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:10:17,883 INFO L290 TraceCheckUtils]: 0: Hoare triple {2222#true} [204] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2222#true} is VALID [2022-02-20 20:10:17,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {2222#true} [147] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2222#true} is VALID [2022-02-20 20:10:17,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {2222#true} [209] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] {2222#true} is VALID [2022-02-20 20:10:17,884 INFO L290 TraceCheckUtils]: 3: Hoare triple {2222#true} [211] L-1-2-->L16: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {2222#true} is VALID [2022-02-20 20:10:17,884 INFO L290 TraceCheckUtils]: 4: Hoare triple {2222#true} [192] L16-->L16-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {2222#true} is VALID [2022-02-20 20:10:17,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {2222#true} [125] L16-1-->L16-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {2222#true} is VALID [2022-02-20 20:10:17,885 INFO L290 TraceCheckUtils]: 6: Hoare triple {2222#true} [220] L16-2-->L16-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {2222#true} is VALID [2022-02-20 20:10:17,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {2222#true} [199] L16-3-->L16-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= (select |v_#length_2| 2) 17)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {2222#true} is VALID [2022-02-20 20:10:17,885 INFO L290 TraceCheckUtils]: 8: Hoare triple {2222#true} [156] L16-4-->L689: Formula: (= v_~block~0_7 0) InVars {} OutVars{~block~0=v_~block~0_7} AuxVars[] AssignedVars[~block~0] {2222#true} is VALID [2022-02-20 20:10:17,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {2222#true} [183] L689-->L690: Formula: (= v_~busy~0_4 0) InVars {} OutVars{~busy~0=v_~busy~0_4} AuxVars[] AssignedVars[~busy~0] {2222#true} is VALID [2022-02-20 20:10:17,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {2222#true} [167] L690-->L691: Formula: (= v_~inode~0_4 0) InVars {} OutVars{~inode~0=v_~inode~0_4} AuxVars[] AssignedVars[~inode~0] {2222#true} is VALID [2022-02-20 20:10:17,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {2222#true} [143] L691-->L691-1: Formula: (and (= |v_~#m_inode~0.base_3| 3) (= |v_~#m_inode~0.offset_3| 0)) InVars {} OutVars{~#m_inode~0.offset=|v_~#m_inode~0.offset_3|, ~#m_inode~0.base=|v_~#m_inode~0.base_3|} AuxVars[] AssignedVars[~#m_inode~0.offset, ~#m_inode~0.base] {2222#true} is VALID [2022-02-20 20:10:17,886 INFO L290 TraceCheckUtils]: 12: Hoare triple {2222#true} [223] L691-1-->L691-2: Formula: (and (= (select |v_#length_3| 3) 24) (= (select |v_#valid_4| 3) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {2222#true} is VALID [2022-02-20 20:10:17,886 INFO L290 TraceCheckUtils]: 13: Hoare triple {2222#true} [141] L691-2-->L691-3: Formula: (= (select (select |v_#memory_int_3| |v_~#m_inode~0.base_4|) |v_~#m_inode~0.offset_4|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#m_inode~0.base=|v_~#m_inode~0.base_4|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_4|} OutVars{#memory_int=|v_#memory_int_3|, ~#m_inode~0.base=|v_~#m_inode~0.base_4|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_4|} AuxVars[] AssignedVars[] {2222#true} is VALID [2022-02-20 20:10:17,886 INFO L290 TraceCheckUtils]: 14: Hoare triple {2222#true} [166] L691-3-->L691-4: Formula: (= (select (select |v_#memory_int_4| |v_~#m_inode~0.base_5|) (+ |v_~#m_inode~0.offset_5| 4)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#m_inode~0.base=|v_~#m_inode~0.base_5|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_5|} OutVars{#memory_int=|v_#memory_int_4|, ~#m_inode~0.base=|v_~#m_inode~0.base_5|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_5|} AuxVars[] AssignedVars[] {2222#true} is VALID [2022-02-20 20:10:17,886 INFO L290 TraceCheckUtils]: 15: Hoare triple {2222#true} [212] L691-4-->L691-5: Formula: (= (select (select |v_#memory_int_5| |v_~#m_inode~0.base_6|) (+ 8 |v_~#m_inode~0.offset_6|)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#m_inode~0.base=|v_~#m_inode~0.base_6|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_6|} OutVars{#memory_int=|v_#memory_int_5|, ~#m_inode~0.base=|v_~#m_inode~0.base_6|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_6|} AuxVars[] AssignedVars[] {2222#true} is VALID [2022-02-20 20:10:17,887 INFO L290 TraceCheckUtils]: 16: Hoare triple {2222#true} [184] L691-5-->L691-6: Formula: (= 0 (select (select |v_#memory_int_6| |v_~#m_inode~0.base_7|) (+ 12 |v_~#m_inode~0.offset_7|))) InVars {#memory_int=|v_#memory_int_6|, ~#m_inode~0.base=|v_~#m_inode~0.base_7|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_7|} OutVars{#memory_int=|v_#memory_int_6|, ~#m_inode~0.base=|v_~#m_inode~0.base_7|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_7|} AuxVars[] AssignedVars[] {2222#true} is VALID [2022-02-20 20:10:17,887 INFO L290 TraceCheckUtils]: 17: Hoare triple {2222#true} [191] L691-6-->L691-7: Formula: (= (select (select |v_#memory_int_7| |v_~#m_inode~0.base_8|) (+ 16 |v_~#m_inode~0.offset_8|)) 0) InVars {#memory_int=|v_#memory_int_7|, ~#m_inode~0.base=|v_~#m_inode~0.base_8|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_8|} OutVars{#memory_int=|v_#memory_int_7|, ~#m_inode~0.base=|v_~#m_inode~0.base_8|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_8|} AuxVars[] AssignedVars[] {2222#true} is VALID [2022-02-20 20:10:17,887 INFO L290 TraceCheckUtils]: 18: Hoare triple {2222#true} [189] L691-7-->L692: Formula: (and (= |v_~#m_busy~0.base_5| 4) (= |v_~#m_busy~0.offset_5| 0)) InVars {} OutVars{~#m_busy~0.offset=|v_~#m_busy~0.offset_5|, ~#m_busy~0.base=|v_~#m_busy~0.base_5|} AuxVars[] AssignedVars[~#m_busy~0.offset, ~#m_busy~0.base] {2222#true} is VALID [2022-02-20 20:10:17,887 INFO L290 TraceCheckUtils]: 19: Hoare triple {2222#true} [142] L692-->L692-1: Formula: (and (= (select |v_#length_4| 4) 24) (= (select |v_#valid_5| 4) 1)) InVars {#length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] {2222#true} is VALID [2022-02-20 20:10:17,887 INFO L290 TraceCheckUtils]: 20: Hoare triple {2222#true} [151] L692-1-->L692-2: Formula: (= (select (select |v_#memory_int_8| |v_~#m_busy~0.base_6|) |v_~#m_busy~0.offset_6|) 0) InVars {#memory_int=|v_#memory_int_8|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_6|, ~#m_busy~0.base=|v_~#m_busy~0.base_6|} OutVars{#memory_int=|v_#memory_int_8|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_6|, ~#m_busy~0.base=|v_~#m_busy~0.base_6|} AuxVars[] AssignedVars[] {2222#true} is VALID [2022-02-20 20:10:17,888 INFO L290 TraceCheckUtils]: 21: Hoare triple {2222#true} [133] L692-2-->L692-3: Formula: (= (select (select |v_#memory_int_9| |v_~#m_busy~0.base_7|) (+ |v_~#m_busy~0.offset_7| 4)) 0) InVars {#memory_int=|v_#memory_int_9|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_7|, ~#m_busy~0.base=|v_~#m_busy~0.base_7|} OutVars{#memory_int=|v_#memory_int_9|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_7|, ~#m_busy~0.base=|v_~#m_busy~0.base_7|} AuxVars[] AssignedVars[] {2222#true} is VALID [2022-02-20 20:10:17,888 INFO L290 TraceCheckUtils]: 22: Hoare triple {2222#true} [195] L692-3-->L692-4: Formula: (= (select (select |v_#memory_int_10| |v_~#m_busy~0.base_8|) (+ |v_~#m_busy~0.offset_8| 8)) 0) InVars {#memory_int=|v_#memory_int_10|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_8|, ~#m_busy~0.base=|v_~#m_busy~0.base_8|} OutVars{#memory_int=|v_#memory_int_10|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_8|, ~#m_busy~0.base=|v_~#m_busy~0.base_8|} AuxVars[] AssignedVars[] {2222#true} is VALID [2022-02-20 20:10:17,888 INFO L290 TraceCheckUtils]: 23: Hoare triple {2222#true} [181] L692-4-->L692-5: Formula: (= (select (select |v_#memory_int_11| |v_~#m_busy~0.base_9|) (+ |v_~#m_busy~0.offset_9| 12)) 0) InVars {#memory_int=|v_#memory_int_11|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_9|, ~#m_busy~0.base=|v_~#m_busy~0.base_9|} OutVars{#memory_int=|v_#memory_int_11|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_9|, ~#m_busy~0.base=|v_~#m_busy~0.base_9|} AuxVars[] AssignedVars[] {2222#true} is VALID [2022-02-20 20:10:17,888 INFO L290 TraceCheckUtils]: 24: Hoare triple {2222#true} [146] L692-5-->L692-6: Formula: (= (select (select |v_#memory_int_12| |v_~#m_busy~0.base_10|) (+ 16 |v_~#m_busy~0.offset_10|)) 0) InVars {#memory_int=|v_#memory_int_12|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_10|, ~#m_busy~0.base=|v_~#m_busy~0.base_10|} OutVars{#memory_int=|v_#memory_int_12|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_10|, ~#m_busy~0.base=|v_~#m_busy~0.base_10|} AuxVars[] AssignedVars[] {2222#true} is VALID [2022-02-20 20:10:17,888 INFO L290 TraceCheckUtils]: 25: Hoare triple {2222#true} [221] L692-6-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2222#true} is VALID [2022-02-20 20:10:17,888 INFO L290 TraceCheckUtils]: 26: Hoare triple {2222#true} [216] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2222#true} is VALID [2022-02-20 20:10:17,889 INFO L290 TraceCheckUtils]: 27: Hoare triple {2222#true} [153] L-1-4-->L-1-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {2222#true} is VALID [2022-02-20 20:10:17,889 INFO L290 TraceCheckUtils]: 28: Hoare triple {2222#true} [128] L-1-5-->L716: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_#t~pre8#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem10#1, ULTIMATE.start_main_~#t2~0#1.base] {2222#true} is VALID [2022-02-20 20:10:17,889 INFO L290 TraceCheckUtils]: 29: Hoare triple {2222#true} [155] L716-->L716-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4) |v_#length_5|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_main_~#t1~0#1.base_2|)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] {2222#true} is VALID [2022-02-20 20:10:17,889 INFO L290 TraceCheckUtils]: 30: Hoare triple {2222#true} [201] L716-1-->L716-2: Formula: (and (= (store |v_#length_8| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4) |v_#length_7|) (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] {2222#true} is VALID [2022-02-20 20:10:17,889 INFO L290 TraceCheckUtils]: 31: Hoare triple {2222#true} [194] L716-2-->L717: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2222#true} is VALID [2022-02-20 20:10:17,890 INFO L290 TraceCheckUtils]: 32: Hoare triple {2222#true} [129] L717-->L717-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (= v_~busy~0_5 v_~inode~0_5) 1 0)) InVars {~inode~0=v_~inode~0_5, ~busy~0=v_~busy~0_5} OutVars{~inode~0=v_~inode~0_5, ~busy~0=v_~busy~0_5, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {2222#true} is VALID [2022-02-20 20:10:17,890 INFO L290 TraceCheckUtils]: 33: Hoare triple {2222#true} [168] L717-1-->L2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {2222#true} is VALID [2022-02-20 20:10:17,890 INFO L290 TraceCheckUtils]: 34: Hoare triple {2222#true} [176] L2-->L3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {2222#true} is VALID [2022-02-20 20:10:17,890 INFO L290 TraceCheckUtils]: 35: Hoare triple {2222#true} [171] L3-->L2-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] {2222#true} is VALID [2022-02-20 20:10:17,890 INFO L290 TraceCheckUtils]: 36: Hoare triple {2222#true} [139] L2-1-->L718: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2222#true} is VALID [2022-02-20 20:10:17,890 INFO L290 TraceCheckUtils]: 37: Hoare triple {2222#true} [188] L718-->L719: Formula: (= |v_#pthreadsMutex_13| (store |v_#pthreadsMutex_14| |v_~#m_inode~0.base_9| (store (select |v_#pthreadsMutex_14| |v_~#m_inode~0.base_9|) |v_~#m_inode~0.offset_9| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_14|, ~#m_inode~0.base=|v_~#m_inode~0.base_9|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_9|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_13|, ~#m_inode~0.base=|v_~#m_inode~0.base_9|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_9|} AuxVars[] AssignedVars[#pthreadsMutex] {2222#true} is VALID [2022-02-20 20:10:17,891 INFO L290 TraceCheckUtils]: 38: Hoare triple {2222#true} [178] L719-->L720: Formula: (= |v_#pthreadsMutex_15| (store |v_#pthreadsMutex_16| |v_~#m_busy~0.base_11| (store (select |v_#pthreadsMutex_16| |v_~#m_busy~0.base_11|) |v_~#m_busy~0.offset_11| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_16|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_11|, ~#m_busy~0.base=|v_~#m_busy~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_15|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_11|, ~#m_busy~0.base=|v_~#m_busy~0.base_11|} AuxVars[] AssignedVars[#pthreadsMutex] {2222#true} is VALID [2022-02-20 20:10:17,891 INFO L290 TraceCheckUtils]: 39: Hoare triple {2222#true} [136] L720-->L720-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {2222#true} is VALID [2022-02-20 20:10:17,891 INFO L290 TraceCheckUtils]: 40: Hoare triple {2222#true} [152] L720-1-->L720-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {2222#true} is VALID [2022-02-20 20:10:17,891 INFO L290 TraceCheckUtils]: 41: Hoare triple {2222#true} [200] L720-2-->L720-3: Formula: (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_13|) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {2222#true} is VALID [2022-02-20 20:10:17,891 INFO L290 TraceCheckUtils]: 42: Hoare triple {2222#true} [258] L720-3-->allocatorENTRY: Formula: (and (= v_allocatorThread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_allocatorThread1of1ForFork0_thidvar0_2) (= |v_allocatorThread1of1ForFork0_#in~_.base_4| 0) (= |v_allocatorThread1of1ForFork0_#in~_.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{allocatorThread1of1ForFork0_#t~nondet3=|v_allocatorThread1of1ForFork0_#t~nondet3_6|, allocatorThread1of1ForFork0_#t~nondet4=|v_allocatorThread1of1ForFork0_#t~nondet4_6|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, allocatorThread1of1ForFork0_#res.offset=|v_allocatorThread1of1ForFork0_#res.offset_4|, allocatorThread1of1ForFork0_~_.base=v_allocatorThread1of1ForFork0_~_.base_4, allocatorThread1of1ForFork0_~_.offset=v_allocatorThread1of1ForFork0_~_.offset_4, allocatorThread1of1ForFork0_#in~_.base=|v_allocatorThread1of1ForFork0_#in~_.base_4|, allocatorThread1of1ForFork0_#in~_.offset=|v_allocatorThread1of1ForFork0_#in~_.offset_4|, allocatorThread1of1ForFork0_#res.base=|v_allocatorThread1of1ForFork0_#res.base_4|, allocatorThread1of1ForFork0_thidvar1=v_allocatorThread1of1ForFork0_thidvar1_2, allocatorThread1of1ForFork0_thidvar0=v_allocatorThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[allocatorThread1of1ForFork0_#t~nondet3, allocatorThread1of1ForFork0_#t~nondet4, allocatorThread1of1ForFork0_#res.offset, allocatorThread1of1ForFork0_~_.base, allocatorThread1of1ForFork0_~_.offset, allocatorThread1of1ForFork0_#in~_.base, allocatorThread1of1ForFork0_#in~_.offset, allocatorThread1of1ForFork0_#res.base, allocatorThread1of1ForFork0_thidvar1, allocatorThread1of1ForFork0_thidvar0] {2222#true} is VALID [2022-02-20 20:10:17,892 INFO L290 TraceCheckUtils]: 43: Hoare triple {2222#true} [159] L720-4-->L720-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {2222#true} is VALID [2022-02-20 20:10:17,892 INFO L290 TraceCheckUtils]: 44: Hoare triple {2222#true} [208] L720-5-->L721: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] {2222#true} is VALID [2022-02-20 20:10:17,892 INFO L290 TraceCheckUtils]: 45: Hoare triple {2222#true} [186] L721-->L721-1: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1] {2222#true} is VALID [2022-02-20 20:10:17,892 INFO L290 TraceCheckUtils]: 46: Hoare triple {2222#true} [165] L721-1-->L721-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {2222#true} is VALID [2022-02-20 20:10:17,892 INFO L290 TraceCheckUtils]: 47: Hoare triple {2222#true} [179] L721-2-->L721-3: Formula: (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre8#1_3|)) |v_#memory_int_15|) InVars {#memory_int=|v_#memory_int_16|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{#memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {2222#true} is VALID [2022-02-20 20:10:17,892 INFO L290 TraceCheckUtils]: 48: Hoare triple {2222#true} [260] L721-3-->de_allocatorENTRY: Formula: (and (= v_de_allocatorThread1of1ForFork1_thidvar2_2 0) (= v_de_allocatorThread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre8#1_6| v_de_allocatorThread1of1ForFork1_thidvar0_2) (= |v_de_allocatorThread1of1ForFork1_#in~_.base_4| 0) (= 0 |v_de_allocatorThread1of1ForFork1_#in~_.offset_4|)) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_6|} OutVars{de_allocatorThread1of1ForFork1_~_.offset=v_de_allocatorThread1of1ForFork1_~_.offset_4, de_allocatorThread1of1ForFork1_thidvar0=v_de_allocatorThread1of1ForFork1_thidvar0_2, de_allocatorThread1of1ForFork1_#t~nondet5=|v_de_allocatorThread1of1ForFork1_#t~nondet5_6|, de_allocatorThread1of1ForFork1_~_.base=v_de_allocatorThread1of1ForFork1_~_.base_4, de_allocatorThread1of1ForFork1_#res.base=|v_de_allocatorThread1of1ForFork1_#res.base_4|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_6|, de_allocatorThread1of1ForFork1_#in~_.base=|v_de_allocatorThread1of1ForFork1_#in~_.base_4|, de_allocatorThread1of1ForFork1_#res.offset=|v_de_allocatorThread1of1ForFork1_#res.offset_4|, de_allocatorThread1of1ForFork1_thidvar1=v_de_allocatorThread1of1ForFork1_thidvar1_2, de_allocatorThread1of1ForFork1_thidvar2=v_de_allocatorThread1of1ForFork1_thidvar2_2, de_allocatorThread1of1ForFork1_#in~_.offset=|v_de_allocatorThread1of1ForFork1_#in~_.offset_4|} AuxVars[] AssignedVars[de_allocatorThread1of1ForFork1_~_.offset, de_allocatorThread1of1ForFork1_thidvar0, de_allocatorThread1of1ForFork1_#t~nondet5, de_allocatorThread1of1ForFork1_~_.base, de_allocatorThread1of1ForFork1_#res.base, de_allocatorThread1of1ForFork1_#in~_.base, de_allocatorThread1of1ForFork1_#res.offset, de_allocatorThread1of1ForFork1_thidvar1, de_allocatorThread1of1ForFork1_thidvar2, de_allocatorThread1of1ForFork1_#in~_.offset] {2222#true} is VALID [2022-02-20 20:10:17,893 INFO L290 TraceCheckUtils]: 49: Hoare triple {2222#true} [243] de_allocatorENTRY-->L707: Formula: (and (= v_de_allocatorThread1of1ForFork1_~_.offset_1 |v_de_allocatorThread1of1ForFork1_#in~_.offset_1|) (= |v_de_allocatorThread1of1ForFork1_#in~_.base_1| v_de_allocatorThread1of1ForFork1_~_.base_1)) InVars {de_allocatorThread1of1ForFork1_#in~_.base=|v_de_allocatorThread1of1ForFork1_#in~_.base_1|, de_allocatorThread1of1ForFork1_#in~_.offset=|v_de_allocatorThread1of1ForFork1_#in~_.offset_1|} OutVars{de_allocatorThread1of1ForFork1_#in~_.base=|v_de_allocatorThread1of1ForFork1_#in~_.base_1|, de_allocatorThread1of1ForFork1_~_.offset=v_de_allocatorThread1of1ForFork1_~_.offset_1, de_allocatorThread1of1ForFork1_~_.base=v_de_allocatorThread1of1ForFork1_~_.base_1, de_allocatorThread1of1ForFork1_#in~_.offset=|v_de_allocatorThread1of1ForFork1_#in~_.offset_1|} AuxVars[] AssignedVars[de_allocatorThread1of1ForFork1_~_.offset, de_allocatorThread1of1ForFork1_~_.base] {2222#true} is VALID [2022-02-20 20:10:17,893 INFO L290 TraceCheckUtils]: 50: Hoare triple {2222#true} [244] L707-->L707-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_12| |v_~#m_busy~0.base_4|))) (and (= (store |v_#pthreadsMutex_12| |v_~#m_busy~0.base_4| (store .cse0 |v_~#m_busy~0.offset_4| 1)) |v_#pthreadsMutex_11|) (= |v_de_allocatorThread1of1ForFork1_#t~nondet5_1| 0) (= (select .cse0 |v_~#m_busy~0.offset_4|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_12|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_4|, ~#m_busy~0.base=|v_~#m_busy~0.base_4|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_11|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_4|, ~#m_busy~0.base=|v_~#m_busy~0.base_4|, de_allocatorThread1of1ForFork1_#t~nondet5=|v_de_allocatorThread1of1ForFork1_#t~nondet5_1|} AuxVars[] AssignedVars[#pthreadsMutex, de_allocatorThread1of1ForFork1_#t~nondet5] {2222#true} is VALID [2022-02-20 20:10:17,893 INFO L290 TraceCheckUtils]: 51: Hoare triple {2222#true} [245] L707-1-->L708: Formula: true InVars {} OutVars{de_allocatorThread1of1ForFork1_#t~nondet5=|v_de_allocatorThread1of1ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[de_allocatorThread1of1ForFork1_#t~nondet5] {2222#true} is VALID [2022-02-20 20:10:17,893 INFO L290 TraceCheckUtils]: 52: Hoare triple {2222#true} [246] L708-->L709: Formula: (= v_~busy~0_2 0) InVars {~busy~0=v_~busy~0_2} OutVars{~busy~0=v_~busy~0_2} AuxVars[] AssignedVars[] {2222#true} is VALID [2022-02-20 20:10:17,894 INFO L290 TraceCheckUtils]: 53: Hoare triple {2222#true} [248] L709-->L710: Formula: (= v_~block~0_4 0) InVars {} OutVars{~block~0=v_~block~0_4} AuxVars[] AssignedVars[~block~0] {2224#(= ~block~0 0)} is VALID [2022-02-20 20:10:17,894 INFO L290 TraceCheckUtils]: 54: Hoare triple {2224#(= ~block~0 0)} [250] L710-->L710-1: Formula: (not (= v_~block~0_5 0)) InVars {~block~0=v_~block~0_5} OutVars{~block~0=v_~block~0_5} AuxVars[] AssignedVars[] {2223#false} is VALID [2022-02-20 20:10:17,894 INFO L290 TraceCheckUtils]: 55: Hoare triple {2223#false} [253] L710-1-->de_allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2223#false} is VALID [2022-02-20 20:10:17,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:10:17,895 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:10:17,895 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563004134] [2022-02-20 20:10:17,895 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563004134] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:10:17,895 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:10:17,895 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 20:10:17,895 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619484767] [2022-02-20 20:10:17,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:10:17,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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) Word has length 56 [2022-02-20 20:10:17,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:10:17,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-02-20 20:10:17,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:10:17,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 20:10:17,929 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:10:17,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 20:10:17,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 20:10:17,930 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 102 [2022-02-20 20:10:17,930 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 84 transitions, 192 flow. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 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-02-20 20:10:17,930 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:10:17,930 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 102 [2022-02-20 20:10:17,930 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:10:17,961 INFO L129 PetriNetUnfolder]: 7/131 cut-off events. [2022-02-20 20:10:17,961 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-02-20 20:10:17,962 INFO L84 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 131 events. 7/131 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 301 event pairs, 3 based on Foata normal form. 7/136 useless extension candidates. Maximal degree in co-relation 126. Up to 19 conditions per place. [2022-02-20 20:10:17,962 INFO L132 encePairwiseOnDemand]: 97/102 looper letters, 9 selfloop transitions, 3 changer transitions 1/85 dead transitions. [2022-02-20 20:10:17,962 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 85 transitions, 219 flow [2022-02-20 20:10:17,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 20:10:17,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-02-20 20:10:17,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2022-02-20 20:10:17,965 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8921568627450981 [2022-02-20 20:10:17,965 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 273 transitions. [2022-02-20 20:10:17,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 273 transitions. [2022-02-20 20:10:17,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:10:17,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 273 transitions. [2022-02-20 20:10:17,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 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-02-20 20:10:17,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 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-02-20 20:10:17,967 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 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-02-20 20:10:17,968 INFO L186 Difference]: Start difference. First operand has 90 places, 84 transitions, 192 flow. Second operand 3 states and 273 transitions. [2022-02-20 20:10:17,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 85 transitions, 219 flow [2022-02-20 20:10:17,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 85 transitions, 215 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-02-20 20:10:17,970 INFO L242 Difference]: Finished difference. Result has 91 places, 83 transitions, 193 flow [2022-02-20 20:10:17,971 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=193, PETRI_PLACES=91, PETRI_TRANSITIONS=83} [2022-02-20 20:10:17,971 INFO L334 CegarLoopForPetriNet]: 92 programPoint places, -1 predicate places. [2022-02-20 20:10:17,971 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 91 places, 83 transitions, 193 flow [2022-02-20 20:10:17,993 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 964 states, 960 states have (on average 2.353125) internal successors, (2259), 963 states have internal predecessors, (2259), 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-02-20 20:10:17,995 INFO L78 Accepts]: Start accepts. Automaton has has 964 states, 960 states have (on average 2.353125) internal successors, (2259), 963 states have internal predecessors, (2259), 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) Word has length 56 [2022-02-20 20:10:17,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:10:17,996 INFO L470 AbstractCegarLoop]: Abstraction has has 91 places, 83 transitions, 193 flow [2022-02-20 20:10:17,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 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-02-20 20:10:17,996 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:10:17,996 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:10:17,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 20:10:17,996 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting de_allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION === [allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION, de_allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-20 20:10:17,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:10:17,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1735004983, now seen corresponding path program 1 times [2022-02-20 20:10:17,997 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:10:17,997 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445344530] [2022-02-20 20:10:17,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:10:17,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:10:18,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:10:18,137 INFO L290 TraceCheckUtils]: 0: Hoare triple {3192#true} [204] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3192#true} is VALID [2022-02-20 20:10:18,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {3192#true} [147] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3192#true} is VALID [2022-02-20 20:10:18,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {3192#true} [209] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] {3192#true} is VALID [2022-02-20 20:10:18,137 INFO L290 TraceCheckUtils]: 3: Hoare triple {3192#true} [211] L-1-2-->L16: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {3192#true} is VALID [2022-02-20 20:10:18,138 INFO L290 TraceCheckUtils]: 4: Hoare triple {3192#true} [192] L16-->L16-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {3192#true} is VALID [2022-02-20 20:10:18,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {3192#true} [125] L16-1-->L16-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {3192#true} is VALID [2022-02-20 20:10:18,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {3192#true} [220] L16-2-->L16-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {3192#true} is VALID [2022-02-20 20:10:18,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {3192#true} [199] L16-3-->L16-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= (select |v_#length_2| 2) 17)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {3192#true} is VALID [2022-02-20 20:10:18,138 INFO L290 TraceCheckUtils]: 8: Hoare triple {3192#true} [156] L16-4-->L689: Formula: (= v_~block~0_7 0) InVars {} OutVars{~block~0=v_~block~0_7} AuxVars[] AssignedVars[~block~0] {3192#true} is VALID [2022-02-20 20:10:18,138 INFO L290 TraceCheckUtils]: 9: Hoare triple {3192#true} [183] L689-->L690: Formula: (= v_~busy~0_4 0) InVars {} OutVars{~busy~0=v_~busy~0_4} AuxVars[] AssignedVars[~busy~0] {3192#true} is VALID [2022-02-20 20:10:18,139 INFO L290 TraceCheckUtils]: 10: Hoare triple {3192#true} [167] L690-->L691: Formula: (= v_~inode~0_4 0) InVars {} OutVars{~inode~0=v_~inode~0_4} AuxVars[] AssignedVars[~inode~0] {3192#true} is VALID [2022-02-20 20:10:18,139 INFO L290 TraceCheckUtils]: 11: Hoare triple {3192#true} [143] L691-->L691-1: Formula: (and (= |v_~#m_inode~0.base_3| 3) (= |v_~#m_inode~0.offset_3| 0)) InVars {} OutVars{~#m_inode~0.offset=|v_~#m_inode~0.offset_3|, ~#m_inode~0.base=|v_~#m_inode~0.base_3|} AuxVars[] AssignedVars[~#m_inode~0.offset, ~#m_inode~0.base] {3194#(<= |~#m_inode~0.base| 3)} is VALID [2022-02-20 20:10:18,140 INFO L290 TraceCheckUtils]: 12: Hoare triple {3194#(<= |~#m_inode~0.base| 3)} [223] L691-1-->L691-2: Formula: (and (= (select |v_#length_3| 3) 24) (= (select |v_#valid_4| 3) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {3194#(<= |~#m_inode~0.base| 3)} is VALID [2022-02-20 20:10:18,140 INFO L290 TraceCheckUtils]: 13: Hoare triple {3194#(<= |~#m_inode~0.base| 3)} [141] L691-2-->L691-3: Formula: (= (select (select |v_#memory_int_3| |v_~#m_inode~0.base_4|) |v_~#m_inode~0.offset_4|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#m_inode~0.base=|v_~#m_inode~0.base_4|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_4|} OutVars{#memory_int=|v_#memory_int_3|, ~#m_inode~0.base=|v_~#m_inode~0.base_4|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_4|} AuxVars[] AssignedVars[] {3194#(<= |~#m_inode~0.base| 3)} is VALID [2022-02-20 20:10:18,141 INFO L290 TraceCheckUtils]: 14: Hoare triple {3194#(<= |~#m_inode~0.base| 3)} [166] L691-3-->L691-4: Formula: (= (select (select |v_#memory_int_4| |v_~#m_inode~0.base_5|) (+ |v_~#m_inode~0.offset_5| 4)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#m_inode~0.base=|v_~#m_inode~0.base_5|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_5|} OutVars{#memory_int=|v_#memory_int_4|, ~#m_inode~0.base=|v_~#m_inode~0.base_5|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_5|} AuxVars[] AssignedVars[] {3194#(<= |~#m_inode~0.base| 3)} is VALID [2022-02-20 20:10:18,141 INFO L290 TraceCheckUtils]: 15: Hoare triple {3194#(<= |~#m_inode~0.base| 3)} [212] L691-4-->L691-5: Formula: (= (select (select |v_#memory_int_5| |v_~#m_inode~0.base_6|) (+ 8 |v_~#m_inode~0.offset_6|)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#m_inode~0.base=|v_~#m_inode~0.base_6|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_6|} OutVars{#memory_int=|v_#memory_int_5|, ~#m_inode~0.base=|v_~#m_inode~0.base_6|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_6|} AuxVars[] AssignedVars[] {3194#(<= |~#m_inode~0.base| 3)} is VALID [2022-02-20 20:10:18,141 INFO L290 TraceCheckUtils]: 16: Hoare triple {3194#(<= |~#m_inode~0.base| 3)} [184] L691-5-->L691-6: Formula: (= 0 (select (select |v_#memory_int_6| |v_~#m_inode~0.base_7|) (+ 12 |v_~#m_inode~0.offset_7|))) InVars {#memory_int=|v_#memory_int_6|, ~#m_inode~0.base=|v_~#m_inode~0.base_7|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_7|} OutVars{#memory_int=|v_#memory_int_6|, ~#m_inode~0.base=|v_~#m_inode~0.base_7|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_7|} AuxVars[] AssignedVars[] {3194#(<= |~#m_inode~0.base| 3)} is VALID [2022-02-20 20:10:18,142 INFO L290 TraceCheckUtils]: 17: Hoare triple {3194#(<= |~#m_inode~0.base| 3)} [191] L691-6-->L691-7: Formula: (= (select (select |v_#memory_int_7| |v_~#m_inode~0.base_8|) (+ 16 |v_~#m_inode~0.offset_8|)) 0) InVars {#memory_int=|v_#memory_int_7|, ~#m_inode~0.base=|v_~#m_inode~0.base_8|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_8|} OutVars{#memory_int=|v_#memory_int_7|, ~#m_inode~0.base=|v_~#m_inode~0.base_8|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_8|} AuxVars[] AssignedVars[] {3194#(<= |~#m_inode~0.base| 3)} is VALID [2022-02-20 20:10:18,142 INFO L290 TraceCheckUtils]: 18: Hoare triple {3194#(<= |~#m_inode~0.base| 3)} [189] L691-7-->L692: Formula: (and (= |v_~#m_busy~0.base_5| 4) (= |v_~#m_busy~0.offset_5| 0)) InVars {} OutVars{~#m_busy~0.offset=|v_~#m_busy~0.offset_5|, ~#m_busy~0.base=|v_~#m_busy~0.base_5|} AuxVars[] AssignedVars[~#m_busy~0.offset, ~#m_busy~0.base] {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} is VALID [2022-02-20 20:10:18,143 INFO L290 TraceCheckUtils]: 19: Hoare triple {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} [142] L692-->L692-1: Formula: (and (= (select |v_#length_4| 4) 24) (= (select |v_#valid_5| 4) 1)) InVars {#length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} is VALID [2022-02-20 20:10:18,145 INFO L290 TraceCheckUtils]: 20: Hoare triple {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} [151] L692-1-->L692-2: Formula: (= (select (select |v_#memory_int_8| |v_~#m_busy~0.base_6|) |v_~#m_busy~0.offset_6|) 0) InVars {#memory_int=|v_#memory_int_8|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_6|, ~#m_busy~0.base=|v_~#m_busy~0.base_6|} OutVars{#memory_int=|v_#memory_int_8|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_6|, ~#m_busy~0.base=|v_~#m_busy~0.base_6|} AuxVars[] AssignedVars[] {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} is VALID [2022-02-20 20:10:18,145 INFO L290 TraceCheckUtils]: 21: Hoare triple {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} [133] L692-2-->L692-3: Formula: (= (select (select |v_#memory_int_9| |v_~#m_busy~0.base_7|) (+ |v_~#m_busy~0.offset_7| 4)) 0) InVars {#memory_int=|v_#memory_int_9|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_7|, ~#m_busy~0.base=|v_~#m_busy~0.base_7|} OutVars{#memory_int=|v_#memory_int_9|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_7|, ~#m_busy~0.base=|v_~#m_busy~0.base_7|} AuxVars[] AssignedVars[] {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} is VALID [2022-02-20 20:10:18,145 INFO L290 TraceCheckUtils]: 22: Hoare triple {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} [195] L692-3-->L692-4: Formula: (= (select (select |v_#memory_int_10| |v_~#m_busy~0.base_8|) (+ |v_~#m_busy~0.offset_8| 8)) 0) InVars {#memory_int=|v_#memory_int_10|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_8|, ~#m_busy~0.base=|v_~#m_busy~0.base_8|} OutVars{#memory_int=|v_#memory_int_10|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_8|, ~#m_busy~0.base=|v_~#m_busy~0.base_8|} AuxVars[] AssignedVars[] {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} is VALID [2022-02-20 20:10:18,146 INFO L290 TraceCheckUtils]: 23: Hoare triple {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} [181] L692-4-->L692-5: Formula: (= (select (select |v_#memory_int_11| |v_~#m_busy~0.base_9|) (+ |v_~#m_busy~0.offset_9| 12)) 0) InVars {#memory_int=|v_#memory_int_11|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_9|, ~#m_busy~0.base=|v_~#m_busy~0.base_9|} OutVars{#memory_int=|v_#memory_int_11|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_9|, ~#m_busy~0.base=|v_~#m_busy~0.base_9|} AuxVars[] AssignedVars[] {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} is VALID [2022-02-20 20:10:18,146 INFO L290 TraceCheckUtils]: 24: Hoare triple {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} [146] L692-5-->L692-6: Formula: (= (select (select |v_#memory_int_12| |v_~#m_busy~0.base_10|) (+ 16 |v_~#m_busy~0.offset_10|)) 0) InVars {#memory_int=|v_#memory_int_12|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_10|, ~#m_busy~0.base=|v_~#m_busy~0.base_10|} OutVars{#memory_int=|v_#memory_int_12|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_10|, ~#m_busy~0.base=|v_~#m_busy~0.base_10|} AuxVars[] AssignedVars[] {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} is VALID [2022-02-20 20:10:18,147 INFO L290 TraceCheckUtils]: 25: Hoare triple {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} [221] L692-6-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} is VALID [2022-02-20 20:10:18,147 INFO L290 TraceCheckUtils]: 26: Hoare triple {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} [216] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} is VALID [2022-02-20 20:10:18,148 INFO L290 TraceCheckUtils]: 27: Hoare triple {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} [153] L-1-4-->L-1-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} is VALID [2022-02-20 20:10:18,148 INFO L290 TraceCheckUtils]: 28: Hoare triple {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} [128] L-1-5-->L716: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_#t~pre8#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem10#1, ULTIMATE.start_main_~#t2~0#1.base] {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} is VALID [2022-02-20 20:10:18,149 INFO L290 TraceCheckUtils]: 29: Hoare triple {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} [155] L716-->L716-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4) |v_#length_5|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_main_~#t1~0#1.base_2|)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} is VALID [2022-02-20 20:10:18,149 INFO L290 TraceCheckUtils]: 30: Hoare triple {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} [201] L716-1-->L716-2: Formula: (and (= (store |v_#length_8| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4) |v_#length_7|) (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} is VALID [2022-02-20 20:10:18,150 INFO L290 TraceCheckUtils]: 31: Hoare triple {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} [194] L716-2-->L717: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} is VALID [2022-02-20 20:10:18,151 INFO L290 TraceCheckUtils]: 32: Hoare triple {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} [129] L717-->L717-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (= v_~busy~0_5 v_~inode~0_5) 1 0)) InVars {~inode~0=v_~inode~0_5, ~busy~0=v_~busy~0_5} OutVars{~inode~0=v_~inode~0_5, ~busy~0=v_~busy~0_5, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} is VALID [2022-02-20 20:10:18,151 INFO L290 TraceCheckUtils]: 33: Hoare triple {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} [168] L717-1-->L2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} is VALID [2022-02-20 20:10:18,151 INFO L290 TraceCheckUtils]: 34: Hoare triple {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} [176] L2-->L3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} is VALID [2022-02-20 20:10:18,152 INFO L290 TraceCheckUtils]: 35: Hoare triple {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} [171] L3-->L2-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} is VALID [2022-02-20 20:10:18,152 INFO L290 TraceCheckUtils]: 36: Hoare triple {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} [139] L2-1-->L718: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} is VALID [2022-02-20 20:10:18,153 INFO L290 TraceCheckUtils]: 37: Hoare triple {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} [188] L718-->L719: Formula: (= |v_#pthreadsMutex_13| (store |v_#pthreadsMutex_14| |v_~#m_inode~0.base_9| (store (select |v_#pthreadsMutex_14| |v_~#m_inode~0.base_9|) |v_~#m_inode~0.offset_9| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_14|, ~#m_inode~0.base=|v_~#m_inode~0.base_9|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_9|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_13|, ~#m_inode~0.base=|v_~#m_inode~0.base_9|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_9|} AuxVars[] AssignedVars[#pthreadsMutex] {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} is VALID [2022-02-20 20:10:18,153 INFO L290 TraceCheckUtils]: 38: Hoare triple {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} [178] L719-->L720: Formula: (= |v_#pthreadsMutex_15| (store |v_#pthreadsMutex_16| |v_~#m_busy~0.base_11| (store (select |v_#pthreadsMutex_16| |v_~#m_busy~0.base_11|) |v_~#m_busy~0.offset_11| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_16|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_11|, ~#m_busy~0.base=|v_~#m_busy~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_15|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_11|, ~#m_busy~0.base=|v_~#m_busy~0.base_11|} AuxVars[] AssignedVars[#pthreadsMutex] {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} is VALID [2022-02-20 20:10:18,153 INFO L290 TraceCheckUtils]: 39: Hoare triple {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} [136] L720-->L720-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} is VALID [2022-02-20 20:10:18,154 INFO L290 TraceCheckUtils]: 40: Hoare triple {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} [152] L720-1-->L720-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} is VALID [2022-02-20 20:10:18,154 INFO L290 TraceCheckUtils]: 41: Hoare triple {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} [200] L720-2-->L720-3: Formula: (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_13|) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} is VALID [2022-02-20 20:10:18,158 INFO L290 TraceCheckUtils]: 42: Hoare triple {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} [258] L720-3-->allocatorENTRY: Formula: (and (= v_allocatorThread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_allocatorThread1of1ForFork0_thidvar0_2) (= |v_allocatorThread1of1ForFork0_#in~_.base_4| 0) (= |v_allocatorThread1of1ForFork0_#in~_.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{allocatorThread1of1ForFork0_#t~nondet3=|v_allocatorThread1of1ForFork0_#t~nondet3_6|, allocatorThread1of1ForFork0_#t~nondet4=|v_allocatorThread1of1ForFork0_#t~nondet4_6|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, allocatorThread1of1ForFork0_#res.offset=|v_allocatorThread1of1ForFork0_#res.offset_4|, allocatorThread1of1ForFork0_~_.base=v_allocatorThread1of1ForFork0_~_.base_4, allocatorThread1of1ForFork0_~_.offset=v_allocatorThread1of1ForFork0_~_.offset_4, allocatorThread1of1ForFork0_#in~_.base=|v_allocatorThread1of1ForFork0_#in~_.base_4|, allocatorThread1of1ForFork0_#in~_.offset=|v_allocatorThread1of1ForFork0_#in~_.offset_4|, allocatorThread1of1ForFork0_#res.base=|v_allocatorThread1of1ForFork0_#res.base_4|, allocatorThread1of1ForFork0_thidvar1=v_allocatorThread1of1ForFork0_thidvar1_2, allocatorThread1of1ForFork0_thidvar0=v_allocatorThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[allocatorThread1of1ForFork0_#t~nondet3, allocatorThread1of1ForFork0_#t~nondet4, allocatorThread1of1ForFork0_#res.offset, allocatorThread1of1ForFork0_~_.base, allocatorThread1of1ForFork0_~_.offset, allocatorThread1of1ForFork0_#in~_.base, allocatorThread1of1ForFork0_#in~_.offset, allocatorThread1of1ForFork0_#res.base, allocatorThread1of1ForFork0_thidvar1, allocatorThread1of1ForFork0_thidvar0] {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} is VALID [2022-02-20 20:10:18,158 INFO L290 TraceCheckUtils]: 43: Hoare triple {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} [159] L720-4-->L720-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} is VALID [2022-02-20 20:10:18,159 INFO L290 TraceCheckUtils]: 44: Hoare triple {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} [208] L720-5-->L721: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} is VALID [2022-02-20 20:10:18,159 INFO L290 TraceCheckUtils]: 45: Hoare triple {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} [186] L721-->L721-1: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1] {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} is VALID [2022-02-20 20:10:18,160 INFO L290 TraceCheckUtils]: 46: Hoare triple {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} [165] L721-1-->L721-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} is VALID [2022-02-20 20:10:18,160 INFO L290 TraceCheckUtils]: 47: Hoare triple {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} [179] L721-2-->L721-3: Formula: (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre8#1_3|)) |v_#memory_int_15|) InVars {#memory_int=|v_#memory_int_16|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{#memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} is VALID [2022-02-20 20:10:18,160 INFO L290 TraceCheckUtils]: 48: Hoare triple {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} [260] L721-3-->de_allocatorENTRY: Formula: (and (= v_de_allocatorThread1of1ForFork1_thidvar2_2 0) (= v_de_allocatorThread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre8#1_6| v_de_allocatorThread1of1ForFork1_thidvar0_2) (= |v_de_allocatorThread1of1ForFork1_#in~_.base_4| 0) (= 0 |v_de_allocatorThread1of1ForFork1_#in~_.offset_4|)) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_6|} OutVars{de_allocatorThread1of1ForFork1_~_.offset=v_de_allocatorThread1of1ForFork1_~_.offset_4, de_allocatorThread1of1ForFork1_thidvar0=v_de_allocatorThread1of1ForFork1_thidvar0_2, de_allocatorThread1of1ForFork1_#t~nondet5=|v_de_allocatorThread1of1ForFork1_#t~nondet5_6|, de_allocatorThread1of1ForFork1_~_.base=v_de_allocatorThread1of1ForFork1_~_.base_4, de_allocatorThread1of1ForFork1_#res.base=|v_de_allocatorThread1of1ForFork1_#res.base_4|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_6|, de_allocatorThread1of1ForFork1_#in~_.base=|v_de_allocatorThread1of1ForFork1_#in~_.base_4|, de_allocatorThread1of1ForFork1_#res.offset=|v_de_allocatorThread1of1ForFork1_#res.offset_4|, de_allocatorThread1of1ForFork1_thidvar1=v_de_allocatorThread1of1ForFork1_thidvar1_2, de_allocatorThread1of1ForFork1_thidvar2=v_de_allocatorThread1of1ForFork1_thidvar2_2, de_allocatorThread1of1ForFork1_#in~_.offset=|v_de_allocatorThread1of1ForFork1_#in~_.offset_4|} AuxVars[] AssignedVars[de_allocatorThread1of1ForFork1_~_.offset, de_allocatorThread1of1ForFork1_thidvar0, de_allocatorThread1of1ForFork1_#t~nondet5, de_allocatorThread1of1ForFork1_~_.base, de_allocatorThread1of1ForFork1_#res.base, de_allocatorThread1of1ForFork1_#in~_.base, de_allocatorThread1of1ForFork1_#res.offset, de_allocatorThread1of1ForFork1_thidvar1, de_allocatorThread1of1ForFork1_thidvar2, de_allocatorThread1of1ForFork1_#in~_.offset] {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} is VALID [2022-02-20 20:10:18,161 INFO L290 TraceCheckUtils]: 49: Hoare triple {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} [243] de_allocatorENTRY-->L707: Formula: (and (= v_de_allocatorThread1of1ForFork1_~_.offset_1 |v_de_allocatorThread1of1ForFork1_#in~_.offset_1|) (= |v_de_allocatorThread1of1ForFork1_#in~_.base_1| v_de_allocatorThread1of1ForFork1_~_.base_1)) InVars {de_allocatorThread1of1ForFork1_#in~_.base=|v_de_allocatorThread1of1ForFork1_#in~_.base_1|, de_allocatorThread1of1ForFork1_#in~_.offset=|v_de_allocatorThread1of1ForFork1_#in~_.offset_1|} OutVars{de_allocatorThread1of1ForFork1_#in~_.base=|v_de_allocatorThread1of1ForFork1_#in~_.base_1|, de_allocatorThread1of1ForFork1_~_.offset=v_de_allocatorThread1of1ForFork1_~_.offset_1, de_allocatorThread1of1ForFork1_~_.base=v_de_allocatorThread1of1ForFork1_~_.base_1, de_allocatorThread1of1ForFork1_#in~_.offset=|v_de_allocatorThread1of1ForFork1_#in~_.offset_1|} AuxVars[] AssignedVars[de_allocatorThread1of1ForFork1_~_.offset, de_allocatorThread1of1ForFork1_~_.base] {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} is VALID [2022-02-20 20:10:18,162 INFO L290 TraceCheckUtils]: 50: Hoare triple {3195#(not (= |~#m_busy~0.base| |~#m_inode~0.base|))} [244] L707-->L707-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_12| |v_~#m_busy~0.base_4|))) (and (= (store |v_#pthreadsMutex_12| |v_~#m_busy~0.base_4| (store .cse0 |v_~#m_busy~0.offset_4| 1)) |v_#pthreadsMutex_11|) (= |v_de_allocatorThread1of1ForFork1_#t~nondet5_1| 0) (= (select .cse0 |v_~#m_busy~0.offset_4|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_12|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_4|, ~#m_busy~0.base=|v_~#m_busy~0.base_4|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_11|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_4|, ~#m_busy~0.base=|v_~#m_busy~0.base_4|, de_allocatorThread1of1ForFork1_#t~nondet5=|v_de_allocatorThread1of1ForFork1_#t~nondet5_1|} AuxVars[] AssignedVars[#pthreadsMutex, de_allocatorThread1of1ForFork1_#t~nondet5] {3196#(and (not (= |~#m_busy~0.base| |~#m_inode~0.base|)) (= (select (select |#pthreadsMutex| |~#m_busy~0.base|) |~#m_busy~0.offset|) 1))} is VALID [2022-02-20 20:10:18,163 INFO L290 TraceCheckUtils]: 51: Hoare triple {3196#(and (not (= |~#m_busy~0.base| |~#m_inode~0.base|)) (= (select (select |#pthreadsMutex| |~#m_busy~0.base|) |~#m_busy~0.offset|) 1))} [245] L707-1-->L708: Formula: true InVars {} OutVars{de_allocatorThread1of1ForFork1_#t~nondet5=|v_de_allocatorThread1of1ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[de_allocatorThread1of1ForFork1_#t~nondet5] {3196#(and (not (= |~#m_busy~0.base| |~#m_inode~0.base|)) (= (select (select |#pthreadsMutex| |~#m_busy~0.base|) |~#m_busy~0.offset|) 1))} is VALID [2022-02-20 20:10:18,163 INFO L290 TraceCheckUtils]: 52: Hoare triple {3196#(and (not (= |~#m_busy~0.base| |~#m_inode~0.base|)) (= (select (select |#pthreadsMutex| |~#m_busy~0.base|) |~#m_busy~0.offset|) 1))} [246] L708-->L709: Formula: (= v_~busy~0_2 0) InVars {~busy~0=v_~busy~0_2} OutVars{~busy~0=v_~busy~0_2} AuxVars[] AssignedVars[] {3196#(and (not (= |~#m_busy~0.base| |~#m_inode~0.base|)) (= (select (select |#pthreadsMutex| |~#m_busy~0.base|) |~#m_busy~0.offset|) 1))} is VALID [2022-02-20 20:10:18,164 INFO L290 TraceCheckUtils]: 53: Hoare triple {3196#(and (not (= |~#m_busy~0.base| |~#m_inode~0.base|)) (= (select (select |#pthreadsMutex| |~#m_busy~0.base|) |~#m_busy~0.offset|) 1))} [248] L709-->L710: Formula: (= v_~block~0_4 0) InVars {} OutVars{~block~0=v_~block~0_4} AuxVars[] AssignedVars[~block~0] {3196#(and (not (= |~#m_busy~0.base| |~#m_inode~0.base|)) (= (select (select |#pthreadsMutex| |~#m_busy~0.base|) |~#m_busy~0.offset|) 1))} is VALID [2022-02-20 20:10:18,164 INFO L290 TraceCheckUtils]: 54: Hoare triple {3196#(and (not (= |~#m_busy~0.base| |~#m_inode~0.base|)) (= (select (select |#pthreadsMutex| |~#m_busy~0.base|) |~#m_busy~0.offset|) 1))} [224] allocatorENTRY-->L694: Formula: (and (= |v_allocatorThread1of1ForFork0_#in~_.base_1| v_allocatorThread1of1ForFork0_~_.base_1) (= |v_allocatorThread1of1ForFork0_#in~_.offset_1| v_allocatorThread1of1ForFork0_~_.offset_1)) InVars {allocatorThread1of1ForFork0_#in~_.offset=|v_allocatorThread1of1ForFork0_#in~_.offset_1|, allocatorThread1of1ForFork0_#in~_.base=|v_allocatorThread1of1ForFork0_#in~_.base_1|} OutVars{allocatorThread1of1ForFork0_#in~_.offset=|v_allocatorThread1of1ForFork0_#in~_.offset_1|, allocatorThread1of1ForFork0_~_.base=v_allocatorThread1of1ForFork0_~_.base_1, allocatorThread1of1ForFork0_~_.offset=v_allocatorThread1of1ForFork0_~_.offset_1, allocatorThread1of1ForFork0_#in~_.base=|v_allocatorThread1of1ForFork0_#in~_.base_1|} AuxVars[] AssignedVars[allocatorThread1of1ForFork0_~_.base, allocatorThread1of1ForFork0_~_.offset] {3196#(and (not (= |~#m_busy~0.base| |~#m_inode~0.base|)) (= (select (select |#pthreadsMutex| |~#m_busy~0.base|) |~#m_busy~0.offset|) 1))} is VALID [2022-02-20 20:10:18,165 INFO L290 TraceCheckUtils]: 55: Hoare triple {3196#(and (not (= |~#m_busy~0.base| |~#m_inode~0.base|)) (= (select (select |#pthreadsMutex| |~#m_busy~0.base|) |~#m_busy~0.offset|) 1))} [225] L694-->L694-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#m_inode~0.base_1|))) (and (= (select .cse0 |v_~#m_inode~0.offset_1|) 0) (= |v_#pthreadsMutex_1| (store |v_#pthreadsMutex_2| |v_~#m_inode~0.base_1| (store .cse0 |v_~#m_inode~0.offset_1| 1))) (= |v_allocatorThread1of1ForFork0_#t~nondet3_1| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2|, ~#m_inode~0.base=|v_~#m_inode~0.base_1|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_1|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_1|, allocatorThread1of1ForFork0_#t~nondet3=|v_allocatorThread1of1ForFork0_#t~nondet3_1|, ~#m_inode~0.base=|v_~#m_inode~0.base_1|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_1|} AuxVars[] AssignedVars[#pthreadsMutex, allocatorThread1of1ForFork0_#t~nondet3] {3197#(= (select (select |#pthreadsMutex| |~#m_busy~0.base|) |~#m_busy~0.offset|) 1)} is VALID [2022-02-20 20:10:18,165 INFO L290 TraceCheckUtils]: 56: Hoare triple {3197#(= (select (select |#pthreadsMutex| |~#m_busy~0.base|) |~#m_busy~0.offset|) 1)} [226] L694-1-->L695: Formula: true InVars {} OutVars{allocatorThread1of1ForFork0_#t~nondet3=|v_allocatorThread1of1ForFork0_#t~nondet3_3|} AuxVars[] AssignedVars[allocatorThread1of1ForFork0_#t~nondet3] {3197#(= (select (select |#pthreadsMutex| |~#m_busy~0.base|) |~#m_busy~0.offset|) 1)} is VALID [2022-02-20 20:10:18,166 INFO L290 TraceCheckUtils]: 57: Hoare triple {3197#(= (select (select |#pthreadsMutex| |~#m_busy~0.base|) |~#m_busy~0.offset|) 1)} [227] L695-->L696: Formula: (= v_~inode~0_1 0) InVars {~inode~0=v_~inode~0_1} OutVars{~inode~0=v_~inode~0_1} AuxVars[] AssignedVars[] {3197#(= (select (select |#pthreadsMutex| |~#m_busy~0.base|) |~#m_busy~0.offset|) 1)} is VALID [2022-02-20 20:10:18,166 INFO L290 TraceCheckUtils]: 58: Hoare triple {3197#(= (select (select |#pthreadsMutex| |~#m_busy~0.base|) |~#m_busy~0.offset|) 1)} [229] L696-->L696-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_4| |v_~#m_busy~0.base_1|))) (and (= (select .cse0 |v_~#m_busy~0.offset_1|) 0) (= |v_allocatorThread1of1ForFork0_#t~nondet4_1| 0) (= |v_#pthreadsMutex_3| (store |v_#pthreadsMutex_4| |v_~#m_busy~0.base_1| (store .cse0 |v_~#m_busy~0.offset_1| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_4|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_1|, ~#m_busy~0.base=|v_~#m_busy~0.base_1|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_3|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_1|, allocatorThread1of1ForFork0_#t~nondet4=|v_allocatorThread1of1ForFork0_#t~nondet4_1|, ~#m_busy~0.base=|v_~#m_busy~0.base_1|} AuxVars[] AssignedVars[#pthreadsMutex, allocatorThread1of1ForFork0_#t~nondet4] {3193#false} is VALID [2022-02-20 20:10:18,166 INFO L290 TraceCheckUtils]: 59: Hoare triple {3193#false} [231] L696-1-->L697: Formula: true InVars {} OutVars{allocatorThread1of1ForFork0_#t~nondet4=|v_allocatorThread1of1ForFork0_#t~nondet4_3|} AuxVars[] AssignedVars[allocatorThread1of1ForFork0_#t~nondet4] {3193#false} is VALID [2022-02-20 20:10:18,166 INFO L290 TraceCheckUtils]: 60: Hoare triple {3193#false} [234] L697-->L698: Formula: (= v_~busy~0_1 1) InVars {} OutVars{~busy~0=v_~busy~0_1} AuxVars[] AssignedVars[~busy~0] {3193#false} is VALID [2022-02-20 20:10:18,167 INFO L290 TraceCheckUtils]: 61: Hoare triple {3193#false} [238] L698-->L699: Formula: (= |v_#pthreadsMutex_5| (store |v_#pthreadsMutex_6| |v_~#m_busy~0.base_2| (store (select |v_#pthreadsMutex_6| |v_~#m_busy~0.base_2|) |v_~#m_busy~0.offset_2| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_6|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_2|, ~#m_busy~0.base=|v_~#m_busy~0.base_2|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_5|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_2|, ~#m_busy~0.base=|v_~#m_busy~0.base_2|} AuxVars[] AssignedVars[#pthreadsMutex] {3193#false} is VALID [2022-02-20 20:10:18,167 INFO L290 TraceCheckUtils]: 62: Hoare triple {3193#false} [241] L699-->L695-2: Formula: (= v_~inode~0_2 1) InVars {} OutVars{~inode~0=v_~inode~0_2} AuxVars[] AssignedVars[~inode~0] {3193#false} is VALID [2022-02-20 20:10:18,167 INFO L290 TraceCheckUtils]: 63: Hoare triple {3193#false} [230] L695-2-->L702: Formula: (= v_~block~0_1 1) InVars {} OutVars{~block~0=v_~block~0_1} AuxVars[] AssignedVars[~block~0] {3193#false} is VALID [2022-02-20 20:10:18,167 INFO L290 TraceCheckUtils]: 64: Hoare triple {3193#false} [250] L710-->L710-1: Formula: (not (= v_~block~0_5 0)) InVars {~block~0=v_~block~0_5} OutVars{~block~0=v_~block~0_5} AuxVars[] AssignedVars[] {3193#false} is VALID [2022-02-20 20:10:18,167 INFO L290 TraceCheckUtils]: 65: Hoare triple {3193#false} [253] L710-1-->de_allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3193#false} is VALID [2022-02-20 20:10:18,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:10:18,168 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:10:18,168 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445344530] [2022-02-20 20:10:18,169 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445344530] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:10:18,169 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:10:18,169 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:10:18,172 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476589094] [2022-02-20 20:10:18,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:10:18,173 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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) Word has length 66 [2022-02-20 20:10:18,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:10:18,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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-02-20 20:10:18,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:10:18,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:10:18,226 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:10:18,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:10:18,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:10:18,227 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 102 [2022-02-20 20:10:18,228 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 83 transitions, 193 flow. Second operand has 6 states, 6 states have (on average 76.33333333333333) internal successors, (458), 6 states have internal predecessors, (458), 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-02-20 20:10:18,228 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:10:18,228 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 102 [2022-02-20 20:10:18,228 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:10:18,466 INFO L129 PetriNetUnfolder]: 14/177 cut-off events. [2022-02-20 20:10:18,466 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-02-20 20:10:18,467 INFO L84 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 177 events. 14/177 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 533 event pairs, 7 based on Foata normal form. 2/177 useless extension candidates. Maximal degree in co-relation 179. Up to 35 conditions per place. [2022-02-20 20:10:18,467 INFO L132 encePairwiseOnDemand]: 96/102 looper letters, 18 selfloop transitions, 6 changer transitions 3/87 dead transitions. [2022-02-20 20:10:18,467 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 87 transitions, 258 flow [2022-02-20 20:10:18,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 20:10:18,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-02-20 20:10:18,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 394 transitions. [2022-02-20 20:10:18,471 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7725490196078432 [2022-02-20 20:10:18,471 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 394 transitions. [2022-02-20 20:10:18,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 394 transitions. [2022-02-20 20:10:18,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:10:18,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 394 transitions. [2022-02-20 20:10:18,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 78.8) internal successors, (394), 5 states have internal predecessors, (394), 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-02-20 20:10:18,474 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 102.0) internal successors, (612), 6 states have internal predecessors, (612), 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-02-20 20:10:18,474 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 102.0) internal successors, (612), 6 states have internal predecessors, (612), 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-02-20 20:10:18,474 INFO L186 Difference]: Start difference. First operand has 91 places, 83 transitions, 193 flow. Second operand 5 states and 394 transitions. [2022-02-20 20:10:18,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 87 transitions, 258 flow [2022-02-20 20:10:19,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 87 transitions, 252 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-02-20 20:10:19,677 INFO L242 Difference]: Finished difference. Result has 93 places, 83 transitions, 199 flow [2022-02-20 20:10:19,677 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=199, PETRI_PLACES=93, PETRI_TRANSITIONS=83} [2022-02-20 20:10:19,678 INFO L334 CegarLoopForPetriNet]: 92 programPoint places, 1 predicate places. [2022-02-20 20:10:19,678 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 83 transitions, 199 flow [2022-02-20 20:10:19,700 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 904 states, 900 states have (on average 2.2911111111111113) internal successors, (2062), 903 states have internal predecessors, (2062), 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-02-20 20:10:19,702 INFO L78 Accepts]: Start accepts. Automaton has has 904 states, 900 states have (on average 2.2911111111111113) internal successors, (2062), 903 states have internal predecessors, (2062), 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) Word has length 66 [2022-02-20 20:10:19,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:10:19,702 INFO L470 AbstractCegarLoop]: Abstraction has has 93 places, 83 transitions, 199 flow [2022-02-20 20:10:19,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.33333333333333) internal successors, (458), 6 states have internal predecessors, (458), 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-02-20 20:10:19,703 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:10:19,703 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:10:19,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 20:10:19,703 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting de_allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION === [allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION, de_allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-20 20:10:19,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:10:19,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1926867913, now seen corresponding path program 2 times [2022-02-20 20:10:19,704 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:10:19,704 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360666394] [2022-02-20 20:10:19,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:10:19,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:10:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:10:19,761 INFO L290 TraceCheckUtils]: 0: Hoare triple {4108#true} [204] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4108#true} is VALID [2022-02-20 20:10:19,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {4108#true} [147] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {4108#true} is VALID [2022-02-20 20:10:19,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {4108#true} [209] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] {4108#true} is VALID [2022-02-20 20:10:19,762 INFO L290 TraceCheckUtils]: 3: Hoare triple {4108#true} [211] L-1-2-->L16: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {4108#true} is VALID [2022-02-20 20:10:19,762 INFO L290 TraceCheckUtils]: 4: Hoare triple {4108#true} [192] L16-->L16-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {4108#true} is VALID [2022-02-20 20:10:19,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {4108#true} [125] L16-1-->L16-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {4108#true} is VALID [2022-02-20 20:10:19,762 INFO L290 TraceCheckUtils]: 6: Hoare triple {4108#true} [220] L16-2-->L16-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {4108#true} is VALID [2022-02-20 20:10:19,762 INFO L290 TraceCheckUtils]: 7: Hoare triple {4108#true} [199] L16-3-->L16-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= (select |v_#length_2| 2) 17)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {4108#true} is VALID [2022-02-20 20:10:19,762 INFO L290 TraceCheckUtils]: 8: Hoare triple {4108#true} [156] L16-4-->L689: Formula: (= v_~block~0_7 0) InVars {} OutVars{~block~0=v_~block~0_7} AuxVars[] AssignedVars[~block~0] {4108#true} is VALID [2022-02-20 20:10:19,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {4108#true} [183] L689-->L690: Formula: (= v_~busy~0_4 0) InVars {} OutVars{~busy~0=v_~busy~0_4} AuxVars[] AssignedVars[~busy~0] {4108#true} is VALID [2022-02-20 20:10:19,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {4108#true} [167] L690-->L691: Formula: (= v_~inode~0_4 0) InVars {} OutVars{~inode~0=v_~inode~0_4} AuxVars[] AssignedVars[~inode~0] {4108#true} is VALID [2022-02-20 20:10:19,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {4108#true} [143] L691-->L691-1: Formula: (and (= |v_~#m_inode~0.base_3| 3) (= |v_~#m_inode~0.offset_3| 0)) InVars {} OutVars{~#m_inode~0.offset=|v_~#m_inode~0.offset_3|, ~#m_inode~0.base=|v_~#m_inode~0.base_3|} AuxVars[] AssignedVars[~#m_inode~0.offset, ~#m_inode~0.base] {4108#true} is VALID [2022-02-20 20:10:19,763 INFO L290 TraceCheckUtils]: 12: Hoare triple {4108#true} [223] L691-1-->L691-2: Formula: (and (= (select |v_#length_3| 3) 24) (= (select |v_#valid_4| 3) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {4108#true} is VALID [2022-02-20 20:10:19,763 INFO L290 TraceCheckUtils]: 13: Hoare triple {4108#true} [141] L691-2-->L691-3: Formula: (= (select (select |v_#memory_int_3| |v_~#m_inode~0.base_4|) |v_~#m_inode~0.offset_4|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#m_inode~0.base=|v_~#m_inode~0.base_4|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_4|} OutVars{#memory_int=|v_#memory_int_3|, ~#m_inode~0.base=|v_~#m_inode~0.base_4|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_4|} AuxVars[] AssignedVars[] {4108#true} is VALID [2022-02-20 20:10:19,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {4108#true} [166] L691-3-->L691-4: Formula: (= (select (select |v_#memory_int_4| |v_~#m_inode~0.base_5|) (+ |v_~#m_inode~0.offset_5| 4)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#m_inode~0.base=|v_~#m_inode~0.base_5|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_5|} OutVars{#memory_int=|v_#memory_int_4|, ~#m_inode~0.base=|v_~#m_inode~0.base_5|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_5|} AuxVars[] AssignedVars[] {4108#true} is VALID [2022-02-20 20:10:19,764 INFO L290 TraceCheckUtils]: 15: Hoare triple {4108#true} [212] L691-4-->L691-5: Formula: (= (select (select |v_#memory_int_5| |v_~#m_inode~0.base_6|) (+ 8 |v_~#m_inode~0.offset_6|)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#m_inode~0.base=|v_~#m_inode~0.base_6|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_6|} OutVars{#memory_int=|v_#memory_int_5|, ~#m_inode~0.base=|v_~#m_inode~0.base_6|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_6|} AuxVars[] AssignedVars[] {4108#true} is VALID [2022-02-20 20:10:19,764 INFO L290 TraceCheckUtils]: 16: Hoare triple {4108#true} [184] L691-5-->L691-6: Formula: (= 0 (select (select |v_#memory_int_6| |v_~#m_inode~0.base_7|) (+ 12 |v_~#m_inode~0.offset_7|))) InVars {#memory_int=|v_#memory_int_6|, ~#m_inode~0.base=|v_~#m_inode~0.base_7|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_7|} OutVars{#memory_int=|v_#memory_int_6|, ~#m_inode~0.base=|v_~#m_inode~0.base_7|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_7|} AuxVars[] AssignedVars[] {4108#true} is VALID [2022-02-20 20:10:19,764 INFO L290 TraceCheckUtils]: 17: Hoare triple {4108#true} [191] L691-6-->L691-7: Formula: (= (select (select |v_#memory_int_7| |v_~#m_inode~0.base_8|) (+ 16 |v_~#m_inode~0.offset_8|)) 0) InVars {#memory_int=|v_#memory_int_7|, ~#m_inode~0.base=|v_~#m_inode~0.base_8|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_8|} OutVars{#memory_int=|v_#memory_int_7|, ~#m_inode~0.base=|v_~#m_inode~0.base_8|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_8|} AuxVars[] AssignedVars[] {4108#true} is VALID [2022-02-20 20:10:19,764 INFO L290 TraceCheckUtils]: 18: Hoare triple {4108#true} [189] L691-7-->L692: Formula: (and (= |v_~#m_busy~0.base_5| 4) (= |v_~#m_busy~0.offset_5| 0)) InVars {} OutVars{~#m_busy~0.offset=|v_~#m_busy~0.offset_5|, ~#m_busy~0.base=|v_~#m_busy~0.base_5|} AuxVars[] AssignedVars[~#m_busy~0.offset, ~#m_busy~0.base] {4108#true} is VALID [2022-02-20 20:10:19,764 INFO L290 TraceCheckUtils]: 19: Hoare triple {4108#true} [142] L692-->L692-1: Formula: (and (= (select |v_#length_4| 4) 24) (= (select |v_#valid_5| 4) 1)) InVars {#length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] {4108#true} is VALID [2022-02-20 20:10:19,764 INFO L290 TraceCheckUtils]: 20: Hoare triple {4108#true} [151] L692-1-->L692-2: Formula: (= (select (select |v_#memory_int_8| |v_~#m_busy~0.base_6|) |v_~#m_busy~0.offset_6|) 0) InVars {#memory_int=|v_#memory_int_8|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_6|, ~#m_busy~0.base=|v_~#m_busy~0.base_6|} OutVars{#memory_int=|v_#memory_int_8|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_6|, ~#m_busy~0.base=|v_~#m_busy~0.base_6|} AuxVars[] AssignedVars[] {4108#true} is VALID [2022-02-20 20:10:19,765 INFO L290 TraceCheckUtils]: 21: Hoare triple {4108#true} [133] L692-2-->L692-3: Formula: (= (select (select |v_#memory_int_9| |v_~#m_busy~0.base_7|) (+ |v_~#m_busy~0.offset_7| 4)) 0) InVars {#memory_int=|v_#memory_int_9|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_7|, ~#m_busy~0.base=|v_~#m_busy~0.base_7|} OutVars{#memory_int=|v_#memory_int_9|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_7|, ~#m_busy~0.base=|v_~#m_busy~0.base_7|} AuxVars[] AssignedVars[] {4108#true} is VALID [2022-02-20 20:10:19,765 INFO L290 TraceCheckUtils]: 22: Hoare triple {4108#true} [195] L692-3-->L692-4: Formula: (= (select (select |v_#memory_int_10| |v_~#m_busy~0.base_8|) (+ |v_~#m_busy~0.offset_8| 8)) 0) InVars {#memory_int=|v_#memory_int_10|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_8|, ~#m_busy~0.base=|v_~#m_busy~0.base_8|} OutVars{#memory_int=|v_#memory_int_10|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_8|, ~#m_busy~0.base=|v_~#m_busy~0.base_8|} AuxVars[] AssignedVars[] {4108#true} is VALID [2022-02-20 20:10:19,765 INFO L290 TraceCheckUtils]: 23: Hoare triple {4108#true} [181] L692-4-->L692-5: Formula: (= (select (select |v_#memory_int_11| |v_~#m_busy~0.base_9|) (+ |v_~#m_busy~0.offset_9| 12)) 0) InVars {#memory_int=|v_#memory_int_11|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_9|, ~#m_busy~0.base=|v_~#m_busy~0.base_9|} OutVars{#memory_int=|v_#memory_int_11|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_9|, ~#m_busy~0.base=|v_~#m_busy~0.base_9|} AuxVars[] AssignedVars[] {4108#true} is VALID [2022-02-20 20:10:19,765 INFO L290 TraceCheckUtils]: 24: Hoare triple {4108#true} [146] L692-5-->L692-6: Formula: (= (select (select |v_#memory_int_12| |v_~#m_busy~0.base_10|) (+ 16 |v_~#m_busy~0.offset_10|)) 0) InVars {#memory_int=|v_#memory_int_12|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_10|, ~#m_busy~0.base=|v_~#m_busy~0.base_10|} OutVars{#memory_int=|v_#memory_int_12|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_10|, ~#m_busy~0.base=|v_~#m_busy~0.base_10|} AuxVars[] AssignedVars[] {4108#true} is VALID [2022-02-20 20:10:19,765 INFO L290 TraceCheckUtils]: 25: Hoare triple {4108#true} [221] L692-6-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4108#true} is VALID [2022-02-20 20:10:19,765 INFO L290 TraceCheckUtils]: 26: Hoare triple {4108#true} [216] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4108#true} is VALID [2022-02-20 20:10:19,765 INFO L290 TraceCheckUtils]: 27: Hoare triple {4108#true} [153] L-1-4-->L-1-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {4108#true} is VALID [2022-02-20 20:10:19,766 INFO L290 TraceCheckUtils]: 28: Hoare triple {4108#true} [128] L-1-5-->L716: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_#t~pre8#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem10#1, ULTIMATE.start_main_~#t2~0#1.base] {4108#true} is VALID [2022-02-20 20:10:19,766 INFO L290 TraceCheckUtils]: 29: Hoare triple {4108#true} [155] L716-->L716-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4) |v_#length_5|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_main_~#t1~0#1.base_2|)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] {4108#true} is VALID [2022-02-20 20:10:19,766 INFO L290 TraceCheckUtils]: 30: Hoare triple {4108#true} [201] L716-1-->L716-2: Formula: (and (= (store |v_#length_8| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4) |v_#length_7|) (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] {4108#true} is VALID [2022-02-20 20:10:19,766 INFO L290 TraceCheckUtils]: 31: Hoare triple {4108#true} [194] L716-2-->L717: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4108#true} is VALID [2022-02-20 20:10:19,766 INFO L290 TraceCheckUtils]: 32: Hoare triple {4108#true} [129] L717-->L717-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (= v_~busy~0_5 v_~inode~0_5) 1 0)) InVars {~inode~0=v_~inode~0_5, ~busy~0=v_~busy~0_5} OutVars{~inode~0=v_~inode~0_5, ~busy~0=v_~busy~0_5, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {4108#true} is VALID [2022-02-20 20:10:19,766 INFO L290 TraceCheckUtils]: 33: Hoare triple {4108#true} [168] L717-1-->L2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {4108#true} is VALID [2022-02-20 20:10:19,767 INFO L290 TraceCheckUtils]: 34: Hoare triple {4108#true} [176] L2-->L3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {4108#true} is VALID [2022-02-20 20:10:19,767 INFO L290 TraceCheckUtils]: 35: Hoare triple {4108#true} [171] L3-->L2-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] {4108#true} is VALID [2022-02-20 20:10:19,767 INFO L290 TraceCheckUtils]: 36: Hoare triple {4108#true} [139] L2-1-->L718: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4108#true} is VALID [2022-02-20 20:10:19,767 INFO L290 TraceCheckUtils]: 37: Hoare triple {4108#true} [188] L718-->L719: Formula: (= |v_#pthreadsMutex_13| (store |v_#pthreadsMutex_14| |v_~#m_inode~0.base_9| (store (select |v_#pthreadsMutex_14| |v_~#m_inode~0.base_9|) |v_~#m_inode~0.offset_9| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_14|, ~#m_inode~0.base=|v_~#m_inode~0.base_9|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_9|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_13|, ~#m_inode~0.base=|v_~#m_inode~0.base_9|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_9|} AuxVars[] AssignedVars[#pthreadsMutex] {4108#true} is VALID [2022-02-20 20:10:19,767 INFO L290 TraceCheckUtils]: 38: Hoare triple {4108#true} [178] L719-->L720: Formula: (= |v_#pthreadsMutex_15| (store |v_#pthreadsMutex_16| |v_~#m_busy~0.base_11| (store (select |v_#pthreadsMutex_16| |v_~#m_busy~0.base_11|) |v_~#m_busy~0.offset_11| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_16|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_11|, ~#m_busy~0.base=|v_~#m_busy~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_15|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_11|, ~#m_busy~0.base=|v_~#m_busy~0.base_11|} AuxVars[] AssignedVars[#pthreadsMutex] {4108#true} is VALID [2022-02-20 20:10:19,767 INFO L290 TraceCheckUtils]: 39: Hoare triple {4108#true} [136] L720-->L720-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {4108#true} is VALID [2022-02-20 20:10:19,768 INFO L290 TraceCheckUtils]: 40: Hoare triple {4108#true} [152] L720-1-->L720-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {4108#true} is VALID [2022-02-20 20:10:19,768 INFO L290 TraceCheckUtils]: 41: Hoare triple {4108#true} [200] L720-2-->L720-3: Formula: (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_13|) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {4108#true} is VALID [2022-02-20 20:10:19,768 INFO L290 TraceCheckUtils]: 42: Hoare triple {4108#true} [258] L720-3-->allocatorENTRY: Formula: (and (= v_allocatorThread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_allocatorThread1of1ForFork0_thidvar0_2) (= |v_allocatorThread1of1ForFork0_#in~_.base_4| 0) (= |v_allocatorThread1of1ForFork0_#in~_.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{allocatorThread1of1ForFork0_#t~nondet3=|v_allocatorThread1of1ForFork0_#t~nondet3_6|, allocatorThread1of1ForFork0_#t~nondet4=|v_allocatorThread1of1ForFork0_#t~nondet4_6|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, allocatorThread1of1ForFork0_#res.offset=|v_allocatorThread1of1ForFork0_#res.offset_4|, allocatorThread1of1ForFork0_~_.base=v_allocatorThread1of1ForFork0_~_.base_4, allocatorThread1of1ForFork0_~_.offset=v_allocatorThread1of1ForFork0_~_.offset_4, allocatorThread1of1ForFork0_#in~_.base=|v_allocatorThread1of1ForFork0_#in~_.base_4|, allocatorThread1of1ForFork0_#in~_.offset=|v_allocatorThread1of1ForFork0_#in~_.offset_4|, allocatorThread1of1ForFork0_#res.base=|v_allocatorThread1of1ForFork0_#res.base_4|, allocatorThread1of1ForFork0_thidvar1=v_allocatorThread1of1ForFork0_thidvar1_2, allocatorThread1of1ForFork0_thidvar0=v_allocatorThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[allocatorThread1of1ForFork0_#t~nondet3, allocatorThread1of1ForFork0_#t~nondet4, allocatorThread1of1ForFork0_#res.offset, allocatorThread1of1ForFork0_~_.base, allocatorThread1of1ForFork0_~_.offset, allocatorThread1of1ForFork0_#in~_.base, allocatorThread1of1ForFork0_#in~_.offset, allocatorThread1of1ForFork0_#res.base, allocatorThread1of1ForFork0_thidvar1, allocatorThread1of1ForFork0_thidvar0] {4108#true} is VALID [2022-02-20 20:10:19,768 INFO L290 TraceCheckUtils]: 43: Hoare triple {4108#true} [159] L720-4-->L720-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {4108#true} is VALID [2022-02-20 20:10:19,768 INFO L290 TraceCheckUtils]: 44: Hoare triple {4108#true} [208] L720-5-->L721: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] {4108#true} is VALID [2022-02-20 20:10:19,768 INFO L290 TraceCheckUtils]: 45: Hoare triple {4108#true} [186] L721-->L721-1: Formula: (= |v_ULTIMATE.start_main_#t~pre8#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre8#1] {4108#true} is VALID [2022-02-20 20:10:19,769 INFO L290 TraceCheckUtils]: 46: Hoare triple {4108#true} [165] L721-1-->L721-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {4108#true} is VALID [2022-02-20 20:10:19,769 INFO L290 TraceCheckUtils]: 47: Hoare triple {4108#true} [179] L721-2-->L721-3: Formula: (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre8#1_3|)) |v_#memory_int_15|) InVars {#memory_int=|v_#memory_int_16|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{#memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {4108#true} is VALID [2022-02-20 20:10:19,769 INFO L290 TraceCheckUtils]: 48: Hoare triple {4108#true} [260] L721-3-->de_allocatorENTRY: Formula: (and (= v_de_allocatorThread1of1ForFork1_thidvar2_2 0) (= v_de_allocatorThread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre8#1_6| v_de_allocatorThread1of1ForFork1_thidvar0_2) (= |v_de_allocatorThread1of1ForFork1_#in~_.base_4| 0) (= 0 |v_de_allocatorThread1of1ForFork1_#in~_.offset_4|)) InVars {ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_6|} OutVars{de_allocatorThread1of1ForFork1_~_.offset=v_de_allocatorThread1of1ForFork1_~_.offset_4, de_allocatorThread1of1ForFork1_thidvar0=v_de_allocatorThread1of1ForFork1_thidvar0_2, de_allocatorThread1of1ForFork1_#t~nondet5=|v_de_allocatorThread1of1ForFork1_#t~nondet5_6|, de_allocatorThread1of1ForFork1_~_.base=v_de_allocatorThread1of1ForFork1_~_.base_4, de_allocatorThread1of1ForFork1_#res.base=|v_de_allocatorThread1of1ForFork1_#res.base_4|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_6|, de_allocatorThread1of1ForFork1_#in~_.base=|v_de_allocatorThread1of1ForFork1_#in~_.base_4|, de_allocatorThread1of1ForFork1_#res.offset=|v_de_allocatorThread1of1ForFork1_#res.offset_4|, de_allocatorThread1of1ForFork1_thidvar1=v_de_allocatorThread1of1ForFork1_thidvar1_2, de_allocatorThread1of1ForFork1_thidvar2=v_de_allocatorThread1of1ForFork1_thidvar2_2, de_allocatorThread1of1ForFork1_#in~_.offset=|v_de_allocatorThread1of1ForFork1_#in~_.offset_4|} AuxVars[] AssignedVars[de_allocatorThread1of1ForFork1_~_.offset, de_allocatorThread1of1ForFork1_thidvar0, de_allocatorThread1of1ForFork1_#t~nondet5, de_allocatorThread1of1ForFork1_~_.base, de_allocatorThread1of1ForFork1_#res.base, de_allocatorThread1of1ForFork1_#in~_.base, de_allocatorThread1of1ForFork1_#res.offset, de_allocatorThread1of1ForFork1_thidvar1, de_allocatorThread1of1ForFork1_thidvar2, de_allocatorThread1of1ForFork1_#in~_.offset] {4108#true} is VALID [2022-02-20 20:10:19,769 INFO L290 TraceCheckUtils]: 49: Hoare triple {4108#true} [243] de_allocatorENTRY-->L707: Formula: (and (= v_de_allocatorThread1of1ForFork1_~_.offset_1 |v_de_allocatorThread1of1ForFork1_#in~_.offset_1|) (= |v_de_allocatorThread1of1ForFork1_#in~_.base_1| v_de_allocatorThread1of1ForFork1_~_.base_1)) InVars {de_allocatorThread1of1ForFork1_#in~_.base=|v_de_allocatorThread1of1ForFork1_#in~_.base_1|, de_allocatorThread1of1ForFork1_#in~_.offset=|v_de_allocatorThread1of1ForFork1_#in~_.offset_1|} OutVars{de_allocatorThread1of1ForFork1_#in~_.base=|v_de_allocatorThread1of1ForFork1_#in~_.base_1|, de_allocatorThread1of1ForFork1_~_.offset=v_de_allocatorThread1of1ForFork1_~_.offset_1, de_allocatorThread1of1ForFork1_~_.base=v_de_allocatorThread1of1ForFork1_~_.base_1, de_allocatorThread1of1ForFork1_#in~_.offset=|v_de_allocatorThread1of1ForFork1_#in~_.offset_1|} AuxVars[] AssignedVars[de_allocatorThread1of1ForFork1_~_.offset, de_allocatorThread1of1ForFork1_~_.base] {4108#true} is VALID [2022-02-20 20:10:19,769 INFO L290 TraceCheckUtils]: 50: Hoare triple {4108#true} [224] allocatorENTRY-->L694: Formula: (and (= |v_allocatorThread1of1ForFork0_#in~_.base_1| v_allocatorThread1of1ForFork0_~_.base_1) (= |v_allocatorThread1of1ForFork0_#in~_.offset_1| v_allocatorThread1of1ForFork0_~_.offset_1)) InVars {allocatorThread1of1ForFork0_#in~_.offset=|v_allocatorThread1of1ForFork0_#in~_.offset_1|, allocatorThread1of1ForFork0_#in~_.base=|v_allocatorThread1of1ForFork0_#in~_.base_1|} OutVars{allocatorThread1of1ForFork0_#in~_.offset=|v_allocatorThread1of1ForFork0_#in~_.offset_1|, allocatorThread1of1ForFork0_~_.base=v_allocatorThread1of1ForFork0_~_.base_1, allocatorThread1of1ForFork0_~_.offset=v_allocatorThread1of1ForFork0_~_.offset_1, allocatorThread1of1ForFork0_#in~_.base=|v_allocatorThread1of1ForFork0_#in~_.base_1|} AuxVars[] AssignedVars[allocatorThread1of1ForFork0_~_.base, allocatorThread1of1ForFork0_~_.offset] {4108#true} is VALID [2022-02-20 20:10:19,769 INFO L290 TraceCheckUtils]: 51: Hoare triple {4108#true} [225] L694-->L694-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#m_inode~0.base_1|))) (and (= (select .cse0 |v_~#m_inode~0.offset_1|) 0) (= |v_#pthreadsMutex_1| (store |v_#pthreadsMutex_2| |v_~#m_inode~0.base_1| (store .cse0 |v_~#m_inode~0.offset_1| 1))) (= |v_allocatorThread1of1ForFork0_#t~nondet3_1| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2|, ~#m_inode~0.base=|v_~#m_inode~0.base_1|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_1|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_1|, allocatorThread1of1ForFork0_#t~nondet3=|v_allocatorThread1of1ForFork0_#t~nondet3_1|, ~#m_inode~0.base=|v_~#m_inode~0.base_1|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_1|} AuxVars[] AssignedVars[#pthreadsMutex, allocatorThread1of1ForFork0_#t~nondet3] {4108#true} is VALID [2022-02-20 20:10:19,770 INFO L290 TraceCheckUtils]: 52: Hoare triple {4108#true} [226] L694-1-->L695: Formula: true InVars {} OutVars{allocatorThread1of1ForFork0_#t~nondet3=|v_allocatorThread1of1ForFork0_#t~nondet3_3|} AuxVars[] AssignedVars[allocatorThread1of1ForFork0_#t~nondet3] {4108#true} is VALID [2022-02-20 20:10:19,770 INFO L290 TraceCheckUtils]: 53: Hoare triple {4108#true} [227] L695-->L696: Formula: (= v_~inode~0_1 0) InVars {~inode~0=v_~inode~0_1} OutVars{~inode~0=v_~inode~0_1} AuxVars[] AssignedVars[] {4108#true} is VALID [2022-02-20 20:10:19,770 INFO L290 TraceCheckUtils]: 54: Hoare triple {4108#true} [229] L696-->L696-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_4| |v_~#m_busy~0.base_1|))) (and (= (select .cse0 |v_~#m_busy~0.offset_1|) 0) (= |v_allocatorThread1of1ForFork0_#t~nondet4_1| 0) (= |v_#pthreadsMutex_3| (store |v_#pthreadsMutex_4| |v_~#m_busy~0.base_1| (store .cse0 |v_~#m_busy~0.offset_1| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_4|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_1|, ~#m_busy~0.base=|v_~#m_busy~0.base_1|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_3|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_1|, allocatorThread1of1ForFork0_#t~nondet4=|v_allocatorThread1of1ForFork0_#t~nondet4_1|, ~#m_busy~0.base=|v_~#m_busy~0.base_1|} AuxVars[] AssignedVars[#pthreadsMutex, allocatorThread1of1ForFork0_#t~nondet4] {4108#true} is VALID [2022-02-20 20:10:19,770 INFO L290 TraceCheckUtils]: 55: Hoare triple {4108#true} [231] L696-1-->L697: Formula: true InVars {} OutVars{allocatorThread1of1ForFork0_#t~nondet4=|v_allocatorThread1of1ForFork0_#t~nondet4_3|} AuxVars[] AssignedVars[allocatorThread1of1ForFork0_#t~nondet4] {4108#true} is VALID [2022-02-20 20:10:19,771 INFO L290 TraceCheckUtils]: 56: Hoare triple {4108#true} [234] L697-->L698: Formula: (= v_~busy~0_1 1) InVars {} OutVars{~busy~0=v_~busy~0_1} AuxVars[] AssignedVars[~busy~0] {4110#(= ~busy~0 1)} is VALID [2022-02-20 20:10:19,771 INFO L290 TraceCheckUtils]: 57: Hoare triple {4110#(= ~busy~0 1)} [238] L698-->L699: Formula: (= |v_#pthreadsMutex_5| (store |v_#pthreadsMutex_6| |v_~#m_busy~0.base_2| (store (select |v_#pthreadsMutex_6| |v_~#m_busy~0.base_2|) |v_~#m_busy~0.offset_2| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_6|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_2|, ~#m_busy~0.base=|v_~#m_busy~0.base_2|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_5|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_2|, ~#m_busy~0.base=|v_~#m_busy~0.base_2|} AuxVars[] AssignedVars[#pthreadsMutex] {4110#(= ~busy~0 1)} is VALID [2022-02-20 20:10:19,771 INFO L290 TraceCheckUtils]: 58: Hoare triple {4110#(= ~busy~0 1)} [244] L707-->L707-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_12| |v_~#m_busy~0.base_4|))) (and (= (store |v_#pthreadsMutex_12| |v_~#m_busy~0.base_4| (store .cse0 |v_~#m_busy~0.offset_4| 1)) |v_#pthreadsMutex_11|) (= |v_de_allocatorThread1of1ForFork1_#t~nondet5_1| 0) (= (select .cse0 |v_~#m_busy~0.offset_4|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_12|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_4|, ~#m_busy~0.base=|v_~#m_busy~0.base_4|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_11|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_4|, ~#m_busy~0.base=|v_~#m_busy~0.base_4|, de_allocatorThread1of1ForFork1_#t~nondet5=|v_de_allocatorThread1of1ForFork1_#t~nondet5_1|} AuxVars[] AssignedVars[#pthreadsMutex, de_allocatorThread1of1ForFork1_#t~nondet5] {4110#(= ~busy~0 1)} is VALID [2022-02-20 20:10:19,772 INFO L290 TraceCheckUtils]: 59: Hoare triple {4110#(= ~busy~0 1)} [245] L707-1-->L708: Formula: true InVars {} OutVars{de_allocatorThread1of1ForFork1_#t~nondet5=|v_de_allocatorThread1of1ForFork1_#t~nondet5_3|} AuxVars[] AssignedVars[de_allocatorThread1of1ForFork1_#t~nondet5] {4110#(= ~busy~0 1)} is VALID [2022-02-20 20:10:19,772 INFO L290 TraceCheckUtils]: 60: Hoare triple {4110#(= ~busy~0 1)} [246] L708-->L709: Formula: (= v_~busy~0_2 0) InVars {~busy~0=v_~busy~0_2} OutVars{~busy~0=v_~busy~0_2} AuxVars[] AssignedVars[] {4109#false} is VALID [2022-02-20 20:10:19,772 INFO L290 TraceCheckUtils]: 61: Hoare triple {4109#false} [248] L709-->L710: Formula: (= v_~block~0_4 0) InVars {} OutVars{~block~0=v_~block~0_4} AuxVars[] AssignedVars[~block~0] {4109#false} is VALID [2022-02-20 20:10:19,772 INFO L290 TraceCheckUtils]: 62: Hoare triple {4109#false} [241] L699-->L695-2: Formula: (= v_~inode~0_2 1) InVars {} OutVars{~inode~0=v_~inode~0_2} AuxVars[] AssignedVars[~inode~0] {4109#false} is VALID [2022-02-20 20:10:19,772 INFO L290 TraceCheckUtils]: 63: Hoare triple {4109#false} [230] L695-2-->L702: Formula: (= v_~block~0_1 1) InVars {} OutVars{~block~0=v_~block~0_1} AuxVars[] AssignedVars[~block~0] {4109#false} is VALID [2022-02-20 20:10:19,773 INFO L290 TraceCheckUtils]: 64: Hoare triple {4109#false} [250] L710-->L710-1: Formula: (not (= v_~block~0_5 0)) InVars {~block~0=v_~block~0_5} OutVars{~block~0=v_~block~0_5} AuxVars[] AssignedVars[] {4109#false} is VALID [2022-02-20 20:10:19,773 INFO L290 TraceCheckUtils]: 65: Hoare triple {4109#false} [253] L710-1-->de_allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4109#false} is VALID [2022-02-20 20:10:19,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:10:19,773 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:10:19,773 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360666394] [2022-02-20 20:10:19,773 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360666394] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:10:19,773 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:10:19,774 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 20:10:19,774 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505397950] [2022-02-20 20:10:19,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:10:19,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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) Word has length 66 [2022-02-20 20:10:19,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:10:19,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-02-20 20:10:19,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:10:19,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 20:10:19,814 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:10:19,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 20:10:19,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 20:10:19,815 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 102 [2022-02-20 20:10:19,815 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 83 transitions, 199 flow. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 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-02-20 20:10:19,815 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:10:19,816 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 102 [2022-02-20 20:10:19,816 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:10:19,836 INFO L129 PetriNetUnfolder]: 1/102 cut-off events. [2022-02-20 20:10:19,836 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-02-20 20:10:19,837 INFO L84 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 102 events. 1/102 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 96 event pairs, 0 based on Foata normal form. 2/103 useless extension candidates. Maximal degree in co-relation 91. Up to 6 conditions per place. [2022-02-20 20:10:19,838 INFO L132 encePairwiseOnDemand]: 100/102 looper letters, 0 selfloop transitions, 0 changer transitions 79/79 dead transitions. [2022-02-20 20:10:19,838 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 79 transitions, 202 flow [2022-02-20 20:10:19,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 20:10:19,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-02-20 20:10:19,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2022-02-20 20:10:19,841 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8921568627450981 [2022-02-20 20:10:19,841 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 273 transitions. [2022-02-20 20:10:19,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 273 transitions. [2022-02-20 20:10:19,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:10:19,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 273 transitions. [2022-02-20 20:10:19,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 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-02-20 20:10:19,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 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-02-20 20:10:19,843 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 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-02-20 20:10:19,843 INFO L186 Difference]: Start difference. First operand has 93 places, 83 transitions, 199 flow. Second operand 3 states and 273 transitions. [2022-02-20 20:10:19,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 79 transitions, 202 flow [2022-02-20 20:10:19,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 79 transitions, 185 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-02-20 20:10:19,846 INFO L242 Difference]: Finished difference. Result has 85 places, 0 transitions, 0 flow [2022-02-20 20:10:19,846 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=85, PETRI_TRANSITIONS=0} [2022-02-20 20:10:19,848 INFO L334 CegarLoopForPetriNet]: 92 programPoint places, -7 predicate places. [2022-02-20 20:10:19,848 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 85 places, 0 transitions, 0 flow [2022-02-20 20:10:19,848 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1 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-02-20 20:10:19,848 INFO L78 Accepts]: Start accepts. Automaton has has 1 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) Word has length 66 [2022-02-20 20:10:19,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:10:19,848 INFO L470 AbstractCegarLoop]: Abstraction has has 85 places, 0 transitions, 0 flow [2022-02-20 20:10:19,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 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-02-20 20:10:19,850 INFO L764 garLoopResultBuilder]: Registering result SAFE for location allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-02-20 20:10:19,851 INFO L764 garLoopResultBuilder]: Registering result SAFE for location de_allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-02-20 20:10:19,851 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2022-02-20 20:10:19,851 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2022-02-20 20:10:19,851 INFO L764 garLoopResultBuilder]: Registering result SAFE for location allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-02-20 20:10:19,851 INFO L764 garLoopResultBuilder]: Registering result SAFE for location de_allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-02-20 20:10:19,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 20:10:19,854 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2022-02-20 20:10:19,857 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-20 20:10:19,857 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 20:10:19,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 08:10:19 BasicIcfg [2022-02-20 20:10:19,859 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 20:10:19,860 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 20:10:19,860 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 20:10:19,860 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 20:10:19,860 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:10:16" (3/4) ... [2022-02-20 20:10:19,862 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 20:10:19,865 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure allocator [2022-02-20 20:10:19,865 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure de_allocator [2022-02-20 20:10:19,868 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2022-02-20 20:10:19,868 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-02-20 20:10:19,868 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 20:10:19,868 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 20:10:19,887 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 20:10:19,887 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 20:10:19,888 INFO L158 Benchmark]: Toolchain (without parser) took 3913.92ms. Allocated memory was 113.2MB in the beginning and 251.7MB in the end (delta: 138.4MB). Free memory was 82.5MB in the beginning and 186.1MB in the end (delta: -103.5MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. [2022-02-20 20:10:19,888 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 113.2MB. Free memory is still 67.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 20:10:19,889 INFO L158 Benchmark]: CACSL2BoogieTranslator took 397.18ms. Allocated memory is still 113.2MB. Free memory was 82.5MB in the beginning and 76.0MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 20:10:19,889 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.57ms. Allocated memory is still 113.2MB. Free memory was 76.0MB in the beginning and 73.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:10:19,889 INFO L158 Benchmark]: Boogie Preprocessor took 44.87ms. Allocated memory is still 113.2MB. Free memory was 73.8MB in the beginning and 72.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:10:19,889 INFO L158 Benchmark]: RCFGBuilder took 356.41ms. Allocated memory is still 113.2MB. Free memory was 72.1MB in the beginning and 58.3MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 20:10:19,890 INFO L158 Benchmark]: TraceAbstraction took 3047.50ms. Allocated memory was 113.2MB in the beginning and 251.7MB in the end (delta: 138.4MB). Free memory was 57.8MB in the beginning and 189.2MB in the end (delta: -131.4MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2022-02-20 20:10:19,890 INFO L158 Benchmark]: Witness Printer took 27.61ms. Allocated memory is still 251.7MB. Free memory was 189.2MB in the beginning and 186.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:10:19,891 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.13ms. Allocated memory is still 113.2MB. Free memory is still 67.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 397.18ms. Allocated memory is still 113.2MB. Free memory was 82.5MB in the beginning and 76.0MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.57ms. Allocated memory is still 113.2MB. Free memory was 76.0MB in the beginning and 73.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.87ms. Allocated memory is still 113.2MB. Free memory was 73.8MB in the beginning and 72.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 356.41ms. Allocated memory is still 113.2MB. Free memory was 72.1MB in the beginning and 58.3MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3047.50ms. Allocated memory was 113.2MB in the beginning and 251.7MB in the end (delta: 138.4MB). Free memory was 57.8MB in the beginning and 189.2MB in the end (delta: -131.4MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. * Witness Printer took 27.61ms. Allocated memory is still 251.7MB. Free memory was 189.2MB in the beginning and 186.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * 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: 702]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 710]: 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 with 1 thread instances CFG has 5 procedures, 131 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.9s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 39 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 21 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 93 IncrementalHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 20 mSDtfsCounter, 93 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=199occurred in iteration=4, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 293 NumberOfCodeBlocks, 293 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 288 ConstructedInterpolants, 0 QuantifiedInterpolants, 555 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 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 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-02-20 20:10:19,916 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE