/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe025_rmo.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:32:41,088 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:32:41,090 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:32:41,141 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:32:41,142 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:32:41,145 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:32:41,147 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:32:41,152 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:32:41,156 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:32:41,161 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:32:41,162 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:32:41,163 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:32:41,164 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:32:41,166 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:32:41,167 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:32:41,170 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:32:41,171 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:32:41,171 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:32:41,174 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:32:41,179 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:32:41,180 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:32:41,181 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:32:41,182 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:32:41,183 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:32:41,189 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:32:41,190 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:32:41,190 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:32:41,192 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:32:41,192 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:32:41,193 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:32:41,193 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:32:41,194 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:32:41,196 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:32:41,197 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:32:41,197 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:32:41,198 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:32:41,198 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:32:41,198 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:32:41,199 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:32:41,199 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:32:41,200 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:32:41,201 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:32:41,231 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:32:41,231 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:32:41,233 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:32:41,233 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:32:41,233 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:32:41,234 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:32:41,234 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:32:41,234 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:32:41,234 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:32:41,235 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:32:41,235 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:32:41,235 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:32:41,236 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:32:41,236 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:32:41,236 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:32:41,236 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:32:41,236 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:32:41,236 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:32:41,236 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:32:41,237 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:32:41,237 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:32:41,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:32:41,237 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:32:41,237 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:32:41,237 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:32:41,237 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:32:41,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:32:41,238 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:32:41,238 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 [2022-12-06 04:32:41,534 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:32:41,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:32:41,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:32:41,563 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:32:41,564 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:32:41,565 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe025_rmo.i [2022-12-06 04:32:42,664 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:32:42,958 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:32:42,959 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe025_rmo.i [2022-12-06 04:32:42,979 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0895dcc2a/23a2e60927dd41f0a7057527291a149f/FLAGca7e70b25 [2022-12-06 04:32:42,998 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0895dcc2a/23a2e60927dd41f0a7057527291a149f [2022-12-06 04:32:43,001 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:32:43,002 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:32:43,004 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:32:43,005 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:32:43,007 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:32:43,008 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:32:42" (1/1) ... [2022-12-06 04:32:43,009 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36a6fb40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:32:43, skipping insertion in model container [2022-12-06 04:32:43,009 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:32:42" (1/1) ... [2022-12-06 04:32:43,015 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:32:43,062 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:32:43,191 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe025_rmo.i[988,1001] [2022-12-06 04:32:43,352 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:43,352 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:43,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:43,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:43,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:43,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:43,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:43,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:43,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:43,377 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:43,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:43,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:43,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:43,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:43,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:43,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:43,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:43,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:43,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:43,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:43,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:43,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:43,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:43,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:43,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:43,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:43,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:43,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:43,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:43,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:43,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:43,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:43,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:32:43,429 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:32:43,439 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe025_rmo.i[988,1001] [2022-12-06 04:32:43,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:43,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:43,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:43,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:43,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:43,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:43,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:43,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:43,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:43,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:43,473 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:43,473 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:43,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:43,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:43,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:43,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:43,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:43,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:43,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:43,483 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:43,483 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:43,484 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:43,484 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:43,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:43,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:43,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:43,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:43,490 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:43,490 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:43,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:43,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:32:43,498 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:32:43,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:32:43,539 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:32:43,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:32:43 WrapperNode [2022-12-06 04:32:43,539 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:32:43,541 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:32:43,541 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:32:43,541 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:32:43,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:32:43" (1/1) ... [2022-12-06 04:32:43,573 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:32:43" (1/1) ... [2022-12-06 04:32:43,612 INFO L138 Inliner]: procedures = 176, calls = 84, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 167 [2022-12-06 04:32:43,612 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:32:43,613 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:32:43,613 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:32:43,613 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:32:43,621 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:32:43" (1/1) ... [2022-12-06 04:32:43,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:32:43" (1/1) ... [2022-12-06 04:32:43,626 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:32:43" (1/1) ... [2022-12-06 04:32:43,626 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:32:43" (1/1) ... [2022-12-06 04:32:43,635 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:32:43" (1/1) ... [2022-12-06 04:32:43,637 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:32:43" (1/1) ... [2022-12-06 04:32:43,640 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:32:43" (1/1) ... [2022-12-06 04:32:43,641 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:32:43" (1/1) ... [2022-12-06 04:32:43,645 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:32:43,646 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:32:43,646 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:32:43,646 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:32:43,647 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:32:43" (1/1) ... [2022-12-06 04:32:43,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:32:43,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:32:43,681 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-12-06 04:32:43,700 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-12-06 04:32:43,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 04:32:43,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:32:43,731 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:32:43,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:32:43,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:32:43,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:32:43,732 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:32:43,732 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:32:43,732 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:32:43,732 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:32:43,732 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:32:43,733 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:32:43,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:32:43,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:32:43,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:32:43,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:32:43,734 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:32:43,890 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:32:43,892 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:32:44,384 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:32:44,714 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:32:44,716 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:32:44,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:32:44 BoogieIcfgContainer [2022-12-06 04:32:44,719 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:32:44,721 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:32:44,721 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:32:44,724 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:32:44,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:32:42" (1/3) ... [2022-12-06 04:32:44,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@258caa6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:32:44, skipping insertion in model container [2022-12-06 04:32:44,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:32:43" (2/3) ... [2022-12-06 04:32:44,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@258caa6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:32:44, skipping insertion in model container [2022-12-06 04:32:44,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:32:44" (3/3) ... [2022-12-06 04:32:44,726 INFO L112 eAbstractionObserver]: Analyzing ICFG safe025_rmo.i [2022-12-06 04:32:44,743 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:32:44,743 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 04:32:44,744 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:32:44,816 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:32:44,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 265 flow [2022-12-06 04:32:44,923 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-12-06 04:32:44,923 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:32:44,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2022-12-06 04:32:44,929 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 125 transitions, 265 flow [2022-12-06 04:32:44,934 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 110 transitions, 229 flow [2022-12-06 04:32:44,935 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:32:44,961 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 110 transitions, 229 flow [2022-12-06 04:32:44,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 110 transitions, 229 flow [2022-12-06 04:32:45,019 INFO L130 PetriNetUnfolder]: 1/110 cut-off events. [2022-12-06 04:32:45,020 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:32:45,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 1/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 40 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2022-12-06 04:32:45,024 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 110 transitions, 229 flow [2022-12-06 04:32:45,024 INFO L188 LiptonReduction]: Number of co-enabled transitions 1212 [2022-12-06 04:32:55,527 INFO L203 LiptonReduction]: Total number of compositions: 91 [2022-12-06 04:32:55,549 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:32:55,556 INFO L357 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=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@49ad97, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:32:55,557 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 04:32:55,563 INFO L130 PetriNetUnfolder]: 0/13 cut-off events. [2022-12-06 04:32:55,563 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:32:55,563 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:32:55,564 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:32:55,565 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:32:55,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:32:55,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1622556870, now seen corresponding path program 1 times [2022-12-06 04:32:55,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:32:55,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926312154] [2022-12-06 04:32:55,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:32:55,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:32:55,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:32:55,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:32:55,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:32:55,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926312154] [2022-12-06 04:32:55,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926312154] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:32:55,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:32:55,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:32:55,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658394996] [2022-12-06 04:32:55,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:32:55,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 04:32:55,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:32:55,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 04:32:55,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 04:32:55,866 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 04:32:55,868 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 51 flow. Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-12-06 04:32:55,868 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:32:55,868 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 04:32:55,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:32:56,138 INFO L130 PetriNetUnfolder]: 567/884 cut-off events. [2022-12-06 04:32:56,139 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 04:32:56,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1795 conditions, 884 events. 567/884 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3690 event pairs, 567 based on Foata normal form. 0/868 useless extension candidates. Maximal degree in co-relation 1784. Up to 865 conditions per place. [2022-12-06 04:32:56,153 INFO L137 encePairwiseOnDemand]: 20/21 looper letters, 18 selfloop transitions, 0 changer transitions 0/20 dead transitions. [2022-12-06 04:32:56,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 20 transitions, 85 flow [2022-12-06 04:32:56,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 04:32:56,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 04:32:56,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 23 transitions. [2022-12-06 04:32:56,164 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2022-12-06 04:32:56,165 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 51 flow. Second operand 2 states and 23 transitions. [2022-12-06 04:32:56,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 20 transitions, 85 flow [2022-12-06 04:32:56,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 20 transitions, 82 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:32:56,169 INFO L231 Difference]: Finished difference. Result has 28 places, 20 transitions, 46 flow [2022-12-06 04:32:56,170 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=46, PETRI_PLACES=28, PETRI_TRANSITIONS=20} [2022-12-06 04:32:56,174 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, -2 predicate places. [2022-12-06 04:32:56,174 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:32:56,175 INFO L89 Accepts]: Start accepts. Operand has 28 places, 20 transitions, 46 flow [2022-12-06 04:32:56,177 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:32:56,177 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:32:56,178 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 20 transitions, 46 flow [2022-12-06 04:32:56,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 20 transitions, 46 flow [2022-12-06 04:32:56,196 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-06 04:32:56,196 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:32:56,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 20 events. 0/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-06 04:32:56,197 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 20 transitions, 46 flow [2022-12-06 04:32:56,197 INFO L188 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-06 04:32:56,495 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:32:56,497 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 323 [2022-12-06 04:32:56,497 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 20 transitions, 46 flow [2022-12-06 04:32:56,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-12-06 04:32:56,497 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:32:56,497 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:32:56,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:32:56,498 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:32:56,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:32:56,499 INFO L85 PathProgramCache]: Analyzing trace with hash -204014022, now seen corresponding path program 1 times [2022-12-06 04:32:56,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:32:56,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129831436] [2022-12-06 04:32:56,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:32:56,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:32:56,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:32:57,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:32:57,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:32:57,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129831436] [2022-12-06 04:32:57,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129831436] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:32:57,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:32:57,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:32:57,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382380127] [2022-12-06 04:32:57,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:32:57,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:32:57,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:32:57,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:32:57,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:32:57,040 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 04:32:57,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 20 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-12-06 04:32:57,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:32:57,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 04:32:57,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:32:57,283 INFO L130 PetriNetUnfolder]: 527/864 cut-off events. [2022-12-06 04:32:57,283 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:32:57,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1716 conditions, 864 events. 527/864 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3797 event pairs, 143 based on Foata normal form. 16/876 useless extension candidates. Maximal degree in co-relation 1708. Up to 609 conditions per place. [2022-12-06 04:32:57,289 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 24 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2022-12-06 04:32:57,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 28 transitions, 114 flow [2022-12-06 04:32:57,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:32:57,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:32:57,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-12-06 04:32:57,291 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-06 04:32:57,291 INFO L175 Difference]: Start difference. First operand has 27 places, 20 transitions, 46 flow. Second operand 3 states and 33 transitions. [2022-12-06 04:32:57,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 28 transitions, 114 flow [2022-12-06 04:32:57,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 28 transitions, 114 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:32:57,293 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 54 flow [2022-12-06 04:32:57,293 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2022-12-06 04:32:57,294 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 0 predicate places. [2022-12-06 04:32:57,294 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:32:57,295 INFO L89 Accepts]: Start accepts. Operand has 30 places, 20 transitions, 54 flow [2022-12-06 04:32:57,295 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:32:57,295 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:32:57,295 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 20 transitions, 54 flow [2022-12-06 04:32:57,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 20 transitions, 54 flow [2022-12-06 04:32:57,303 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-06 04:32:57,303 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:32:57,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 20 events. 0/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:32:57,304 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 20 transitions, 54 flow [2022-12-06 04:32:57,304 INFO L188 LiptonReduction]: Number of co-enabled transitions 184 [2022-12-06 04:32:57,305 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:32:57,306 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 04:32:57,306 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 54 flow [2022-12-06 04:32:57,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-12-06 04:32:57,307 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:32:57,307 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:32:57,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:32:57,307 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:32:57,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:32:57,308 INFO L85 PathProgramCache]: Analyzing trace with hash -2029467272, now seen corresponding path program 1 times [2022-12-06 04:32:57,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:32:57,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271976435] [2022-12-06 04:32:57,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:32:57,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:32:57,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:32:58,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:32:58,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:32:58,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271976435] [2022-12-06 04:32:58,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271976435] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:32:58,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:32:58,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:32:58,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310184011] [2022-12-06 04:32:58,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:32:58,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:32:58,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:32:58,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:32:58,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:32:58,647 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 04:32:58,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 54 flow. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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-12-06 04:32:58,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:32:58,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 04:32:58,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:32:58,944 INFO L130 PetriNetUnfolder]: 645/990 cut-off events. [2022-12-06 04:32:58,944 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 04:32:58,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2195 conditions, 990 events. 645/990 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4164 event pairs, 105 based on Foata normal form. 12/998 useless extension candidates. Maximal degree in co-relation 2184. Up to 849 conditions per place. [2022-12-06 04:32:58,951 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 27 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2022-12-06 04:32:58,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 30 transitions, 137 flow [2022-12-06 04:32:58,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:32:58,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:32:58,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-12-06 04:32:58,954 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-06 04:32:58,954 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 54 flow. Second operand 3 states and 33 transitions. [2022-12-06 04:32:58,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 30 transitions, 137 flow [2022-12-06 04:32:58,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 30 transitions, 131 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:32:58,957 INFO L231 Difference]: Finished difference. Result has 31 places, 20 transitions, 58 flow [2022-12-06 04:32:58,957 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=31, PETRI_TRANSITIONS=20} [2022-12-06 04:32:58,958 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2022-12-06 04:32:58,958 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:32:58,958 INFO L89 Accepts]: Start accepts. Operand has 31 places, 20 transitions, 58 flow [2022-12-06 04:32:58,959 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:32:58,959 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:32:58,959 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 20 transitions, 58 flow [2022-12-06 04:32:58,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 20 transitions, 58 flow [2022-12-06 04:32:58,966 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-06 04:32:58,966 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 04:32:58,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 20 events. 0/20 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:32:58,967 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 20 transitions, 58 flow [2022-12-06 04:32:58,967 INFO L188 LiptonReduction]: Number of co-enabled transitions 182 [2022-12-06 04:32:58,968 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:32:58,970 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 04:32:58,970 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 20 transitions, 58 flow [2022-12-06 04:32:58,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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-12-06 04:32:58,970 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:32:58,970 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:32:58,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:32:58,971 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:32:58,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:32:58,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1513531681, now seen corresponding path program 1 times [2022-12-06 04:32:58,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:32:58,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762463257] [2022-12-06 04:32:58,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:32:58,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:32:59,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:32:59,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:32:59,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:32:59,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762463257] [2022-12-06 04:32:59,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762463257] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:32:59,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:32:59,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:32:59,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117663625] [2022-12-06 04:32:59,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:32:59,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:32:59,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:32:59,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:32:59,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:32:59,318 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 04:32:59,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 20 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-12-06 04:32:59,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:32:59,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 04:32:59,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:32:59,580 INFO L130 PetriNetUnfolder]: 759/1162 cut-off events. [2022-12-06 04:32:59,580 INFO L131 PetriNetUnfolder]: For 161/161 co-relation queries the response was YES. [2022-12-06 04:32:59,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2656 conditions, 1162 events. 759/1162 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4794 event pairs, 574 based on Foata normal form. 12/1158 useless extension candidates. Maximal degree in co-relation 2644. Up to 1034 conditions per place. [2022-12-06 04:32:59,590 INFO L137 encePairwiseOnDemand]: 11/20 looper letters, 22 selfloop transitions, 8 changer transitions 0/31 dead transitions. [2022-12-06 04:32:59,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 31 transitions, 143 flow [2022-12-06 04:32:59,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:32:59,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:32:59,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-12-06 04:32:59,592 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4375 [2022-12-06 04:32:59,594 INFO L175 Difference]: Start difference. First operand has 31 places, 20 transitions, 58 flow. Second operand 4 states and 35 transitions. [2022-12-06 04:32:59,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 31 transitions, 143 flow [2022-12-06 04:32:59,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 31 transitions, 139 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:32:59,596 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 104 flow [2022-12-06 04:32:59,596 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2022-12-06 04:32:59,598 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2022-12-06 04:32:59,598 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:32:59,598 INFO L89 Accepts]: Start accepts. Operand has 33 places, 26 transitions, 104 flow [2022-12-06 04:32:59,599 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:32:59,600 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:32:59,600 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 26 transitions, 104 flow [2022-12-06 04:32:59,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 26 transitions, 104 flow [2022-12-06 04:32:59,675 INFO L130 PetriNetUnfolder]: 89/206 cut-off events. [2022-12-06 04:32:59,675 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2022-12-06 04:32:59,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 454 conditions, 206 events. 89/206 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 964 event pairs, 43 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 444. Up to 138 conditions per place. [2022-12-06 04:32:59,677 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 26 transitions, 104 flow [2022-12-06 04:32:59,678 INFO L188 LiptonReduction]: Number of co-enabled transitions 188 [2022-12-06 04:32:59,878 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [693] $Ultimate##0-->L791: Formula: (and (= (store |v_#memory_int_351| |v_~#x~0.base_220| (store (select |v_#memory_int_351| |v_~#x~0.base_220|) |v_~#x~0.offset_220| 1)) |v_#memory_int_350|) (= v_P1Thread1of1ForFork2_~arg.offset_5 |v_P1Thread1of1ForFork2_#in~arg.offset_5|) (= v_P1Thread1of1ForFork2_~arg.base_5 |v_P1Thread1of1ForFork2_#in~arg.base_5|)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, ~#x~0.offset=|v_~#x~0.offset_220|, #memory_int=|v_#memory_int_351|, ~#x~0.base=|v_~#x~0.base_220|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_5, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_5, ~#x~0.offset=|v_~#x~0.offset_220|, #memory_int=|v_#memory_int_350|, ~#x~0.base=|v_~#x~0.base_220|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, #memory_int] and [627] L864-->L870: Formula: (let ((.cse7 (= 0 (mod v_~x$r_buff0_thd0~0_72 256)))) (let ((.cse3 (not .cse7)) (.cse1 (not (= (mod v_~x$w_buff0_used~0_217 256) 0))) (.cse6 (= (mod v_~x$w_buff0_used~0_218 256) 0)) (.cse10 (= (mod v_~x$r_buff1_thd0~0_71 256) 0)) (.cse11 (= (mod v_~x$w_buff1_used~0_219 256) 0))) (let ((.cse4 (not .cse11)) (.cse0 (not .cse10)) (.cse2 (not .cse6)) (.cse9 (select |v_#memory_int_251| |v_~#x~0.base_174|)) (.cse5 (and .cse3 .cse1))) (and (= v_~x$r_buff1_thd0~0_70 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_218 256) 0))) (and .cse1 (not (= (mod v_~x$r_buff0_thd0~0_71 256) 0)))) 0 v_~x$r_buff1_thd0~0_71)) (= (ite (and .cse2 .cse3) 0 v_~x$w_buff0_used~0_218) v_~x$w_buff0_used~0_217) (= (ite (or (and .cse4 .cse0) .cse5) 0 v_~x$w_buff1_used~0_219) v_~x$w_buff1_used~0_218) (let ((.cse8 (= |v_ULTIMATE.start_main_#t~mem31#1_29| |v_ULTIMATE.start_main_#t~mem31#1_25|))) (or (and (or .cse6 .cse7) (or (and .cse4 (= v_~x$w_buff1~0_100 |v_ULTIMATE.start_main_#t~ite32#1_28|) .cse8 .cse0) (and (= |v_ULTIMATE.start_main_#t~mem31#1_29| (select .cse9 |v_~#x~0.offset_174|)) (or .cse10 .cse11) (= |v_ULTIMATE.start_main_#t~mem31#1_29| |v_ULTIMATE.start_main_#t~ite32#1_28|))) (= |v_ULTIMATE.start_main_#t~ite33#1_24| |v_ULTIMATE.start_main_#t~ite32#1_28|)) (and .cse2 .cse3 (= |v_ULTIMATE.start_main_#t~ite33#1_24| v_~x$w_buff0~0_96) (= |v_ULTIMATE.start_main_#t~ite32#1_28| |v_ULTIMATE.start_main_#t~ite32#1_24|) .cse8))) (= |v_#memory_int_250| (store |v_#memory_int_251| |v_~#x~0.base_174| (store .cse9 |v_~#x~0.offset_174| |v_ULTIMATE.start_main_#t~ite33#1_24|))) (= v_~x$r_buff0_thd0~0_71 (ite .cse5 0 v_~x$r_buff0_thd0~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_96, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_72, ~#x~0.offset=|v_~#x~0.offset_174|, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_25|, ~x$w_buff1~0=v_~x$w_buff1~0_100, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_24|, #memory_int=|v_#memory_int_251|, ~#x~0.base=|v_~#x~0.base_174|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_219, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_218} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_96, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_71, ~#x~0.offset=|v_~#x~0.offset_174|, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_20|, ~x$w_buff1~0=v_~x$w_buff1~0_100, #memory_int=|v_#memory_int_250|, ~#x~0.base=|v_~#x~0.base_174|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_218, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_70, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_217} AuxVars[|v_ULTIMATE.start_main_#t~ite32#1_28|, |v_ULTIMATE.start_main_#t~ite33#1_24|, |v_ULTIMATE.start_main_#t~mem31#1_29|] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~mem31#1, ULTIMATE.start_main_#t~ite33#1, ULTIMATE.start_main_#t~ite32#1, #memory_int, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] [2022-12-06 04:33:00,273 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [693] $Ultimate##0-->L791: Formula: (and (= (store |v_#memory_int_351| |v_~#x~0.base_220| (store (select |v_#memory_int_351| |v_~#x~0.base_220|) |v_~#x~0.offset_220| 1)) |v_#memory_int_350|) (= v_P1Thread1of1ForFork2_~arg.offset_5 |v_P1Thread1of1ForFork2_#in~arg.offset_5|) (= v_P1Thread1of1ForFork2_~arg.base_5 |v_P1Thread1of1ForFork2_#in~arg.base_5|)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, ~#x~0.offset=|v_~#x~0.offset_220|, #memory_int=|v_#memory_int_351|, ~#x~0.base=|v_~#x~0.base_220|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_5, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_5, ~#x~0.offset=|v_~#x~0.offset_220|, #memory_int=|v_#memory_int_350|, ~#x~0.base=|v_~#x~0.base_220|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, #memory_int] and [642] L762-->L780: Formula: (let ((.cse14 (= (mod v_~x$r_buff1_thd1~0_54 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_241 256) 0)) (.cse10 (= (mod v_~x$r_buff0_thd1~0_51 256) 0)) (.cse16 (= (mod v_~x$w_buff0_used~0_240 256) 0))) (let ((.cse5 (= (mod v_~weak$$choice2~0_120 256) 0)) (.cse12 (not .cse16)) (.cse11 (not .cse10)) (.cse3 (and .cse13 .cse10)) (.cse4 (and .cse10 .cse14)) (.cse0 (select |v_#memory_int_282| |v_~#x~0.base_190|))) (let ((.cse6 (select .cse0 |v_~#x~0.offset_190|)) (.cse7 (or .cse16 .cse3 .cse4)) (.cse8 (and .cse12 .cse11)) (.cse1 (not .cse5)) (.cse2 (= (mod v_~x$w_buff0_used~0_239 256) 0)) (.cse9 (= (mod v_~x$w_buff1_used~0_240 256) 0))) (and (= (store |v_#memory_int_282| |v_~#x~0.base_190| (store .cse0 |v_~#x~0.offset_190| |v_P0_#t~ite10_25|)) |v_#memory_int_280|) (= (ite .cse1 v_~x$w_buff1_used~0_241 (ite (or .cse2 .cse3 .cse4) v_~x$w_buff1_used~0_241 0)) v_~x$w_buff1_used~0_240) (or (and (= v_~__unbuffered_p0_EAX~0_22 |v_P0_#t~mem9_24|) (= |v_P0_#t~ite10_25| |v_P0_#t~mem9_24|) .cse5) (and (= |v_P0_#t~ite10_25| v_~x$mem_tmp~0_54) .cse1 (= |v_P0_#t~mem9_24| |v_P0Thread1of1ForFork1_#t~mem9_1|))) (= v_~x$flush_delayed~0_96 0) (= v_~x$mem_tmp~0_54 .cse6) (= v_~x$w_buff1~0_121 v_~x$w_buff1~0_120) (= |v_P0Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_31) (= (ite .cse1 v_~x$w_buff0_used~0_240 (ite .cse7 v_~x$w_buff0_used~0_240 (ite .cse8 0 v_~x$w_buff0_used~0_240))) v_~x$w_buff0_used~0_239) (= |v_P0Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_120) (= (ite .cse1 v_~x$r_buff0_thd1~0_51 (ite (or .cse2 (and .cse9 .cse10) .cse4) v_~x$r_buff0_thd1~0_51 (ite (and .cse11 (not .cse2)) 0 v_~x$r_buff0_thd1~0_51))) v_~x$r_buff0_thd1~0_50) (or (and (= |v_P0_#t~mem6_44| .cse6) .cse7 (= v_~__unbuffered_p0_EAX~0_22 |v_P0_#t~mem6_44|)) (and .cse12 (or .cse11 (not .cse13)) (= (ite .cse8 v_~x$w_buff0~0_117 v_~x$w_buff1~0_121) v_~__unbuffered_p0_EAX~0_22) (or (not .cse14) .cse11) (= |v_P0_#t~mem6_44| |v_P0Thread1of1ForFork1_#t~mem6_1|))) (= v_~x$r_buff1_thd1~0_53 (ite .cse1 v_~x$r_buff1_thd1~0_54 (ite (let ((.cse15 (= (mod v_~x$r_buff0_thd1~0_50 256) 0))) (or .cse2 (and .cse9 .cse15) (and .cse14 .cse15))) v_~x$r_buff1_thd1~0_54 0))) (= v_~x$w_buff0~0_117 v_~x$w_buff0~0_116))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_117, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_51, ~#x~0.offset=|v_~#x~0.offset_190|, ~x$w_buff1~0=v_~x$w_buff1~0_121, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_241, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_54, P0Thread1of1ForFork1_#t~mem9=|v_P0Thread1of1ForFork1_#t~mem9_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_240, P0Thread1of1ForFork1_#t~mem6=|v_P0Thread1of1ForFork1_#t~mem6_1|, #memory_int=|v_#memory_int_282|, ~#x~0.base=|v_~#x~0.base_190|, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_1|, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_1|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_116, P0Thread1of1ForFork1_#t~ite10=|v_P0Thread1of1ForFork1_#t~ite10_1|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_50, ~x$flush_delayed~0=v_~x$flush_delayed~0_96, ~#x~0.offset=|v_~#x~0.offset_190|, ~x$w_buff1~0=v_~x$w_buff1~0_120, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_240, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_53, ~x$mem_tmp~0=v_~x$mem_tmp~0_54, P0Thread1of1ForFork1_#t~mem8=|v_P0Thread1of1ForFork1_#t~mem8_1|, P0Thread1of1ForFork1_#t~mem5=|v_P0Thread1of1ForFork1_#t~mem5_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_239, ~weak$$choice0~0=v_~weak$$choice0~0_31, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, P0Thread1of1ForFork1_#t~ite7=|v_P0Thread1of1ForFork1_#t~ite7_1|, #memory_int=|v_#memory_int_280|, ~#x~0.base=|v_~#x~0.base_190|, ~weak$$choice2~0=v_~weak$$choice2~0_120} AuxVars[|v_P0_#t~mem6_44|, |v_P0_#t~mem9_24|, |v_P0_#t~ite10_25|] AssignedVars[~x$w_buff0~0, P0Thread1of1ForFork1_#t~ite10, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~mem9, ~x$mem_tmp~0, P0Thread1of1ForFork1_#t~mem8, P0Thread1of1ForFork1_#t~mem5, ~x$w_buff0_used~0, P0Thread1of1ForFork1_#t~mem6, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#t~ite7, #memory_int, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4] [2022-12-06 04:33:00,844 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [693] $Ultimate##0-->L791: Formula: (and (= (store |v_#memory_int_351| |v_~#x~0.base_220| (store (select |v_#memory_int_351| |v_~#x~0.base_220|) |v_~#x~0.offset_220| 1)) |v_#memory_int_350|) (= v_P1Thread1of1ForFork2_~arg.offset_5 |v_P1Thread1of1ForFork2_#in~arg.offset_5|) (= v_P1Thread1of1ForFork2_~arg.base_5 |v_P1Thread1of1ForFork2_#in~arg.base_5|)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, ~#x~0.offset=|v_~#x~0.offset_220|, #memory_int=|v_#memory_int_351|, ~#x~0.base=|v_~#x~0.base_220|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_5, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_5, ~#x~0.offset=|v_~#x~0.offset_220|, #memory_int=|v_#memory_int_350|, ~#x~0.base=|v_~#x~0.base_220|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, #memory_int] and [656] L830-->L837: Formula: (let ((.cse10 (= (mod v_~x$r_buff0_thd3~0_80 256) 0))) (let ((.cse7 (= (mod v_~x$r_buff1_thd3~0_79 256) 0)) (.cse11 (not (= (mod v_~x$w_buff0_used~0_243 256) 0))) (.cse5 (not .cse10)) (.cse9 (= (mod v_~x$w_buff0_used~0_244 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_245 256) 0))) (let ((.cse3 (not .cse8)) (.cse0 (select |v_#memory_int_287| |v_~#x~0.base_192|)) (.cse4 (not .cse9)) (.cse1 (and .cse11 .cse5)) (.cse2 (not .cse7))) (and (= |v_#memory_int_286| (store |v_#memory_int_287| |v_~#x~0.base_192| (store .cse0 |v_~#x~0.offset_192| |v_P2_#t~ite24_27|))) (= v_~x$w_buff1_used~0_244 (ite (or .cse1 (and .cse2 .cse3)) 0 v_~x$w_buff1_used~0_245)) (let ((.cse6 (= |v_P2Thread1of1ForFork0_#t~mem22_1| |v_P2_#t~mem22_28|))) (or (and .cse4 (= |v_P2_#t~ite23_29| |v_P2Thread1of1ForFork0_#t~ite23_1|) .cse5 .cse6 (= |v_P2_#t~ite24_27| v_~x$w_buff0~0_120)) (and (= |v_P2_#t~ite24_27| |v_P2_#t~ite23_29|) (or (and (= |v_P2_#t~ite23_29| v_~x$w_buff1~0_124) .cse2 .cse6 .cse3) (and (or .cse7 .cse8) (= |v_P2_#t~ite23_29| |v_P2_#t~mem22_28|) (= (select .cse0 |v_~#x~0.offset_192|) |v_P2_#t~mem22_28|))) (or .cse9 .cse10)))) (= (ite (and .cse4 .cse5) 0 v_~x$w_buff0_used~0_244) v_~x$w_buff0_used~0_243) (= (ite .cse1 0 v_~x$r_buff0_thd3~0_80) v_~x$r_buff0_thd3~0_79) (= v_~x$r_buff1_thd3~0_78 (ite (or (and .cse11 (not (= (mod v_~x$r_buff0_thd3~0_79 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_244 256) 0)) .cse2)) 0 v_~x$r_buff1_thd3~0_79)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_120, ~#x~0.offset=|v_~#x~0.offset_192|, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_1|, ~x$w_buff1~0=v_~x$w_buff1~0_124, #memory_int=|v_#memory_int_287|, ~#x~0.base=|v_~#x~0.base_192|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_79, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_245, P2Thread1of1ForFork0_#t~mem22=|v_P2Thread1of1ForFork0_#t~mem22_1|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_80, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_244} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_120, ~#x~0.offset=|v_~#x~0.offset_192|, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_1|, ~x$w_buff1~0=v_~x$w_buff1~0_124, #memory_int=|v_#memory_int_286|, ~#x~0.base=|v_~#x~0.base_192|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_78, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_244, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_79, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_243} AuxVars[|v_P2_#t~mem22_28|, |v_P2_#t~ite24_27|, |v_P2_#t~ite23_29|] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, #memory_int, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, P2Thread1of1ForFork0_#t~mem22, ~x$r_buff0_thd3~0, ~x$w_buff0_used~0] [2022-12-06 04:33:01,245 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [693] $Ultimate##0-->L791: Formula: (and (= (store |v_#memory_int_351| |v_~#x~0.base_220| (store (select |v_#memory_int_351| |v_~#x~0.base_220|) |v_~#x~0.offset_220| 1)) |v_#memory_int_350|) (= v_P1Thread1of1ForFork2_~arg.offset_5 |v_P1Thread1of1ForFork2_#in~arg.offset_5|) (= v_P1Thread1of1ForFork2_~arg.base_5 |v_P1Thread1of1ForFork2_#in~arg.base_5|)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, ~#x~0.offset=|v_~#x~0.offset_220|, #memory_int=|v_#memory_int_351|, ~#x~0.base=|v_~#x~0.base_220|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_5, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_5, ~#x~0.offset=|v_~#x~0.offset_220|, #memory_int=|v_#memory_int_350|, ~#x~0.base=|v_~#x~0.base_220|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, #memory_int] and [744] L857-3-->L859-2: Formula: (and (= |v_#pthreadsForks_47| |v_ULTIMATE.start_main_#t~pre29#1_23|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (< |v_#StackHeapBarrier_35| |v_ULTIMATE.start_main_~#t2383~0#1.base_20|) (= (select |v_#valid_88| |v_ULTIMATE.start_main_~#t2383~0#1.base_20|) 0) (= (store |v_#memory_int_463| |v_ULTIMATE.start_main_~#t2383~0#1.base_20| (store (select |v_#memory_int_463| |v_ULTIMATE.start_main_~#t2383~0#1.base_20|) |v_ULTIMATE.start_main_~#t2383~0#1.offset_20| |v_ULTIMATE.start_main_#t~pre29#1_23|)) |v_#memory_int_462|) (= |v_ULTIMATE.start_main_~#t2383~0#1.offset_20| 0) (= |v_#length_80| (store |v_#length_81| |v_ULTIMATE.start_main_~#t2383~0#1.base_20| 4)) (= |v_#valid_87| (store |v_#valid_88| |v_ULTIMATE.start_main_~#t2383~0#1.base_20| 1)) (not (= |v_ULTIMATE.start_main_~#t2383~0#1.base_20| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_35|, #pthreadsForks=|v_#pthreadsForks_47|, #valid=|v_#valid_88|, #memory_int=|v_#memory_int_463|, #length=|v_#length_81|} OutVars{ULTIMATE.start_main_~#t2383~0#1.offset=|v_ULTIMATE.start_main_~#t2383~0#1.offset_20|, #StackHeapBarrier=|v_#StackHeapBarrier_35|, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_23|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t2383~0#1.base=|v_ULTIMATE.start_main_~#t2383~0#1.base_20|, #valid=|v_#valid_87|, #memory_int=|v_#memory_int_462|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_21|, #length=|v_#length_80|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2383~0#1.offset, ULTIMATE.start_main_#t~pre29#1, #pthreadsForks, ULTIMATE.start_main_~#t2383~0#1.base, #valid, #memory_int, ULTIMATE.start_main_#t~pre27#1, #length, ULTIMATE.start_main_#t~nondet28#1] [2022-12-06 04:33:01,329 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [693] $Ultimate##0-->L791: Formula: (and (= (store |v_#memory_int_351| |v_~#x~0.base_220| (store (select |v_#memory_int_351| |v_~#x~0.base_220|) |v_~#x~0.offset_220| 1)) |v_#memory_int_350|) (= v_P1Thread1of1ForFork2_~arg.offset_5 |v_P1Thread1of1ForFork2_#in~arg.offset_5|) (= v_P1Thread1of1ForFork2_~arg.base_5 |v_P1Thread1of1ForFork2_#in~arg.base_5|)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, ~#x~0.offset=|v_~#x~0.offset_220|, #memory_int=|v_#memory_int_351|, ~#x~0.base=|v_~#x~0.base_220|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_5, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_5, ~#x~0.offset=|v_~#x~0.offset_220|, #memory_int=|v_#memory_int_350|, ~#x~0.base=|v_~#x~0.base_220|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, #memory_int] and [714] $Ultimate##0-->L827: Formula: (let ((.cse16 (= (mod v_~x$w_buff0_used~0_348 256) 0)) (.cse9 (= (mod v_~x$r_buff1_thd3~0_113 256) 0)) (.cse14 (= (mod v_~x$r_buff0_thd3~0_114 256) 0)) (.cse11 (= (mod v_~x$w_buff1_used~0_343 256) 0))) (let ((.cse15 (= (mod v_~weak$$choice2~0_168 256) 0)) (.cse3 (select |v_#memory_int_409| |v_~#x~0.base_242|)) (.cse6 (and .cse14 .cse11)) (.cse7 (and .cse9 .cse14)) (.cse8 (not .cse16)) (.cse10 (not .cse14))) (let ((.cse2 (and .cse8 .cse10)) (.cse1 (or .cse16 .cse6 .cse7)) (.cse4 (select .cse3 |v_~#x~0.offset_242|)) (.cse13 (= (mod v_~x$w_buff1_used~0_342 256) 0)) (.cse5 (= (mod v_~x$w_buff0_used~0_347 256) 0)) (.cse0 (not .cse15))) (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_~x$w_buff0~0_209 v_~x$w_buff0~0_208) (= (ite .cse0 v_~x$w_buff0_used~0_348 (ite .cse1 v_~x$w_buff0_used~0_348 (ite .cse2 0 v_~x$w_buff0_used~0_348))) v_~x$w_buff0_used~0_347) (= |v_P2Thread1of1ForFork0_#t~nondet14_26| v_~weak$$choice0~0_77) (= (store |v_#memory_int_409| |v_~#x~0.base_242| (store .cse3 |v_~#x~0.offset_242| |v_P2_#t~ite21_46|)) |v_#memory_int_408|) (= v_~x$mem_tmp~0_98 .cse4) (= (ite .cse0 v_~x$w_buff1_used~0_343 (ite (or .cse5 .cse6 .cse7) v_~x$w_buff1_used~0_343 0)) v_~x$w_buff1_used~0_342) (= v_~x$w_buff1~0_213 v_~x$w_buff1~0_212) (= v_~x$flush_delayed~0_148 0) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (or (and .cse8 (or (not .cse9) .cse10) (= |v_P2Thread1of1ForFork0_#t~mem17_26| |v_P2_#t~mem17_47|) (or (not .cse11) .cse10) (= (ite .cse2 v_~x$w_buff0~0_209 v_~x$w_buff1~0_213) v_~__unbuffered_p2_EAX~0_107)) (and (= |v_P2_#t~mem17_47| v_~__unbuffered_p2_EAX~0_107) .cse1 (= .cse4 |v_P2_#t~mem17_47|))) (= v_~__unbuffered_p2_EAX$read_delayed~0_65 1) (= (ite .cse0 v_~x$r_buff1_thd3~0_113 (ite (let ((.cse12 (= (mod v_~x$r_buff0_thd3~0_113 256) 0))) (or .cse5 (and .cse12 .cse9) (and .cse12 .cse13))) v_~x$r_buff1_thd3~0_113 0)) v_~x$r_buff1_thd3~0_112) (= |v_~#x~0.base_242| v_~__unbuffered_p2_EAX$read_delayed_var~0.base_64) (= (ite .cse0 v_~x$r_buff0_thd3~0_114 (ite (or .cse5 .cse7 (and .cse13 .cse14)) v_~x$r_buff0_thd3~0_114 (ite (and (not .cse5) .cse10) 0 v_~x$r_buff0_thd3~0_114))) v_~x$r_buff0_thd3~0_113) (or (and .cse15 (= |v_P2_#t~ite21_46| |v_P2_#t~mem20_45|) (= |v_P2_#t~mem20_45| v_~__unbuffered_p2_EAX~0_107)) (and (= |v_P2_#t~ite21_46| v_~x$mem_tmp~0_98) .cse0 (= |v_P2Thread1of1ForFork0_#t~mem20_26| |v_P2_#t~mem20_45|))) (= v_~weak$$choice2~0_168 |v_P2Thread1of1ForFork0_#t~nondet15_26|) (= |v_~#x~0.offset_242| v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_209, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~#x~0.offset=|v_~#x~0.offset_242|, ~x$w_buff1~0=v_~x$w_buff1~0_213, P2Thread1of1ForFork0_#t~mem17=|v_P2Thread1of1ForFork0_#t~mem17_26|, P2Thread1of1ForFork0_#t~nondet15=|v_P2Thread1of1ForFork0_#t~nondet15_26|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_113, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_343, P2Thread1of1ForFork0_#t~nondet14=|v_P2Thread1of1ForFork0_#t~nondet14_26|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_114, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_348, #memory_int=|v_#memory_int_409|, ~#x~0.base=|v_~#x~0.base_242|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, P2Thread1of1ForFork0_#t~mem20=|v_P2Thread1of1ForFork0_#t~mem20_26|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_208, P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_15|, P2Thread1of1ForFork0_#t~mem16=|v_P2Thread1of1ForFork0_#t~mem16_15|, ~x$flush_delayed~0=v_~x$flush_delayed~0_148, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_64, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_64, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_112, ~x$mem_tmp~0=v_~x$mem_tmp~0_98, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_113, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_15|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_107, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~#x~0.offset=|v_~#x~0.offset_242|, ~x$w_buff1~0=v_~x$w_buff1~0_212, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_342, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_65, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_347, ~weak$$choice0~0=v_~weak$$choice0~0_77, #memory_int=|v_#memory_int_408|, ~#x~0.base=|v_~#x~0.base_242|, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_15|, ~weak$$choice2~0=v_~weak$$choice2~0_168, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} AuxVars[|v_P2_#t~mem17_47|, |v_P2_#t~ite21_46|, |v_P2_#t~mem20_45|] AssignedVars[~x$w_buff0~0, P2Thread1of1ForFork0_#t~mem19, P2Thread1of1ForFork0_#t~mem16, ~x$flush_delayed~0, ~__unbuffered_p2_EAX$read_delayed_var~0.offset, ~__unbuffered_p2_EAX$read_delayed_var~0.base, P2Thread1of1ForFork0_#t~mem17, ~x$r_buff1_thd3~0, ~x$mem_tmp~0, ~x$r_buff0_thd3~0, P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_#t~ite21, ~__unbuffered_p2_EAX~0, ~x$w_buff1~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0_#t~nondet15, ~x$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet14, ~__unbuffered_p2_EAX$read_delayed~0, ~x$w_buff0_used~0, ~weak$$choice0~0, #memory_int, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, P2Thread1of1ForFork0_#t~mem20] [2022-12-06 04:33:02,026 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [760] $Ultimate##0-->L870: Formula: (let ((.cse3 (= (mod v_~x$r_buff0_thd0~0_264 256) 0))) (let ((.cse7 (= (mod v_~x$w_buff1_used~0_560 256) 0)) (.cse8 (= (mod v_~x$r_buff1_thd0~0_255 256) 0)) (.cse10 (not (= (mod v_~x$w_buff0_used~0_566 256) 0))) (.cse1 (not .cse3)) (.cse4 (= (mod v_~x$w_buff0_used~0_567 256) 0))) (let ((.cse0 (not .cse4)) (.cse9 (and .cse10 .cse1)) (.cse5 (not .cse8)) (.cse6 (not .cse7))) (and (= (ite (and .cse0 .cse1) 0 v_~x$w_buff0_used~0_567) v_~x$w_buff0_used~0_566) (= |v_P1Thread1of1ForFork2_#in~arg.base_27| v_P1Thread1of1ForFork2_~arg.base_27) (= |v_P1Thread1of1ForFork2_#in~arg.offset_27| v_P1Thread1of1ForFork2_~arg.offset_27) (let ((.cse2 (= |v_ULTIMATE.start_main_#t~mem31#1_150| |v_ULTIMATE.start_main_#t~mem31#1_148|))) (or (and (= |v_ULTIMATE.start_main_#t~ite33#1_120| v_~x$w_buff0~0_346) .cse0 (= |v_ULTIMATE.start_main_#t~ite32#1_149| |v_ULTIMATE.start_main_#t~ite32#1_147|) .cse2 .cse1) (and (= |v_ULTIMATE.start_main_#t~ite33#1_120| |v_ULTIMATE.start_main_#t~ite32#1_147|) (or .cse3 .cse4) (or (and .cse5 .cse6 (= v_~x$w_buff1~0_350 |v_ULTIMATE.start_main_#t~ite32#1_147|) .cse2) (and (= |v_ULTIMATE.start_main_#t~mem31#1_148| 1) (= |v_ULTIMATE.start_main_#t~mem31#1_148| |v_ULTIMATE.start_main_#t~ite32#1_147|) (or .cse7 .cse8)))))) (= (store |v_#memory_int_715| |v_~#x~0.base_354| (store (select |v_#memory_int_715| |v_~#x~0.base_354|) |v_~#x~0.offset_354| |v_ULTIMATE.start_main_#t~ite33#1_120|)) |v_#memory_int_713|) (= v_~x$r_buff0_thd0~0_263 (ite .cse9 0 v_~x$r_buff0_thd0~0_264)) (= (ite (or (and .cse5 (not (= (mod v_~x$w_buff1_used~0_559 256) 0))) (and .cse10 (not (= (mod v_~x$r_buff0_thd0~0_263 256) 0)))) 0 v_~x$r_buff1_thd0~0_255) v_~x$r_buff1_thd0~0_254) (= v_~x$w_buff1_used~0_559 (ite (or .cse9 (and .cse5 .cse6)) 0 v_~x$w_buff1_used~0_560)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_346, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_264, ~#x~0.offset=|v_~#x~0.offset_354|, ~x$w_buff1~0=v_~x$w_buff1~0_350, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_560, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_255, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_567, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_27|, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_150|, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_149|, #memory_int=|v_#memory_int_715|, ~#x~0.base=|v_~#x~0.base_354|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_27|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_346, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_263, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_27, ~#x~0.offset=|v_~#x~0.offset_354|, ~x$w_buff1~0=v_~x$w_buff1~0_350, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_559, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_254, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_566, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_27|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_27, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_119|, #memory_int=|v_#memory_int_713|, ~#x~0.base=|v_~#x~0.base_354|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_27|} AuxVars[|v_ULTIMATE.start_main_#t~ite32#1_147|, |v_ULTIMATE.start_main_#t~ite33#1_120|, |v_ULTIMATE.start_main_#t~mem31#1_148|] AssignedVars[~x$r_buff0_thd0~0, P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ULTIMATE.start_main_#t~mem31#1, ULTIMATE.start_main_#t~ite33#1, ULTIMATE.start_main_#t~ite32#1, #memory_int, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] and [648] L791-->L794: Formula: (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#x~0.base_9| (store (select |v_#memory_int_14| |v_~#x~0.base_9|) |v_~#x~0.offset_9| 2))) InVars {#memory_int=|v_#memory_int_14|, ~#x~0.base=|v_~#x~0.base_9|, ~#x~0.offset=|v_~#x~0.offset_9|} OutVars{#memory_int=|v_#memory_int_13|, ~#x~0.base=|v_~#x~0.base_9|, ~#x~0.offset=|v_~#x~0.offset_9|} AuxVars[] AssignedVars[#memory_int] [2022-12-06 04:33:02,332 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [762] $Ultimate##0-->L837: Formula: (let ((.cse5 (= (mod v_~x$r_buff0_thd3~0_198 256) 0))) (let ((.cse0 (not (= (mod v_~x$w_buff0_used~0_574 256) 0))) (.cse9 (not .cse5)) (.cse4 (= (mod v_~x$w_buff0_used~0_575 256) 0)) (.cse7 (= (mod v_~x$w_buff1_used~0_568 256) 0)) (.cse6 (= (mod v_~x$r_buff1_thd3~0_201 256) 0))) (let ((.cse1 (not .cse6)) (.cse3 (not .cse7)) (.cse10 (not .cse4)) (.cse2 (and .cse0 .cse9))) (and (= (store |v_#memory_int_727| |v_~#x~0.base_358| (store (select |v_#memory_int_727| |v_~#x~0.base_358|) |v_~#x~0.offset_358| |v_P2_#t~ite24_64|)) |v_#memory_int_725|) (= |v_P1Thread1of1ForFork2_#in~arg.base_31| v_P1Thread1of1ForFork2_~arg.base_31) (= |v_P1Thread1of1ForFork2_#in~arg.offset_31| v_P1Thread1of1ForFork2_~arg.offset_31) (= (ite (or (and .cse0 (not (= (mod v_~x$r_buff0_thd3~0_197 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_567 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_201) v_~x$r_buff1_thd3~0_200) (= (ite (or .cse2 (and .cse1 .cse3)) 0 v_~x$w_buff1_used~0_568) v_~x$w_buff1_used~0_567) (let ((.cse8 (= |v_P2Thread1of1ForFork0_#t~mem22_74| |v_P2_#t~mem22_65|))) (or (and (or .cse4 .cse5) (or (and (= |v_P2_#t~ite23_66| |v_P2_#t~mem22_65|) (or .cse6 .cse7) (= |v_P2_#t~mem22_65| 1)) (and .cse8 (= |v_P2_#t~ite23_66| v_~x$w_buff1~0_356) .cse1 .cse3)) (= |v_P2_#t~ite24_64| |v_P2_#t~ite23_66|)) (and .cse8 (= |v_P2_#t~ite24_64| v_~x$w_buff0~0_352) (= |v_P2_#t~ite23_66| |v_P2Thread1of1ForFork0_#t~ite23_74|) .cse9 .cse10))) (= v_~x$w_buff0_used~0_574 (ite (and .cse9 .cse10) 0 v_~x$w_buff0_used~0_575)) (= (ite .cse2 0 v_~x$r_buff0_thd3~0_198) v_~x$r_buff0_thd3~0_197))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_352, ~#x~0.offset=|v_~#x~0.offset_358|, ~x$w_buff1~0=v_~x$w_buff1~0_356, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_201, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_568, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_198, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_575, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_31|, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_74|, #memory_int=|v_#memory_int_727|, ~#x~0.base=|v_~#x~0.base_358|, P2Thread1of1ForFork0_#t~mem22=|v_P2Thread1of1ForFork0_#t~mem22_74|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_31|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_352, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_31, ~#x~0.offset=|v_~#x~0.offset_358|, ~x$w_buff1~0=v_~x$w_buff1~0_356, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_200, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_567, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_197, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_574, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_31|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_31, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_39|, #memory_int=|v_#memory_int_725|, ~#x~0.base=|v_~#x~0.base_358|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_31|} AuxVars[|v_P2_#t~ite24_64|, |v_P2_#t~ite23_66|, |v_P2_#t~mem22_65|] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, #memory_int, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, P2Thread1of1ForFork0_#t~mem22, ~x$r_buff0_thd3~0, ~x$w_buff0_used~0] and [648] L791-->L794: Formula: (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#x~0.base_9| (store (select |v_#memory_int_14| |v_~#x~0.base_9|) |v_~#x~0.offset_9| 2))) InVars {#memory_int=|v_#memory_int_14|, ~#x~0.base=|v_~#x~0.base_9|, ~#x~0.offset=|v_~#x~0.offset_9|} OutVars{#memory_int=|v_#memory_int_13|, ~#x~0.base=|v_~#x~0.base_9|, ~#x~0.offset=|v_~#x~0.offset_9|} AuxVars[] AssignedVars[#memory_int] [2022-12-06 04:33:02,678 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [765] $Ultimate##0-->L827: Formula: (let ((.cse3 (= (mod v_~x$r_buff1_thd3~0_205 256) 0)) (.cse4 (= (mod v_~x$w_buff1_used~0_572 256) 0)) (.cse13 (= (mod v_~x$r_buff0_thd3~0_202 256) 0)) (.cse14 (= (mod v_~x$w_buff0_used~0_579 256) 0))) (let ((.cse6 (= (mod v_~weak$$choice2~0_228 256) 0)) (.cse0 (not .cse14)) (.cse2 (not .cse13)) (.cse8 (and .cse13 .cse4)) (.cse10 (and .cse13 .cse3))) (let ((.cse5 (or .cse8 .cse14 .cse10)) (.cse1 (and .cse0 .cse2)) (.cse7 (not .cse6)) (.cse11 (= (mod v_~x$w_buff1_used~0_571 256) 0)) (.cse9 (= (mod v_~x$w_buff0_used~0_578 256) 0))) (and (= v_~x$w_buff1~0_359 v_~x$w_buff1~0_358) (= |v_P2Thread1of1ForFork0_#t~nondet14_42| v_~weak$$choice0~0_137) (or (and (= |v_P2Thread1of1ForFork0_#t~mem17_42| |v_P2_#t~mem17_58|) .cse0 (= (ite .cse1 v_~x$w_buff0~0_355 v_~x$w_buff1~0_359) v_~__unbuffered_p2_EAX~0_168) (or .cse2 (not .cse3)) (or (not .cse4) .cse2)) (and .cse5 (= |v_P2_#t~mem17_58| v_~__unbuffered_p2_EAX~0_168) (= |v_P2_#t~mem17_58| 1))) (or (and (= |v_P2_#t~mem20_56| v_~__unbuffered_p2_EAX~0_168) (= |v_P2_#t~ite21_57| |v_P2_#t~mem20_56|) .cse6) (and (= |v_P2Thread1of1ForFork0_#t~mem20_42| |v_P2_#t~mem20_56|) .cse7 (= |v_P2_#t~ite21_57| v_~x$mem_tmp~0_164))) (= 1 v_~x$mem_tmp~0_164) (= (ite .cse7 v_~x$w_buff1_used~0_572 (ite (or .cse8 .cse9 .cse10) v_~x$w_buff1_used~0_572 0)) v_~x$w_buff1_used~0_571) (= |v_P1Thread1of1ForFork2_#in~arg.base_37| v_P1Thread1of1ForFork2_~arg.base_37) (= (ite .cse7 v_~x$r_buff1_thd3~0_205 (ite (let ((.cse12 (= (mod v_~x$r_buff0_thd3~0_201 256) 0))) (or .cse9 (and .cse11 .cse12) (and .cse12 .cse3))) v_~x$r_buff1_thd3~0_205 0)) v_~x$r_buff1_thd3~0_204) (= v_~weak$$choice2~0_228 |v_P2Thread1of1ForFork0_#t~nondet15_42|) (= (store |v_#memory_int_745| |v_~#x~0.base_364| (store (select |v_#memory_int_745| |v_~#x~0.base_364|) |v_~#x~0.offset_364| |v_P2_#t~ite21_57|)) |v_#memory_int_743|) (= v_~x$w_buff0~0_355 v_~x$w_buff0~0_354) (= v_~__unbuffered_p2_EAX$read_delayed_var~0.base_107 |v_~#x~0.base_364|) (= |v_P1Thread1of1ForFork2_#in~arg.offset_37| v_P1Thread1of1ForFork2_~arg.offset_37) (= |v_P2Thread1of1ForFork0_#in~arg.base_13| v_P2Thread1of1ForFork0_~arg.base_13) (= v_~__unbuffered_p2_EAX$read_delayed~0_108 1) (= |v_~#x~0.offset_364| v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_107) (= v_~x$flush_delayed~0_218 0) (= (ite .cse7 v_~x$w_buff0_used~0_579 (ite .cse5 v_~x$w_buff0_used~0_579 (ite .cse1 0 v_~x$w_buff0_used~0_579))) v_~x$w_buff0_used~0_578) (= |v_P2Thread1of1ForFork0_#in~arg.offset_13| v_P2Thread1of1ForFork0_~arg.offset_13) (= (ite .cse7 v_~x$r_buff0_thd3~0_202 (ite (or .cse9 (and .cse13 .cse11) .cse10) v_~x$r_buff0_thd3~0_202 (ite (and (not .cse9) .cse2) 0 v_~x$r_buff0_thd3~0_202))) v_~x$r_buff0_thd3~0_201))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_355, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_13|, ~#x~0.offset=|v_~#x~0.offset_364|, ~x$w_buff1~0=v_~x$w_buff1~0_359, P2Thread1of1ForFork0_#t~mem17=|v_P2Thread1of1ForFork0_#t~mem17_42|, P2Thread1of1ForFork0_#t~nondet15=|v_P2Thread1of1ForFork0_#t~nondet15_42|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_205, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_572, P2Thread1of1ForFork0_#t~nondet14=|v_P2Thread1of1ForFork0_#t~nondet14_42|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_202, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_579, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_37|, #memory_int=|v_#memory_int_745|, ~#x~0.base=|v_~#x~0.base_364|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_37|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_13|, P2Thread1of1ForFork0_#t~mem20=|v_P2Thread1of1ForFork0_#t~mem20_42|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_354, P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_23|, P2Thread1of1ForFork0_#t~mem16=|v_P2Thread1of1ForFork0_#t~mem16_23|, ~x$flush_delayed~0=v_~x$flush_delayed~0_218, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_107, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_107, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_204, ~x$mem_tmp~0=v_~x$mem_tmp~0_164, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_201, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_37|, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_13, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_168, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_37, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_13|, ~#x~0.offset=|v_~#x~0.offset_364|, ~x$w_buff1~0=v_~x$w_buff1~0_358, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_13, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_571, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_578, ~weak$$choice0~0=v_~weak$$choice0~0_137, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_37, #memory_int=|v_#memory_int_743|, ~#x~0.base=|v_~#x~0.base_364|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_37|, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_23|, ~weak$$choice2~0=v_~weak$$choice2~0_228, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_13|} AuxVars[|v_P2_#t~mem17_58|, |v_P2_#t~ite21_57|, |v_P2_#t~mem20_56|] AssignedVars[~x$w_buff0~0, P2Thread1of1ForFork0_#t~mem19, P2Thread1of1ForFork0_#t~mem16, ~x$flush_delayed~0, ~__unbuffered_p2_EAX$read_delayed_var~0.offset, ~__unbuffered_p2_EAX$read_delayed_var~0.base, P2Thread1of1ForFork0_#t~mem17, ~x$r_buff1_thd3~0, ~x$mem_tmp~0, ~x$r_buff0_thd3~0, P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_#t~ite21, ~__unbuffered_p2_EAX~0, P1Thread1of1ForFork2_~arg.base, ~x$w_buff1~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0_#t~nondet15, ~x$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet14, ~__unbuffered_p2_EAX$read_delayed~0, ~x$w_buff0_used~0, ~weak$$choice0~0, P1Thread1of1ForFork2_~arg.offset, #memory_int, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, P2Thread1of1ForFork0_#t~mem20] and [648] L791-->L794: Formula: (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#x~0.base_9| (store (select |v_#memory_int_14| |v_~#x~0.base_9|) |v_~#x~0.offset_9| 2))) InVars {#memory_int=|v_#memory_int_14|, ~#x~0.base=|v_~#x~0.base_9|, ~#x~0.offset=|v_~#x~0.offset_9|} OutVars{#memory_int=|v_#memory_int_13|, ~#x~0.base=|v_~#x~0.base_9|, ~#x~0.offset=|v_~#x~0.offset_9|} AuxVars[] AssignedVars[#memory_int] [2022-12-06 04:33:03,205 ERROR L799 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-06 04:33:03,207 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:33:03,208 ERROR L123 eatedLiptonReduction]: Lipton reduction run adaptation of counterexample failed. [2022-12-06 04:33:03,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:33:03,209 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet! at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 04:33:03,222 INFO L158 Benchmark]: Toolchain (without parser) took 20218.60ms. Allocated memory was 206.6MB in the beginning and 423.6MB in the end (delta: 217.1MB). Free memory was 180.8MB in the beginning and 291.2MB in the end (delta: -110.4MB). Peak memory consumption was 257.4MB. Max. memory is 8.0GB. [2022-12-06 04:33:03,222 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 206.6MB. Free memory is still 182.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:33:03,225 INFO L158 Benchmark]: CACSL2BoogieTranslator took 535.22ms. Allocated memory is still 206.6MB. Free memory was 180.6MB in the beginning and 151.6MB in the end (delta: 29.0MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-06 04:33:03,226 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.67ms. Allocated memory is still 206.6MB. Free memory was 151.6MB in the beginning and 148.6MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 04:33:03,226 INFO L158 Benchmark]: Boogie Preprocessor took 32.46ms. Allocated memory is still 206.6MB. Free memory was 148.6MB in the beginning and 146.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:33:03,227 INFO L158 Benchmark]: RCFGBuilder took 1072.90ms. Allocated memory was 206.6MB in the beginning and 248.5MB in the end (delta: 41.9MB). Free memory was 146.0MB in the beginning and 202.3MB in the end (delta: -56.3MB). Peak memory consumption was 63.8MB. Max. memory is 8.0GB. [2022-12-06 04:33:03,228 INFO L158 Benchmark]: TraceAbstraction took 18499.54ms. Allocated memory was 248.5MB in the beginning and 423.6MB in the end (delta: 175.1MB). Free memory was 201.8MB in the beginning and 291.2MB in the end (delta: -89.4MB). Peak memory consumption was 235.6MB. Max. memory is 8.0GB. [2022-12-06 04:33:03,230 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 206.6MB. Free memory is still 182.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 535.22ms. Allocated memory is still 206.6MB. Free memory was 180.6MB in the beginning and 151.6MB in the end (delta: 29.0MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 71.67ms. Allocated memory is still 206.6MB. Free memory was 151.6MB in the beginning and 148.6MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.46ms. Allocated memory is still 206.6MB. Free memory was 148.6MB in the beginning and 146.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1072.90ms. Allocated memory was 206.6MB in the beginning and 248.5MB in the end (delta: 41.9MB). Free memory was 146.0MB in the beginning and 202.3MB in the end (delta: -56.3MB). Peak memory consumption was 63.8MB. Max. memory is 8.0GB. * TraceAbstraction took 18499.54ms. Allocated memory was 248.5MB in the beginning and 423.6MB in the end (delta: 175.1MB). Free memory was 201.8MB in the beginning and 291.2MB in the end (delta: -89.4MB). Peak memory consumption was 235.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.5s, 119 PlacesBefore, 30 PlacesAfterwards, 110 TransitionsBefore, 21 TransitionsAfterwards, 1212 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 57 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 91 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 984, independent: 911, independent conditional: 911, independent unconditional: 0, dependent: 73, dependent conditional: 73, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 984, independent: 911, independent conditional: 0, independent unconditional: 911, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 984, independent: 911, independent conditional: 0, independent unconditional: 911, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 984, independent: 911, independent conditional: 0, independent unconditional: 911, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 820, independent: 774, independent conditional: 0, independent unconditional: 774, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 820, independent: 752, independent conditional: 0, independent unconditional: 752, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 68, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 714, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 686, dependent conditional: 0, dependent unconditional: 686, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 984, independent: 137, independent conditional: 0, independent unconditional: 137, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 820, unknown conditional: 0, unknown unconditional: 820] , Statistics on independence cache: Total cache size (in pairs): 1227, Positive cache size: 1181, Positive conditional cache size: 0, Positive unconditional cache size: 1181, Negative cache size: 46, Negative conditional cache size: 0, Negative unconditional cache size: 46, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 27 PlacesBefore, 27 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 186 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 63, independent: 43, independent conditional: 43, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 63, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 63, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 63, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 58, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 58, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 21, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 295, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 290, dependent conditional: 0, dependent unconditional: 290, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 63, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 58, unknown conditional: 0, unknown unconditional: 58] , Statistics on independence cache: Total cache size (in pairs): 58, Positive cache size: 41, Positive conditional cache size: 0, Positive unconditional cache size: 41, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 58, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 58, independent: 40, independent conditional: 3, independent unconditional: 37, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 58, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 58, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 58, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 58, Positive cache size: 41, Positive conditional cache size: 0, Positive unconditional cache size: 41, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 31 PlacesBefore, 31 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 182 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, independent: 39, independent conditional: 39, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 56, independent: 39, independent conditional: 3, independent unconditional: 36, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 56, independent: 39, independent conditional: 3, independent unconditional: 36, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 56, independent: 39, independent conditional: 3, independent unconditional: 36, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 56, independent: 38, independent conditional: 3, independent unconditional: 35, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 59, Positive cache size: 42, Positive conditional cache size: 0, Positive unconditional cache size: 42, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 33 PlacesBefore, 32 PlacesAfterwards, 26 TransitionsBefore, 25 TransitionsAfterwards, 188 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 100, independent: 87, independent conditional: 87, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 100, independent: 87, independent conditional: 39, independent unconditional: 48, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 100, independent: 87, independent conditional: 3, independent unconditional: 84, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 100, independent: 87, independent conditional: 3, independent unconditional: 84, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 17, independent conditional: 3, independent unconditional: 14, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 76, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 100, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 19, unknown conditional: 3, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 75, Positive conditional cache size: 3, Positive unconditional cache size: 72, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36, Maximal queried relation: 0 - ExceptionOrErrorResult: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet!: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:125) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 04:33:03,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...