./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_31-traces-mine-vs-mutex_true.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/goblint-regression/13-privatized_31-traces-mine-vs-mutex_true.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 16b41d7352a3e7bca6c65d29839f35cd9a045339e5497acb7d0d6bf7ecef2ad7 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:40:25,045 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:40:25,046 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:40:25,074 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:40:25,074 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:40:25,075 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:40:25,076 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:40:25,078 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:40:25,079 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:40:25,080 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:40:25,080 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:40:25,081 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:40:25,082 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:40:25,082 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:40:25,083 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:40:25,084 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:40:25,085 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:40:25,086 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:40:25,087 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:40:25,088 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:40:25,090 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:40:25,091 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:40:25,092 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:40:25,092 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:40:25,094 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:40:25,095 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:40:25,095 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:40:25,096 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:40:25,096 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:40:25,097 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:40:25,097 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:40:25,098 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:40:25,099 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:40:25,099 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:40:25,100 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:40:25,100 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:40:25,101 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:40:25,101 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:40:25,101 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:40:25,102 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:40:25,103 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:40:25,107 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:40:25,134 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:40:25,134 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:40:25,135 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:40:25,135 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:40:25,136 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:40:25,136 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:40:25,136 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:40:25,137 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:40:25,137 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:40:25,137 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:40:25,138 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:40:25,138 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:40:25,138 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:40:25,138 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:40:25,138 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:40:25,138 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:40:25,138 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:40:25,139 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:40:25,139 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:40:25,139 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:40:25,139 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:40:25,139 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:40:25,139 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:40:25,139 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:40:25,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:40:25,140 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:40:25,140 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:40:25,140 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:40:25,140 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:40:25,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:40:25,141 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:40:25,141 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:40:25,141 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:40:25,141 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 -> 16b41d7352a3e7bca6c65d29839f35cd9a045339e5497acb7d0d6bf7ecef2ad7 [2022-02-20 20:40:25,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:40:25,396 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:40:25,398 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:40:25,399 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:40:25,400 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:40:25,401 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_31-traces-mine-vs-mutex_true.i [2022-02-20 20:40:25,463 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f27ba9312/dac322b79aa64fd18d1bec3e0ee46749/FLAG390587b9e [2022-02-20 20:40:25,882 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:40:25,887 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_31-traces-mine-vs-mutex_true.i [2022-02-20 20:40:25,898 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f27ba9312/dac322b79aa64fd18d1bec3e0ee46749/FLAG390587b9e [2022-02-20 20:40:25,909 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f27ba9312/dac322b79aa64fd18d1bec3e0ee46749 [2022-02-20 20:40:25,911 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:40:25,912 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:40:25,914 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:40:25,915 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:40:25,917 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:40:25,918 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:40:25" (1/1) ... [2022-02-20 20:40:25,919 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@475bd651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:25, skipping insertion in model container [2022-02-20 20:40:25,919 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:40:25" (1/1) ... [2022-02-20 20:40:25,925 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:40:25,951 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:40:26,088 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/goblint-regression/13-privatized_31-traces-mine-vs-mutex_true.i[1097,1110] [2022-02-20 20:40:26,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:40:26,225 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:40:26,238 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/goblint-regression/13-privatized_31-traces-mine-vs-mutex_true.i[1097,1110] [2022-02-20 20:40:26,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:40:26,328 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:40:26,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:26 WrapperNode [2022-02-20 20:40:26,329 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:40:26,330 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:40:26,330 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:40:26,330 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:40:26,336 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:40:26" (1/1) ... [2022-02-20 20:40:26,364 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:40:26" (1/1) ... [2022-02-20 20:40:26,393 INFO L137 Inliner]: procedures = 162, calls = 31, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 55 [2022-02-20 20:40:26,394 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:40:26,395 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:40:26,395 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:40:26,395 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:40:26,401 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:26" (1/1) ... [2022-02-20 20:40:26,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:26" (1/1) ... [2022-02-20 20:40:26,407 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:26" (1/1) ... [2022-02-20 20:40:26,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:26" (1/1) ... [2022-02-20 20:40:26,420 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:26" (1/1) ... [2022-02-20 20:40:26,423 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:26" (1/1) ... [2022-02-20 20:40:26,428 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:26" (1/1) ... [2022-02-20 20:40:26,430 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:40:26,431 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:40:26,431 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:40:26,431 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:40:26,439 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:26" (1/1) ... [2022-02-20 20:40:26,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:40:26,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:40:26,470 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:40:26,480 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:40:26,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 20:40:26,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 20:40:26,507 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-02-20 20:40:26,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:40:26,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 20:40:26,507 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-02-20 20:40:26,508 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-02-20 20:40:26,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 20:40:26,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:40:26,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:40:26,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:40:26,510 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:40:26,646 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:40:26,647 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:40:26,813 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:40:26,819 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:40:26,820 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 20:40:26,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:40:26 BoogieIcfgContainer [2022-02-20 20:40:26,821 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:40:26,822 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:40:26,822 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:40:26,825 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:40:26,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:40:25" (1/3) ... [2022-02-20 20:40:26,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@327a7663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:40:26, skipping insertion in model container [2022-02-20 20:40:26,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:26" (2/3) ... [2022-02-20 20:40:26,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@327a7663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:40:26, skipping insertion in model container [2022-02-20 20:40:26,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:40:26" (3/3) ... [2022-02-20 20:40:26,827 INFO L111 eAbstractionObserver]: Analyzing ICFG 13-privatized_31-traces-mine-vs-mutex_true.i [2022-02-20 20:40:26,830 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-20 20:40:26,830 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:40:26,830 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 20:40:26,830 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-20 20:40:26,862 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:26,862 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:26,862 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:26,862 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:26,863 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:26,863 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:26,863 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:26,863 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:26,864 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:26,864 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:26,864 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:26,865 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:26,865 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:26,865 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:26,866 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:26,866 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:26,866 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:26,866 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:26,866 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:26,867 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:26,867 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:26,867 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:26,868 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:26,868 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:26,868 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:26,869 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:26,869 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:26,869 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:26,869 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:26,870 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:26,870 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:26,870 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:26,871 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:26,871 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:26,871 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:26,872 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:26,875 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:26,875 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:26,875 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:26,875 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:26,875 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:26,876 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:26,876 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:26,876 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:26,876 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:26,883 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-02-20 20:40:26,919 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:40:26,924 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:40:26,926 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 20:40:26,937 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 84 places, 81 transitions, 170 flow [2022-02-20 20:40:26,970 INFO L129 PetriNetUnfolder]: 1/80 cut-off events. [2022-02-20 20:40:26,970 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-02-20 20:40:26,972 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 80 events. 1/80 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 48 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 40. Up to 2 conditions per place. [2022-02-20 20:40:26,973 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 81 transitions, 170 flow [2022-02-20 20:40:26,976 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 65 transitions, 133 flow [2022-02-20 20:40:26,991 INFO L129 PetriNetUnfolder]: 0/61 cut-off events. [2022-02-20 20:40:26,992 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:40:26,992 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:40:26,992 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] [2022-02-20 20:40:26,993 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:40:26,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:40:26,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1972094872, now seen corresponding path program 1 times [2022-02-20 20:40:27,005 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:40:27,006 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904266103] [2022-02-20 20:40:27,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:40:27,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:40:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:40:27,363 INFO L290 TraceCheckUtils]: 0: Hoare triple {87#true} [143] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {87#true} is VALID [2022-02-20 20:40:27,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {87#true} [128] 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] {87#true} is VALID [2022-02-20 20:40:27,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {87#true} [154] 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[] {87#true} is VALID [2022-02-20 20:40:27,364 INFO L290 TraceCheckUtils]: 3: Hoare triple {87#true} [158] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {87#true} is VALID [2022-02-20 20:40:27,364 INFO L290 TraceCheckUtils]: 4: Hoare triple {87#true} [109] L18-->L18-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[] {87#true} is VALID [2022-02-20 20:40:27,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {87#true} [144] L18-1-->L18-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[] {87#true} is VALID [2022-02-20 20:40:27,365 INFO L290 TraceCheckUtils]: 6: Hoare triple {87#true} [134] L18-2-->L18-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[] {87#true} is VALID [2022-02-20 20:40:27,365 INFO L290 TraceCheckUtils]: 7: Hoare triple {87#true} [137] L18-3-->L18-4: Formula: (and (= 45 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {87#true} is VALID [2022-02-20 20:40:27,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {87#true} [138] L18-4-->L682: Formula: (= v_~g~0_1 0) InVars {} OutVars{~g~0=v_~g~0_1} AuxVars[] AssignedVars[~g~0] {89#(= ~g~0 0)} is VALID [2022-02-20 20:40:27,367 INFO L290 TraceCheckUtils]: 9: Hoare triple {89#(= ~g~0 0)} [91] L682-->L682-1: Formula: (and (= |v_~#A~0.offset_1| 0) (= 3 |v_~#A~0.base_1|)) InVars {} OutVars{~#A~0.offset=|v_~#A~0.offset_1|, ~#A~0.base=|v_~#A~0.base_1|} AuxVars[] AssignedVars[~#A~0.offset, ~#A~0.base] {89#(= ~g~0 0)} is VALID [2022-02-20 20:40:27,367 INFO L290 TraceCheckUtils]: 10: Hoare triple {89#(= ~g~0 0)} [110] L682-1-->L682-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[] {89#(= ~g~0 0)} is VALID [2022-02-20 20:40:27,368 INFO L290 TraceCheckUtils]: 11: Hoare triple {89#(= ~g~0 0)} [94] L682-2-->L682-3: Formula: (= (select (select |v_#memory_int_3| |v_~#A~0.base_2|) |v_~#A~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#A~0.offset=|v_~#A~0.offset_2|, ~#A~0.base=|v_~#A~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#A~0.offset=|v_~#A~0.offset_2|, ~#A~0.base=|v_~#A~0.base_2|} AuxVars[] AssignedVars[] {89#(= ~g~0 0)} is VALID [2022-02-20 20:40:27,370 INFO L290 TraceCheckUtils]: 12: Hoare triple {89#(= ~g~0 0)} [157] L682-3-->L682-4: Formula: (= (select (select |v_#memory_int_4| |v_~#A~0.base_3|) (+ |v_~#A~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#A~0.offset=|v_~#A~0.offset_3|, ~#A~0.base=|v_~#A~0.base_3|} OutVars{#memory_int=|v_#memory_int_4|, ~#A~0.offset=|v_~#A~0.offset_3|, ~#A~0.base=|v_~#A~0.base_3|} AuxVars[] AssignedVars[] {89#(= ~g~0 0)} is VALID [2022-02-20 20:40:27,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {89#(= ~g~0 0)} [122] L682-4-->L682-5: Formula: (= (select (select |v_#memory_int_5| |v_~#A~0.base_4|) (+ |v_~#A~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#A~0.offset=|v_~#A~0.offset_4|, ~#A~0.base=|v_~#A~0.base_4|} OutVars{#memory_int=|v_#memory_int_5|, ~#A~0.offset=|v_~#A~0.offset_4|, ~#A~0.base=|v_~#A~0.base_4|} AuxVars[] AssignedVars[] {89#(= ~g~0 0)} is VALID [2022-02-20 20:40:27,371 INFO L290 TraceCheckUtils]: 14: Hoare triple {89#(= ~g~0 0)} [162] L682-5-->L682-6: Formula: (= (select (select |v_#memory_int_6| |v_~#A~0.base_5|) (+ |v_~#A~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_6|, ~#A~0.offset=|v_~#A~0.offset_5|, ~#A~0.base=|v_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_6|, ~#A~0.offset=|v_~#A~0.offset_5|, ~#A~0.base=|v_~#A~0.base_5|} AuxVars[] AssignedVars[] {89#(= ~g~0 0)} is VALID [2022-02-20 20:40:27,372 INFO L290 TraceCheckUtils]: 15: Hoare triple {89#(= ~g~0 0)} [101] L682-6-->L682-7: Formula: (= (select (select |v_#memory_int_7| |v_~#A~0.base_6|) (+ |v_~#A~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_7|, ~#A~0.offset=|v_~#A~0.offset_6|, ~#A~0.base=|v_~#A~0.base_6|} OutVars{#memory_int=|v_#memory_int_7|, ~#A~0.offset=|v_~#A~0.offset_6|, ~#A~0.base=|v_~#A~0.base_6|} AuxVars[] AssignedVars[] {89#(= ~g~0 0)} is VALID [2022-02-20 20:40:27,373 INFO L290 TraceCheckUtils]: 16: Hoare triple {89#(= ~g~0 0)} [149] L682-7-->L683: Formula: (and (= 4 |v_~#B~0.base_1|) (= |v_~#B~0.offset_1| 0)) InVars {} OutVars{~#B~0.base=|v_~#B~0.base_1|, ~#B~0.offset=|v_~#B~0.offset_1|} AuxVars[] AssignedVars[~#B~0.base, ~#B~0.offset] {89#(= ~g~0 0)} is VALID [2022-02-20 20:40:27,374 INFO L290 TraceCheckUtils]: 17: Hoare triple {89#(= ~g~0 0)} [96] L683-->L683-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[] {89#(= ~g~0 0)} is VALID [2022-02-20 20:40:27,377 INFO L290 TraceCheckUtils]: 18: Hoare triple {89#(= ~g~0 0)} [142] L683-1-->L683-2: Formula: (= (select (select |v_#memory_int_8| |v_~#B~0.base_2|) |v_~#B~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_8|, ~#B~0.base=|v_~#B~0.base_2|, ~#B~0.offset=|v_~#B~0.offset_2|} OutVars{#memory_int=|v_#memory_int_8|, ~#B~0.base=|v_~#B~0.base_2|, ~#B~0.offset=|v_~#B~0.offset_2|} AuxVars[] AssignedVars[] {89#(= ~g~0 0)} is VALID [2022-02-20 20:40:27,378 INFO L290 TraceCheckUtils]: 19: Hoare triple {89#(= ~g~0 0)} [126] L683-2-->L683-3: Formula: (= 0 (select (select |v_#memory_int_9| |v_~#B~0.base_3|) (+ |v_~#B~0.offset_3| 4))) InVars {#memory_int=|v_#memory_int_9|, ~#B~0.base=|v_~#B~0.base_3|, ~#B~0.offset=|v_~#B~0.offset_3|} OutVars{#memory_int=|v_#memory_int_9|, ~#B~0.base=|v_~#B~0.base_3|, ~#B~0.offset=|v_~#B~0.offset_3|} AuxVars[] AssignedVars[] {89#(= ~g~0 0)} is VALID [2022-02-20 20:40:27,380 INFO L290 TraceCheckUtils]: 20: Hoare triple {89#(= ~g~0 0)} [150] L683-3-->L683-4: Formula: (= (select (select |v_#memory_int_10| |v_~#B~0.base_4|) (+ |v_~#B~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_10|, ~#B~0.base=|v_~#B~0.base_4|, ~#B~0.offset=|v_~#B~0.offset_4|} OutVars{#memory_int=|v_#memory_int_10|, ~#B~0.base=|v_~#B~0.base_4|, ~#B~0.offset=|v_~#B~0.offset_4|} AuxVars[] AssignedVars[] {89#(= ~g~0 0)} is VALID [2022-02-20 20:40:27,382 INFO L290 TraceCheckUtils]: 21: Hoare triple {89#(= ~g~0 0)} [90] L683-4-->L683-5: Formula: (= ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP (select (select |v_#memory_int_11| |v_~#B~0.base_5|) (+ |v_~#B~0.offset_5| 12))) InVars {#memory_int=|v_#memory_int_11|, ~#B~0.base=|v_~#B~0.base_5|, ~#B~0.offset=|v_~#B~0.offset_5|} OutVars{#memory_int=|v_#memory_int_11|, ~#B~0.base=|v_~#B~0.base_5|, ~#B~0.offset=|v_~#B~0.offset_5|} AuxVars[] AssignedVars[] {89#(= ~g~0 0)} is VALID [2022-02-20 20:40:27,383 INFO L290 TraceCheckUtils]: 22: Hoare triple {89#(= ~g~0 0)} [151] L683-5-->L683-6: Formula: (= (select (select |v_#memory_int_12| |v_~#B~0.base_6|) (+ |v_~#B~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_12|, ~#B~0.base=|v_~#B~0.base_6|, ~#B~0.offset=|v_~#B~0.offset_6|} OutVars{#memory_int=|v_#memory_int_12|, ~#B~0.base=|v_~#B~0.base_6|, ~#B~0.offset=|v_~#B~0.offset_6|} AuxVars[] AssignedVars[] {89#(= ~g~0 0)} is VALID [2022-02-20 20:40:27,384 INFO L290 TraceCheckUtils]: 23: Hoare triple {89#(= ~g~0 0)} [123] L683-6-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {89#(= ~g~0 0)} is VALID [2022-02-20 20:40:27,384 INFO L290 TraceCheckUtils]: 24: Hoare triple {89#(= ~g~0 0)} [161] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {89#(= ~g~0 0)} is VALID [2022-02-20 20:40:27,385 INFO L290 TraceCheckUtils]: 25: Hoare triple {89#(= ~g~0 0)} [136] 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] {89#(= ~g~0 0)} is VALID [2022-02-20 20:40:27,385 INFO L290 TraceCheckUtils]: 26: Hoare triple {89#(= ~g~0 0)} [99] L-1-5-->L696: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_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_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_~#id~0#1.offset] {89#(= ~g~0 0)} is VALID [2022-02-20 20:40:27,390 INFO L290 TraceCheckUtils]: 27: Hoare triple {89#(= ~g~0 0)} [139] L696-->L696-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#id~0#1.base_2| 0)) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#id~0#1.base_2| 4) |v_#length_5|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#id~0#1.base_2| 1)) (= |v_ULTIMATE.start_main_~#id~0#1.offset_2| 0) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#id~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id~0#1.base_2|)) 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_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_2|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id~0#1.base, #valid, #length, ULTIMATE.start_main_~#id~0#1.offset] {89#(= ~g~0 0)} is VALID [2022-02-20 20:40:27,391 INFO L290 TraceCheckUtils]: 28: Hoare triple {89#(= ~g~0 0)} [124] L696-1-->L697: 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] {89#(= ~g~0 0)} is VALID [2022-02-20 20:40:27,392 INFO L290 TraceCheckUtils]: 29: Hoare triple {89#(= ~g~0 0)} [118] L697-->L697-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {89#(= ~g~0 0)} is VALID [2022-02-20 20:40:27,392 INFO L290 TraceCheckUtils]: 30: Hoare triple {89#(= ~g~0 0)} [100] L697-1-->L697-2: Formula: (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#id~0#1.base_3| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#id~0#1.base_3|) |v_ULTIMATE.start_main_~#id~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|))) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~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_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {89#(= ~g~0 0)} is VALID [2022-02-20 20:40:27,393 INFO L290 TraceCheckUtils]: 31: Hoare triple {89#(= ~g~0 0)} [186] L697-2-->t_funENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_t_funThread1of1ForFork0_thidvar0_2) (= |v_t_funThread1of1ForFork0_#in~arg.base_4| 0) (= v_t_funThread1of1ForFork0_thidvar1_2 0) (= |v_t_funThread1of1ForFork0_#in~arg.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, t_funThread1of1ForFork0_thidvar1=v_t_funThread1of1ForFork0_thidvar1_2, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_4|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_4, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_2, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_4|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_4|, t_funThread1of1ForFork0_#t~post3=|v_t_funThread1of1ForFork0_#t~post3_8|, t_funThread1of1ForFork0_#t~post5=|v_t_funThread1of1ForFork0_#t~post5_8|, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_4, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_6|, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_4|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_6|, t_funThread1of1ForFork0_#t~nondet4=|v_t_funThread1of1ForFork0_#t~nondet4_6|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_#in~arg.base, t_funThread1of1ForFork0_~arg.base, t_funThread1of1ForFork0_thidvar0, t_funThread1of1ForFork0_#res.offset, t_funThread1of1ForFork0_#in~arg.offset, t_funThread1of1ForFork0_#t~post3, t_funThread1of1ForFork0_#t~post5, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_#t~nondet4] {89#(= ~g~0 0)} is VALID [2022-02-20 20:40:27,393 INFO L290 TraceCheckUtils]: 32: Hoare triple {89#(= ~g~0 0)} [89] L697-3-->L697-4: 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] {89#(= ~g~0 0)} is VALID [2022-02-20 20:40:27,394 INFO L290 TraceCheckUtils]: 33: Hoare triple {89#(= ~g~0 0)} [111] L697-4-->L698: 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] {89#(= ~g~0 0)} is VALID [2022-02-20 20:40:27,394 INFO L290 TraceCheckUtils]: 34: Hoare triple {89#(= ~g~0 0)} [114] L698-->L698-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#B~0.base_7|))) (and (= (select .cse0 |v_~#B~0.offset_7|) 0) (= |v_#pthreadsMutex_1| (store |v_#pthreadsMutex_2| |v_~#B~0.base_7| (store .cse0 |v_~#B~0.offset_7| 1))) (= |v_ULTIMATE.start_main_#t~nondet8#1_2| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2|, ~#B~0.base=|v_~#B~0.base_7|, ~#B~0.offset=|v_~#B~0.offset_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_1|, ~#B~0.base=|v_~#B~0.base_7|, ~#B~0.offset=|v_~#B~0.offset_7|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet8#1] {89#(= ~g~0 0)} is VALID [2022-02-20 20:40:27,395 INFO L290 TraceCheckUtils]: 35: Hoare triple {89#(= ~g~0 0)} [113] L698-1-->L699: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] {89#(= ~g~0 0)} is VALID [2022-02-20 20:40:27,396 INFO L290 TraceCheckUtils]: 36: Hoare triple {89#(= ~g~0 0)} [131] L699-->L700: Formula: (= |v_#pthreadsMutex_3| (store |v_#pthreadsMutex_4| |v_~#B~0.base_8| (store (select |v_#pthreadsMutex_4| |v_~#B~0.base_8|) |v_~#B~0.offset_8| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_4|, ~#B~0.base=|v_~#B~0.base_8|, ~#B~0.offset=|v_~#B~0.offset_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_3|, ~#B~0.base=|v_~#B~0.base_8|, ~#B~0.offset=|v_~#B~0.offset_8|} AuxVars[] AssignedVars[#pthreadsMutex] {89#(= ~g~0 0)} is VALID [2022-02-20 20:40:27,396 INFO L290 TraceCheckUtils]: 37: Hoare triple {89#(= ~g~0 0)} [159] L700-->L700-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_6| |v_~#A~0.base_7|))) (and (= |v_#pthreadsMutex_5| (store |v_#pthreadsMutex_6| |v_~#A~0.base_7| (store .cse0 |v_~#A~0.offset_7| 1))) (= (select .cse0 |v_~#A~0.offset_7|) 0) (= |v_ULTIMATE.start_main_#t~nondet9#1_2| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_6|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_5|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet9#1] {89#(= ~g~0 0)} is VALID [2022-02-20 20:40:27,397 INFO L290 TraceCheckUtils]: 38: Hoare triple {89#(= ~g~0 0)} [164] L700-1-->L701: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] {89#(= ~g~0 0)} is VALID [2022-02-20 20:40:27,397 INFO L290 TraceCheckUtils]: 39: Hoare triple {89#(= ~g~0 0)} [146] L701-->L701-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_8| |v_~#B~0.base_9|))) (and (= |v_ULTIMATE.start_main_#t~nondet10#1_2| 0) (= (select .cse0 |v_~#B~0.offset_9|) 0) (= |v_#pthreadsMutex_7| (store |v_#pthreadsMutex_8| |v_~#B~0.base_9| (store .cse0 |v_~#B~0.offset_9| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_8|, ~#B~0.base=|v_~#B~0.base_9|, ~#B~0.offset=|v_~#B~0.offset_9|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_7|, ~#B~0.base=|v_~#B~0.base_9|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|, ~#B~0.offset=|v_~#B~0.offset_9|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet10#1] {89#(= ~g~0 0)} is VALID [2022-02-20 20:40:27,398 INFO L290 TraceCheckUtils]: 40: Hoare triple {89#(= ~g~0 0)} [105] L701-1-->L702: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] {89#(= ~g~0 0)} is VALID [2022-02-20 20:40:27,398 INFO L290 TraceCheckUtils]: 41: Hoare triple {89#(= ~g~0 0)} [107] L702-->L702-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {89#(= ~g~0 0)} is VALID [2022-02-20 20:40:27,399 INFO L290 TraceCheckUtils]: 42: Hoare triple {89#(= ~g~0 0)} [115] L702-1-->L702-2: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1| (ite (= v_~g~0_2 0) 1 0)) InVars {~g~0=v_~g~0_2} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ~g~0=v_~g~0_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {90#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:27,400 INFO L290 TraceCheckUtils]: 43: Hoare triple {90#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} [130] L702-2-->L19: Formula: true InVars {} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {90#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:27,400 INFO L290 TraceCheckUtils]: 44: Hoare triple {90#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} [117] L19-->L19-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_2| |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|) InVars {ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_2|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {91#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 20:40:27,401 INFO L290 TraceCheckUtils]: 45: Hoare triple {91#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} [102] L19-1-->L19-2: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_3| 0) InVars {ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_3|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_3|} AuxVars[] AssignedVars[] {88#false} is VALID [2022-02-20 20:40:27,401 INFO L290 TraceCheckUtils]: 46: Hoare triple {88#false} [120] L19-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {88#false} is VALID [2022-02-20 20:40:27,403 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:40:27,403 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:40:27,403 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904266103] [2022-02-20 20:40:27,404 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904266103] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:40:27,404 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:40:27,404 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 20:40:27,406 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449137360] [2022-02-20 20:40:27,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:40:27,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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 47 [2022-02-20 20:40:27,420 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:40:27,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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:40:27,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:40:27,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 20:40:27,486 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:40:27,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 20:40:27,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 20:40:27,525 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 81 [2022-02-20 20:40:27,528 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 65 transitions, 133 flow. Second operand has 5 states, 5 states have (on average 68.2) internal successors, (341), 5 states have internal predecessors, (341), 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:40:27,528 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:40:27,529 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 81 [2022-02-20 20:40:27,530 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:40:27,679 INFO L129 PetriNetUnfolder]: 17/139 cut-off events. [2022-02-20 20:40:27,679 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-02-20 20:40:27,680 INFO L84 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 139 events. 17/139 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 358 event pairs, 8 based on Foata normal form. 5/143 useless extension candidates. Maximal degree in co-relation 155. Up to 24 conditions per place. [2022-02-20 20:40:27,681 INFO L132 encePairwiseOnDemand]: 76/81 looper letters, 8 selfloop transitions, 2 changer transitions 13/78 dead transitions. [2022-02-20 20:40:27,681 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 78 transitions, 205 flow [2022-02-20 20:40:27,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 20:40:27,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-02-20 20:40:27,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 494 transitions. [2022-02-20 20:40:27,720 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8712522045855379 [2022-02-20 20:40:27,721 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 494 transitions. [2022-02-20 20:40:27,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 494 transitions. [2022-02-20 20:40:27,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:40:27,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 494 transitions. [2022-02-20 20:40:27,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 70.57142857142857) internal successors, (494), 7 states have internal predecessors, (494), 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:40:27,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 81.0) internal successors, (648), 8 states have internal predecessors, (648), 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:40:27,738 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 81.0) internal successors, (648), 8 states have internal predecessors, (648), 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:40:27,740 INFO L186 Difference]: Start difference. First operand has 69 places, 65 transitions, 133 flow. Second operand 7 states and 494 transitions. [2022-02-20 20:40:27,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 78 transitions, 205 flow [2022-02-20 20:40:27,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 78 transitions, 204 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-02-20 20:40:27,752 INFO L242 Difference]: Finished difference. Result has 79 places, 65 transitions, 148 flow [2022-02-20 20:40:27,754 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=148, PETRI_PLACES=79, PETRI_TRANSITIONS=65} [2022-02-20 20:40:27,759 INFO L334 CegarLoopForPetriNet]: 69 programPoint places, 10 predicate places. [2022-02-20 20:40:27,760 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 65 transitions, 148 flow [2022-02-20 20:40:27,793 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 301 states, 300 states have (on average 1.7833333333333334) internal successors, (535), 300 states have internal predecessors, (535), 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:40:27,796 INFO L78 Accepts]: Start accepts. Automaton has has 301 states, 300 states have (on average 1.7833333333333334) internal successors, (535), 300 states have internal predecessors, (535), 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 47 [2022-02-20 20:40:27,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:40:27,797 INFO L470 AbstractCegarLoop]: Abstraction has has 79 places, 65 transitions, 148 flow [2022-02-20 20:40:27,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.2) internal successors, (341), 5 states have internal predecessors, (341), 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:40:27,797 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:40:27,798 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] [2022-02-20 20:40:27,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:40:27,798 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:40:27,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:40:27,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1681565644, now seen corresponding path program 1 times [2022-02-20 20:40:27,799 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:40:27,799 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495885191] [2022-02-20 20:40:27,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:40:27,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:40:27,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:40:27,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {406#true} [143] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {406#true} is VALID [2022-02-20 20:40:27,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {406#true} [128] 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] {406#true} is VALID [2022-02-20 20:40:27,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {406#true} [154] 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[] {406#true} is VALID [2022-02-20 20:40:27,889 INFO L290 TraceCheckUtils]: 3: Hoare triple {406#true} [158] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {406#true} is VALID [2022-02-20 20:40:27,890 INFO L290 TraceCheckUtils]: 4: Hoare triple {406#true} [109] L18-->L18-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[] {406#true} is VALID [2022-02-20 20:40:27,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {406#true} [144] L18-1-->L18-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[] {406#true} is VALID [2022-02-20 20:40:27,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {406#true} [134] L18-2-->L18-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[] {406#true} is VALID [2022-02-20 20:40:27,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {406#true} [137] L18-3-->L18-4: Formula: (and (= 45 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {406#true} is VALID [2022-02-20 20:40:27,900 INFO L290 TraceCheckUtils]: 8: Hoare triple {406#true} [138] L18-4-->L682: Formula: (= v_~g~0_1 0) InVars {} OutVars{~g~0=v_~g~0_1} AuxVars[] AssignedVars[~g~0] {406#true} is VALID [2022-02-20 20:40:27,900 INFO L290 TraceCheckUtils]: 9: Hoare triple {406#true} [91] L682-->L682-1: Formula: (and (= |v_~#A~0.offset_1| 0) (= 3 |v_~#A~0.base_1|)) InVars {} OutVars{~#A~0.offset=|v_~#A~0.offset_1|, ~#A~0.base=|v_~#A~0.base_1|} AuxVars[] AssignedVars[~#A~0.offset, ~#A~0.base] {406#true} is VALID [2022-02-20 20:40:27,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {406#true} [110] L682-1-->L682-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[] {406#true} is VALID [2022-02-20 20:40:27,901 INFO L290 TraceCheckUtils]: 11: Hoare triple {406#true} [94] L682-2-->L682-3: Formula: (= (select (select |v_#memory_int_3| |v_~#A~0.base_2|) |v_~#A~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#A~0.offset=|v_~#A~0.offset_2|, ~#A~0.base=|v_~#A~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#A~0.offset=|v_~#A~0.offset_2|, ~#A~0.base=|v_~#A~0.base_2|} AuxVars[] AssignedVars[] {406#true} is VALID [2022-02-20 20:40:27,901 INFO L290 TraceCheckUtils]: 12: Hoare triple {406#true} [157] L682-3-->L682-4: Formula: (= (select (select |v_#memory_int_4| |v_~#A~0.base_3|) (+ |v_~#A~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#A~0.offset=|v_~#A~0.offset_3|, ~#A~0.base=|v_~#A~0.base_3|} OutVars{#memory_int=|v_#memory_int_4|, ~#A~0.offset=|v_~#A~0.offset_3|, ~#A~0.base=|v_~#A~0.base_3|} AuxVars[] AssignedVars[] {406#true} is VALID [2022-02-20 20:40:27,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {406#true} [122] L682-4-->L682-5: Formula: (= (select (select |v_#memory_int_5| |v_~#A~0.base_4|) (+ |v_~#A~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#A~0.offset=|v_~#A~0.offset_4|, ~#A~0.base=|v_~#A~0.base_4|} OutVars{#memory_int=|v_#memory_int_5|, ~#A~0.offset=|v_~#A~0.offset_4|, ~#A~0.base=|v_~#A~0.base_4|} AuxVars[] AssignedVars[] {406#true} is VALID [2022-02-20 20:40:27,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {406#true} [162] L682-5-->L682-6: Formula: (= (select (select |v_#memory_int_6| |v_~#A~0.base_5|) (+ |v_~#A~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_6|, ~#A~0.offset=|v_~#A~0.offset_5|, ~#A~0.base=|v_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_6|, ~#A~0.offset=|v_~#A~0.offset_5|, ~#A~0.base=|v_~#A~0.base_5|} AuxVars[] AssignedVars[] {406#true} is VALID [2022-02-20 20:40:27,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {406#true} [101] L682-6-->L682-7: Formula: (= (select (select |v_#memory_int_7| |v_~#A~0.base_6|) (+ |v_~#A~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_7|, ~#A~0.offset=|v_~#A~0.offset_6|, ~#A~0.base=|v_~#A~0.base_6|} OutVars{#memory_int=|v_#memory_int_7|, ~#A~0.offset=|v_~#A~0.offset_6|, ~#A~0.base=|v_~#A~0.base_6|} AuxVars[] AssignedVars[] {406#true} is VALID [2022-02-20 20:40:27,902 INFO L290 TraceCheckUtils]: 16: Hoare triple {406#true} [149] L682-7-->L683: Formula: (and (= 4 |v_~#B~0.base_1|) (= |v_~#B~0.offset_1| 0)) InVars {} OutVars{~#B~0.base=|v_~#B~0.base_1|, ~#B~0.offset=|v_~#B~0.offset_1|} AuxVars[] AssignedVars[~#B~0.base, ~#B~0.offset] {406#true} is VALID [2022-02-20 20:40:27,902 INFO L290 TraceCheckUtils]: 17: Hoare triple {406#true} [96] L683-->L683-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[] {406#true} is VALID [2022-02-20 20:40:27,903 INFO L290 TraceCheckUtils]: 18: Hoare triple {406#true} [142] L683-1-->L683-2: Formula: (= (select (select |v_#memory_int_8| |v_~#B~0.base_2|) |v_~#B~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_8|, ~#B~0.base=|v_~#B~0.base_2|, ~#B~0.offset=|v_~#B~0.offset_2|} OutVars{#memory_int=|v_#memory_int_8|, ~#B~0.base=|v_~#B~0.base_2|, ~#B~0.offset=|v_~#B~0.offset_2|} AuxVars[] AssignedVars[] {406#true} is VALID [2022-02-20 20:40:27,903 INFO L290 TraceCheckUtils]: 19: Hoare triple {406#true} [126] L683-2-->L683-3: Formula: (= 0 (select (select |v_#memory_int_9| |v_~#B~0.base_3|) (+ |v_~#B~0.offset_3| 4))) InVars {#memory_int=|v_#memory_int_9|, ~#B~0.base=|v_~#B~0.base_3|, ~#B~0.offset=|v_~#B~0.offset_3|} OutVars{#memory_int=|v_#memory_int_9|, ~#B~0.base=|v_~#B~0.base_3|, ~#B~0.offset=|v_~#B~0.offset_3|} AuxVars[] AssignedVars[] {406#true} is VALID [2022-02-20 20:40:27,903 INFO L290 TraceCheckUtils]: 20: Hoare triple {406#true} [150] L683-3-->L683-4: Formula: (= (select (select |v_#memory_int_10| |v_~#B~0.base_4|) (+ |v_~#B~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_10|, ~#B~0.base=|v_~#B~0.base_4|, ~#B~0.offset=|v_~#B~0.offset_4|} OutVars{#memory_int=|v_#memory_int_10|, ~#B~0.base=|v_~#B~0.base_4|, ~#B~0.offset=|v_~#B~0.offset_4|} AuxVars[] AssignedVars[] {406#true} is VALID [2022-02-20 20:40:27,904 INFO L290 TraceCheckUtils]: 21: Hoare triple {406#true} [90] L683-4-->L683-5: Formula: (= ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP (select (select |v_#memory_int_11| |v_~#B~0.base_5|) (+ |v_~#B~0.offset_5| 12))) InVars {#memory_int=|v_#memory_int_11|, ~#B~0.base=|v_~#B~0.base_5|, ~#B~0.offset=|v_~#B~0.offset_5|} OutVars{#memory_int=|v_#memory_int_11|, ~#B~0.base=|v_~#B~0.base_5|, ~#B~0.offset=|v_~#B~0.offset_5|} AuxVars[] AssignedVars[] {406#true} is VALID [2022-02-20 20:40:27,904 INFO L290 TraceCheckUtils]: 22: Hoare triple {406#true} [151] L683-5-->L683-6: Formula: (= (select (select |v_#memory_int_12| |v_~#B~0.base_6|) (+ |v_~#B~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_12|, ~#B~0.base=|v_~#B~0.base_6|, ~#B~0.offset=|v_~#B~0.offset_6|} OutVars{#memory_int=|v_#memory_int_12|, ~#B~0.base=|v_~#B~0.base_6|, ~#B~0.offset=|v_~#B~0.offset_6|} AuxVars[] AssignedVars[] {406#true} is VALID [2022-02-20 20:40:27,904 INFO L290 TraceCheckUtils]: 23: Hoare triple {406#true} [123] L683-6-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {406#true} is VALID [2022-02-20 20:40:27,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {406#true} [161] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {406#true} is VALID [2022-02-20 20:40:27,904 INFO L290 TraceCheckUtils]: 25: Hoare triple {406#true} [136] 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] {406#true} is VALID [2022-02-20 20:40:27,905 INFO L290 TraceCheckUtils]: 26: Hoare triple {406#true} [99] L-1-5-->L696: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_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_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_~#id~0#1.offset] {406#true} is VALID [2022-02-20 20:40:27,905 INFO L290 TraceCheckUtils]: 27: Hoare triple {406#true} [139] L696-->L696-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#id~0#1.base_2| 0)) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#id~0#1.base_2| 4) |v_#length_5|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#id~0#1.base_2| 1)) (= |v_ULTIMATE.start_main_~#id~0#1.offset_2| 0) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#id~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id~0#1.base_2|)) 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_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_2|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id~0#1.base, #valid, #length, ULTIMATE.start_main_~#id~0#1.offset] {406#true} is VALID [2022-02-20 20:40:27,905 INFO L290 TraceCheckUtils]: 28: Hoare triple {406#true} [124] L696-1-->L697: 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] {406#true} is VALID [2022-02-20 20:40:27,905 INFO L290 TraceCheckUtils]: 29: Hoare triple {406#true} [118] L697-->L697-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {406#true} is VALID [2022-02-20 20:40:27,906 INFO L290 TraceCheckUtils]: 30: Hoare triple {406#true} [100] L697-1-->L697-2: Formula: (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#id~0#1.base_3| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#id~0#1.base_3|) |v_ULTIMATE.start_main_~#id~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|))) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~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_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {406#true} is VALID [2022-02-20 20:40:27,906 INFO L290 TraceCheckUtils]: 31: Hoare triple {406#true} [186] L697-2-->t_funENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_t_funThread1of1ForFork0_thidvar0_2) (= |v_t_funThread1of1ForFork0_#in~arg.base_4| 0) (= v_t_funThread1of1ForFork0_thidvar1_2 0) (= |v_t_funThread1of1ForFork0_#in~arg.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, t_funThread1of1ForFork0_thidvar1=v_t_funThread1of1ForFork0_thidvar1_2, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_4|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_4, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_2, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_4|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_4|, t_funThread1of1ForFork0_#t~post3=|v_t_funThread1of1ForFork0_#t~post3_8|, t_funThread1of1ForFork0_#t~post5=|v_t_funThread1of1ForFork0_#t~post5_8|, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_4, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_6|, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_4|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_6|, t_funThread1of1ForFork0_#t~nondet4=|v_t_funThread1of1ForFork0_#t~nondet4_6|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_#in~arg.base, t_funThread1of1ForFork0_~arg.base, t_funThread1of1ForFork0_thidvar0, t_funThread1of1ForFork0_#res.offset, t_funThread1of1ForFork0_#in~arg.offset, t_funThread1of1ForFork0_#t~post3, t_funThread1of1ForFork0_#t~post5, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_#t~nondet4] {406#true} is VALID [2022-02-20 20:40:27,906 INFO L290 TraceCheckUtils]: 32: Hoare triple {406#true} [167] t_funENTRY-->L685: Formula: (and (= |v_t_funThread1of1ForFork0_#in~arg.base_1| v_t_funThread1of1ForFork0_~arg.base_1) (= v_t_funThread1of1ForFork0_~arg.offset_1 |v_t_funThread1of1ForFork0_#in~arg.offset_1|)) InVars {t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_1|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_1|} OutVars{t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_1|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_1|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_1, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_1} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_~arg.base] {406#true} is VALID [2022-02-20 20:40:27,906 INFO L290 TraceCheckUtils]: 33: Hoare triple {406#true} [168] L685-->L685-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_14| |v_~#A~0.base_9|))) (and (= |v_#pthreadsMutex_13| (store |v_#pthreadsMutex_14| |v_~#A~0.base_9| (store .cse0 |v_~#A~0.offset_9| 1))) (= (select .cse0 |v_~#A~0.offset_9|) 0) (= |v_t_funThread1of1ForFork0_#t~nondet1_1| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_14|, ~#A~0.offset=|v_~#A~0.offset_9|, ~#A~0.base=|v_~#A~0.base_9|} OutVars{t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_1|, #pthreadsMutex=|v_#pthreadsMutex_13|, ~#A~0.offset=|v_~#A~0.offset_9|, ~#A~0.base=|v_~#A~0.base_9|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet1] {406#true} is VALID [2022-02-20 20:40:27,907 INFO L290 TraceCheckUtils]: 34: Hoare triple {406#true} [169] L685-1-->L686: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet1] {406#true} is VALID [2022-02-20 20:40:27,908 INFO L290 TraceCheckUtils]: 35: Hoare triple {406#true} [170] L686-->L686-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_16| |v_~#B~0.base_11|))) (and (= |v_t_funThread1of1ForFork0_#t~nondet2_1| 0) (= |v_#pthreadsMutex_15| (store |v_#pthreadsMutex_16| |v_~#B~0.base_11| (store .cse0 |v_~#B~0.offset_11| 1))) (= (select .cse0 |v_~#B~0.offset_11|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_16|, ~#B~0.base=|v_~#B~0.base_11|, ~#B~0.offset=|v_~#B~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_15|, ~#B~0.base=|v_~#B~0.base_11|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_1|, ~#B~0.offset=|v_~#B~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet2] {408#(= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1)} is VALID [2022-02-20 20:40:27,908 INFO L290 TraceCheckUtils]: 36: Hoare triple {408#(= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1)} [171] L686-1-->L687: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet2] {408#(= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1)} is VALID [2022-02-20 20:40:27,909 INFO L290 TraceCheckUtils]: 37: Hoare triple {408#(= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1)} [172] L687-->L687-1: Formula: (= |v_t_funThread1of1ForFork0_#t~post3_1| v_~g~0_3) InVars {~g~0=v_~g~0_3} OutVars{t_funThread1of1ForFork0_#t~post3=|v_t_funThread1of1ForFork0_#t~post3_1|, ~g~0=v_~g~0_3} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~post3] {408#(= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1)} is VALID [2022-02-20 20:40:27,913 INFO L290 TraceCheckUtils]: 38: Hoare triple {408#(= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1)} [173] L687-1-->L687-2: Formula: (= v_~g~0_4 (+ |v_t_funThread1of1ForFork0_#t~post3_3| 1)) InVars {t_funThread1of1ForFork0_#t~post3=|v_t_funThread1of1ForFork0_#t~post3_3|} OutVars{t_funThread1of1ForFork0_#t~post3=|v_t_funThread1of1ForFork0_#t~post3_3|, ~g~0=v_~g~0_4} AuxVars[] AssignedVars[~g~0] {408#(= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1)} is VALID [2022-02-20 20:40:27,913 INFO L290 TraceCheckUtils]: 39: Hoare triple {408#(= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1)} [89] L697-3-->L697-4: 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] {408#(= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1)} is VALID [2022-02-20 20:40:27,914 INFO L290 TraceCheckUtils]: 40: Hoare triple {408#(= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1)} [111] L697-4-->L698: 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] {408#(= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1)} is VALID [2022-02-20 20:40:27,914 INFO L290 TraceCheckUtils]: 41: Hoare triple {408#(= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1)} [114] L698-->L698-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#B~0.base_7|))) (and (= (select .cse0 |v_~#B~0.offset_7|) 0) (= |v_#pthreadsMutex_1| (store |v_#pthreadsMutex_2| |v_~#B~0.base_7| (store .cse0 |v_~#B~0.offset_7| 1))) (= |v_ULTIMATE.start_main_#t~nondet8#1_2| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2|, ~#B~0.base=|v_~#B~0.base_7|, ~#B~0.offset=|v_~#B~0.offset_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_1|, ~#B~0.base=|v_~#B~0.base_7|, ~#B~0.offset=|v_~#B~0.offset_7|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet8#1] {407#false} is VALID [2022-02-20 20:40:27,915 INFO L290 TraceCheckUtils]: 42: Hoare triple {407#false} [113] L698-1-->L699: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] {407#false} is VALID [2022-02-20 20:40:27,915 INFO L290 TraceCheckUtils]: 43: Hoare triple {407#false} [131] L699-->L700: Formula: (= |v_#pthreadsMutex_3| (store |v_#pthreadsMutex_4| |v_~#B~0.base_8| (store (select |v_#pthreadsMutex_4| |v_~#B~0.base_8|) |v_~#B~0.offset_8| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_4|, ~#B~0.base=|v_~#B~0.base_8|, ~#B~0.offset=|v_~#B~0.offset_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_3|, ~#B~0.base=|v_~#B~0.base_8|, ~#B~0.offset=|v_~#B~0.offset_8|} AuxVars[] AssignedVars[#pthreadsMutex] {407#false} is VALID [2022-02-20 20:40:27,915 INFO L290 TraceCheckUtils]: 44: Hoare triple {407#false} [159] L700-->L700-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_6| |v_~#A~0.base_7|))) (and (= |v_#pthreadsMutex_5| (store |v_#pthreadsMutex_6| |v_~#A~0.base_7| (store .cse0 |v_~#A~0.offset_7| 1))) (= (select .cse0 |v_~#A~0.offset_7|) 0) (= |v_ULTIMATE.start_main_#t~nondet9#1_2| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_6|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_5|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet9#1] {407#false} is VALID [2022-02-20 20:40:27,915 INFO L290 TraceCheckUtils]: 45: Hoare triple {407#false} [164] L700-1-->L701: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] {407#false} is VALID [2022-02-20 20:40:27,916 INFO L290 TraceCheckUtils]: 46: Hoare triple {407#false} [146] L701-->L701-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_8| |v_~#B~0.base_9|))) (and (= |v_ULTIMATE.start_main_#t~nondet10#1_2| 0) (= (select .cse0 |v_~#B~0.offset_9|) 0) (= |v_#pthreadsMutex_7| (store |v_#pthreadsMutex_8| |v_~#B~0.base_9| (store .cse0 |v_~#B~0.offset_9| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_8|, ~#B~0.base=|v_~#B~0.base_9|, ~#B~0.offset=|v_~#B~0.offset_9|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_7|, ~#B~0.base=|v_~#B~0.base_9|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|, ~#B~0.offset=|v_~#B~0.offset_9|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet10#1] {407#false} is VALID [2022-02-20 20:40:27,916 INFO L290 TraceCheckUtils]: 47: Hoare triple {407#false} [105] L701-1-->L702: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] {407#false} is VALID [2022-02-20 20:40:27,917 INFO L290 TraceCheckUtils]: 48: Hoare triple {407#false} [107] L702-->L702-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {407#false} is VALID [2022-02-20 20:40:27,918 INFO L290 TraceCheckUtils]: 49: Hoare triple {407#false} [115] L702-1-->L702-2: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1| (ite (= v_~g~0_2 0) 1 0)) InVars {~g~0=v_~g~0_2} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ~g~0=v_~g~0_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {407#false} is VALID [2022-02-20 20:40:27,918 INFO L290 TraceCheckUtils]: 50: Hoare triple {407#false} [130] L702-2-->L19: Formula: true InVars {} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {407#false} is VALID [2022-02-20 20:40:27,919 INFO L290 TraceCheckUtils]: 51: Hoare triple {407#false} [117] L19-->L19-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_2| |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|) InVars {ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_2|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {407#false} is VALID [2022-02-20 20:40:27,919 INFO L290 TraceCheckUtils]: 52: Hoare triple {407#false} [102] L19-1-->L19-2: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_3| 0) InVars {ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_3|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_3|} AuxVars[] AssignedVars[] {407#false} is VALID [2022-02-20 20:40:27,919 INFO L290 TraceCheckUtils]: 53: Hoare triple {407#false} [120] L19-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {407#false} is VALID [2022-02-20 20:40:27,920 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:40:27,920 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:40:27,920 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495885191] [2022-02-20 20:40:27,921 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495885191] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:40:27,921 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:40:27,921 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 20:40:27,921 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487186146] [2022-02-20 20:40:27,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:40:27,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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 54 [2022-02-20 20:40:27,923 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:40:27,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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:40:27,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:40:27,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 20:40:27,966 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:40:27,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 20:40:27,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 20:40:27,967 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 81 [2022-02-20 20:40:27,968 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 65 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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:40:27,968 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:40:27,968 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 81 [2022-02-20 20:40:27,968 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:40:28,033 INFO L129 PetriNetUnfolder]: 13/149 cut-off events. [2022-02-20 20:40:28,034 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-02-20 20:40:28,035 INFO L84 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 149 events. 13/149 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 335 event pairs, 8 based on Foata normal form. 8/157 useless extension candidates. Maximal degree in co-relation 213. Up to 33 conditions per place. [2022-02-20 20:40:28,039 INFO L132 encePairwiseOnDemand]: 73/81 looper letters, 13 selfloop transitions, 8 changer transitions 0/69 dead transitions. [2022-02-20 20:40:28,040 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 69 transitions, 198 flow [2022-02-20 20:40:28,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 20:40:28,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-02-20 20:40:28,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 202 transitions. [2022-02-20 20:40:28,043 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.831275720164609 [2022-02-20 20:40:28,043 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 202 transitions. [2022-02-20 20:40:28,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 202 transitions. [2022-02-20 20:40:28,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:40:28,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 202 transitions. [2022-02-20 20:40:28,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 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:40:28,045 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 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:40:28,045 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 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:40:28,045 INFO L186 Difference]: Start difference. First operand has 79 places, 65 transitions, 148 flow. Second operand 3 states and 202 transitions. [2022-02-20 20:40:28,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 69 transitions, 198 flow [2022-02-20 20:40:28,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 69 transitions, 186 flow, removed 4 selfloop flow, removed 6 redundant places. [2022-02-20 20:40:28,358 INFO L242 Difference]: Finished difference. Result has 72 places, 67 transitions, 168 flow [2022-02-20 20:40:28,358 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=72, PETRI_TRANSITIONS=67} [2022-02-20 20:40:28,359 INFO L334 CegarLoopForPetriNet]: 69 programPoint places, 3 predicate places. [2022-02-20 20:40:28,359 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 72 places, 67 transitions, 168 flow [2022-02-20 20:40:28,365 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 246 states, 242 states have (on average 1.5991735537190082) internal successors, (387), 245 states have internal predecessors, (387), 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:40:28,366 INFO L78 Accepts]: Start accepts. Automaton has has 246 states, 242 states have (on average 1.5991735537190082) internal successors, (387), 245 states have internal predecessors, (387), 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 54 [2022-02-20 20:40:28,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:40:28,366 INFO L470 AbstractCegarLoop]: Abstraction has has 72 places, 67 transitions, 168 flow [2022-02-20 20:40:28,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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:40:28,367 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:40:28,367 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:40:28,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:40:28,367 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:40:28,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:40:28,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1672303611, now seen corresponding path program 1 times [2022-02-20 20:40:28,368 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:40:28,368 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995142368] [2022-02-20 20:40:28,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:40:28,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:40:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:40:28,534 INFO L290 TraceCheckUtils]: 0: Hoare triple {658#true} [143] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {658#true} is VALID [2022-02-20 20:40:28,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {658#true} [128] 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] {658#true} is VALID [2022-02-20 20:40:28,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {658#true} [154] 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[] {658#true} is VALID [2022-02-20 20:40:28,535 INFO L290 TraceCheckUtils]: 3: Hoare triple {658#true} [158] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {658#true} is VALID [2022-02-20 20:40:28,537 INFO L290 TraceCheckUtils]: 4: Hoare triple {658#true} [109] L18-->L18-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[] {658#true} is VALID [2022-02-20 20:40:28,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {658#true} [144] L18-1-->L18-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[] {658#true} is VALID [2022-02-20 20:40:28,538 INFO L290 TraceCheckUtils]: 6: Hoare triple {658#true} [134] L18-2-->L18-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[] {658#true} is VALID [2022-02-20 20:40:28,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {658#true} [137] L18-3-->L18-4: Formula: (and (= 45 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {658#true} is VALID [2022-02-20 20:40:28,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {658#true} [138] L18-4-->L682: Formula: (= v_~g~0_1 0) InVars {} OutVars{~g~0=v_~g~0_1} AuxVars[] AssignedVars[~g~0] {658#true} is VALID [2022-02-20 20:40:28,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {658#true} [91] L682-->L682-1: Formula: (and (= |v_~#A~0.offset_1| 0) (= 3 |v_~#A~0.base_1|)) InVars {} OutVars{~#A~0.offset=|v_~#A~0.offset_1|, ~#A~0.base=|v_~#A~0.base_1|} AuxVars[] AssignedVars[~#A~0.offset, ~#A~0.base] {660#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:28,541 INFO L290 TraceCheckUtils]: 10: Hoare triple {660#(<= |~#A~0.base| 3)} [110] L682-1-->L682-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[] {660#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:28,541 INFO L290 TraceCheckUtils]: 11: Hoare triple {660#(<= |~#A~0.base| 3)} [94] L682-2-->L682-3: Formula: (= (select (select |v_#memory_int_3| |v_~#A~0.base_2|) |v_~#A~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#A~0.offset=|v_~#A~0.offset_2|, ~#A~0.base=|v_~#A~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#A~0.offset=|v_~#A~0.offset_2|, ~#A~0.base=|v_~#A~0.base_2|} AuxVars[] AssignedVars[] {660#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:28,542 INFO L290 TraceCheckUtils]: 12: Hoare triple {660#(<= |~#A~0.base| 3)} [157] L682-3-->L682-4: Formula: (= (select (select |v_#memory_int_4| |v_~#A~0.base_3|) (+ |v_~#A~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#A~0.offset=|v_~#A~0.offset_3|, ~#A~0.base=|v_~#A~0.base_3|} OutVars{#memory_int=|v_#memory_int_4|, ~#A~0.offset=|v_~#A~0.offset_3|, ~#A~0.base=|v_~#A~0.base_3|} AuxVars[] AssignedVars[] {660#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:28,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {660#(<= |~#A~0.base| 3)} [122] L682-4-->L682-5: Formula: (= (select (select |v_#memory_int_5| |v_~#A~0.base_4|) (+ |v_~#A~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#A~0.offset=|v_~#A~0.offset_4|, ~#A~0.base=|v_~#A~0.base_4|} OutVars{#memory_int=|v_#memory_int_5|, ~#A~0.offset=|v_~#A~0.offset_4|, ~#A~0.base=|v_~#A~0.base_4|} AuxVars[] AssignedVars[] {660#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:28,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {660#(<= |~#A~0.base| 3)} [162] L682-5-->L682-6: Formula: (= (select (select |v_#memory_int_6| |v_~#A~0.base_5|) (+ |v_~#A~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_6|, ~#A~0.offset=|v_~#A~0.offset_5|, ~#A~0.base=|v_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_6|, ~#A~0.offset=|v_~#A~0.offset_5|, ~#A~0.base=|v_~#A~0.base_5|} AuxVars[] AssignedVars[] {660#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:28,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {660#(<= |~#A~0.base| 3)} [101] L682-6-->L682-7: Formula: (= (select (select |v_#memory_int_7| |v_~#A~0.base_6|) (+ |v_~#A~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_7|, ~#A~0.offset=|v_~#A~0.offset_6|, ~#A~0.base=|v_~#A~0.base_6|} OutVars{#memory_int=|v_#memory_int_7|, ~#A~0.offset=|v_~#A~0.offset_6|, ~#A~0.base=|v_~#A~0.base_6|} AuxVars[] AssignedVars[] {660#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:28,554 INFO L290 TraceCheckUtils]: 16: Hoare triple {660#(<= |~#A~0.base| 3)} [149] L682-7-->L683: Formula: (and (= 4 |v_~#B~0.base_1|) (= |v_~#B~0.offset_1| 0)) InVars {} OutVars{~#B~0.base=|v_~#B~0.base_1|, ~#B~0.offset=|v_~#B~0.offset_1|} AuxVars[] AssignedVars[~#B~0.base, ~#B~0.offset] {661#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:28,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {661#(not (= |~#B~0.base| |~#A~0.base|))} [96] L683-->L683-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[] {661#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:28,557 INFO L290 TraceCheckUtils]: 18: Hoare triple {661#(not (= |~#B~0.base| |~#A~0.base|))} [142] L683-1-->L683-2: Formula: (= (select (select |v_#memory_int_8| |v_~#B~0.base_2|) |v_~#B~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_8|, ~#B~0.base=|v_~#B~0.base_2|, ~#B~0.offset=|v_~#B~0.offset_2|} OutVars{#memory_int=|v_#memory_int_8|, ~#B~0.base=|v_~#B~0.base_2|, ~#B~0.offset=|v_~#B~0.offset_2|} AuxVars[] AssignedVars[] {661#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:28,557 INFO L290 TraceCheckUtils]: 19: Hoare triple {661#(not (= |~#B~0.base| |~#A~0.base|))} [126] L683-2-->L683-3: Formula: (= 0 (select (select |v_#memory_int_9| |v_~#B~0.base_3|) (+ |v_~#B~0.offset_3| 4))) InVars {#memory_int=|v_#memory_int_9|, ~#B~0.base=|v_~#B~0.base_3|, ~#B~0.offset=|v_~#B~0.offset_3|} OutVars{#memory_int=|v_#memory_int_9|, ~#B~0.base=|v_~#B~0.base_3|, ~#B~0.offset=|v_~#B~0.offset_3|} AuxVars[] AssignedVars[] {661#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:28,558 INFO L290 TraceCheckUtils]: 20: Hoare triple {661#(not (= |~#B~0.base| |~#A~0.base|))} [150] L683-3-->L683-4: Formula: (= (select (select |v_#memory_int_10| |v_~#B~0.base_4|) (+ |v_~#B~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_10|, ~#B~0.base=|v_~#B~0.base_4|, ~#B~0.offset=|v_~#B~0.offset_4|} OutVars{#memory_int=|v_#memory_int_10|, ~#B~0.base=|v_~#B~0.base_4|, ~#B~0.offset=|v_~#B~0.offset_4|} AuxVars[] AssignedVars[] {661#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:28,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {661#(not (= |~#B~0.base| |~#A~0.base|))} [90] L683-4-->L683-5: Formula: (= ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP (select (select |v_#memory_int_11| |v_~#B~0.base_5|) (+ |v_~#B~0.offset_5| 12))) InVars {#memory_int=|v_#memory_int_11|, ~#B~0.base=|v_~#B~0.base_5|, ~#B~0.offset=|v_~#B~0.offset_5|} OutVars{#memory_int=|v_#memory_int_11|, ~#B~0.base=|v_~#B~0.base_5|, ~#B~0.offset=|v_~#B~0.offset_5|} AuxVars[] AssignedVars[] {661#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:28,559 INFO L290 TraceCheckUtils]: 22: Hoare triple {661#(not (= |~#B~0.base| |~#A~0.base|))} [151] L683-5-->L683-6: Formula: (= (select (select |v_#memory_int_12| |v_~#B~0.base_6|) (+ |v_~#B~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_12|, ~#B~0.base=|v_~#B~0.base_6|, ~#B~0.offset=|v_~#B~0.offset_6|} OutVars{#memory_int=|v_#memory_int_12|, ~#B~0.base=|v_~#B~0.base_6|, ~#B~0.offset=|v_~#B~0.offset_6|} AuxVars[] AssignedVars[] {661#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:28,560 INFO L290 TraceCheckUtils]: 23: Hoare triple {661#(not (= |~#B~0.base| |~#A~0.base|))} [123] L683-6-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {661#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:28,560 INFO L290 TraceCheckUtils]: 24: Hoare triple {661#(not (= |~#B~0.base| |~#A~0.base|))} [161] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {661#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:28,561 INFO L290 TraceCheckUtils]: 25: Hoare triple {661#(not (= |~#B~0.base| |~#A~0.base|))} [136] 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] {661#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:28,561 INFO L290 TraceCheckUtils]: 26: Hoare triple {661#(not (= |~#B~0.base| |~#A~0.base|))} [99] L-1-5-->L696: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_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_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_~#id~0#1.offset] {661#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:28,562 INFO L290 TraceCheckUtils]: 27: Hoare triple {661#(not (= |~#B~0.base| |~#A~0.base|))} [139] L696-->L696-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#id~0#1.base_2| 0)) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#id~0#1.base_2| 4) |v_#length_5|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#id~0#1.base_2| 1)) (= |v_ULTIMATE.start_main_~#id~0#1.offset_2| 0) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#id~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id~0#1.base_2|)) 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_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_2|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id~0#1.base, #valid, #length, ULTIMATE.start_main_~#id~0#1.offset] {661#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:28,562 INFO L290 TraceCheckUtils]: 28: Hoare triple {661#(not (= |~#B~0.base| |~#A~0.base|))} [124] L696-1-->L697: 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] {661#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:28,563 INFO L290 TraceCheckUtils]: 29: Hoare triple {661#(not (= |~#B~0.base| |~#A~0.base|))} [118] L697-->L697-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {661#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:28,563 INFO L290 TraceCheckUtils]: 30: Hoare triple {661#(not (= |~#B~0.base| |~#A~0.base|))} [100] L697-1-->L697-2: Formula: (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#id~0#1.base_3| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#id~0#1.base_3|) |v_ULTIMATE.start_main_~#id~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|))) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~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_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {661#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:28,564 INFO L290 TraceCheckUtils]: 31: Hoare triple {661#(not (= |~#B~0.base| |~#A~0.base|))} [186] L697-2-->t_funENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_t_funThread1of1ForFork0_thidvar0_2) (= |v_t_funThread1of1ForFork0_#in~arg.base_4| 0) (= v_t_funThread1of1ForFork0_thidvar1_2 0) (= |v_t_funThread1of1ForFork0_#in~arg.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, t_funThread1of1ForFork0_thidvar1=v_t_funThread1of1ForFork0_thidvar1_2, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_4|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_4, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_2, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_4|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_4|, t_funThread1of1ForFork0_#t~post3=|v_t_funThread1of1ForFork0_#t~post3_8|, t_funThread1of1ForFork0_#t~post5=|v_t_funThread1of1ForFork0_#t~post5_8|, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_4, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_6|, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_4|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_6|, t_funThread1of1ForFork0_#t~nondet4=|v_t_funThread1of1ForFork0_#t~nondet4_6|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_#in~arg.base, t_funThread1of1ForFork0_~arg.base, t_funThread1of1ForFork0_thidvar0, t_funThread1of1ForFork0_#res.offset, t_funThread1of1ForFork0_#in~arg.offset, t_funThread1of1ForFork0_#t~post3, t_funThread1of1ForFork0_#t~post5, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_#t~nondet4] {661#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:28,564 INFO L290 TraceCheckUtils]: 32: Hoare triple {661#(not (= |~#B~0.base| |~#A~0.base|))} [89] L697-3-->L697-4: 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] {661#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:28,564 INFO L290 TraceCheckUtils]: 33: Hoare triple {661#(not (= |~#B~0.base| |~#A~0.base|))} [111] L697-4-->L698: 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] {661#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:28,565 INFO L290 TraceCheckUtils]: 34: Hoare triple {661#(not (= |~#B~0.base| |~#A~0.base|))} [114] L698-->L698-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#B~0.base_7|))) (and (= (select .cse0 |v_~#B~0.offset_7|) 0) (= |v_#pthreadsMutex_1| (store |v_#pthreadsMutex_2| |v_~#B~0.base_7| (store .cse0 |v_~#B~0.offset_7| 1))) (= |v_ULTIMATE.start_main_#t~nondet8#1_2| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2|, ~#B~0.base=|v_~#B~0.base_7|, ~#B~0.offset=|v_~#B~0.offset_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_1|, ~#B~0.base=|v_~#B~0.base_7|, ~#B~0.offset=|v_~#B~0.offset_7|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet8#1] {661#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:28,565 INFO L290 TraceCheckUtils]: 35: Hoare triple {661#(not (= |~#B~0.base| |~#A~0.base|))} [113] L698-1-->L699: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] {661#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:28,566 INFO L290 TraceCheckUtils]: 36: Hoare triple {661#(not (= |~#B~0.base| |~#A~0.base|))} [131] L699-->L700: Formula: (= |v_#pthreadsMutex_3| (store |v_#pthreadsMutex_4| |v_~#B~0.base_8| (store (select |v_#pthreadsMutex_4| |v_~#B~0.base_8|) |v_~#B~0.offset_8| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_4|, ~#B~0.base=|v_~#B~0.base_8|, ~#B~0.offset=|v_~#B~0.offset_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_3|, ~#B~0.base=|v_~#B~0.base_8|, ~#B~0.offset=|v_~#B~0.offset_8|} AuxVars[] AssignedVars[#pthreadsMutex] {661#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:28,566 INFO L290 TraceCheckUtils]: 37: Hoare triple {661#(not (= |~#B~0.base| |~#A~0.base|))} [167] t_funENTRY-->L685: Formula: (and (= |v_t_funThread1of1ForFork0_#in~arg.base_1| v_t_funThread1of1ForFork0_~arg.base_1) (= v_t_funThread1of1ForFork0_~arg.offset_1 |v_t_funThread1of1ForFork0_#in~arg.offset_1|)) InVars {t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_1|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_1|} OutVars{t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_1|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_1|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_1, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_1} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_~arg.base] {661#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:28,567 INFO L290 TraceCheckUtils]: 38: Hoare triple {661#(not (= |~#B~0.base| |~#A~0.base|))} [168] L685-->L685-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_14| |v_~#A~0.base_9|))) (and (= |v_#pthreadsMutex_13| (store |v_#pthreadsMutex_14| |v_~#A~0.base_9| (store .cse0 |v_~#A~0.offset_9| 1))) (= (select .cse0 |v_~#A~0.offset_9|) 0) (= |v_t_funThread1of1ForFork0_#t~nondet1_1| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_14|, ~#A~0.offset=|v_~#A~0.offset_9|, ~#A~0.base=|v_~#A~0.base_9|} OutVars{t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_1|, #pthreadsMutex=|v_#pthreadsMutex_13|, ~#A~0.offset=|v_~#A~0.offset_9|, ~#A~0.base=|v_~#A~0.base_9|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet1] {662#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:28,568 INFO L290 TraceCheckUtils]: 39: Hoare triple {662#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} [169] L685-1-->L686: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet1] {662#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:28,569 INFO L290 TraceCheckUtils]: 40: Hoare triple {662#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} [170] L686-->L686-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_16| |v_~#B~0.base_11|))) (and (= |v_t_funThread1of1ForFork0_#t~nondet2_1| 0) (= |v_#pthreadsMutex_15| (store |v_#pthreadsMutex_16| |v_~#B~0.base_11| (store .cse0 |v_~#B~0.offset_11| 1))) (= (select .cse0 |v_~#B~0.offset_11|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_16|, ~#B~0.base=|v_~#B~0.base_11|, ~#B~0.offset=|v_~#B~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_15|, ~#B~0.base=|v_~#B~0.base_11|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_1|, ~#B~0.offset=|v_~#B~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet2] {662#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:28,570 INFO L290 TraceCheckUtils]: 41: Hoare triple {662#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} [171] L686-1-->L687: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet2] {662#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:28,570 INFO L290 TraceCheckUtils]: 42: Hoare triple {662#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} [172] L687-->L687-1: Formula: (= |v_t_funThread1of1ForFork0_#t~post3_1| v_~g~0_3) InVars {~g~0=v_~g~0_3} OutVars{t_funThread1of1ForFork0_#t~post3=|v_t_funThread1of1ForFork0_#t~post3_1|, ~g~0=v_~g~0_3} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~post3] {662#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:28,571 INFO L290 TraceCheckUtils]: 43: Hoare triple {662#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} [173] L687-1-->L687-2: Formula: (= v_~g~0_4 (+ |v_t_funThread1of1ForFork0_#t~post3_3| 1)) InVars {t_funThread1of1ForFork0_#t~post3=|v_t_funThread1of1ForFork0_#t~post3_3|} OutVars{t_funThread1of1ForFork0_#t~post3=|v_t_funThread1of1ForFork0_#t~post3_3|, ~g~0=v_~g~0_4} AuxVars[] AssignedVars[~g~0] {662#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:28,571 INFO L290 TraceCheckUtils]: 44: Hoare triple {662#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} [174] L687-2-->L688: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~post3=|v_t_funThread1of1ForFork0_#t~post3_5|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~post3] {662#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:28,572 INFO L290 TraceCheckUtils]: 45: Hoare triple {662#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} [175] L688-->L689: Formula: (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#B~0.base_12| (store (select |v_#pthreadsMutex_18| |v_~#B~0.base_12|) |v_~#B~0.offset_12| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_18|, ~#B~0.base=|v_~#B~0.base_12|, ~#B~0.offset=|v_~#B~0.offset_12|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_17|, ~#B~0.base=|v_~#B~0.base_12|, ~#B~0.offset=|v_~#B~0.offset_12|} AuxVars[] AssignedVars[#pthreadsMutex] {663#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1)} is VALID [2022-02-20 20:40:28,572 INFO L290 TraceCheckUtils]: 46: Hoare triple {663#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1)} [159] L700-->L700-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_6| |v_~#A~0.base_7|))) (and (= |v_#pthreadsMutex_5| (store |v_#pthreadsMutex_6| |v_~#A~0.base_7| (store .cse0 |v_~#A~0.offset_7| 1))) (= (select .cse0 |v_~#A~0.offset_7|) 0) (= |v_ULTIMATE.start_main_#t~nondet9#1_2| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_6|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_5|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet9#1] {659#false} is VALID [2022-02-20 20:40:28,573 INFO L290 TraceCheckUtils]: 47: Hoare triple {659#false} [164] L700-1-->L701: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] {659#false} is VALID [2022-02-20 20:40:28,582 INFO L290 TraceCheckUtils]: 48: Hoare triple {659#false} [146] L701-->L701-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_8| |v_~#B~0.base_9|))) (and (= |v_ULTIMATE.start_main_#t~nondet10#1_2| 0) (= (select .cse0 |v_~#B~0.offset_9|) 0) (= |v_#pthreadsMutex_7| (store |v_#pthreadsMutex_8| |v_~#B~0.base_9| (store .cse0 |v_~#B~0.offset_9| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_8|, ~#B~0.base=|v_~#B~0.base_9|, ~#B~0.offset=|v_~#B~0.offset_9|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_7|, ~#B~0.base=|v_~#B~0.base_9|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|, ~#B~0.offset=|v_~#B~0.offset_9|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet10#1] {659#false} is VALID [2022-02-20 20:40:28,582 INFO L290 TraceCheckUtils]: 49: Hoare triple {659#false} [105] L701-1-->L702: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] {659#false} is VALID [2022-02-20 20:40:28,582 INFO L290 TraceCheckUtils]: 50: Hoare triple {659#false} [107] L702-->L702-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {659#false} is VALID [2022-02-20 20:40:28,583 INFO L290 TraceCheckUtils]: 51: Hoare triple {659#false} [115] L702-1-->L702-2: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1| (ite (= v_~g~0_2 0) 1 0)) InVars {~g~0=v_~g~0_2} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ~g~0=v_~g~0_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {659#false} is VALID [2022-02-20 20:40:28,583 INFO L290 TraceCheckUtils]: 52: Hoare triple {659#false} [130] L702-2-->L19: Formula: true InVars {} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {659#false} is VALID [2022-02-20 20:40:28,583 INFO L290 TraceCheckUtils]: 53: Hoare triple {659#false} [117] L19-->L19-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_2| |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|) InVars {ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_2|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {659#false} is VALID [2022-02-20 20:40:28,583 INFO L290 TraceCheckUtils]: 54: Hoare triple {659#false} [102] L19-1-->L19-2: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_3| 0) InVars {ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_3|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_3|} AuxVars[] AssignedVars[] {659#false} is VALID [2022-02-20 20:40:28,583 INFO L290 TraceCheckUtils]: 55: Hoare triple {659#false} [120] L19-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {659#false} is VALID [2022-02-20 20:40:28,584 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:40:28,584 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:40:28,584 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995142368] [2022-02-20 20:40:28,585 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995142368] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:40:28,585 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:40:28,585 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:40:28,585 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110385484] [2022-02-20 20:40:28,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:40:28,586 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 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:40:28,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:40:28,586 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 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:40:28,628 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:40:28,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:40:28,628 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:40:28,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:40:28,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:40:28,630 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 81 [2022-02-20 20:40:28,630 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 67 transitions, 168 flow. Second operand has 6 states, 6 states have (on average 56.333333333333336) internal successors, (338), 6 states have internal predecessors, (338), 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:40:28,631 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:40:28,631 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 81 [2022-02-20 20:40:28,631 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:40:28,767 INFO L129 PetriNetUnfolder]: 6/104 cut-off events. [2022-02-20 20:40:28,768 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-02-20 20:40:28,768 INFO L84 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 104 events. 6/104 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 129 event pairs, 1 based on Foata normal form. 7/111 useless extension candidates. Maximal degree in co-relation 138. Up to 21 conditions per place. [2022-02-20 20:40:28,769 INFO L132 encePairwiseOnDemand]: 76/81 looper letters, 21 selfloop transitions, 6 changer transitions 0/69 dead transitions. [2022-02-20 20:40:28,769 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 69 transitions, 232 flow [2022-02-20 20:40:28,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 20:40:28,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-02-20 20:40:28,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 292 transitions. [2022-02-20 20:40:28,773 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7209876543209877 [2022-02-20 20:40:28,773 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 292 transitions. [2022-02-20 20:40:28,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 292 transitions. [2022-02-20 20:40:28,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:40:28,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 292 transitions. [2022-02-20 20:40:28,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 58.4) internal successors, (292), 5 states have internal predecessors, (292), 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:40:28,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 81.0) internal successors, (486), 6 states have internal predecessors, (486), 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:40:28,776 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 81.0) internal successors, (486), 6 states have internal predecessors, (486), 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:40:28,776 INFO L186 Difference]: Start difference. First operand has 72 places, 67 transitions, 168 flow. Second operand 5 states and 292 transitions. [2022-02-20 20:40:28,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 69 transitions, 232 flow [2022-02-20 20:40:28,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 69 transitions, 222 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-02-20 20:40:28,821 INFO L242 Difference]: Finished difference. Result has 75 places, 67 transitions, 172 flow [2022-02-20 20:40:28,821 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=172, PETRI_PLACES=75, PETRI_TRANSITIONS=67} [2022-02-20 20:40:28,822 INFO L334 CegarLoopForPetriNet]: 69 programPoint places, 6 predicate places. [2022-02-20 20:40:28,822 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 67 transitions, 172 flow [2022-02-20 20:40:28,825 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 172 states, 170 states have (on average 1.5058823529411764) internal successors, (256), 171 states have internal predecessors, (256), 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:40:28,826 INFO L78 Accepts]: Start accepts. Automaton has has 172 states, 170 states have (on average 1.5058823529411764) internal successors, (256), 171 states have internal predecessors, (256), 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:40:28,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:40:28,826 INFO L470 AbstractCegarLoop]: Abstraction has has 75 places, 67 transitions, 172 flow [2022-02-20 20:40:28,827 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 56.333333333333336) internal successors, (338), 6 states have internal predecessors, (338), 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:40:28,827 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:40:28,827 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] [2022-02-20 20:40:28,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 20:40:28,827 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:40:28,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:40:28,828 INFO L85 PathProgramCache]: Analyzing trace with hash 551900832, now seen corresponding path program 1 times [2022-02-20 20:40:28,828 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:40:28,828 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335606182] [2022-02-20 20:40:28,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:40:28,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:40:28,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:40:28,972 INFO L290 TraceCheckUtils]: 0: Hoare triple {842#true} [143] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {842#true} is VALID [2022-02-20 20:40:28,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {842#true} [128] 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] {842#true} is VALID [2022-02-20 20:40:28,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {842#true} [154] 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[] {842#true} is VALID [2022-02-20 20:40:28,973 INFO L290 TraceCheckUtils]: 3: Hoare triple {842#true} [158] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {842#true} is VALID [2022-02-20 20:40:28,973 INFO L290 TraceCheckUtils]: 4: Hoare triple {842#true} [109] L18-->L18-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[] {842#true} is VALID [2022-02-20 20:40:28,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {842#true} [144] L18-1-->L18-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[] {842#true} is VALID [2022-02-20 20:40:28,974 INFO L290 TraceCheckUtils]: 6: Hoare triple {842#true} [134] L18-2-->L18-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[] {842#true} is VALID [2022-02-20 20:40:28,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {842#true} [137] L18-3-->L18-4: Formula: (and (= 45 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {842#true} is VALID [2022-02-20 20:40:28,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {842#true} [138] L18-4-->L682: Formula: (= v_~g~0_1 0) InVars {} OutVars{~g~0=v_~g~0_1} AuxVars[] AssignedVars[~g~0] {844#(= ~g~0 0)} is VALID [2022-02-20 20:40:28,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {844#(= ~g~0 0)} [91] L682-->L682-1: Formula: (and (= |v_~#A~0.offset_1| 0) (= 3 |v_~#A~0.base_1|)) InVars {} OutVars{~#A~0.offset=|v_~#A~0.offset_1|, ~#A~0.base=|v_~#A~0.base_1|} AuxVars[] AssignedVars[~#A~0.offset, ~#A~0.base] {844#(= ~g~0 0)} is VALID [2022-02-20 20:40:28,975 INFO L290 TraceCheckUtils]: 10: Hoare triple {844#(= ~g~0 0)} [110] L682-1-->L682-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[] {844#(= ~g~0 0)} is VALID [2022-02-20 20:40:28,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {844#(= ~g~0 0)} [94] L682-2-->L682-3: Formula: (= (select (select |v_#memory_int_3| |v_~#A~0.base_2|) |v_~#A~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#A~0.offset=|v_~#A~0.offset_2|, ~#A~0.base=|v_~#A~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#A~0.offset=|v_~#A~0.offset_2|, ~#A~0.base=|v_~#A~0.base_2|} AuxVars[] AssignedVars[] {844#(= ~g~0 0)} is VALID [2022-02-20 20:40:28,976 INFO L290 TraceCheckUtils]: 12: Hoare triple {844#(= ~g~0 0)} [157] L682-3-->L682-4: Formula: (= (select (select |v_#memory_int_4| |v_~#A~0.base_3|) (+ |v_~#A~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#A~0.offset=|v_~#A~0.offset_3|, ~#A~0.base=|v_~#A~0.base_3|} OutVars{#memory_int=|v_#memory_int_4|, ~#A~0.offset=|v_~#A~0.offset_3|, ~#A~0.base=|v_~#A~0.base_3|} AuxVars[] AssignedVars[] {844#(= ~g~0 0)} is VALID [2022-02-20 20:40:28,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {844#(= ~g~0 0)} [122] L682-4-->L682-5: Formula: (= (select (select |v_#memory_int_5| |v_~#A~0.base_4|) (+ |v_~#A~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#A~0.offset=|v_~#A~0.offset_4|, ~#A~0.base=|v_~#A~0.base_4|} OutVars{#memory_int=|v_#memory_int_5|, ~#A~0.offset=|v_~#A~0.offset_4|, ~#A~0.base=|v_~#A~0.base_4|} AuxVars[] AssignedVars[] {844#(= ~g~0 0)} is VALID [2022-02-20 20:40:28,977 INFO L290 TraceCheckUtils]: 14: Hoare triple {844#(= ~g~0 0)} [162] L682-5-->L682-6: Formula: (= (select (select |v_#memory_int_6| |v_~#A~0.base_5|) (+ |v_~#A~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_6|, ~#A~0.offset=|v_~#A~0.offset_5|, ~#A~0.base=|v_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_6|, ~#A~0.offset=|v_~#A~0.offset_5|, ~#A~0.base=|v_~#A~0.base_5|} AuxVars[] AssignedVars[] {844#(= ~g~0 0)} is VALID [2022-02-20 20:40:28,977 INFO L290 TraceCheckUtils]: 15: Hoare triple {844#(= ~g~0 0)} [101] L682-6-->L682-7: Formula: (= (select (select |v_#memory_int_7| |v_~#A~0.base_6|) (+ |v_~#A~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_7|, ~#A~0.offset=|v_~#A~0.offset_6|, ~#A~0.base=|v_~#A~0.base_6|} OutVars{#memory_int=|v_#memory_int_7|, ~#A~0.offset=|v_~#A~0.offset_6|, ~#A~0.base=|v_~#A~0.base_6|} AuxVars[] AssignedVars[] {844#(= ~g~0 0)} is VALID [2022-02-20 20:40:28,978 INFO L290 TraceCheckUtils]: 16: Hoare triple {844#(= ~g~0 0)} [149] L682-7-->L683: Formula: (and (= 4 |v_~#B~0.base_1|) (= |v_~#B~0.offset_1| 0)) InVars {} OutVars{~#B~0.base=|v_~#B~0.base_1|, ~#B~0.offset=|v_~#B~0.offset_1|} AuxVars[] AssignedVars[~#B~0.base, ~#B~0.offset] {844#(= ~g~0 0)} is VALID [2022-02-20 20:40:28,980 INFO L290 TraceCheckUtils]: 17: Hoare triple {844#(= ~g~0 0)} [96] L683-->L683-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[] {844#(= ~g~0 0)} is VALID [2022-02-20 20:40:28,981 INFO L290 TraceCheckUtils]: 18: Hoare triple {844#(= ~g~0 0)} [142] L683-1-->L683-2: Formula: (= (select (select |v_#memory_int_8| |v_~#B~0.base_2|) |v_~#B~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_8|, ~#B~0.base=|v_~#B~0.base_2|, ~#B~0.offset=|v_~#B~0.offset_2|} OutVars{#memory_int=|v_#memory_int_8|, ~#B~0.base=|v_~#B~0.base_2|, ~#B~0.offset=|v_~#B~0.offset_2|} AuxVars[] AssignedVars[] {844#(= ~g~0 0)} is VALID [2022-02-20 20:40:28,981 INFO L290 TraceCheckUtils]: 19: Hoare triple {844#(= ~g~0 0)} [126] L683-2-->L683-3: Formula: (= 0 (select (select |v_#memory_int_9| |v_~#B~0.base_3|) (+ |v_~#B~0.offset_3| 4))) InVars {#memory_int=|v_#memory_int_9|, ~#B~0.base=|v_~#B~0.base_3|, ~#B~0.offset=|v_~#B~0.offset_3|} OutVars{#memory_int=|v_#memory_int_9|, ~#B~0.base=|v_~#B~0.base_3|, ~#B~0.offset=|v_~#B~0.offset_3|} AuxVars[] AssignedVars[] {844#(= ~g~0 0)} is VALID [2022-02-20 20:40:28,982 INFO L290 TraceCheckUtils]: 20: Hoare triple {844#(= ~g~0 0)} [150] L683-3-->L683-4: Formula: (= (select (select |v_#memory_int_10| |v_~#B~0.base_4|) (+ |v_~#B~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_10|, ~#B~0.base=|v_~#B~0.base_4|, ~#B~0.offset=|v_~#B~0.offset_4|} OutVars{#memory_int=|v_#memory_int_10|, ~#B~0.base=|v_~#B~0.base_4|, ~#B~0.offset=|v_~#B~0.offset_4|} AuxVars[] AssignedVars[] {844#(= ~g~0 0)} is VALID [2022-02-20 20:40:28,982 INFO L290 TraceCheckUtils]: 21: Hoare triple {844#(= ~g~0 0)} [90] L683-4-->L683-5: Formula: (= ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP (select (select |v_#memory_int_11| |v_~#B~0.base_5|) (+ |v_~#B~0.offset_5| 12))) InVars {#memory_int=|v_#memory_int_11|, ~#B~0.base=|v_~#B~0.base_5|, ~#B~0.offset=|v_~#B~0.offset_5|} OutVars{#memory_int=|v_#memory_int_11|, ~#B~0.base=|v_~#B~0.base_5|, ~#B~0.offset=|v_~#B~0.offset_5|} AuxVars[] AssignedVars[] {844#(= ~g~0 0)} is VALID [2022-02-20 20:40:28,982 INFO L290 TraceCheckUtils]: 22: Hoare triple {844#(= ~g~0 0)} [151] L683-5-->L683-6: Formula: (= (select (select |v_#memory_int_12| |v_~#B~0.base_6|) (+ |v_~#B~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_12|, ~#B~0.base=|v_~#B~0.base_6|, ~#B~0.offset=|v_~#B~0.offset_6|} OutVars{#memory_int=|v_#memory_int_12|, ~#B~0.base=|v_~#B~0.base_6|, ~#B~0.offset=|v_~#B~0.offset_6|} AuxVars[] AssignedVars[] {844#(= ~g~0 0)} is VALID [2022-02-20 20:40:28,983 INFO L290 TraceCheckUtils]: 23: Hoare triple {844#(= ~g~0 0)} [123] L683-6-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {844#(= ~g~0 0)} is VALID [2022-02-20 20:40:28,983 INFO L290 TraceCheckUtils]: 24: Hoare triple {844#(= ~g~0 0)} [161] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {844#(= ~g~0 0)} is VALID [2022-02-20 20:40:28,984 INFO L290 TraceCheckUtils]: 25: Hoare triple {844#(= ~g~0 0)} [136] 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] {844#(= ~g~0 0)} is VALID [2022-02-20 20:40:28,984 INFO L290 TraceCheckUtils]: 26: Hoare triple {844#(= ~g~0 0)} [99] L-1-5-->L696: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_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_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_~#id~0#1.offset] {844#(= ~g~0 0)} is VALID [2022-02-20 20:40:28,984 INFO L290 TraceCheckUtils]: 27: Hoare triple {844#(= ~g~0 0)} [139] L696-->L696-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#id~0#1.base_2| 0)) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#id~0#1.base_2| 4) |v_#length_5|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#id~0#1.base_2| 1)) (= |v_ULTIMATE.start_main_~#id~0#1.offset_2| 0) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#id~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id~0#1.base_2|)) 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_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_2|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id~0#1.base, #valid, #length, ULTIMATE.start_main_~#id~0#1.offset] {844#(= ~g~0 0)} is VALID [2022-02-20 20:40:28,985 INFO L290 TraceCheckUtils]: 28: Hoare triple {844#(= ~g~0 0)} [124] L696-1-->L697: 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] {844#(= ~g~0 0)} is VALID [2022-02-20 20:40:28,985 INFO L290 TraceCheckUtils]: 29: Hoare triple {844#(= ~g~0 0)} [118] L697-->L697-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {844#(= ~g~0 0)} is VALID [2022-02-20 20:40:28,986 INFO L290 TraceCheckUtils]: 30: Hoare triple {844#(= ~g~0 0)} [100] L697-1-->L697-2: Formula: (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#id~0#1.base_3| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#id~0#1.base_3|) |v_ULTIMATE.start_main_~#id~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|))) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~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_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {844#(= ~g~0 0)} is VALID [2022-02-20 20:40:28,986 INFO L290 TraceCheckUtils]: 31: Hoare triple {844#(= ~g~0 0)} [186] L697-2-->t_funENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_t_funThread1of1ForFork0_thidvar0_2) (= |v_t_funThread1of1ForFork0_#in~arg.base_4| 0) (= v_t_funThread1of1ForFork0_thidvar1_2 0) (= |v_t_funThread1of1ForFork0_#in~arg.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, t_funThread1of1ForFork0_thidvar1=v_t_funThread1of1ForFork0_thidvar1_2, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_4|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_4, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_2, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_4|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_4|, t_funThread1of1ForFork0_#t~post3=|v_t_funThread1of1ForFork0_#t~post3_8|, t_funThread1of1ForFork0_#t~post5=|v_t_funThread1of1ForFork0_#t~post5_8|, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_4, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_6|, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_4|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_6|, t_funThread1of1ForFork0_#t~nondet4=|v_t_funThread1of1ForFork0_#t~nondet4_6|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_#in~arg.base, t_funThread1of1ForFork0_~arg.base, t_funThread1of1ForFork0_thidvar0, t_funThread1of1ForFork0_#res.offset, t_funThread1of1ForFork0_#in~arg.offset, t_funThread1of1ForFork0_#t~post3, t_funThread1of1ForFork0_#t~post5, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_#t~nondet4] {844#(= ~g~0 0)} is VALID [2022-02-20 20:40:28,986 INFO L290 TraceCheckUtils]: 32: Hoare triple {844#(= ~g~0 0)} [89] L697-3-->L697-4: 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] {844#(= ~g~0 0)} is VALID [2022-02-20 20:40:28,987 INFO L290 TraceCheckUtils]: 33: Hoare triple {844#(= ~g~0 0)} [111] L697-4-->L698: 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] {844#(= ~g~0 0)} is VALID [2022-02-20 20:40:28,987 INFO L290 TraceCheckUtils]: 34: Hoare triple {844#(= ~g~0 0)} [114] L698-->L698-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#B~0.base_7|))) (and (= (select .cse0 |v_~#B~0.offset_7|) 0) (= |v_#pthreadsMutex_1| (store |v_#pthreadsMutex_2| |v_~#B~0.base_7| (store .cse0 |v_~#B~0.offset_7| 1))) (= |v_ULTIMATE.start_main_#t~nondet8#1_2| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2|, ~#B~0.base=|v_~#B~0.base_7|, ~#B~0.offset=|v_~#B~0.offset_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_1|, ~#B~0.base=|v_~#B~0.base_7|, ~#B~0.offset=|v_~#B~0.offset_7|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet8#1] {844#(= ~g~0 0)} is VALID [2022-02-20 20:40:28,988 INFO L290 TraceCheckUtils]: 35: Hoare triple {844#(= ~g~0 0)} [113] L698-1-->L699: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] {844#(= ~g~0 0)} is VALID [2022-02-20 20:40:28,988 INFO L290 TraceCheckUtils]: 36: Hoare triple {844#(= ~g~0 0)} [131] L699-->L700: Formula: (= |v_#pthreadsMutex_3| (store |v_#pthreadsMutex_4| |v_~#B~0.base_8| (store (select |v_#pthreadsMutex_4| |v_~#B~0.base_8|) |v_~#B~0.offset_8| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_4|, ~#B~0.base=|v_~#B~0.base_8|, ~#B~0.offset=|v_~#B~0.offset_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_3|, ~#B~0.base=|v_~#B~0.base_8|, ~#B~0.offset=|v_~#B~0.offset_8|} AuxVars[] AssignedVars[#pthreadsMutex] {844#(= ~g~0 0)} is VALID [2022-02-20 20:40:28,989 INFO L290 TraceCheckUtils]: 37: Hoare triple {844#(= ~g~0 0)} [167] t_funENTRY-->L685: Formula: (and (= |v_t_funThread1of1ForFork0_#in~arg.base_1| v_t_funThread1of1ForFork0_~arg.base_1) (= v_t_funThread1of1ForFork0_~arg.offset_1 |v_t_funThread1of1ForFork0_#in~arg.offset_1|)) InVars {t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_1|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_1|} OutVars{t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_1|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_1|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_1, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_1} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_~arg.base] {844#(= ~g~0 0)} is VALID [2022-02-20 20:40:28,989 INFO L290 TraceCheckUtils]: 38: Hoare triple {844#(= ~g~0 0)} [168] L685-->L685-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_14| |v_~#A~0.base_9|))) (and (= |v_#pthreadsMutex_13| (store |v_#pthreadsMutex_14| |v_~#A~0.base_9| (store .cse0 |v_~#A~0.offset_9| 1))) (= (select .cse0 |v_~#A~0.offset_9|) 0) (= |v_t_funThread1of1ForFork0_#t~nondet1_1| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_14|, ~#A~0.offset=|v_~#A~0.offset_9|, ~#A~0.base=|v_~#A~0.base_9|} OutVars{t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_1|, #pthreadsMutex=|v_#pthreadsMutex_13|, ~#A~0.offset=|v_~#A~0.offset_9|, ~#A~0.base=|v_~#A~0.base_9|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet1] {844#(= ~g~0 0)} is VALID [2022-02-20 20:40:28,989 INFO L290 TraceCheckUtils]: 39: Hoare triple {844#(= ~g~0 0)} [169] L685-1-->L686: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet1] {844#(= ~g~0 0)} is VALID [2022-02-20 20:40:28,990 INFO L290 TraceCheckUtils]: 40: Hoare triple {844#(= ~g~0 0)} [170] L686-->L686-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_16| |v_~#B~0.base_11|))) (and (= |v_t_funThread1of1ForFork0_#t~nondet2_1| 0) (= |v_#pthreadsMutex_15| (store |v_#pthreadsMutex_16| |v_~#B~0.base_11| (store .cse0 |v_~#B~0.offset_11| 1))) (= (select .cse0 |v_~#B~0.offset_11|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_16|, ~#B~0.base=|v_~#B~0.base_11|, ~#B~0.offset=|v_~#B~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_15|, ~#B~0.base=|v_~#B~0.base_11|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_1|, ~#B~0.offset=|v_~#B~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet2] {844#(= ~g~0 0)} is VALID [2022-02-20 20:40:28,990 INFO L290 TraceCheckUtils]: 41: Hoare triple {844#(= ~g~0 0)} [171] L686-1-->L687: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet2] {844#(= ~g~0 0)} is VALID [2022-02-20 20:40:28,991 INFO L290 TraceCheckUtils]: 42: Hoare triple {844#(= ~g~0 0)} [172] L687-->L687-1: Formula: (= |v_t_funThread1of1ForFork0_#t~post3_1| v_~g~0_3) InVars {~g~0=v_~g~0_3} OutVars{t_funThread1of1ForFork0_#t~post3=|v_t_funThread1of1ForFork0_#t~post3_1|, ~g~0=v_~g~0_3} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~post3] {845#(= |t_funThread1of1ForFork0_#t~post3| 0)} is VALID [2022-02-20 20:40:28,991 INFO L290 TraceCheckUtils]: 43: Hoare triple {845#(= |t_funThread1of1ForFork0_#t~post3| 0)} [173] L687-1-->L687-2: Formula: (= v_~g~0_4 (+ |v_t_funThread1of1ForFork0_#t~post3_3| 1)) InVars {t_funThread1of1ForFork0_#t~post3=|v_t_funThread1of1ForFork0_#t~post3_3|} OutVars{t_funThread1of1ForFork0_#t~post3=|v_t_funThread1of1ForFork0_#t~post3_3|, ~g~0=v_~g~0_4} AuxVars[] AssignedVars[~g~0] {846#(and (<= 1 ~g~0) (<= ~g~0 1))} is VALID [2022-02-20 20:40:28,992 INFO L290 TraceCheckUtils]: 44: Hoare triple {846#(and (<= 1 ~g~0) (<= ~g~0 1))} [174] L687-2-->L688: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~post3=|v_t_funThread1of1ForFork0_#t~post3_5|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~post3] {846#(and (<= 1 ~g~0) (<= ~g~0 1))} is VALID [2022-02-20 20:40:28,992 INFO L290 TraceCheckUtils]: 45: Hoare triple {846#(and (<= 1 ~g~0) (<= ~g~0 1))} [175] L688-->L689: Formula: (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#B~0.base_12| (store (select |v_#pthreadsMutex_18| |v_~#B~0.base_12|) |v_~#B~0.offset_12| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_18|, ~#B~0.base=|v_~#B~0.base_12|, ~#B~0.offset=|v_~#B~0.offset_12|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_17|, ~#B~0.base=|v_~#B~0.base_12|, ~#B~0.offset=|v_~#B~0.offset_12|} AuxVars[] AssignedVars[#pthreadsMutex] {846#(and (<= 1 ~g~0) (<= ~g~0 1))} is VALID [2022-02-20 20:40:28,993 INFO L290 TraceCheckUtils]: 46: Hoare triple {846#(and (<= 1 ~g~0) (<= ~g~0 1))} [176] L689-->L689-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_20| |v_~#B~0.base_13|))) (and (= (store |v_#pthreadsMutex_20| |v_~#B~0.base_13| (store .cse0 |v_~#B~0.offset_13| 1)) |v_#pthreadsMutex_19|) (= (select .cse0 |v_~#B~0.offset_13|) 0) (= |v_t_funThread1of1ForFork0_#t~nondet4_1| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_20|, ~#B~0.base=|v_~#B~0.base_13|, ~#B~0.offset=|v_~#B~0.offset_13|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_19|, ~#B~0.base=|v_~#B~0.base_13|, t_funThread1of1ForFork0_#t~nondet4=|v_t_funThread1of1ForFork0_#t~nondet4_1|, ~#B~0.offset=|v_~#B~0.offset_13|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet4] {846#(and (<= 1 ~g~0) (<= ~g~0 1))} is VALID [2022-02-20 20:40:28,996 INFO L290 TraceCheckUtils]: 47: Hoare triple {846#(and (<= 1 ~g~0) (<= ~g~0 1))} [177] L689-1-->L690: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet4=|v_t_funThread1of1ForFork0_#t~nondet4_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet4] {846#(and (<= 1 ~g~0) (<= ~g~0 1))} is VALID [2022-02-20 20:40:28,997 INFO L290 TraceCheckUtils]: 48: Hoare triple {846#(and (<= 1 ~g~0) (<= ~g~0 1))} [178] L690-->L690-1: Formula: (= |v_t_funThread1of1ForFork0_#t~post5_1| v_~g~0_5) InVars {~g~0=v_~g~0_5} OutVars{~g~0=v_~g~0_5, t_funThread1of1ForFork0_#t~post5=|v_t_funThread1of1ForFork0_#t~post5_1|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~post5] {847#(and (<= 1 |t_funThread1of1ForFork0_#t~post5|) (<= |t_funThread1of1ForFork0_#t~post5| 1))} is VALID [2022-02-20 20:40:28,997 INFO L290 TraceCheckUtils]: 49: Hoare triple {847#(and (<= 1 |t_funThread1of1ForFork0_#t~post5|) (<= |t_funThread1of1ForFork0_#t~post5| 1))} [179] L690-1-->L690-2: Formula: (= (+ (- 1) |v_t_funThread1of1ForFork0_#t~post5_3|) v_~g~0_6) InVars {t_funThread1of1ForFork0_#t~post5=|v_t_funThread1of1ForFork0_#t~post5_3|} OutVars{~g~0=v_~g~0_6, t_funThread1of1ForFork0_#t~post5=|v_t_funThread1of1ForFork0_#t~post5_3|} AuxVars[] AssignedVars[~g~0] {844#(= ~g~0 0)} is VALID [2022-02-20 20:40:28,998 INFO L290 TraceCheckUtils]: 50: Hoare triple {844#(= ~g~0 0)} [180] L690-2-->L691: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~post5=|v_t_funThread1of1ForFork0_#t~post5_5|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~post5] {844#(= ~g~0 0)} is VALID [2022-02-20 20:40:28,998 INFO L290 TraceCheckUtils]: 51: Hoare triple {844#(= ~g~0 0)} [181] L691-->L692: Formula: (= |v_#pthreadsMutex_21| (store |v_#pthreadsMutex_22| |v_~#B~0.base_14| (store (select |v_#pthreadsMutex_22| |v_~#B~0.base_14|) |v_~#B~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_22|, ~#B~0.base=|v_~#B~0.base_14|, ~#B~0.offset=|v_~#B~0.offset_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_21|, ~#B~0.base=|v_~#B~0.base_14|, ~#B~0.offset=|v_~#B~0.offset_14|} AuxVars[] AssignedVars[#pthreadsMutex] {844#(= ~g~0 0)} is VALID [2022-02-20 20:40:28,999 INFO L290 TraceCheckUtils]: 52: Hoare triple {844#(= ~g~0 0)} [182] L692-->L693: Formula: (= |v_#pthreadsMutex_23| (store |v_#pthreadsMutex_24| |v_~#A~0.base_10| (store (select |v_#pthreadsMutex_24| |v_~#A~0.base_10|) |v_~#A~0.offset_10| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_24|, ~#A~0.offset=|v_~#A~0.offset_10|, ~#A~0.base=|v_~#A~0.base_10|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_23|, ~#A~0.offset=|v_~#A~0.offset_10|, ~#A~0.base=|v_~#A~0.base_10|} AuxVars[] AssignedVars[#pthreadsMutex] {844#(= ~g~0 0)} is VALID [2022-02-20 20:40:28,999 INFO L290 TraceCheckUtils]: 53: Hoare triple {844#(= ~g~0 0)} [159] L700-->L700-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_6| |v_~#A~0.base_7|))) (and (= |v_#pthreadsMutex_5| (store |v_#pthreadsMutex_6| |v_~#A~0.base_7| (store .cse0 |v_~#A~0.offset_7| 1))) (= (select .cse0 |v_~#A~0.offset_7|) 0) (= |v_ULTIMATE.start_main_#t~nondet9#1_2| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_6|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_5|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet9#1] {844#(= ~g~0 0)} is VALID [2022-02-20 20:40:28,999 INFO L290 TraceCheckUtils]: 54: Hoare triple {844#(= ~g~0 0)} [164] L700-1-->L701: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] {844#(= ~g~0 0)} is VALID [2022-02-20 20:40:29,000 INFO L290 TraceCheckUtils]: 55: Hoare triple {844#(= ~g~0 0)} [146] L701-->L701-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_8| |v_~#B~0.base_9|))) (and (= |v_ULTIMATE.start_main_#t~nondet10#1_2| 0) (= (select .cse0 |v_~#B~0.offset_9|) 0) (= |v_#pthreadsMutex_7| (store |v_#pthreadsMutex_8| |v_~#B~0.base_9| (store .cse0 |v_~#B~0.offset_9| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_8|, ~#B~0.base=|v_~#B~0.base_9|, ~#B~0.offset=|v_~#B~0.offset_9|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_7|, ~#B~0.base=|v_~#B~0.base_9|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|, ~#B~0.offset=|v_~#B~0.offset_9|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet10#1] {844#(= ~g~0 0)} is VALID [2022-02-20 20:40:29,000 INFO L290 TraceCheckUtils]: 56: Hoare triple {844#(= ~g~0 0)} [105] L701-1-->L702: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] {844#(= ~g~0 0)} is VALID [2022-02-20 20:40:29,001 INFO L290 TraceCheckUtils]: 57: Hoare triple {844#(= ~g~0 0)} [107] L702-->L702-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {844#(= ~g~0 0)} is VALID [2022-02-20 20:40:29,001 INFO L290 TraceCheckUtils]: 58: Hoare triple {844#(= ~g~0 0)} [115] L702-1-->L702-2: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1| (ite (= v_~g~0_2 0) 1 0)) InVars {~g~0=v_~g~0_2} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ~g~0=v_~g~0_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {848#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:29,002 INFO L290 TraceCheckUtils]: 59: Hoare triple {848#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} [130] L702-2-->L19: Formula: true InVars {} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {848#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:29,002 INFO L290 TraceCheckUtils]: 60: Hoare triple {848#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} [117] L19-->L19-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_2| |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|) InVars {ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_2|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {849#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 20:40:29,003 INFO L290 TraceCheckUtils]: 61: Hoare triple {849#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} [102] L19-1-->L19-2: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_3| 0) InVars {ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_3|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_3|} AuxVars[] AssignedVars[] {843#false} is VALID [2022-02-20 20:40:29,003 INFO L290 TraceCheckUtils]: 62: Hoare triple {843#false} [120] L19-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {843#false} is VALID [2022-02-20 20:40:29,003 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:40:29,003 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:40:29,004 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335606182] [2022-02-20 20:40:29,004 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335606182] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:40:29,004 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:40:29,004 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:40:29,004 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452582439] [2022-02-20 20:40:29,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:40:29,005 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 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 63 [2022-02-20 20:40:29,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:40:29,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 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:40:29,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:40:29,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:40:29,064 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:40:29,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:40:29,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:40:29,066 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 81 [2022-02-20 20:40:29,067 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 67 transitions, 172 flow. Second operand has 8 states, 8 states have (on average 66.5) internal successors, (532), 8 states have internal predecessors, (532), 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:40:29,067 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:40:29,067 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 81 [2022-02-20 20:40:29,067 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:40:29,202 INFO L129 PetriNetUnfolder]: 4/96 cut-off events. [2022-02-20 20:40:29,202 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-02-20 20:40:29,203 INFO L84 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 96 events. 4/96 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 107 event pairs, 3 based on Foata normal form. 1/97 useless extension candidates. Maximal degree in co-relation 110. Up to 13 conditions per place. [2022-02-20 20:40:29,204 INFO L132 encePairwiseOnDemand]: 71/81 looper letters, 0 selfloop transitions, 0 changer transitions 65/65 dead transitions. [2022-02-20 20:40:29,204 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 65 transitions, 190 flow [2022-02-20 20:40:29,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 20:40:29,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-02-20 20:40:29,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 662 transitions. [2022-02-20 20:40:29,213 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.817283950617284 [2022-02-20 20:40:29,213 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 662 transitions. [2022-02-20 20:40:29,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 662 transitions. [2022-02-20 20:40:29,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:40:29,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 662 transitions. [2022-02-20 20:40:29,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 66.2) internal successors, (662), 10 states have internal predecessors, (662), 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:40:29,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 81.0) internal successors, (891), 11 states have internal predecessors, (891), 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:40:29,217 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 81.0) internal successors, (891), 11 states have internal predecessors, (891), 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:40:29,217 INFO L186 Difference]: Start difference. First operand has 75 places, 67 transitions, 172 flow. Second operand 10 states and 662 transitions. [2022-02-20 20:40:29,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 65 transitions, 190 flow [2022-02-20 20:40:29,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 65 transitions, 183 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-02-20 20:40:29,222 INFO L242 Difference]: Finished difference. Result has 79 places, 0 transitions, 0 flow [2022-02-20 20:40:29,222 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=0, PETRI_PLACES=79, PETRI_TRANSITIONS=0} [2022-02-20 20:40:29,223 INFO L334 CegarLoopForPetriNet]: 69 programPoint places, 10 predicate places. [2022-02-20 20:40:29,223 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 0 transitions, 0 flow [2022-02-20 20:40:29,224 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:40:29,224 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 63 [2022-02-20 20:40:29,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:40:29,224 INFO L470 AbstractCegarLoop]: Abstraction has has 79 places, 0 transitions, 0 flow [2022-02-20 20:40:29,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 66.5) internal successors, (532), 8 states have internal predecessors, (532), 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:40:29,227 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-02-20 20:40:29,228 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 2 remaining) [2022-02-20 20:40:29,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 20:40:29,231 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-20 20:40:29,233 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-20 20:40:29,233 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 20:40:29,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 08:40:29 BasicIcfg [2022-02-20 20:40:29,235 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 20:40:29,236 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 20:40:29,236 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 20:40:29,236 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 20:40:29,236 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:40:26" (3/4) ... [2022-02-20 20:40:29,238 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 20:40:29,241 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2022-02-20 20:40:29,244 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-02-20 20:40:29,244 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-02-20 20:40:29,244 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 20:40:29,244 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 20:40:29,268 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 20:40:29,268 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 20:40:29,269 INFO L158 Benchmark]: Toolchain (without parser) took 3356.71ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 78.0MB in the beginning and 85.8MB in the end (delta: -7.8MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2022-02-20 20:40:29,269 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 81.8MB. Free memory was 38.0MB in the beginning and 37.9MB in the end (delta: 49.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 20:40:29,270 INFO L158 Benchmark]: CACSL2BoogieTranslator took 414.90ms. Allocated memory is still 111.1MB. Free memory was 77.7MB in the beginning and 77.2MB in the end (delta: 530.5kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 20:40:29,270 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.99ms. Allocated memory is still 111.1MB. Free memory was 77.2MB in the beginning and 75.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:40:29,270 INFO L158 Benchmark]: Boogie Preprocessor took 35.43ms. Allocated memory is still 111.1MB. Free memory was 75.1MB in the beginning and 73.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:40:29,271 INFO L158 Benchmark]: RCFGBuilder took 390.14ms. Allocated memory is still 111.1MB. Free memory was 73.5MB in the beginning and 59.9MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 20:40:29,271 INFO L158 Benchmark]: TraceAbstraction took 2413.22ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 59.4MB in the beginning and 88.9MB in the end (delta: -29.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 20:40:29,272 INFO L158 Benchmark]: Witness Printer took 32.13ms. Allocated memory is still 134.2MB. Free memory was 88.9MB in the beginning and 85.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:40:29,274 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.19ms. Allocated memory is still 81.8MB. Free memory was 38.0MB in the beginning and 37.9MB in the end (delta: 49.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 414.90ms. Allocated memory is still 111.1MB. Free memory was 77.7MB in the beginning and 77.2MB in the end (delta: 530.5kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.99ms. Allocated memory is still 111.1MB. Free memory was 77.2MB in the beginning and 75.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.43ms. Allocated memory is still 111.1MB. Free memory was 75.1MB in the beginning and 73.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 390.14ms. Allocated memory is still 111.1MB. Free memory was 73.5MB in the beginning and 59.9MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2413.22ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 59.4MB in the beginning and 88.9MB in the end (delta: -29.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 32.13ms. Allocated memory is still 134.2MB. Free memory was 88.9MB in the beginning and 85.8MB 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: 19]: 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 3 procedures, 101 locations, 2 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.3s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 32 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32 mSDsluCounter, 66 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 46 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 148 IncrementalHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 32 mSDtfsCounter, 148 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=172occurred in iteration=3, InterpolantAutomatonStates: 25, 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.7s InterpolantComputationTime, 220 NumberOfCodeBlocks, 220 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 216 ConstructedInterpolants, 0 QuantifiedInterpolants, 625 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-02-20 20:40:29,305 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