./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/lazy01.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/lazy01.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 b5d87933b05ad3566f9bc28daac5c0aeceb8a45433a1cac3d51a8d34f7f284f0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:07:18,123 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:07:18,124 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:07:18,152 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:07:18,153 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:07:18,154 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:07:18,156 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:07:18,159 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:07:18,161 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:07:18,162 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:07:18,163 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:07:18,164 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:07:18,165 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:07:18,167 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:07:18,168 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:07:18,169 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:07:18,170 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:07:18,174 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:07:18,175 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:07:18,178 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:07:18,181 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:07:18,182 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:07:18,183 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:07:18,184 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:07:18,185 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:07:18,186 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:07:18,187 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:07:18,187 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:07:18,188 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:07:18,189 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:07:18,189 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:07:18,189 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:07:18,190 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:07:18,191 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:07:18,192 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:07:18,192 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:07:18,193 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:07:18,193 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:07:18,193 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:07:18,194 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:07:18,194 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:07:18,195 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:07:18,220 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:07:18,220 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:07:18,221 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:07:18,221 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:07:18,221 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:07:18,221 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:07:18,222 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:07:18,222 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:07:18,222 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:07:18,222 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:07:18,222 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:07:18,230 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:07:18,230 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:07:18,231 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:07:18,231 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:07:18,231 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:07:18,231 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:07:18,231 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:07:18,231 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:07:18,232 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:07:18,232 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:07:18,232 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:07:18,232 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:07:18,232 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:07:18,233 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:07:18,233 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:07:18,233 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:07:18,234 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:07:18,234 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:07:18,234 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:07:18,234 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:07:18,235 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:07:18,235 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:07:18,235 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 -> b5d87933b05ad3566f9bc28daac5c0aeceb8a45433a1cac3d51a8d34f7f284f0 [2022-02-20 20:07:18,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:07:18,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:07:18,434 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:07:18,435 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:07:18,435 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:07:18,436 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/lazy01.i [2022-02-20 20:07:18,478 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d237b087f/007937e9ccf547f49da61aeac46bb987/FLAG97bc8de8f [2022-02-20 20:07:18,925 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:07:18,926 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/lazy01.i [2022-02-20 20:07:18,934 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d237b087f/007937e9ccf547f49da61aeac46bb987/FLAG97bc8de8f [2022-02-20 20:07:19,298 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d237b087f/007937e9ccf547f49da61aeac46bb987 [2022-02-20 20:07:19,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:07:19,301 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:07:19,302 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:07:19,302 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:07:19,304 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:07:19,305 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:07:19" (1/1) ... [2022-02-20 20:07:19,306 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54fd2cb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:07:19, skipping insertion in model container [2022-02-20 20:07:19,306 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:07:19" (1/1) ... [2022-02-20 20:07:19,310 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:07:19,332 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:07:19,558 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/lazy01.i[31042,31055] [2022-02-20 20:07:19,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:07:19,575 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:07:19,612 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/lazy01.i[31042,31055] [2022-02-20 20:07:19,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:07:19,658 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:07:19,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:07:19 WrapperNode [2022-02-20 20:07:19,658 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:07:19,659 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:07:19,659 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:07:19,659 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:07:19,664 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:07:19" (1/1) ... [2022-02-20 20:07:19,690 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:07:19" (1/1) ... [2022-02-20 20:07:19,724 INFO L137 Inliner]: procedures = 169, calls = 33, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 62 [2022-02-20 20:07:19,724 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:07:19,725 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:07:19,725 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:07:19,725 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:07:19,730 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:07:19" (1/1) ... [2022-02-20 20:07:19,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:07:19" (1/1) ... [2022-02-20 20:07:19,740 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:07:19" (1/1) ... [2022-02-20 20:07:19,741 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:07:19" (1/1) ... [2022-02-20 20:07:19,748 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:07:19" (1/1) ... [2022-02-20 20:07:19,755 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:07:19" (1/1) ... [2022-02-20 20:07:19,757 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:07:19" (1/1) ... [2022-02-20 20:07:19,762 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:07:19,769 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:07:19,769 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:07:19,769 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:07:19,770 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:07:19" (1/1) ... [2022-02-20 20:07:19,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:07:19,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:07:19,808 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:07:19,836 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:07:19,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 20:07:19,865 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-02-20 20:07:19,865 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-02-20 20:07:19,865 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-02-20 20:07:19,865 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-02-20 20:07:19,865 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-02-20 20:07:19,865 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-02-20 20:07:19,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 20:07:19,866 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-02-20 20:07:19,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:07:19,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 20:07:19,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 20:07:19,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:07:19,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:07:19,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:07:19,868 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:07:20,028 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:07:20,029 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:07:20,223 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:07:20,228 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:07:20,228 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 20:07:20,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:07:20 BoogieIcfgContainer [2022-02-20 20:07:20,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:07:20,230 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:07:20,230 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:07:20,235 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:07:20,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:07:19" (1/3) ... [2022-02-20 20:07:20,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1267d48e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:07:20, skipping insertion in model container [2022-02-20 20:07:20,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:07:19" (2/3) ... [2022-02-20 20:07:20,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1267d48e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:07:20, skipping insertion in model container [2022-02-20 20:07:20,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:07:20" (3/3) ... [2022-02-20 20:07:20,238 INFO L111 eAbstractionObserver]: Analyzing ICFG lazy01.i [2022-02-20 20:07:20,241 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-20 20:07:20,241 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:07:20,241 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 20:07:20,241 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-20 20:07:20,303 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,304 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,304 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,304 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,305 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,305 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,305 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,306 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,306 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,308 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,309 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,311 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,311 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,311 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,312 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,312 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,312 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,313 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,313 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,314 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,314 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,314 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,315 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,317 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,317 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,318 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,318 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,318 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,318 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,318 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,318 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,319 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,319 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,319 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,320 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,320 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,320 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,320 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,321 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,321 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,321 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,321 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,321 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,322 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,322 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,322 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,322 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,323 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,323 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,324 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,327 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,327 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,327 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,327 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,329 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,331 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,331 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,332 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,332 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,346 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,346 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,346 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,346 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,346 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,352 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,352 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,352 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,353 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,353 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,353 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:07:20,368 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-02-20 20:07:20,416 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:07:20,420 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:07:20,420 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-02-20 20:07:20,428 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 100 places, 91 transitions, 206 flow [2022-02-20 20:07:20,473 INFO L129 PetriNetUnfolder]: 1/88 cut-off events. [2022-02-20 20:07:20,473 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-02-20 20:07:20,476 INFO L84 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 88 events. 1/88 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 62 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2022-02-20 20:07:20,476 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 91 transitions, 206 flow [2022-02-20 20:07:20,480 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 70 transitions, 155 flow [2022-02-20 20:07:20,501 INFO L129 PetriNetUnfolder]: 0/63 cut-off events. [2022-02-20 20:07:20,503 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-02-20 20:07:20,503 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:07:20,504 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] [2022-02-20 20:07:20,504 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting thread3Err0ASSERT_VIOLATIONERROR_FUNCTION === [thread3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-02-20 20:07:20,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:07:20,510 INFO L85 PathProgramCache]: Analyzing trace with hash 992235864, now seen corresponding path program 1 times [2022-02-20 20:07:20,516 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:07:20,516 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002725085] [2022-02-20 20:07:20,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:07:20,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:07:20,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:07:20,744 INFO L290 TraceCheckUtils]: 0: Hoare triple {103#true} [161] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {103#true} is VALID [2022-02-20 20:07:20,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {103#true} [145] 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] {103#true} is VALID [2022-02-20 20:07:20,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {103#true} [169] 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[] {103#true} is VALID [2022-02-20 20:07:20,745 INFO L290 TraceCheckUtils]: 3: Hoare triple {103#true} [173] L-1-2-->L20: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {103#true} is VALID [2022-02-20 20:07:20,745 INFO L290 TraceCheckUtils]: 4: Hoare triple {103#true} [109] L20-->L20-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[] {103#true} is VALID [2022-02-20 20:07:20,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {103#true} [158] L20-1-->L20-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[] {103#true} is VALID [2022-02-20 20:07:20,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {103#true} [155] L20-2-->L20-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[] {103#true} is VALID [2022-02-20 20:07:20,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {103#true} [176] L20-3-->L20-4: Formula: (and (= 9 (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[] {103#true} is VALID [2022-02-20 20:07:20,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {103#true} [147] L20-4-->L702: Formula: (and (= 3 |v_~#mutex~0.base_7|) (= |v_~#mutex~0.offset_7| 0)) InVars {} OutVars{~#mutex~0.base=|v_~#mutex~0.base_7|, ~#mutex~0.offset=|v_~#mutex~0.offset_7|} AuxVars[] AssignedVars[~#mutex~0.base, ~#mutex~0.offset] {103#true} is VALID [2022-02-20 20:07:20,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {103#true} [117] L702-->L702-1: 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[] {103#true} is VALID [2022-02-20 20:07:20,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {103#true} [128] L702-1-->L702-2: Formula: (= (select (select |v_#memory_int_3| |v_~#mutex~0.base_8|) |v_~#mutex~0.offset_8|) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_8|, #memory_int=|v_#memory_int_3|, ~#mutex~0.base=|v_~#mutex~0.base_8|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_8|, #memory_int=|v_#memory_int_3|, ~#mutex~0.base=|v_~#mutex~0.base_8|} AuxVars[] AssignedVars[] {103#true} is VALID [2022-02-20 20:07:20,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {103#true} [149] L702-2-->L702-3: Formula: (= (select (select |v_#memory_int_4| |v_~#mutex~0.base_9|) (+ |v_~#mutex~0.offset_9| 4)) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_9|, #memory_int=|v_#memory_int_4|, ~#mutex~0.base=|v_~#mutex~0.base_9|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_9|, #memory_int=|v_#memory_int_4|, ~#mutex~0.base=|v_~#mutex~0.base_9|} AuxVars[] AssignedVars[] {103#true} is VALID [2022-02-20 20:07:20,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {103#true} [115] L702-3-->L702-4: Formula: (= (select (select |v_#memory_int_5| |v_~#mutex~0.base_10|) (+ |v_~#mutex~0.offset_10| 8)) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_10|, #memory_int=|v_#memory_int_5|, ~#mutex~0.base=|v_~#mutex~0.base_10|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_10|, #memory_int=|v_#memory_int_5|, ~#mutex~0.base=|v_~#mutex~0.base_10|} AuxVars[] AssignedVars[] {103#true} is VALID [2022-02-20 20:07:20,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {103#true} [162] L702-4-->L702-5: Formula: (= (select (select |v_#memory_int_6| |v_~#mutex~0.base_11|) (+ |v_~#mutex~0.offset_11| 12)) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_11|, #memory_int=|v_#memory_int_6|, ~#mutex~0.base=|v_~#mutex~0.base_11|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_11|, #memory_int=|v_#memory_int_6|, ~#mutex~0.base=|v_~#mutex~0.base_11|} AuxVars[] AssignedVars[] {103#true} is VALID [2022-02-20 20:07:20,747 INFO L290 TraceCheckUtils]: 14: Hoare triple {103#true} [104] L702-5-->L702-6: Formula: (= (select (select |v_#memory_int_7| |v_~#mutex~0.base_12|) (+ 16 |v_~#mutex~0.offset_12|)) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_12|, #memory_int=|v_#memory_int_7|, ~#mutex~0.base=|v_~#mutex~0.base_12|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_12|, #memory_int=|v_#memory_int_7|, ~#mutex~0.base=|v_~#mutex~0.base_12|} AuxVars[] AssignedVars[] {103#true} is VALID [2022-02-20 20:07:20,748 INFO L290 TraceCheckUtils]: 15: Hoare triple {103#true} [180] L702-6-->L-1-3: Formula: (= v_~data~0_7 0) InVars {} OutVars{~data~0=v_~data~0_7} AuxVars[] AssignedVars[~data~0] {105#(= ~data~0 0)} is VALID [2022-02-20 20:07:20,748 INFO L290 TraceCheckUtils]: 16: Hoare triple {105#(= ~data~0 0)} [174] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {105#(= ~data~0 0)} is VALID [2022-02-20 20:07:20,749 INFO L290 TraceCheckUtils]: 17: Hoare triple {105#(= ~data~0 0)} [154] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {105#(= ~data~0 0)} is VALID [2022-02-20 20:07:20,749 INFO L290 TraceCheckUtils]: 18: Hoare triple {105#(= ~data~0 0)} [110] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {105#(= ~data~0 0)} is VALID [2022-02-20 20:07:20,750 INFO L290 TraceCheckUtils]: 19: Hoare triple {105#(= ~data~0 0)} [152] L-1-6-->L730: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_1|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_1|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~#t2~0#1.base] {105#(= ~data~0 0)} is VALID [2022-02-20 20:07:20,750 INFO L290 TraceCheckUtils]: 20: Hoare triple {105#(= ~data~0 0)} [167] L730-->L731: Formula: (= (store |v_#pthreadsMutex_14| |v_~#mutex~0.base_13| (store (select |v_#pthreadsMutex_14| |v_~#mutex~0.base_13|) |v_~#mutex~0.offset_13| 0)) |v_#pthreadsMutex_13|) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_13|, #pthreadsMutex=|v_#pthreadsMutex_14|, ~#mutex~0.base=|v_~#mutex~0.base_13|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_13|, #pthreadsMutex=|v_#pthreadsMutex_13|, ~#mutex~0.base=|v_~#mutex~0.base_13|} AuxVars[] AssignedVars[#pthreadsMutex] {105#(= ~data~0 0)} is VALID [2022-02-20 20:07:20,751 INFO L290 TraceCheckUtils]: 21: Hoare triple {105#(= ~data~0 0)} [126] L731-->L731-1: Formula: (and (= (store |v_#length_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4) |v_#length_4|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] {105#(= ~data~0 0)} is VALID [2022-02-20 20:07:20,751 INFO L290 TraceCheckUtils]: 22: Hoare triple {105#(= ~data~0 0)} [130] L731-1-->L731-2: Formula: (and (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= |v_#valid_7| (store |v_#valid_8| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1)) (= (store |v_#length_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4) |v_#length_6|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] {105#(= ~data~0 0)} is VALID [2022-02-20 20:07:20,752 INFO L290 TraceCheckUtils]: 23: Hoare triple {105#(= ~data~0 0)} [95] L731-2-->L731-3: Formula: (and (= (select |v_#valid_10| |v_ULTIMATE.start_main_~#t3~0#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_2| 0) (= |v_#valid_9| (store |v_#valid_10| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 1)) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_2| 0)) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t3~0#1.base_2|) (= |v_#length_8| (store |v_#length_9| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_9|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_8|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_2|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] {105#(= ~data~0 0)} is VALID [2022-02-20 20:07:20,752 INFO L290 TraceCheckUtils]: 24: Hoare triple {105#(= ~data~0 0)} [151] L731-3-->L732: Formula: (= |v_ULTIMATE.start_main_#t~pre7#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {105#(= ~data~0 0)} is VALID [2022-02-20 20:07:20,753 INFO L290 TraceCheckUtils]: 25: Hoare triple {105#(= ~data~0 0)} [121] L732-->L732-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {105#(= ~data~0 0)} is VALID [2022-02-20 20:07:20,753 INFO L290 TraceCheckUtils]: 26: Hoare triple {105#(= ~data~0 0)} [171] L732-1-->L732-2: Formula: (= (store |v_#memory_int_9| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_9| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre7#1_3|)) |v_#memory_int_8|) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {105#(= ~data~0 0)} is VALID [2022-02-20 20:07:20,753 INFO L290 TraceCheckUtils]: 27: Hoare triple {105#(= ~data~0 0)} [215] L732-2-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_thread1Thread1of1ForFork2_thidvar0_2) (= |v_thread1Thread1of1ForFork2_#in~arg.base_4| 0) (= |v_thread1Thread1of1ForFork2_#in~arg.offset_4| 0) (= 0 v_thread1Thread1of1ForFork2_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{thread1Thread1of1ForFork2_#t~nondet3=|v_thread1Thread1of1ForFork2_#t~nondet3_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_2, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_#in~arg.base=|v_thread1Thread1of1ForFork2_#in~arg.base_4|, thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_4|, thread1Thread1of1ForFork2_~arg.offset=v_thread1Thread1of1ForFork2_~arg.offset_4, thread1Thread1of1ForFork2_~arg.base=v_thread1Thread1of1ForFork2_~arg.base_4, thread1Thread1of1ForFork2_#t~post4=|v_thread1Thread1of1ForFork2_#t~post4_8|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_4|, thread1Thread1of1ForFork2_#in~arg.offset=|v_thread1Thread1of1ForFork2_#in~arg.offset_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~nondet3, thread1Thread1of1ForFork2_thidvar1, thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_#in~arg.base, thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_~arg.offset, thread1Thread1of1ForFork2_~arg.base, thread1Thread1of1ForFork2_#t~post4, thread1Thread1of1ForFork2_#res.offset, thread1Thread1of1ForFork2_#in~arg.offset] {105#(= ~data~0 0)} is VALID [2022-02-20 20:07:20,754 INFO L290 TraceCheckUtils]: 28: Hoare triple {105#(= ~data~0 0)} [105] L732-3-->L732-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {105#(= ~data~0 0)} is VALID [2022-02-20 20:07:20,754 INFO L290 TraceCheckUtils]: 29: Hoare triple {105#(= ~data~0 0)} [113] L732-4-->L733: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] {105#(= ~data~0 0)} is VALID [2022-02-20 20:07:20,755 INFO L290 TraceCheckUtils]: 30: Hoare triple {105#(= ~data~0 0)} [124] L733-->L733-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] {105#(= ~data~0 0)} is VALID [2022-02-20 20:07:20,755 INFO L290 TraceCheckUtils]: 31: Hoare triple {105#(= ~data~0 0)} [97] L733-1-->L733-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {105#(= ~data~0 0)} is VALID [2022-02-20 20:07:20,756 INFO L290 TraceCheckUtils]: 32: Hoare triple {105#(= ~data~0 0)} [179] L733-2-->L733-3: Formula: (= |v_#memory_int_10| (store |v_#memory_int_11| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_11| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre9#1_3|))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{#memory_int=|v_#memory_int_10|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {105#(= ~data~0 0)} is VALID [2022-02-20 20:07:20,756 INFO L290 TraceCheckUtils]: 33: Hoare triple {105#(= ~data~0 0)} [211] L733-3-->thread2ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread2Thread1of1ForFork0_thidvar0_2) (= |v_thread2Thread1of1ForFork0_#in~arg.offset_4| 0) (= |v_thread2Thread1of1ForFork0_#in~arg.base_4| 0) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_4|, thread2Thread1of1ForFork0_~arg.base=v_thread2Thread1of1ForFork0_~arg.base_4, thread2Thread1of1ForFork0_~arg.offset=v_thread2Thread1of1ForFork0_~arg.offset_4, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, thread2Thread1of1ForFork0_#in~arg.offset=|v_thread2Thread1of1ForFork0_#in~arg.offset_4|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_#t~nondet5=|v_thread2Thread1of1ForFork0_#t~nondet5_6|, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#in~arg.base=|v_thread2Thread1of1ForFork0_#in~arg.base_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_~arg.base, thread2Thread1of1ForFork0_~arg.offset, thread2Thread1of1ForFork0_#in~arg.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_#t~nondet5, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#in~arg.base] {105#(= ~data~0 0)} is VALID [2022-02-20 20:07:20,756 INFO L290 TraceCheckUtils]: 34: Hoare triple {105#(= ~data~0 0)} [116] L733-4-->L733-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] {105#(= ~data~0 0)} is VALID [2022-02-20 20:07:20,757 INFO L290 TraceCheckUtils]: 35: Hoare triple {105#(= ~data~0 0)} [101] L733-5-->L734: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] {105#(= ~data~0 0)} is VALID [2022-02-20 20:07:20,757 INFO L290 TraceCheckUtils]: 36: Hoare triple {105#(= ~data~0 0)} [127] L734-->L734-1: Formula: (= |v_ULTIMATE.start_main_#t~pre11#1_2| |v_#pthreadsForks_7|) InVars {#pthreadsForks=|v_#pthreadsForks_7|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, #pthreadsForks=|v_#pthreadsForks_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1] {105#(= ~data~0 0)} is VALID [2022-02-20 20:07:20,758 INFO L290 TraceCheckUtils]: 37: Hoare triple {105#(= ~data~0 0)} [134] L734-1-->L734-2: Formula: (= (+ 1 |v_#pthreadsForks_9|) |v_#pthreadsForks_8|) InVars {#pthreadsForks=|v_#pthreadsForks_9|} OutVars{#pthreadsForks=|v_#pthreadsForks_8|} AuxVars[] AssignedVars[#pthreadsForks] {105#(= ~data~0 0)} is VALID [2022-02-20 20:07:20,758 INFO L290 TraceCheckUtils]: 38: Hoare triple {105#(= ~data~0 0)} [141] L734-2-->L734-3: Formula: (= (store |v_#memory_int_13| |v_ULTIMATE.start_main_~#t3~0#1.base_3| (store (select |v_#memory_int_13| |v_ULTIMATE.start_main_~#t3~0#1.base_3|) |v_ULTIMATE.start_main_~#t3~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre11#1_3|)) |v_#memory_int_12|) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_3|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_3|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {105#(= ~data~0 0)} is VALID [2022-02-20 20:07:20,759 INFO L290 TraceCheckUtils]: 39: Hoare triple {105#(= ~data~0 0)} [213] L734-3-->thread3ENTRY: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar1_2) (= 0 v_thread3Thread1of1ForFork1_thidvar2_2) (= v_thread3Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= |v_thread3Thread1of1ForFork1_#in~arg.base_4| 0) (= 0 v_thread3Thread1of1ForFork1_thidvar3_2) (= |v_thread3Thread1of1ForFork1_#in~arg.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread3Thread1of1ForFork1_#t~nondet6=|v_thread3Thread1of1ForFork1_#t~nondet6_6|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread3Thread1of1ForFork1_#in~arg.offset=|v_thread3Thread1of1ForFork1_#in~arg.offset_4|, thread3Thread1of1ForFork1_~arg.base=v_thread3Thread1of1ForFork1_~arg.base_4, thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_4|, thread3Thread1of1ForFork1_~arg.offset=v_thread3Thread1of1ForFork1_~arg.offset_4, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_4|, thread3Thread1of1ForFork1_#in~arg.base=|v_thread3Thread1of1ForFork1_#in~arg.base_4|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~nondet6, thread3Thread1of1ForFork1_#in~arg.offset, thread3Thread1of1ForFork1_~arg.base, thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_~arg.offset, thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_#res.base, thread3Thread1of1ForFork1_#in~arg.base, thread3Thread1of1ForFork1_thidvar3, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2] {105#(= ~data~0 0)} is VALID [2022-02-20 20:07:20,759 INFO L290 TraceCheckUtils]: 40: Hoare triple {105#(= ~data~0 0)} [199] thread3ENTRY-->L720: Formula: (and (= v_thread3Thread1of1ForFork1_~arg.base_1 |v_thread3Thread1of1ForFork1_#in~arg.base_1|) (= |v_thread3Thread1of1ForFork1_#in~arg.offset_1| v_thread3Thread1of1ForFork1_~arg.offset_1)) InVars {thread3Thread1of1ForFork1_#in~arg.offset=|v_thread3Thread1of1ForFork1_#in~arg.offset_1|, thread3Thread1of1ForFork1_#in~arg.base=|v_thread3Thread1of1ForFork1_#in~arg.base_1|} OutVars{thread3Thread1of1ForFork1_~arg.base=v_thread3Thread1of1ForFork1_~arg.base_1, thread3Thread1of1ForFork1_~arg.offset=v_thread3Thread1of1ForFork1_~arg.offset_1, thread3Thread1of1ForFork1_#in~arg.base=|v_thread3Thread1of1ForFork1_#in~arg.base_1|, thread3Thread1of1ForFork1_#in~arg.offset=|v_thread3Thread1of1ForFork1_#in~arg.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_~arg.base, thread3Thread1of1ForFork1_~arg.offset] {105#(= ~data~0 0)} is VALID [2022-02-20 20:07:20,760 INFO L290 TraceCheckUtils]: 41: Hoare triple {105#(= ~data~0 0)} [200] L720-->L720-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_10| |v_~#mutex~0.base_5|))) (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#mutex~0.base_5| (store .cse0 |v_~#mutex~0.offset_5| 1))) (= |v_thread3Thread1of1ForFork1_#t~nondet6_1| 0) (= (select .cse0 |v_~#mutex~0.offset_5|) 0))) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_5|, #pthreadsMutex=|v_#pthreadsMutex_10|, ~#mutex~0.base=|v_~#mutex~0.base_5|} OutVars{thread3Thread1of1ForFork1_#t~nondet6=|v_thread3Thread1of1ForFork1_#t~nondet6_1|, ~#mutex~0.offset=|v_~#mutex~0.offset_5|, #pthreadsMutex=|v_#pthreadsMutex_9|, ~#mutex~0.base=|v_~#mutex~0.base_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~nondet6, #pthreadsMutex] {105#(= ~data~0 0)} is VALID [2022-02-20 20:07:20,760 INFO L290 TraceCheckUtils]: 42: Hoare triple {105#(= ~data~0 0)} [201] L720-1-->L721: Formula: true InVars {} OutVars{thread3Thread1of1ForFork1_#t~nondet6=|v_thread3Thread1of1ForFork1_#t~nondet6_3|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~nondet6] {105#(= ~data~0 0)} is VALID [2022-02-20 20:07:20,760 INFO L290 TraceCheckUtils]: 43: Hoare triple {105#(= ~data~0 0)} [202] L721-->L722: Formula: (<= 3 v_~data~0_5) InVars {~data~0=v_~data~0_5} OutVars{~data~0=v_~data~0_5} AuxVars[] AssignedVars[] {104#false} is VALID [2022-02-20 20:07:20,761 INFO L290 TraceCheckUtils]: 44: Hoare triple {104#false} [204] L722-->thread3Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {104#false} is VALID [2022-02-20 20:07:20,762 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:07:20,762 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:07:20,762 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002725085] [2022-02-20 20:07:20,763 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002725085] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:07:20,763 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:07:20,763 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 20:07:20,764 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231047446] [2022-02-20 20:07:20,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:07:20,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 45 [2022-02-20 20:07:20,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:07:20,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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:07:20,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:07:20,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 20:07:20,826 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:07:20,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 20:07:20,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 20:07:20,847 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 91 [2022-02-20 20:07:20,851 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 70 transitions, 155 flow. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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:07:20,851 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:07:20,851 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 91 [2022-02-20 20:07:20,852 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:07:20,927 INFO L129 PetriNetUnfolder]: 19/150 cut-off events. [2022-02-20 20:07:20,927 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-02-20 20:07:20,929 INFO L84 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 150 events. 19/150 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 427 event pairs, 9 based on Foata normal form. 2/149 useless extension candidates. Maximal degree in co-relation 152. Up to 37 conditions per place. [2022-02-20 20:07:20,930 INFO L132 encePairwiseOnDemand]: 87/91 looper letters, 12 selfloop transitions, 3 changer transitions 0/75 dead transitions. [2022-02-20 20:07:20,930 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 75 transitions, 201 flow [2022-02-20 20:07:20,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 20:07:20,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-02-20 20:07:20,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 247 transitions. [2022-02-20 20:07:20,952 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2022-02-20 20:07:20,953 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 247 transitions. [2022-02-20 20:07:20,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 247 transitions. [2022-02-20 20:07:20,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:07:20,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 247 transitions. [2022-02-20 20:07:20,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 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:07:20,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 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:07:20,963 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 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:07:20,964 INFO L186 Difference]: Start difference. First operand has 80 places, 70 transitions, 155 flow. Second operand 3 states and 247 transitions. [2022-02-20 20:07:20,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 75 transitions, 201 flow [2022-02-20 20:07:20,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 75 transitions, 189 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-02-20 20:07:20,973 INFO L242 Difference]: Finished difference. Result has 78 places, 72 transitions, 165 flow [2022-02-20 20:07:20,974 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=165, PETRI_PLACES=78, PETRI_TRANSITIONS=72} [2022-02-20 20:07:20,977 INFO L334 CegarLoopForPetriNet]: 80 programPoint places, -2 predicate places. [2022-02-20 20:07:20,977 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 72 transitions, 165 flow [2022-02-20 20:07:21,056 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2490 states, 2489 states have (on average 3.111691442346324) internal successors, (7745), 2489 states have internal predecessors, (7745), 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:07:21,065 INFO L78 Accepts]: Start accepts. Automaton has has 2490 states, 2489 states have (on average 3.111691442346324) internal successors, (7745), 2489 states have internal predecessors, (7745), 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 45 [2022-02-20 20:07:21,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:07:21,066 INFO L470 AbstractCegarLoop]: Abstraction has has 78 places, 72 transitions, 165 flow [2022-02-20 20:07:21,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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:07:21,066 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:07:21,066 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] [2022-02-20 20:07:21,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:07:21,067 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting thread3Err0ASSERT_VIOLATIONERROR_FUNCTION === [thread3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-02-20 20:07:21,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:07:21,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1710973530, now seen corresponding path program 1 times [2022-02-20 20:07:21,068 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:07:21,068 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239083105] [2022-02-20 20:07:21,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:07:21,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:07:21,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:07:21,157 INFO L290 TraceCheckUtils]: 0: Hoare triple {2599#true} [161] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2599#true} is VALID [2022-02-20 20:07:21,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {2599#true} [145] 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] {2599#true} is VALID [2022-02-20 20:07:21,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {2599#true} [169] 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[] {2599#true} is VALID [2022-02-20 20:07:21,158 INFO L290 TraceCheckUtils]: 3: Hoare triple {2599#true} [173] L-1-2-->L20: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {2599#true} is VALID [2022-02-20 20:07:21,158 INFO L290 TraceCheckUtils]: 4: Hoare triple {2599#true} [109] L20-->L20-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[] {2599#true} is VALID [2022-02-20 20:07:21,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {2599#true} [158] L20-1-->L20-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[] {2599#true} is VALID [2022-02-20 20:07:21,159 INFO L290 TraceCheckUtils]: 6: Hoare triple {2599#true} [155] L20-2-->L20-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[] {2599#true} is VALID [2022-02-20 20:07:21,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {2599#true} [176] L20-3-->L20-4: Formula: (and (= 9 (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[] {2599#true} is VALID [2022-02-20 20:07:21,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {2599#true} [147] L20-4-->L702: Formula: (and (= 3 |v_~#mutex~0.base_7|) (= |v_~#mutex~0.offset_7| 0)) InVars {} OutVars{~#mutex~0.base=|v_~#mutex~0.base_7|, ~#mutex~0.offset=|v_~#mutex~0.offset_7|} AuxVars[] AssignedVars[~#mutex~0.base, ~#mutex~0.offset] {2599#true} is VALID [2022-02-20 20:07:21,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {2599#true} [117] L702-->L702-1: 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[] {2599#true} is VALID [2022-02-20 20:07:21,162 INFO L290 TraceCheckUtils]: 10: Hoare triple {2599#true} [128] L702-1-->L702-2: Formula: (= (select (select |v_#memory_int_3| |v_~#mutex~0.base_8|) |v_~#mutex~0.offset_8|) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_8|, #memory_int=|v_#memory_int_3|, ~#mutex~0.base=|v_~#mutex~0.base_8|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_8|, #memory_int=|v_#memory_int_3|, ~#mutex~0.base=|v_~#mutex~0.base_8|} AuxVars[] AssignedVars[] {2599#true} is VALID [2022-02-20 20:07:21,162 INFO L290 TraceCheckUtils]: 11: Hoare triple {2599#true} [149] L702-2-->L702-3: Formula: (= (select (select |v_#memory_int_4| |v_~#mutex~0.base_9|) (+ |v_~#mutex~0.offset_9| 4)) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_9|, #memory_int=|v_#memory_int_4|, ~#mutex~0.base=|v_~#mutex~0.base_9|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_9|, #memory_int=|v_#memory_int_4|, ~#mutex~0.base=|v_~#mutex~0.base_9|} AuxVars[] AssignedVars[] {2599#true} is VALID [2022-02-20 20:07:21,162 INFO L290 TraceCheckUtils]: 12: Hoare triple {2599#true} [115] L702-3-->L702-4: Formula: (= (select (select |v_#memory_int_5| |v_~#mutex~0.base_10|) (+ |v_~#mutex~0.offset_10| 8)) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_10|, #memory_int=|v_#memory_int_5|, ~#mutex~0.base=|v_~#mutex~0.base_10|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_10|, #memory_int=|v_#memory_int_5|, ~#mutex~0.base=|v_~#mutex~0.base_10|} AuxVars[] AssignedVars[] {2599#true} is VALID [2022-02-20 20:07:21,163 INFO L290 TraceCheckUtils]: 13: Hoare triple {2599#true} [162] L702-4-->L702-5: Formula: (= (select (select |v_#memory_int_6| |v_~#mutex~0.base_11|) (+ |v_~#mutex~0.offset_11| 12)) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_11|, #memory_int=|v_#memory_int_6|, ~#mutex~0.base=|v_~#mutex~0.base_11|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_11|, #memory_int=|v_#memory_int_6|, ~#mutex~0.base=|v_~#mutex~0.base_11|} AuxVars[] AssignedVars[] {2599#true} is VALID [2022-02-20 20:07:21,163 INFO L290 TraceCheckUtils]: 14: Hoare triple {2599#true} [104] L702-5-->L702-6: Formula: (= (select (select |v_#memory_int_7| |v_~#mutex~0.base_12|) (+ 16 |v_~#mutex~0.offset_12|)) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_12|, #memory_int=|v_#memory_int_7|, ~#mutex~0.base=|v_~#mutex~0.base_12|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_12|, #memory_int=|v_#memory_int_7|, ~#mutex~0.base=|v_~#mutex~0.base_12|} AuxVars[] AssignedVars[] {2599#true} is VALID [2022-02-20 20:07:21,163 INFO L290 TraceCheckUtils]: 15: Hoare triple {2599#true} [180] L702-6-->L-1-3: Formula: (= v_~data~0_7 0) InVars {} OutVars{~data~0=v_~data~0_7} AuxVars[] AssignedVars[~data~0] {2599#true} is VALID [2022-02-20 20:07:21,163 INFO L290 TraceCheckUtils]: 16: Hoare triple {2599#true} [174] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2599#true} is VALID [2022-02-20 20:07:21,163 INFO L290 TraceCheckUtils]: 17: Hoare triple {2599#true} [154] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2599#true} is VALID [2022-02-20 20:07:21,164 INFO L290 TraceCheckUtils]: 18: Hoare triple {2599#true} [110] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {2599#true} is VALID [2022-02-20 20:07:21,164 INFO L290 TraceCheckUtils]: 19: Hoare triple {2599#true} [152] L-1-6-->L730: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_1|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_1|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~#t2~0#1.base] {2599#true} is VALID [2022-02-20 20:07:21,164 INFO L290 TraceCheckUtils]: 20: Hoare triple {2599#true} [167] L730-->L731: Formula: (= (store |v_#pthreadsMutex_14| |v_~#mutex~0.base_13| (store (select |v_#pthreadsMutex_14| |v_~#mutex~0.base_13|) |v_~#mutex~0.offset_13| 0)) |v_#pthreadsMutex_13|) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_13|, #pthreadsMutex=|v_#pthreadsMutex_14|, ~#mutex~0.base=|v_~#mutex~0.base_13|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_13|, #pthreadsMutex=|v_#pthreadsMutex_13|, ~#mutex~0.base=|v_~#mutex~0.base_13|} AuxVars[] AssignedVars[#pthreadsMutex] {2599#true} is VALID [2022-02-20 20:07:21,164 INFO L290 TraceCheckUtils]: 21: Hoare triple {2599#true} [126] L731-->L731-1: Formula: (and (= (store |v_#length_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4) |v_#length_4|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] {2599#true} is VALID [2022-02-20 20:07:21,165 INFO L290 TraceCheckUtils]: 22: Hoare triple {2599#true} [130] L731-1-->L731-2: Formula: (and (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= |v_#valid_7| (store |v_#valid_8| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1)) (= (store |v_#length_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4) |v_#length_6|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] {2599#true} is VALID [2022-02-20 20:07:21,165 INFO L290 TraceCheckUtils]: 23: Hoare triple {2599#true} [95] L731-2-->L731-3: Formula: (and (= (select |v_#valid_10| |v_ULTIMATE.start_main_~#t3~0#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_2| 0) (= |v_#valid_9| (store |v_#valid_10| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 1)) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_2| 0)) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t3~0#1.base_2|) (= |v_#length_8| (store |v_#length_9| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_9|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_8|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_2|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] {2599#true} is VALID [2022-02-20 20:07:21,166 INFO L290 TraceCheckUtils]: 24: Hoare triple {2599#true} [151] L731-3-->L732: Formula: (= |v_ULTIMATE.start_main_#t~pre7#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {2599#true} is VALID [2022-02-20 20:07:21,168 INFO L290 TraceCheckUtils]: 25: Hoare triple {2599#true} [121] L732-->L732-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {2599#true} is VALID [2022-02-20 20:07:21,168 INFO L290 TraceCheckUtils]: 26: Hoare triple {2599#true} [171] L732-1-->L732-2: Formula: (= (store |v_#memory_int_9| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_9| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre7#1_3|)) |v_#memory_int_8|) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {2599#true} is VALID [2022-02-20 20:07:21,168 INFO L290 TraceCheckUtils]: 27: Hoare triple {2599#true} [215] L732-2-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_thread1Thread1of1ForFork2_thidvar0_2) (= |v_thread1Thread1of1ForFork2_#in~arg.base_4| 0) (= |v_thread1Thread1of1ForFork2_#in~arg.offset_4| 0) (= 0 v_thread1Thread1of1ForFork2_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{thread1Thread1of1ForFork2_#t~nondet3=|v_thread1Thread1of1ForFork2_#t~nondet3_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_2, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_#in~arg.base=|v_thread1Thread1of1ForFork2_#in~arg.base_4|, thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_4|, thread1Thread1of1ForFork2_~arg.offset=v_thread1Thread1of1ForFork2_~arg.offset_4, thread1Thread1of1ForFork2_~arg.base=v_thread1Thread1of1ForFork2_~arg.base_4, thread1Thread1of1ForFork2_#t~post4=|v_thread1Thread1of1ForFork2_#t~post4_8|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_4|, thread1Thread1of1ForFork2_#in~arg.offset=|v_thread1Thread1of1ForFork2_#in~arg.offset_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~nondet3, thread1Thread1of1ForFork2_thidvar1, thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_#in~arg.base, thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_~arg.offset, thread1Thread1of1ForFork2_~arg.base, thread1Thread1of1ForFork2_#t~post4, thread1Thread1of1ForFork2_#res.offset, thread1Thread1of1ForFork2_#in~arg.offset] {2599#true} is VALID [2022-02-20 20:07:21,169 INFO L290 TraceCheckUtils]: 28: Hoare triple {2599#true} [105] L732-3-->L732-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {2599#true} is VALID [2022-02-20 20:07:21,169 INFO L290 TraceCheckUtils]: 29: Hoare triple {2599#true} [113] L732-4-->L733: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] {2599#true} is VALID [2022-02-20 20:07:21,169 INFO L290 TraceCheckUtils]: 30: Hoare triple {2599#true} [124] L733-->L733-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] {2599#true} is VALID [2022-02-20 20:07:21,169 INFO L290 TraceCheckUtils]: 31: Hoare triple {2599#true} [97] L733-1-->L733-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {2599#true} is VALID [2022-02-20 20:07:21,169 INFO L290 TraceCheckUtils]: 32: Hoare triple {2599#true} [179] L733-2-->L733-3: Formula: (= |v_#memory_int_10| (store |v_#memory_int_11| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_11| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre9#1_3|))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{#memory_int=|v_#memory_int_10|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {2599#true} is VALID [2022-02-20 20:07:21,170 INFO L290 TraceCheckUtils]: 33: Hoare triple {2599#true} [211] L733-3-->thread2ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread2Thread1of1ForFork0_thidvar0_2) (= |v_thread2Thread1of1ForFork0_#in~arg.offset_4| 0) (= |v_thread2Thread1of1ForFork0_#in~arg.base_4| 0) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_4|, thread2Thread1of1ForFork0_~arg.base=v_thread2Thread1of1ForFork0_~arg.base_4, thread2Thread1of1ForFork0_~arg.offset=v_thread2Thread1of1ForFork0_~arg.offset_4, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, thread2Thread1of1ForFork0_#in~arg.offset=|v_thread2Thread1of1ForFork0_#in~arg.offset_4|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_#t~nondet5=|v_thread2Thread1of1ForFork0_#t~nondet5_6|, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#in~arg.base=|v_thread2Thread1of1ForFork0_#in~arg.base_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_~arg.base, thread2Thread1of1ForFork0_~arg.offset, thread2Thread1of1ForFork0_#in~arg.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_#t~nondet5, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#in~arg.base] {2599#true} is VALID [2022-02-20 20:07:21,170 INFO L290 TraceCheckUtils]: 34: Hoare triple {2599#true} [116] L733-4-->L733-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] {2599#true} is VALID [2022-02-20 20:07:21,170 INFO L290 TraceCheckUtils]: 35: Hoare triple {2599#true} [101] L733-5-->L734: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] {2599#true} is VALID [2022-02-20 20:07:21,170 INFO L290 TraceCheckUtils]: 36: Hoare triple {2599#true} [127] L734-->L734-1: Formula: (= |v_ULTIMATE.start_main_#t~pre11#1_2| |v_#pthreadsForks_7|) InVars {#pthreadsForks=|v_#pthreadsForks_7|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, #pthreadsForks=|v_#pthreadsForks_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1] {2599#true} is VALID [2022-02-20 20:07:21,170 INFO L290 TraceCheckUtils]: 37: Hoare triple {2599#true} [134] L734-1-->L734-2: Formula: (= (+ 1 |v_#pthreadsForks_9|) |v_#pthreadsForks_8|) InVars {#pthreadsForks=|v_#pthreadsForks_9|} OutVars{#pthreadsForks=|v_#pthreadsForks_8|} AuxVars[] AssignedVars[#pthreadsForks] {2599#true} is VALID [2022-02-20 20:07:21,171 INFO L290 TraceCheckUtils]: 38: Hoare triple {2599#true} [141] L734-2-->L734-3: Formula: (= (store |v_#memory_int_13| |v_ULTIMATE.start_main_~#t3~0#1.base_3| (store (select |v_#memory_int_13| |v_ULTIMATE.start_main_~#t3~0#1.base_3|) |v_ULTIMATE.start_main_~#t3~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre11#1_3|)) |v_#memory_int_12|) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_3|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_3|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {2599#true} is VALID [2022-02-20 20:07:21,171 INFO L290 TraceCheckUtils]: 39: Hoare triple {2599#true} [192] thread2ENTRY-->L713: Formula: (and (= |v_thread2Thread1of1ForFork0_#in~arg.offset_1| v_thread2Thread1of1ForFork0_~arg.offset_1) (= |v_thread2Thread1of1ForFork0_#in~arg.base_1| v_thread2Thread1of1ForFork0_~arg.base_1)) InVars {thread2Thread1of1ForFork0_#in~arg.offset=|v_thread2Thread1of1ForFork0_#in~arg.offset_1|, thread2Thread1of1ForFork0_#in~arg.base=|v_thread2Thread1of1ForFork0_#in~arg.base_1|} OutVars{thread2Thread1of1ForFork0_~arg.base=v_thread2Thread1of1ForFork0_~arg.base_1, thread2Thread1of1ForFork0_~arg.offset=v_thread2Thread1of1ForFork0_~arg.offset_1, thread2Thread1of1ForFork0_#in~arg.offset=|v_thread2Thread1of1ForFork0_#in~arg.offset_1|, thread2Thread1of1ForFork0_#in~arg.base=|v_thread2Thread1of1ForFork0_#in~arg.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~arg.base, thread2Thread1of1ForFork0_~arg.offset] {2599#true} is VALID [2022-02-20 20:07:21,172 INFO L290 TraceCheckUtils]: 40: Hoare triple {2599#true} [193] L713-->L713-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_6| |v_~#mutex~0.base_3|))) (and (= (select .cse0 |v_~#mutex~0.offset_3|) 0) (= |v_thread2Thread1of1ForFork0_#t~nondet5_1| 0) (= |v_#pthreadsMutex_5| (store |v_#pthreadsMutex_6| |v_~#mutex~0.base_3| (store .cse0 |v_~#mutex~0.offset_3| 1))))) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_3|, #pthreadsMutex=|v_#pthreadsMutex_6|, ~#mutex~0.base=|v_~#mutex~0.base_3|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_3|, #pthreadsMutex=|v_#pthreadsMutex_5|, thread2Thread1of1ForFork0_#t~nondet5=|v_thread2Thread1of1ForFork0_#t~nondet5_1|, ~#mutex~0.base=|v_~#mutex~0.base_3|} AuxVars[] AssignedVars[#pthreadsMutex, thread2Thread1of1ForFork0_#t~nondet5] {2601#(= (select (select |#pthreadsMutex| |~#mutex~0.base|) |~#mutex~0.offset|) 1)} is VALID [2022-02-20 20:07:21,172 INFO L290 TraceCheckUtils]: 41: Hoare triple {2601#(= (select (select |#pthreadsMutex| |~#mutex~0.base|) |~#mutex~0.offset|) 1)} [194] L713-1-->L714: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet5=|v_thread2Thread1of1ForFork0_#t~nondet5_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet5] {2601#(= (select (select |#pthreadsMutex| |~#mutex~0.base|) |~#mutex~0.offset|) 1)} is VALID [2022-02-20 20:07:21,173 INFO L290 TraceCheckUtils]: 42: Hoare triple {2601#(= (select (select |#pthreadsMutex| |~#mutex~0.base|) |~#mutex~0.offset|) 1)} [195] L714-->L715: Formula: (= v_~data~0_3 (+ v_~data~0_4 2)) InVars {~data~0=v_~data~0_4} OutVars{~data~0=v_~data~0_3} AuxVars[] AssignedVars[~data~0] {2601#(= (select (select |#pthreadsMutex| |~#mutex~0.base|) |~#mutex~0.offset|) 1)} is VALID [2022-02-20 20:07:21,173 INFO L290 TraceCheckUtils]: 43: Hoare triple {2601#(= (select (select |#pthreadsMutex| |~#mutex~0.base|) |~#mutex~0.offset|) 1)} [213] L734-3-->thread3ENTRY: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar1_2) (= 0 v_thread3Thread1of1ForFork1_thidvar2_2) (= v_thread3Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= |v_thread3Thread1of1ForFork1_#in~arg.base_4| 0) (= 0 v_thread3Thread1of1ForFork1_thidvar3_2) (= |v_thread3Thread1of1ForFork1_#in~arg.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread3Thread1of1ForFork1_#t~nondet6=|v_thread3Thread1of1ForFork1_#t~nondet6_6|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread3Thread1of1ForFork1_#in~arg.offset=|v_thread3Thread1of1ForFork1_#in~arg.offset_4|, thread3Thread1of1ForFork1_~arg.base=v_thread3Thread1of1ForFork1_~arg.base_4, thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_4|, thread3Thread1of1ForFork1_~arg.offset=v_thread3Thread1of1ForFork1_~arg.offset_4, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_4|, thread3Thread1of1ForFork1_#in~arg.base=|v_thread3Thread1of1ForFork1_#in~arg.base_4|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~nondet6, thread3Thread1of1ForFork1_#in~arg.offset, thread3Thread1of1ForFork1_~arg.base, thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_~arg.offset, thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_#res.base, thread3Thread1of1ForFork1_#in~arg.base, thread3Thread1of1ForFork1_thidvar3, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2] {2601#(= (select (select |#pthreadsMutex| |~#mutex~0.base|) |~#mutex~0.offset|) 1)} is VALID [2022-02-20 20:07:21,174 INFO L290 TraceCheckUtils]: 44: Hoare triple {2601#(= (select (select |#pthreadsMutex| |~#mutex~0.base|) |~#mutex~0.offset|) 1)} [199] thread3ENTRY-->L720: Formula: (and (= v_thread3Thread1of1ForFork1_~arg.base_1 |v_thread3Thread1of1ForFork1_#in~arg.base_1|) (= |v_thread3Thread1of1ForFork1_#in~arg.offset_1| v_thread3Thread1of1ForFork1_~arg.offset_1)) InVars {thread3Thread1of1ForFork1_#in~arg.offset=|v_thread3Thread1of1ForFork1_#in~arg.offset_1|, thread3Thread1of1ForFork1_#in~arg.base=|v_thread3Thread1of1ForFork1_#in~arg.base_1|} OutVars{thread3Thread1of1ForFork1_~arg.base=v_thread3Thread1of1ForFork1_~arg.base_1, thread3Thread1of1ForFork1_~arg.offset=v_thread3Thread1of1ForFork1_~arg.offset_1, thread3Thread1of1ForFork1_#in~arg.base=|v_thread3Thread1of1ForFork1_#in~arg.base_1|, thread3Thread1of1ForFork1_#in~arg.offset=|v_thread3Thread1of1ForFork1_#in~arg.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_~arg.base, thread3Thread1of1ForFork1_~arg.offset] {2601#(= (select (select |#pthreadsMutex| |~#mutex~0.base|) |~#mutex~0.offset|) 1)} is VALID [2022-02-20 20:07:21,174 INFO L290 TraceCheckUtils]: 45: Hoare triple {2601#(= (select (select |#pthreadsMutex| |~#mutex~0.base|) |~#mutex~0.offset|) 1)} [200] L720-->L720-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_10| |v_~#mutex~0.base_5|))) (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#mutex~0.base_5| (store .cse0 |v_~#mutex~0.offset_5| 1))) (= |v_thread3Thread1of1ForFork1_#t~nondet6_1| 0) (= (select .cse0 |v_~#mutex~0.offset_5|) 0))) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_5|, #pthreadsMutex=|v_#pthreadsMutex_10|, ~#mutex~0.base=|v_~#mutex~0.base_5|} OutVars{thread3Thread1of1ForFork1_#t~nondet6=|v_thread3Thread1of1ForFork1_#t~nondet6_1|, ~#mutex~0.offset=|v_~#mutex~0.offset_5|, #pthreadsMutex=|v_#pthreadsMutex_9|, ~#mutex~0.base=|v_~#mutex~0.base_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~nondet6, #pthreadsMutex] {2600#false} is VALID [2022-02-20 20:07:21,174 INFO L290 TraceCheckUtils]: 46: Hoare triple {2600#false} [201] L720-1-->L721: Formula: true InVars {} OutVars{thread3Thread1of1ForFork1_#t~nondet6=|v_thread3Thread1of1ForFork1_#t~nondet6_3|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~nondet6] {2600#false} is VALID [2022-02-20 20:07:21,175 INFO L290 TraceCheckUtils]: 47: Hoare triple {2600#false} [202] L721-->L722: Formula: (<= 3 v_~data~0_5) InVars {~data~0=v_~data~0_5} OutVars{~data~0=v_~data~0_5} AuxVars[] AssignedVars[] {2600#false} is VALID [2022-02-20 20:07:21,175 INFO L290 TraceCheckUtils]: 48: Hoare triple {2600#false} [204] L722-->thread3Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2600#false} is VALID [2022-02-20 20:07:21,175 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:07:21,176 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:07:21,176 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239083105] [2022-02-20 20:07:21,176 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239083105] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:07:21,176 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:07:21,176 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 20:07:21,177 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468019289] [2022-02-20 20:07:21,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:07:21,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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 49 [2022-02-20 20:07:21,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:07:21,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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:07:21,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:07:21,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 20:07:21,218 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:07:21,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 20:07:21,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 20:07:21,220 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 91 [2022-02-20 20:07:21,221 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 72 transitions, 165 flow. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 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:07:21,221 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:07:21,221 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 91 [2022-02-20 20:07:21,221 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:07:21,294 INFO L129 PetriNetUnfolder]: 16/158 cut-off events. [2022-02-20 20:07:21,295 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-02-20 20:07:21,296 INFO L84 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 158 events. 16/158 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 481 event pairs, 5 based on Foata normal form. 14/170 useless extension candidates. Maximal degree in co-relation 112. Up to 28 conditions per place. [2022-02-20 20:07:21,297 INFO L132 encePairwiseOnDemand]: 86/91 looper letters, 16 selfloop transitions, 5 changer transitions 0/76 dead transitions. [2022-02-20 20:07:21,297 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 76 transitions, 220 flow [2022-02-20 20:07:21,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 20:07:21,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-02-20 20:07:21,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 234 transitions. [2022-02-20 20:07:21,303 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2022-02-20 20:07:21,303 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 234 transitions. [2022-02-20 20:07:21,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 234 transitions. [2022-02-20 20:07:21,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:07:21,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 234 transitions. [2022-02-20 20:07:21,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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:07:21,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 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:07:21,306 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 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:07:21,306 INFO L186 Difference]: Start difference. First operand has 78 places, 72 transitions, 165 flow. Second operand 3 states and 234 transitions. [2022-02-20 20:07:21,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 76 transitions, 220 flow [2022-02-20 20:07:21,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 76 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-02-20 20:07:21,309 INFO L242 Difference]: Finished difference. Result has 79 places, 72 transitions, 172 flow [2022-02-20 20:07:21,310 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=79, PETRI_TRANSITIONS=72} [2022-02-20 20:07:21,310 INFO L334 CegarLoopForPetriNet]: 80 programPoint places, -1 predicate places. [2022-02-20 20:07:21,310 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 72 transitions, 172 flow [2022-02-20 20:07:21,342 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1492 states, 1488 states have (on average 2.7103494623655915) internal successors, (4033), 1491 states have internal predecessors, (4033), 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:07:21,346 INFO L78 Accepts]: Start accepts. Automaton has has 1492 states, 1488 states have (on average 2.7103494623655915) internal successors, (4033), 1491 states have internal predecessors, (4033), 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 49 [2022-02-20 20:07:21,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:07:21,347 INFO L470 AbstractCegarLoop]: Abstraction has has 79 places, 72 transitions, 172 flow [2022-02-20 20:07:21,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 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:07:21,347 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:07:21,347 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:07:21,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:07:21,348 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting thread3Err0ASSERT_VIOLATIONERROR_FUNCTION === [thread3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-02-20 20:07:21,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:07:21,348 INFO L85 PathProgramCache]: Analyzing trace with hash -413432428, now seen corresponding path program 1 times [2022-02-20 20:07:21,348 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:07:21,349 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230591465] [2022-02-20 20:07:21,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:07:21,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:07:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:07:21,409 INFO L290 TraceCheckUtils]: 0: Hoare triple {4096#true} [161] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4096#true} is VALID [2022-02-20 20:07:21,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {4096#true} [145] 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] {4096#true} is VALID [2022-02-20 20:07:21,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {4096#true} [169] 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[] {4096#true} is VALID [2022-02-20 20:07:21,410 INFO L290 TraceCheckUtils]: 3: Hoare triple {4096#true} [173] L-1-2-->L20: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {4096#true} is VALID [2022-02-20 20:07:21,410 INFO L290 TraceCheckUtils]: 4: Hoare triple {4096#true} [109] L20-->L20-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[] {4096#true} is VALID [2022-02-20 20:07:21,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {4096#true} [158] L20-1-->L20-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[] {4096#true} is VALID [2022-02-20 20:07:21,411 INFO L290 TraceCheckUtils]: 6: Hoare triple {4096#true} [155] L20-2-->L20-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[] {4096#true} is VALID [2022-02-20 20:07:21,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {4096#true} [176] L20-3-->L20-4: Formula: (and (= 9 (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[] {4096#true} is VALID [2022-02-20 20:07:21,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {4096#true} [147] L20-4-->L702: Formula: (and (= 3 |v_~#mutex~0.base_7|) (= |v_~#mutex~0.offset_7| 0)) InVars {} OutVars{~#mutex~0.base=|v_~#mutex~0.base_7|, ~#mutex~0.offset=|v_~#mutex~0.offset_7|} AuxVars[] AssignedVars[~#mutex~0.base, ~#mutex~0.offset] {4096#true} is VALID [2022-02-20 20:07:21,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {4096#true} [117] L702-->L702-1: 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[] {4096#true} is VALID [2022-02-20 20:07:21,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {4096#true} [128] L702-1-->L702-2: Formula: (= (select (select |v_#memory_int_3| |v_~#mutex~0.base_8|) |v_~#mutex~0.offset_8|) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_8|, #memory_int=|v_#memory_int_3|, ~#mutex~0.base=|v_~#mutex~0.base_8|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_8|, #memory_int=|v_#memory_int_3|, ~#mutex~0.base=|v_~#mutex~0.base_8|} AuxVars[] AssignedVars[] {4096#true} is VALID [2022-02-20 20:07:21,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {4096#true} [149] L702-2-->L702-3: Formula: (= (select (select |v_#memory_int_4| |v_~#mutex~0.base_9|) (+ |v_~#mutex~0.offset_9| 4)) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_9|, #memory_int=|v_#memory_int_4|, ~#mutex~0.base=|v_~#mutex~0.base_9|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_9|, #memory_int=|v_#memory_int_4|, ~#mutex~0.base=|v_~#mutex~0.base_9|} AuxVars[] AssignedVars[] {4096#true} is VALID [2022-02-20 20:07:21,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {4096#true} [115] L702-3-->L702-4: Formula: (= (select (select |v_#memory_int_5| |v_~#mutex~0.base_10|) (+ |v_~#mutex~0.offset_10| 8)) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_10|, #memory_int=|v_#memory_int_5|, ~#mutex~0.base=|v_~#mutex~0.base_10|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_10|, #memory_int=|v_#memory_int_5|, ~#mutex~0.base=|v_~#mutex~0.base_10|} AuxVars[] AssignedVars[] {4096#true} is VALID [2022-02-20 20:07:21,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {4096#true} [162] L702-4-->L702-5: Formula: (= (select (select |v_#memory_int_6| |v_~#mutex~0.base_11|) (+ |v_~#mutex~0.offset_11| 12)) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_11|, #memory_int=|v_#memory_int_6|, ~#mutex~0.base=|v_~#mutex~0.base_11|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_11|, #memory_int=|v_#memory_int_6|, ~#mutex~0.base=|v_~#mutex~0.base_11|} AuxVars[] AssignedVars[] {4096#true} is VALID [2022-02-20 20:07:21,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {4096#true} [104] L702-5-->L702-6: Formula: (= (select (select |v_#memory_int_7| |v_~#mutex~0.base_12|) (+ 16 |v_~#mutex~0.offset_12|)) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_12|, #memory_int=|v_#memory_int_7|, ~#mutex~0.base=|v_~#mutex~0.base_12|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_12|, #memory_int=|v_#memory_int_7|, ~#mutex~0.base=|v_~#mutex~0.base_12|} AuxVars[] AssignedVars[] {4096#true} is VALID [2022-02-20 20:07:21,413 INFO L290 TraceCheckUtils]: 15: Hoare triple {4096#true} [180] L702-6-->L-1-3: Formula: (= v_~data~0_7 0) InVars {} OutVars{~data~0=v_~data~0_7} AuxVars[] AssignedVars[~data~0] {4098#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,413 INFO L290 TraceCheckUtils]: 16: Hoare triple {4098#(= ~data~0 0)} [174] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4098#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {4098#(= ~data~0 0)} [154] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4098#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,414 INFO L290 TraceCheckUtils]: 18: Hoare triple {4098#(= ~data~0 0)} [110] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {4098#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,415 INFO L290 TraceCheckUtils]: 19: Hoare triple {4098#(= ~data~0 0)} [152] L-1-6-->L730: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_1|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_1|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~#t2~0#1.base] {4098#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,415 INFO L290 TraceCheckUtils]: 20: Hoare triple {4098#(= ~data~0 0)} [167] L730-->L731: Formula: (= (store |v_#pthreadsMutex_14| |v_~#mutex~0.base_13| (store (select |v_#pthreadsMutex_14| |v_~#mutex~0.base_13|) |v_~#mutex~0.offset_13| 0)) |v_#pthreadsMutex_13|) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_13|, #pthreadsMutex=|v_#pthreadsMutex_14|, ~#mutex~0.base=|v_~#mutex~0.base_13|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_13|, #pthreadsMutex=|v_#pthreadsMutex_13|, ~#mutex~0.base=|v_~#mutex~0.base_13|} AuxVars[] AssignedVars[#pthreadsMutex] {4098#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,416 INFO L290 TraceCheckUtils]: 21: Hoare triple {4098#(= ~data~0 0)} [126] L731-->L731-1: Formula: (and (= (store |v_#length_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4) |v_#length_4|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] {4098#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,416 INFO L290 TraceCheckUtils]: 22: Hoare triple {4098#(= ~data~0 0)} [130] L731-1-->L731-2: Formula: (and (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= |v_#valid_7| (store |v_#valid_8| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1)) (= (store |v_#length_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4) |v_#length_6|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] {4098#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,417 INFO L290 TraceCheckUtils]: 23: Hoare triple {4098#(= ~data~0 0)} [95] L731-2-->L731-3: Formula: (and (= (select |v_#valid_10| |v_ULTIMATE.start_main_~#t3~0#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_2| 0) (= |v_#valid_9| (store |v_#valid_10| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 1)) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_2| 0)) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t3~0#1.base_2|) (= |v_#length_8| (store |v_#length_9| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_9|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_8|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_2|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] {4098#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,417 INFO L290 TraceCheckUtils]: 24: Hoare triple {4098#(= ~data~0 0)} [151] L731-3-->L732: Formula: (= |v_ULTIMATE.start_main_#t~pre7#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {4098#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,417 INFO L290 TraceCheckUtils]: 25: Hoare triple {4098#(= ~data~0 0)} [121] L732-->L732-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {4098#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,418 INFO L290 TraceCheckUtils]: 26: Hoare triple {4098#(= ~data~0 0)} [171] L732-1-->L732-2: Formula: (= (store |v_#memory_int_9| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_9| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre7#1_3|)) |v_#memory_int_8|) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {4098#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,418 INFO L290 TraceCheckUtils]: 27: Hoare triple {4098#(= ~data~0 0)} [215] L732-2-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_thread1Thread1of1ForFork2_thidvar0_2) (= |v_thread1Thread1of1ForFork2_#in~arg.base_4| 0) (= |v_thread1Thread1of1ForFork2_#in~arg.offset_4| 0) (= 0 v_thread1Thread1of1ForFork2_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{thread1Thread1of1ForFork2_#t~nondet3=|v_thread1Thread1of1ForFork2_#t~nondet3_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_2, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_#in~arg.base=|v_thread1Thread1of1ForFork2_#in~arg.base_4|, thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_4|, thread1Thread1of1ForFork2_~arg.offset=v_thread1Thread1of1ForFork2_~arg.offset_4, thread1Thread1of1ForFork2_~arg.base=v_thread1Thread1of1ForFork2_~arg.base_4, thread1Thread1of1ForFork2_#t~post4=|v_thread1Thread1of1ForFork2_#t~post4_8|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_4|, thread1Thread1of1ForFork2_#in~arg.offset=|v_thread1Thread1of1ForFork2_#in~arg.offset_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~nondet3, thread1Thread1of1ForFork2_thidvar1, thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_#in~arg.base, thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_~arg.offset, thread1Thread1of1ForFork2_~arg.base, thread1Thread1of1ForFork2_#t~post4, thread1Thread1of1ForFork2_#res.offset, thread1Thread1of1ForFork2_#in~arg.offset] {4098#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,419 INFO L290 TraceCheckUtils]: 28: Hoare triple {4098#(= ~data~0 0)} [105] L732-3-->L732-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {4098#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,419 INFO L290 TraceCheckUtils]: 29: Hoare triple {4098#(= ~data~0 0)} [113] L732-4-->L733: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] {4098#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,420 INFO L290 TraceCheckUtils]: 30: Hoare triple {4098#(= ~data~0 0)} [124] L733-->L733-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] {4098#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,420 INFO L290 TraceCheckUtils]: 31: Hoare triple {4098#(= ~data~0 0)} [97] L733-1-->L733-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {4098#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,420 INFO L290 TraceCheckUtils]: 32: Hoare triple {4098#(= ~data~0 0)} [179] L733-2-->L733-3: Formula: (= |v_#memory_int_10| (store |v_#memory_int_11| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_11| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre9#1_3|))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{#memory_int=|v_#memory_int_10|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {4098#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,421 INFO L290 TraceCheckUtils]: 33: Hoare triple {4098#(= ~data~0 0)} [211] L733-3-->thread2ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread2Thread1of1ForFork0_thidvar0_2) (= |v_thread2Thread1of1ForFork0_#in~arg.offset_4| 0) (= |v_thread2Thread1of1ForFork0_#in~arg.base_4| 0) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_4|, thread2Thread1of1ForFork0_~arg.base=v_thread2Thread1of1ForFork0_~arg.base_4, thread2Thread1of1ForFork0_~arg.offset=v_thread2Thread1of1ForFork0_~arg.offset_4, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, thread2Thread1of1ForFork0_#in~arg.offset=|v_thread2Thread1of1ForFork0_#in~arg.offset_4|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_#t~nondet5=|v_thread2Thread1of1ForFork0_#t~nondet5_6|, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#in~arg.base=|v_thread2Thread1of1ForFork0_#in~arg.base_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_~arg.base, thread2Thread1of1ForFork0_~arg.offset, thread2Thread1of1ForFork0_#in~arg.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_#t~nondet5, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#in~arg.base] {4098#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,421 INFO L290 TraceCheckUtils]: 34: Hoare triple {4098#(= ~data~0 0)} [116] L733-4-->L733-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] {4098#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,422 INFO L290 TraceCheckUtils]: 35: Hoare triple {4098#(= ~data~0 0)} [101] L733-5-->L734: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] {4098#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,422 INFO L290 TraceCheckUtils]: 36: Hoare triple {4098#(= ~data~0 0)} [127] L734-->L734-1: Formula: (= |v_ULTIMATE.start_main_#t~pre11#1_2| |v_#pthreadsForks_7|) InVars {#pthreadsForks=|v_#pthreadsForks_7|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, #pthreadsForks=|v_#pthreadsForks_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1] {4098#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,422 INFO L290 TraceCheckUtils]: 37: Hoare triple {4098#(= ~data~0 0)} [134] L734-1-->L734-2: Formula: (= (+ 1 |v_#pthreadsForks_9|) |v_#pthreadsForks_8|) InVars {#pthreadsForks=|v_#pthreadsForks_9|} OutVars{#pthreadsForks=|v_#pthreadsForks_8|} AuxVars[] AssignedVars[#pthreadsForks] {4098#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,423 INFO L290 TraceCheckUtils]: 38: Hoare triple {4098#(= ~data~0 0)} [141] L734-2-->L734-3: Formula: (= (store |v_#memory_int_13| |v_ULTIMATE.start_main_~#t3~0#1.base_3| (store (select |v_#memory_int_13| |v_ULTIMATE.start_main_~#t3~0#1.base_3|) |v_ULTIMATE.start_main_~#t3~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre11#1_3|)) |v_#memory_int_12|) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_3|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_3|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {4098#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,423 INFO L290 TraceCheckUtils]: 39: Hoare triple {4098#(= ~data~0 0)} [213] L734-3-->thread3ENTRY: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar1_2) (= 0 v_thread3Thread1of1ForFork1_thidvar2_2) (= v_thread3Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= |v_thread3Thread1of1ForFork1_#in~arg.base_4| 0) (= 0 v_thread3Thread1of1ForFork1_thidvar3_2) (= |v_thread3Thread1of1ForFork1_#in~arg.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread3Thread1of1ForFork1_#t~nondet6=|v_thread3Thread1of1ForFork1_#t~nondet6_6|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread3Thread1of1ForFork1_#in~arg.offset=|v_thread3Thread1of1ForFork1_#in~arg.offset_4|, thread3Thread1of1ForFork1_~arg.base=v_thread3Thread1of1ForFork1_~arg.base_4, thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_4|, thread3Thread1of1ForFork1_~arg.offset=v_thread3Thread1of1ForFork1_~arg.offset_4, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_4|, thread3Thread1of1ForFork1_#in~arg.base=|v_thread3Thread1of1ForFork1_#in~arg.base_4|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~nondet6, thread3Thread1of1ForFork1_#in~arg.offset, thread3Thread1of1ForFork1_~arg.base, thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_~arg.offset, thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_#res.base, thread3Thread1of1ForFork1_#in~arg.base, thread3Thread1of1ForFork1_thidvar3, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2] {4098#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,424 INFO L290 TraceCheckUtils]: 40: Hoare triple {4098#(= ~data~0 0)} [192] thread2ENTRY-->L713: Formula: (and (= |v_thread2Thread1of1ForFork0_#in~arg.offset_1| v_thread2Thread1of1ForFork0_~arg.offset_1) (= |v_thread2Thread1of1ForFork0_#in~arg.base_1| v_thread2Thread1of1ForFork0_~arg.base_1)) InVars {thread2Thread1of1ForFork0_#in~arg.offset=|v_thread2Thread1of1ForFork0_#in~arg.offset_1|, thread2Thread1of1ForFork0_#in~arg.base=|v_thread2Thread1of1ForFork0_#in~arg.base_1|} OutVars{thread2Thread1of1ForFork0_~arg.base=v_thread2Thread1of1ForFork0_~arg.base_1, thread2Thread1of1ForFork0_~arg.offset=v_thread2Thread1of1ForFork0_~arg.offset_1, thread2Thread1of1ForFork0_#in~arg.offset=|v_thread2Thread1of1ForFork0_#in~arg.offset_1|, thread2Thread1of1ForFork0_#in~arg.base=|v_thread2Thread1of1ForFork0_#in~arg.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~arg.base, thread2Thread1of1ForFork0_~arg.offset] {4098#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,424 INFO L290 TraceCheckUtils]: 41: Hoare triple {4098#(= ~data~0 0)} [193] L713-->L713-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_6| |v_~#mutex~0.base_3|))) (and (= (select .cse0 |v_~#mutex~0.offset_3|) 0) (= |v_thread2Thread1of1ForFork0_#t~nondet5_1| 0) (= |v_#pthreadsMutex_5| (store |v_#pthreadsMutex_6| |v_~#mutex~0.base_3| (store .cse0 |v_~#mutex~0.offset_3| 1))))) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_3|, #pthreadsMutex=|v_#pthreadsMutex_6|, ~#mutex~0.base=|v_~#mutex~0.base_3|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_3|, #pthreadsMutex=|v_#pthreadsMutex_5|, thread2Thread1of1ForFork0_#t~nondet5=|v_thread2Thread1of1ForFork0_#t~nondet5_1|, ~#mutex~0.base=|v_~#mutex~0.base_3|} AuxVars[] AssignedVars[#pthreadsMutex, thread2Thread1of1ForFork0_#t~nondet5] {4098#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,425 INFO L290 TraceCheckUtils]: 42: Hoare triple {4098#(= ~data~0 0)} [194] L713-1-->L714: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet5=|v_thread2Thread1of1ForFork0_#t~nondet5_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet5] {4098#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,425 INFO L290 TraceCheckUtils]: 43: Hoare triple {4098#(= ~data~0 0)} [195] L714-->L715: Formula: (= v_~data~0_3 (+ v_~data~0_4 2)) InVars {~data~0=v_~data~0_4} OutVars{~data~0=v_~data~0_3} AuxVars[] AssignedVars[~data~0] {4099#(<= ~data~0 2)} is VALID [2022-02-20 20:07:21,425 INFO L290 TraceCheckUtils]: 44: Hoare triple {4099#(<= ~data~0 2)} [199] thread3ENTRY-->L720: Formula: (and (= v_thread3Thread1of1ForFork1_~arg.base_1 |v_thread3Thread1of1ForFork1_#in~arg.base_1|) (= |v_thread3Thread1of1ForFork1_#in~arg.offset_1| v_thread3Thread1of1ForFork1_~arg.offset_1)) InVars {thread3Thread1of1ForFork1_#in~arg.offset=|v_thread3Thread1of1ForFork1_#in~arg.offset_1|, thread3Thread1of1ForFork1_#in~arg.base=|v_thread3Thread1of1ForFork1_#in~arg.base_1|} OutVars{thread3Thread1of1ForFork1_~arg.base=v_thread3Thread1of1ForFork1_~arg.base_1, thread3Thread1of1ForFork1_~arg.offset=v_thread3Thread1of1ForFork1_~arg.offset_1, thread3Thread1of1ForFork1_#in~arg.base=|v_thread3Thread1of1ForFork1_#in~arg.base_1|, thread3Thread1of1ForFork1_#in~arg.offset=|v_thread3Thread1of1ForFork1_#in~arg.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_~arg.base, thread3Thread1of1ForFork1_~arg.offset] {4099#(<= ~data~0 2)} is VALID [2022-02-20 20:07:21,426 INFO L290 TraceCheckUtils]: 45: Hoare triple {4099#(<= ~data~0 2)} [196] L715-->L716: Formula: (= |v_#pthreadsMutex_7| (store |v_#pthreadsMutex_8| |v_~#mutex~0.base_4| (store (select |v_#pthreadsMutex_8| |v_~#mutex~0.base_4|) |v_~#mutex~0.offset_4| 0))) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_4|, #pthreadsMutex=|v_#pthreadsMutex_8|, ~#mutex~0.base=|v_~#mutex~0.base_4|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_4|, #pthreadsMutex=|v_#pthreadsMutex_7|, ~#mutex~0.base=|v_~#mutex~0.base_4|} AuxVars[] AssignedVars[#pthreadsMutex] {4099#(<= ~data~0 2)} is VALID [2022-02-20 20:07:21,426 INFO L290 TraceCheckUtils]: 46: Hoare triple {4099#(<= ~data~0 2)} [200] L720-->L720-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_10| |v_~#mutex~0.base_5|))) (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#mutex~0.base_5| (store .cse0 |v_~#mutex~0.offset_5| 1))) (= |v_thread3Thread1of1ForFork1_#t~nondet6_1| 0) (= (select .cse0 |v_~#mutex~0.offset_5|) 0))) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_5|, #pthreadsMutex=|v_#pthreadsMutex_10|, ~#mutex~0.base=|v_~#mutex~0.base_5|} OutVars{thread3Thread1of1ForFork1_#t~nondet6=|v_thread3Thread1of1ForFork1_#t~nondet6_1|, ~#mutex~0.offset=|v_~#mutex~0.offset_5|, #pthreadsMutex=|v_#pthreadsMutex_9|, ~#mutex~0.base=|v_~#mutex~0.base_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~nondet6, #pthreadsMutex] {4099#(<= ~data~0 2)} is VALID [2022-02-20 20:07:21,427 INFO L290 TraceCheckUtils]: 47: Hoare triple {4099#(<= ~data~0 2)} [201] L720-1-->L721: Formula: true InVars {} OutVars{thread3Thread1of1ForFork1_#t~nondet6=|v_thread3Thread1of1ForFork1_#t~nondet6_3|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~nondet6] {4099#(<= ~data~0 2)} is VALID [2022-02-20 20:07:21,427 INFO L290 TraceCheckUtils]: 48: Hoare triple {4099#(<= ~data~0 2)} [202] L721-->L722: Formula: (<= 3 v_~data~0_5) InVars {~data~0=v_~data~0_5} OutVars{~data~0=v_~data~0_5} AuxVars[] AssignedVars[] {4097#false} is VALID [2022-02-20 20:07:21,427 INFO L290 TraceCheckUtils]: 49: Hoare triple {4097#false} [204] L722-->thread3Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4097#false} is VALID [2022-02-20 20:07:21,428 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:07:21,428 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:07:21,428 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230591465] [2022-02-20 20:07:21,429 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230591465] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:07:21,429 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:07:21,429 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 20:07:21,429 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29309053] [2022-02-20 20:07:21,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:07:21,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-02-20 20:07:21,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:07:21,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:07:21,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:07:21,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 20:07:21,463 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:07:21,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 20:07:21,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 20:07:21,464 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 91 [2022-02-20 20:07:21,465 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 72 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 78.5) internal successors, (314), 4 states have internal predecessors, (314), 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:07:21,465 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:07:21,465 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 91 [2022-02-20 20:07:21,465 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:07:21,509 INFO L129 PetriNetUnfolder]: 14/141 cut-off events. [2022-02-20 20:07:21,509 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-02-20 20:07:21,510 INFO L84 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 141 events. 14/141 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 389 event pairs, 6 based on Foata normal form. 1/140 useless extension candidates. Maximal degree in co-relation 105. Up to 24 conditions per place. [2022-02-20 20:07:21,510 INFO L132 encePairwiseOnDemand]: 87/91 looper letters, 12 selfloop transitions, 4 changer transitions 0/76 dead transitions. [2022-02-20 20:07:21,510 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 76 transitions, 217 flow [2022-02-20 20:07:21,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 20:07:21,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-02-20 20:07:21,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 325 transitions. [2022-02-20 20:07:21,514 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8928571428571429 [2022-02-20 20:07:21,514 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 325 transitions. [2022-02-20 20:07:21,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 325 transitions. [2022-02-20 20:07:21,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:07:21,514 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 325 transitions. [2022-02-20 20:07:21,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 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:07:21,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 91.0) internal successors, (455), 5 states have internal predecessors, (455), 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:07:21,516 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 91.0) internal successors, (455), 5 states have internal predecessors, (455), 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:07:21,516 INFO L186 Difference]: Start difference. First operand has 79 places, 72 transitions, 172 flow. Second operand 4 states and 325 transitions. [2022-02-20 20:07:21,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 76 transitions, 217 flow [2022-02-20 20:07:21,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 76 transitions, 212 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-02-20 20:07:21,519 INFO L242 Difference]: Finished difference. Result has 82 places, 72 transitions, 179 flow [2022-02-20 20:07:21,519 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=82, PETRI_TRANSITIONS=72} [2022-02-20 20:07:21,520 INFO L334 CegarLoopForPetriNet]: 80 programPoint places, 2 predicate places. [2022-02-20 20:07:21,520 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 72 transitions, 179 flow [2022-02-20 20:07:21,543 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1444 states, 1440 states have (on average 2.703472222222222) internal successors, (3893), 1443 states have internal predecessors, (3893), 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:07:21,547 INFO L78 Accepts]: Start accepts. Automaton has has 1444 states, 1440 states have (on average 2.703472222222222) internal successors, (3893), 1443 states have internal predecessors, (3893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-02-20 20:07:21,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:07:21,547 INFO L470 AbstractCegarLoop]: Abstraction has has 82 places, 72 transitions, 179 flow [2022-02-20 20:07:21,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.5) internal successors, (314), 4 states have internal predecessors, (314), 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:07:21,548 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:07:21,548 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] [2022-02-20 20:07:21,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 20:07:21,548 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting thread3Err0ASSERT_VIOLATIONERROR_FUNCTION === [thread3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-02-20 20:07:21,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:07:21,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1750587070, now seen corresponding path program 1 times [2022-02-20 20:07:21,549 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:07:21,549 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538314137] [2022-02-20 20:07:21,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:07:21,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:07:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:07:21,614 INFO L290 TraceCheckUtils]: 0: Hoare triple {5547#true} [161] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5547#true} is VALID [2022-02-20 20:07:21,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {5547#true} [145] 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] {5547#true} is VALID [2022-02-20 20:07:21,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {5547#true} [169] 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[] {5547#true} is VALID [2022-02-20 20:07:21,615 INFO L290 TraceCheckUtils]: 3: Hoare triple {5547#true} [173] L-1-2-->L20: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {5547#true} is VALID [2022-02-20 20:07:21,615 INFO L290 TraceCheckUtils]: 4: Hoare triple {5547#true} [109] L20-->L20-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[] {5547#true} is VALID [2022-02-20 20:07:21,617 INFO L290 TraceCheckUtils]: 5: Hoare triple {5547#true} [158] L20-1-->L20-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[] {5547#true} is VALID [2022-02-20 20:07:21,617 INFO L290 TraceCheckUtils]: 6: Hoare triple {5547#true} [155] L20-2-->L20-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[] {5547#true} is VALID [2022-02-20 20:07:21,617 INFO L290 TraceCheckUtils]: 7: Hoare triple {5547#true} [176] L20-3-->L20-4: Formula: (and (= 9 (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[] {5547#true} is VALID [2022-02-20 20:07:21,617 INFO L290 TraceCheckUtils]: 8: Hoare triple {5547#true} [147] L20-4-->L702: Formula: (and (= 3 |v_~#mutex~0.base_7|) (= |v_~#mutex~0.offset_7| 0)) InVars {} OutVars{~#mutex~0.base=|v_~#mutex~0.base_7|, ~#mutex~0.offset=|v_~#mutex~0.offset_7|} AuxVars[] AssignedVars[~#mutex~0.base, ~#mutex~0.offset] {5547#true} is VALID [2022-02-20 20:07:21,617 INFO L290 TraceCheckUtils]: 9: Hoare triple {5547#true} [117] L702-->L702-1: 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[] {5547#true} is VALID [2022-02-20 20:07:21,618 INFO L290 TraceCheckUtils]: 10: Hoare triple {5547#true} [128] L702-1-->L702-2: Formula: (= (select (select |v_#memory_int_3| |v_~#mutex~0.base_8|) |v_~#mutex~0.offset_8|) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_8|, #memory_int=|v_#memory_int_3|, ~#mutex~0.base=|v_~#mutex~0.base_8|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_8|, #memory_int=|v_#memory_int_3|, ~#mutex~0.base=|v_~#mutex~0.base_8|} AuxVars[] AssignedVars[] {5547#true} is VALID [2022-02-20 20:07:21,618 INFO L290 TraceCheckUtils]: 11: Hoare triple {5547#true} [149] L702-2-->L702-3: Formula: (= (select (select |v_#memory_int_4| |v_~#mutex~0.base_9|) (+ |v_~#mutex~0.offset_9| 4)) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_9|, #memory_int=|v_#memory_int_4|, ~#mutex~0.base=|v_~#mutex~0.base_9|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_9|, #memory_int=|v_#memory_int_4|, ~#mutex~0.base=|v_~#mutex~0.base_9|} AuxVars[] AssignedVars[] {5547#true} is VALID [2022-02-20 20:07:21,618 INFO L290 TraceCheckUtils]: 12: Hoare triple {5547#true} [115] L702-3-->L702-4: Formula: (= (select (select |v_#memory_int_5| |v_~#mutex~0.base_10|) (+ |v_~#mutex~0.offset_10| 8)) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_10|, #memory_int=|v_#memory_int_5|, ~#mutex~0.base=|v_~#mutex~0.base_10|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_10|, #memory_int=|v_#memory_int_5|, ~#mutex~0.base=|v_~#mutex~0.base_10|} AuxVars[] AssignedVars[] {5547#true} is VALID [2022-02-20 20:07:21,618 INFO L290 TraceCheckUtils]: 13: Hoare triple {5547#true} [162] L702-4-->L702-5: Formula: (= (select (select |v_#memory_int_6| |v_~#mutex~0.base_11|) (+ |v_~#mutex~0.offset_11| 12)) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_11|, #memory_int=|v_#memory_int_6|, ~#mutex~0.base=|v_~#mutex~0.base_11|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_11|, #memory_int=|v_#memory_int_6|, ~#mutex~0.base=|v_~#mutex~0.base_11|} AuxVars[] AssignedVars[] {5547#true} is VALID [2022-02-20 20:07:21,618 INFO L290 TraceCheckUtils]: 14: Hoare triple {5547#true} [104] L702-5-->L702-6: Formula: (= (select (select |v_#memory_int_7| |v_~#mutex~0.base_12|) (+ 16 |v_~#mutex~0.offset_12|)) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_12|, #memory_int=|v_#memory_int_7|, ~#mutex~0.base=|v_~#mutex~0.base_12|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_12|, #memory_int=|v_#memory_int_7|, ~#mutex~0.base=|v_~#mutex~0.base_12|} AuxVars[] AssignedVars[] {5547#true} is VALID [2022-02-20 20:07:21,619 INFO L290 TraceCheckUtils]: 15: Hoare triple {5547#true} [180] L702-6-->L-1-3: Formula: (= v_~data~0_7 0) InVars {} OutVars{~data~0=v_~data~0_7} AuxVars[] AssignedVars[~data~0] {5549#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,619 INFO L290 TraceCheckUtils]: 16: Hoare triple {5549#(= ~data~0 0)} [174] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5549#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,620 INFO L290 TraceCheckUtils]: 17: Hoare triple {5549#(= ~data~0 0)} [154] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5549#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,620 INFO L290 TraceCheckUtils]: 18: Hoare triple {5549#(= ~data~0 0)} [110] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {5549#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,621 INFO L290 TraceCheckUtils]: 19: Hoare triple {5549#(= ~data~0 0)} [152] L-1-6-->L730: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_1|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_1|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~#t2~0#1.base] {5549#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,621 INFO L290 TraceCheckUtils]: 20: Hoare triple {5549#(= ~data~0 0)} [167] L730-->L731: Formula: (= (store |v_#pthreadsMutex_14| |v_~#mutex~0.base_13| (store (select |v_#pthreadsMutex_14| |v_~#mutex~0.base_13|) |v_~#mutex~0.offset_13| 0)) |v_#pthreadsMutex_13|) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_13|, #pthreadsMutex=|v_#pthreadsMutex_14|, ~#mutex~0.base=|v_~#mutex~0.base_13|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_13|, #pthreadsMutex=|v_#pthreadsMutex_13|, ~#mutex~0.base=|v_~#mutex~0.base_13|} AuxVars[] AssignedVars[#pthreadsMutex] {5549#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,621 INFO L290 TraceCheckUtils]: 21: Hoare triple {5549#(= ~data~0 0)} [126] L731-->L731-1: Formula: (and (= (store |v_#length_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4) |v_#length_4|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] {5549#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,622 INFO L290 TraceCheckUtils]: 22: Hoare triple {5549#(= ~data~0 0)} [130] L731-1-->L731-2: Formula: (and (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= |v_#valid_7| (store |v_#valid_8| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1)) (= (store |v_#length_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4) |v_#length_6|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] {5549#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,622 INFO L290 TraceCheckUtils]: 23: Hoare triple {5549#(= ~data~0 0)} [95] L731-2-->L731-3: Formula: (and (= (select |v_#valid_10| |v_ULTIMATE.start_main_~#t3~0#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_2| 0) (= |v_#valid_9| (store |v_#valid_10| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 1)) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_2| 0)) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t3~0#1.base_2|) (= |v_#length_8| (store |v_#length_9| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_9|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_8|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_2|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] {5549#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,622 INFO L290 TraceCheckUtils]: 24: Hoare triple {5549#(= ~data~0 0)} [151] L731-3-->L732: Formula: (= |v_ULTIMATE.start_main_#t~pre7#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {5549#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,623 INFO L290 TraceCheckUtils]: 25: Hoare triple {5549#(= ~data~0 0)} [121] L732-->L732-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {5549#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,623 INFO L290 TraceCheckUtils]: 26: Hoare triple {5549#(= ~data~0 0)} [171] L732-1-->L732-2: Formula: (= (store |v_#memory_int_9| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_9| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre7#1_3|)) |v_#memory_int_8|) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {5549#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,624 INFO L290 TraceCheckUtils]: 27: Hoare triple {5549#(= ~data~0 0)} [215] L732-2-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_thread1Thread1of1ForFork2_thidvar0_2) (= |v_thread1Thread1of1ForFork2_#in~arg.base_4| 0) (= |v_thread1Thread1of1ForFork2_#in~arg.offset_4| 0) (= 0 v_thread1Thread1of1ForFork2_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{thread1Thread1of1ForFork2_#t~nondet3=|v_thread1Thread1of1ForFork2_#t~nondet3_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_2, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_#in~arg.base=|v_thread1Thread1of1ForFork2_#in~arg.base_4|, thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_4|, thread1Thread1of1ForFork2_~arg.offset=v_thread1Thread1of1ForFork2_~arg.offset_4, thread1Thread1of1ForFork2_~arg.base=v_thread1Thread1of1ForFork2_~arg.base_4, thread1Thread1of1ForFork2_#t~post4=|v_thread1Thread1of1ForFork2_#t~post4_8|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_4|, thread1Thread1of1ForFork2_#in~arg.offset=|v_thread1Thread1of1ForFork2_#in~arg.offset_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~nondet3, thread1Thread1of1ForFork2_thidvar1, thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_#in~arg.base, thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_~arg.offset, thread1Thread1of1ForFork2_~arg.base, thread1Thread1of1ForFork2_#t~post4, thread1Thread1of1ForFork2_#res.offset, thread1Thread1of1ForFork2_#in~arg.offset] {5549#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,624 INFO L290 TraceCheckUtils]: 28: Hoare triple {5549#(= ~data~0 0)} [105] L732-3-->L732-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {5549#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,625 INFO L290 TraceCheckUtils]: 29: Hoare triple {5549#(= ~data~0 0)} [113] L732-4-->L733: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] {5549#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,625 INFO L290 TraceCheckUtils]: 30: Hoare triple {5549#(= ~data~0 0)} [124] L733-->L733-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] {5549#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,625 INFO L290 TraceCheckUtils]: 31: Hoare triple {5549#(= ~data~0 0)} [97] L733-1-->L733-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {5549#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,626 INFO L290 TraceCheckUtils]: 32: Hoare triple {5549#(= ~data~0 0)} [179] L733-2-->L733-3: Formula: (= |v_#memory_int_10| (store |v_#memory_int_11| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_11| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre9#1_3|))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{#memory_int=|v_#memory_int_10|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {5549#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,626 INFO L290 TraceCheckUtils]: 33: Hoare triple {5549#(= ~data~0 0)} [211] L733-3-->thread2ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread2Thread1of1ForFork0_thidvar0_2) (= |v_thread2Thread1of1ForFork0_#in~arg.offset_4| 0) (= |v_thread2Thread1of1ForFork0_#in~arg.base_4| 0) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_4|, thread2Thread1of1ForFork0_~arg.base=v_thread2Thread1of1ForFork0_~arg.base_4, thread2Thread1of1ForFork0_~arg.offset=v_thread2Thread1of1ForFork0_~arg.offset_4, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, thread2Thread1of1ForFork0_#in~arg.offset=|v_thread2Thread1of1ForFork0_#in~arg.offset_4|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_#t~nondet5=|v_thread2Thread1of1ForFork0_#t~nondet5_6|, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#in~arg.base=|v_thread2Thread1of1ForFork0_#in~arg.base_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_~arg.base, thread2Thread1of1ForFork0_~arg.offset, thread2Thread1of1ForFork0_#in~arg.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_#t~nondet5, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#in~arg.base] {5549#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,626 INFO L290 TraceCheckUtils]: 34: Hoare triple {5549#(= ~data~0 0)} [116] L733-4-->L733-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] {5549#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,627 INFO L290 TraceCheckUtils]: 35: Hoare triple {5549#(= ~data~0 0)} [101] L733-5-->L734: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] {5549#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,627 INFO L290 TraceCheckUtils]: 36: Hoare triple {5549#(= ~data~0 0)} [127] L734-->L734-1: Formula: (= |v_ULTIMATE.start_main_#t~pre11#1_2| |v_#pthreadsForks_7|) InVars {#pthreadsForks=|v_#pthreadsForks_7|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, #pthreadsForks=|v_#pthreadsForks_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1] {5549#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,628 INFO L290 TraceCheckUtils]: 37: Hoare triple {5549#(= ~data~0 0)} [134] L734-1-->L734-2: Formula: (= (+ 1 |v_#pthreadsForks_9|) |v_#pthreadsForks_8|) InVars {#pthreadsForks=|v_#pthreadsForks_9|} OutVars{#pthreadsForks=|v_#pthreadsForks_8|} AuxVars[] AssignedVars[#pthreadsForks] {5549#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,628 INFO L290 TraceCheckUtils]: 38: Hoare triple {5549#(= ~data~0 0)} [141] L734-2-->L734-3: Formula: (= (store |v_#memory_int_13| |v_ULTIMATE.start_main_~#t3~0#1.base_3| (store (select |v_#memory_int_13| |v_ULTIMATE.start_main_~#t3~0#1.base_3|) |v_ULTIMATE.start_main_~#t3~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre11#1_3|)) |v_#memory_int_12|) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_3|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_3|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {5549#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,628 INFO L290 TraceCheckUtils]: 39: Hoare triple {5549#(= ~data~0 0)} [213] L734-3-->thread3ENTRY: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar1_2) (= 0 v_thread3Thread1of1ForFork1_thidvar2_2) (= v_thread3Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= |v_thread3Thread1of1ForFork1_#in~arg.base_4| 0) (= 0 v_thread3Thread1of1ForFork1_thidvar3_2) (= |v_thread3Thread1of1ForFork1_#in~arg.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread3Thread1of1ForFork1_#t~nondet6=|v_thread3Thread1of1ForFork1_#t~nondet6_6|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread3Thread1of1ForFork1_#in~arg.offset=|v_thread3Thread1of1ForFork1_#in~arg.offset_4|, thread3Thread1of1ForFork1_~arg.base=v_thread3Thread1of1ForFork1_~arg.base_4, thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_4|, thread3Thread1of1ForFork1_~arg.offset=v_thread3Thread1of1ForFork1_~arg.offset_4, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_4|, thread3Thread1of1ForFork1_#in~arg.base=|v_thread3Thread1of1ForFork1_#in~arg.base_4|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~nondet6, thread3Thread1of1ForFork1_#in~arg.offset, thread3Thread1of1ForFork1_~arg.base, thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_~arg.offset, thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_#res.base, thread3Thread1of1ForFork1_#in~arg.base, thread3Thread1of1ForFork1_thidvar3, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2] {5549#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,631 INFO L290 TraceCheckUtils]: 40: Hoare triple {5549#(= ~data~0 0)} [183] thread1ENTRY-->L706: Formula: (and (= |v_thread1Thread1of1ForFork2_#in~arg.base_1| v_thread1Thread1of1ForFork2_~arg.base_1) (= |v_thread1Thread1of1ForFork2_#in~arg.offset_1| v_thread1Thread1of1ForFork2_~arg.offset_1)) InVars {thread1Thread1of1ForFork2_#in~arg.base=|v_thread1Thread1of1ForFork2_#in~arg.base_1|, thread1Thread1of1ForFork2_#in~arg.offset=|v_thread1Thread1of1ForFork2_#in~arg.offset_1|} OutVars{thread1Thread1of1ForFork2_#in~arg.base=|v_thread1Thread1of1ForFork2_#in~arg.base_1|, thread1Thread1of1ForFork2_~arg.offset=v_thread1Thread1of1ForFork2_~arg.offset_1, thread1Thread1of1ForFork2_~arg.base=v_thread1Thread1of1ForFork2_~arg.base_1, thread1Thread1of1ForFork2_#in~arg.offset=|v_thread1Thread1of1ForFork2_#in~arg.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~arg.offset, thread1Thread1of1ForFork2_~arg.base] {5549#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,631 INFO L290 TraceCheckUtils]: 41: Hoare triple {5549#(= ~data~0 0)} [184] L706-->L706-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#mutex~0.base_1|))) (and (= |v_#pthreadsMutex_1| (store |v_#pthreadsMutex_2| |v_~#mutex~0.base_1| (store .cse0 |v_~#mutex~0.offset_1| 1))) (= (select .cse0 |v_~#mutex~0.offset_1|) 0) (= |v_thread1Thread1of1ForFork2_#t~nondet3_1| 0))) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_1|, #pthreadsMutex=|v_#pthreadsMutex_2|, ~#mutex~0.base=|v_~#mutex~0.base_1|} OutVars{thread1Thread1of1ForFork2_#t~nondet3=|v_thread1Thread1of1ForFork2_#t~nondet3_1|, ~#mutex~0.offset=|v_~#mutex~0.offset_1|, #pthreadsMutex=|v_#pthreadsMutex_1|, ~#mutex~0.base=|v_~#mutex~0.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~nondet3, #pthreadsMutex] {5549#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,632 INFO L290 TraceCheckUtils]: 42: Hoare triple {5549#(= ~data~0 0)} [185] L706-1-->L707: Formula: true InVars {} OutVars{thread1Thread1of1ForFork2_#t~nondet3=|v_thread1Thread1of1ForFork2_#t~nondet3_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~nondet3] {5549#(= ~data~0 0)} is VALID [2022-02-20 20:07:21,632 INFO L290 TraceCheckUtils]: 43: Hoare triple {5549#(= ~data~0 0)} [186] L707-->L707-1: Formula: (= v_~data~0_1 |v_thread1Thread1of1ForFork2_#t~post4_1|) InVars {~data~0=v_~data~0_1} OutVars{thread1Thread1of1ForFork2_#t~post4=|v_thread1Thread1of1ForFork2_#t~post4_1|, ~data~0=v_~data~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post4] {5550#(= |thread1Thread1of1ForFork2_#t~post4| 0)} is VALID [2022-02-20 20:07:21,633 INFO L290 TraceCheckUtils]: 44: Hoare triple {5550#(= |thread1Thread1of1ForFork2_#t~post4| 0)} [187] L707-1-->L707-2: Formula: (= v_~data~0_2 (+ |v_thread1Thread1of1ForFork2_#t~post4_3| 1)) InVars {thread1Thread1of1ForFork2_#t~post4=|v_thread1Thread1of1ForFork2_#t~post4_3|} OutVars{thread1Thread1of1ForFork2_#t~post4=|v_thread1Thread1of1ForFork2_#t~post4_3|, ~data~0=v_~data~0_2} AuxVars[] AssignedVars[~data~0] {5551#(<= ~data~0 1)} is VALID [2022-02-20 20:07:21,633 INFO L290 TraceCheckUtils]: 45: Hoare triple {5551#(<= ~data~0 1)} [188] L707-2-->L708: Formula: true InVars {} OutVars{thread1Thread1of1ForFork2_#t~post4=|v_thread1Thread1of1ForFork2_#t~post4_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post4] {5551#(<= ~data~0 1)} is VALID [2022-02-20 20:07:21,633 INFO L290 TraceCheckUtils]: 46: Hoare triple {5551#(<= ~data~0 1)} [189] L708-->L709: Formula: (= |v_#pthreadsMutex_3| (store |v_#pthreadsMutex_4| |v_~#mutex~0.base_2| (store (select |v_#pthreadsMutex_4| |v_~#mutex~0.base_2|) |v_~#mutex~0.offset_2| 0))) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_2|, #pthreadsMutex=|v_#pthreadsMutex_4|, ~#mutex~0.base=|v_~#mutex~0.base_2|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_2|, #pthreadsMutex=|v_#pthreadsMutex_3|, ~#mutex~0.base=|v_~#mutex~0.base_2|} AuxVars[] AssignedVars[#pthreadsMutex] {5551#(<= ~data~0 1)} is VALID [2022-02-20 20:07:21,634 INFO L290 TraceCheckUtils]: 47: Hoare triple {5551#(<= ~data~0 1)} [199] thread3ENTRY-->L720: Formula: (and (= v_thread3Thread1of1ForFork1_~arg.base_1 |v_thread3Thread1of1ForFork1_#in~arg.base_1|) (= |v_thread3Thread1of1ForFork1_#in~arg.offset_1| v_thread3Thread1of1ForFork1_~arg.offset_1)) InVars {thread3Thread1of1ForFork1_#in~arg.offset=|v_thread3Thread1of1ForFork1_#in~arg.offset_1|, thread3Thread1of1ForFork1_#in~arg.base=|v_thread3Thread1of1ForFork1_#in~arg.base_1|} OutVars{thread3Thread1of1ForFork1_~arg.base=v_thread3Thread1of1ForFork1_~arg.base_1, thread3Thread1of1ForFork1_~arg.offset=v_thread3Thread1of1ForFork1_~arg.offset_1, thread3Thread1of1ForFork1_#in~arg.base=|v_thread3Thread1of1ForFork1_#in~arg.base_1|, thread3Thread1of1ForFork1_#in~arg.offset=|v_thread3Thread1of1ForFork1_#in~arg.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_~arg.base, thread3Thread1of1ForFork1_~arg.offset] {5551#(<= ~data~0 1)} is VALID [2022-02-20 20:07:21,634 INFO L290 TraceCheckUtils]: 48: Hoare triple {5551#(<= ~data~0 1)} [200] L720-->L720-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_10| |v_~#mutex~0.base_5|))) (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#mutex~0.base_5| (store .cse0 |v_~#mutex~0.offset_5| 1))) (= |v_thread3Thread1of1ForFork1_#t~nondet6_1| 0) (= (select .cse0 |v_~#mutex~0.offset_5|) 0))) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_5|, #pthreadsMutex=|v_#pthreadsMutex_10|, ~#mutex~0.base=|v_~#mutex~0.base_5|} OutVars{thread3Thread1of1ForFork1_#t~nondet6=|v_thread3Thread1of1ForFork1_#t~nondet6_1|, ~#mutex~0.offset=|v_~#mutex~0.offset_5|, #pthreadsMutex=|v_#pthreadsMutex_9|, ~#mutex~0.base=|v_~#mutex~0.base_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~nondet6, #pthreadsMutex] {5551#(<= ~data~0 1)} is VALID [2022-02-20 20:07:21,634 INFO L290 TraceCheckUtils]: 49: Hoare triple {5551#(<= ~data~0 1)} [201] L720-1-->L721: Formula: true InVars {} OutVars{thread3Thread1of1ForFork1_#t~nondet6=|v_thread3Thread1of1ForFork1_#t~nondet6_3|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~nondet6] {5551#(<= ~data~0 1)} is VALID [2022-02-20 20:07:21,635 INFO L290 TraceCheckUtils]: 50: Hoare triple {5551#(<= ~data~0 1)} [202] L721-->L722: Formula: (<= 3 v_~data~0_5) InVars {~data~0=v_~data~0_5} OutVars{~data~0=v_~data~0_5} AuxVars[] AssignedVars[] {5548#false} is VALID [2022-02-20 20:07:21,635 INFO L290 TraceCheckUtils]: 51: Hoare triple {5548#false} [204] L722-->thread3Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5548#false} is VALID [2022-02-20 20:07:21,635 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:07:21,636 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:07:21,636 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538314137] [2022-02-20 20:07:21,636 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538314137] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:07:21,636 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:07:21,636 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 20:07:21,636 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815634786] [2022-02-20 20:07:21,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:07:21,638 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 52 [2022-02-20 20:07:21,638 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:07:21,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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:07:21,670 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:07:21,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 20:07:21,671 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:07:21,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 20:07:21,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 20:07:21,672 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 91 [2022-02-20 20:07:21,672 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 72 transitions, 179 flow. Second operand has 5 states, 5 states have (on average 77.6) internal successors, (388), 5 states have internal predecessors, (388), 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:07:21,672 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:07:21,672 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 91 [2022-02-20 20:07:21,672 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:07:21,739 INFO L129 PetriNetUnfolder]: 17/162 cut-off events. [2022-02-20 20:07:21,739 INFO L130 PetriNetUnfolder]: For 51/51 co-relation queries the response was YES. [2022-02-20 20:07:21,739 INFO L84 FinitePrefix]: Finished finitePrefix Result has 270 conditions, 162 events. 17/162 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 511 event pairs, 5 based on Foata normal form. 2/164 useless extension candidates. Maximal degree in co-relation 174. Up to 26 conditions per place. [2022-02-20 20:07:21,740 INFO L132 encePairwiseOnDemand]: 85/91 looper letters, 17 selfloop transitions, 6 changer transitions 0/82 dead transitions. [2022-02-20 20:07:21,740 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 82 transitions, 257 flow [2022-02-20 20:07:21,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 20:07:21,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-02-20 20:07:21,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 480 transitions. [2022-02-20 20:07:21,744 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8791208791208791 [2022-02-20 20:07:21,744 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 480 transitions. [2022-02-20 20:07:21,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 480 transitions. [2022-02-20 20:07:21,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:07:21,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 480 transitions. [2022-02-20 20:07:21,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 80.0) internal successors, (480), 6 states have internal predecessors, (480), 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:07:21,746 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 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:07:21,746 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 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:07:21,747 INFO L186 Difference]: Start difference. First operand has 82 places, 72 transitions, 179 flow. Second operand 6 states and 480 transitions. [2022-02-20 20:07:21,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 82 transitions, 257 flow [2022-02-20 20:07:21,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 82 transitions, 249 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-02-20 20:07:21,750 INFO L242 Difference]: Finished difference. Result has 88 places, 74 transitions, 200 flow [2022-02-20 20:07:21,750 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=200, PETRI_PLACES=88, PETRI_TRANSITIONS=74} [2022-02-20 20:07:21,751 INFO L334 CegarLoopForPetriNet]: 80 programPoint places, 8 predicate places. [2022-02-20 20:07:21,751 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 88 places, 74 transitions, 200 flow [2022-02-20 20:07:21,782 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1384 states, 1380 states have (on average 2.6978260869565216) internal successors, (3723), 1383 states have internal predecessors, (3723), 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:07:21,785 INFO L78 Accepts]: Start accepts. Automaton has has 1384 states, 1380 states have (on average 2.6978260869565216) internal successors, (3723), 1383 states have internal predecessors, (3723), 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 52 [2022-02-20 20:07:21,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:07:21,785 INFO L470 AbstractCegarLoop]: Abstraction has has 88 places, 74 transitions, 200 flow [2022-02-20 20:07:21,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.6) internal successors, (388), 5 states have internal predecessors, (388), 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:07:21,785 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:07:21,786 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] [2022-02-20 20:07:21,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 20:07:21,786 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting thread3Err0ASSERT_VIOLATIONERROR_FUNCTION === [thread3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-02-20 20:07:21,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:07:21,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1698978968, now seen corresponding path program 1 times [2022-02-20 20:07:21,787 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:07:21,787 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359076714] [2022-02-20 20:07:21,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:07:21,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:07:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:07:21,808 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 20:07:21,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:07:21,837 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 20:07:21,837 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 20:07:21,838 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location thread3Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-02-20 20:07:21,839 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-02-20 20:07:21,839 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 5 remaining) [2022-02-20 20:07:21,839 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 5 remaining) [2022-02-20 20:07:21,839 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 5 remaining) [2022-02-20 20:07:21,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 20:07:21,842 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-02-20 20:07:21,845 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-20 20:07:21,845 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 20:07:21,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 08:07:21 BasicIcfg [2022-02-20 20:07:21,880 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 20:07:21,880 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 20:07:21,880 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 20:07:21,881 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 20:07:21,881 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:07:20" (3/4) ... [2022-02-20 20:07:21,882 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-20 20:07:21,917 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 20:07:21,917 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 20:07:21,918 INFO L158 Benchmark]: Toolchain (without parser) took 2616.50ms. Allocated memory was 92.3MB in the beginning and 159.4MB in the end (delta: 67.1MB). Free memory was 64.8MB in the beginning and 70.5MB in the end (delta: -5.7MB). Peak memory consumption was 62.7MB. Max. memory is 16.1GB. [2022-02-20 20:07:21,918 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 92.3MB. Free memory is still 63.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 20:07:21,918 INFO L158 Benchmark]: CACSL2BoogieTranslator took 356.68ms. Allocated memory was 92.3MB in the beginning and 117.4MB in the end (delta: 25.2MB). Free memory was 64.7MB in the beginning and 93.8MB in the end (delta: -29.1MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. [2022-02-20 20:07:21,919 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.02ms. Allocated memory is still 117.4MB. Free memory was 93.7MB in the beginning and 93.1MB in the end (delta: 679.3kB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. [2022-02-20 20:07:21,919 INFO L158 Benchmark]: Boogie Preprocessor took 43.40ms. Allocated memory is still 117.4MB. Free memory was 93.1MB in the beginning and 91.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:07:21,919 INFO L158 Benchmark]: RCFGBuilder took 460.58ms. Allocated memory is still 117.4MB. Free memory was 91.6MB in the beginning and 76.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 20:07:21,919 INFO L158 Benchmark]: TraceAbstraction took 1649.60ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 76.9MB in the beginning and 82.0MB in the end (delta: -5.1MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. [2022-02-20 20:07:21,920 INFO L158 Benchmark]: Witness Printer took 36.60ms. Allocated memory is still 159.4MB. Free memory was 82.0MB in the beginning and 70.5MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 20:07:21,921 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 92.3MB. Free memory is still 63.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 356.68ms. Allocated memory was 92.3MB in the beginning and 117.4MB in the end (delta: 25.2MB). Free memory was 64.7MB in the beginning and 93.8MB in the end (delta: -29.1MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.02ms. Allocated memory is still 117.4MB. Free memory was 93.7MB in the beginning and 93.1MB in the end (delta: 679.3kB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.40ms. Allocated memory is still 117.4MB. Free memory was 93.1MB in the beginning and 91.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 460.58ms. Allocated memory is still 117.4MB. Free memory was 91.6MB in the beginning and 76.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1649.60ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 76.9MB in the beginning and 82.0MB in the end (delta: -5.1MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. * Witness Printer took 36.60ms. Allocated memory is still 159.4MB. Free memory was 82.0MB in the beginning and 70.5MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. 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 - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L702] 0 pthread_mutex_t mutex; VAL [mutex={3:0}] [L703] 0 int data = 0; VAL [data=0, mutex={3:0}] [L731] 0 pthread_t t1, t2, t3; VAL [data=0, mutex={3:0}, t1={6:0}, t2={7:0}, t3={5:0}] [L732] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, data=0, mutex={3:0}, pthread_create(&t1, 0, thread1, 0)=-2, t1={6:0}, t2={7:0}, t3={5:0}] [L707] 1 data++ VAL [arg={0:0}, arg={0:0}, data=0, data++=0, mutex={3:0}] [L733] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, data=0, data++=0, mutex={3:0}, pthread_create(&t2, 0, thread2, 0)=-1, t1={6:0}, t2={7:0}, t3={5:0}] [L707] 1 data++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data=1, mutex={3:0}] [L714] 2 data+=2 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data=3, mutex={3:0}] [L734] FCALL, FORK 0 pthread_create(&t3, 0, thread3, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data=3, mutex={3:0}, pthread_create(&t3, 0, thread3, 0)=0, t1={6:0}, t2={7:0}, t3={5:0}] [L721] COND TRUE 3 data >= 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data=3, mutex={3:0}] [L722] 3 reach_error() VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, data=3, mutex={3:0}] - UnprovableResult [Line: 734]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 733]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 732]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 123 locations, 5 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: 1.4s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 24 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 24 mSDsluCounter, 23 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 61 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 96 IncrementalHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 19 mSDtfsCounter, 96 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=200occurred in iteration=4, InterpolantAutomatonStates: 16, 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.3s InterpolantComputationTime, 253 NumberOfCodeBlocks, 253 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 192 ConstructedInterpolants, 0 QuantifiedInterpolants, 414 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 RESULT: Ultimate proved your program to be incorrect! [2022-02-20 20:07:21,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE