/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/safe002_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:24:50,087 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:24:50,088 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:24:50,125 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:24:50,125 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:24:50,127 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:24:50,130 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:24:50,132 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:24:50,136 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:24:50,140 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:24:50,141 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:24:50,144 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:24:50,144 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:24:50,145 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:24:50,146 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:24:50,146 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:24:50,147 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:24:50,147 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:24:50,148 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:24:50,149 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:24:50,150 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:24:50,154 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:24:50,155 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:24:50,157 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:24:50,164 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:24:50,165 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:24:50,165 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:24:50,165 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:24:50,166 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:24:50,166 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:24:50,166 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:24:50,167 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:24:50,167 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:24:50,168 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:24:50,168 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:24:50,169 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:24:50,169 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:24:50,169 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:24:50,169 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:24:50,170 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:24:50,170 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:24:50,174 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:24:50,204 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:24:50,204 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:24:50,206 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:24:50,206 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:24:50,206 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:24:50,206 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:24:50,207 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:24:50,207 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:24:50,207 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:24:50,207 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:24:50,207 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:24:50,208 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:24:50,208 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:24:50,208 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:24:50,208 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:24:50,208 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:24:50,208 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:24:50,208 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:24:50,208 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:24:50,208 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:24:50,209 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:24:50,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:24:50,209 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:24:50,209 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:24:50,209 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:24:50,209 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:24:50,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:24:50,209 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:24:50,209 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:24:50,449 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:24:50,471 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:24:50,473 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:24:50,474 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:24:50,474 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:24:50,476 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe002_rmo.oepc.i [2022-12-06 04:24:51,640 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:24:52,011 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:24:52,031 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_rmo.oepc.i [2022-12-06 04:24:52,056 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b0b16c11/c431cc86e8f743afb185377f3918ebe6/FLAGe859a505a [2022-12-06 04:24:52,068 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b0b16c11/c431cc86e8f743afb185377f3918ebe6 [2022-12-06 04:24:52,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:24:52,070 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:24:52,071 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:24:52,071 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:24:52,073 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:24:52,073 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:24:52" (1/1) ... [2022-12-06 04:24:52,074 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c50d025 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:24:52, skipping insertion in model container [2022-12-06 04:24:52,074 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:24:52" (1/1) ... [2022-12-06 04:24:52,078 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:24:52,124 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:24:52,302 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/safe002_rmo.oepc.i[993,1006] [2022-12-06 04:24:52,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:52,453 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:52,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:52,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:52,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:52,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:52,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:52,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:52,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:52,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:52,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:52,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:52,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:52,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:52,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:52,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:52,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:52,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:52,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:52,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:52,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:52,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:52,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:52,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:52,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:52,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:52,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:52,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:52,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:52,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:52,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:24:52,530 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:24:52,548 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/safe002_rmo.oepc.i[993,1006] [2022-12-06 04:24:52,580 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:52,584 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:52,584 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:52,585 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:52,585 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:52,585 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:52,585 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:52,585 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:52,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:52,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:52,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:52,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:52,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:52,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:52,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:52,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:52,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:52,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:52,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:52,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:52,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:52,593 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:52,594 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:52,594 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:52,597 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:52,597 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:52,597 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:52,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:52,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:24:52,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:24:52,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:24:52,641 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:24:52,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:24:52 WrapperNode [2022-12-06 04:24:52,643 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:24:52,645 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:24:52,645 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:24:52,645 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:24:52,651 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:24:52" (1/1) ... [2022-12-06 04:24:52,674 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:24:52" (1/1) ... [2022-12-06 04:24:52,707 INFO L138 Inliner]: procedures = 176, calls = 82, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 167 [2022-12-06 04:24:52,708 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:24:52,709 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:24:52,709 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:24:52,709 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:24:52,717 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:24:52" (1/1) ... [2022-12-06 04:24:52,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:24:52" (1/1) ... [2022-12-06 04:24:52,736 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:24:52" (1/1) ... [2022-12-06 04:24:52,737 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:24:52" (1/1) ... [2022-12-06 04:24:52,746 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:24:52" (1/1) ... [2022-12-06 04:24:52,748 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:24:52" (1/1) ... [2022-12-06 04:24:52,750 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:24:52" (1/1) ... [2022-12-06 04:24:52,767 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:24:52" (1/1) ... [2022-12-06 04:24:52,771 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:24:52,771 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:24:52,772 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:24:52,772 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:24:52,772 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:24:52" (1/1) ... [2022-12-06 04:24:52,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:24:52,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:24:52,823 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:24:52,845 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:24:52,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 04:24:52,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:24:52,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:24:52,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:24:52,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:24:52,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:24:52,866 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:24:52,866 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:24:52,866 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:24:52,866 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:24:52,866 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:24:52,866 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:24:52,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:24:52,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:24:52,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:24:52,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:24:52,867 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:24:52,970 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:24:52,971 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:24:53,342 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:24:53,605 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:24:53,606 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:24:53,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:24:53 BoogieIcfgContainer [2022-12-06 04:24:53,608 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:24:53,610 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:24:53,610 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:24:53,612 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:24:53,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:24:52" (1/3) ... [2022-12-06 04:24:53,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4affe01d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:24:53, skipping insertion in model container [2022-12-06 04:24:53,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:24:52" (2/3) ... [2022-12-06 04:24:53,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4affe01d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:24:53, skipping insertion in model container [2022-12-06 04:24:53,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:24:53" (3/3) ... [2022-12-06 04:24:53,616 INFO L112 eAbstractionObserver]: Analyzing ICFG safe002_rmo.oepc.i [2022-12-06 04:24:53,628 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:24:53,628 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 04:24:53,628 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:24:53,678 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:24:53,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 265 flow [2022-12-06 04:24:53,753 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-12-06 04:24:53,753 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:24:53,759 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 50 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:24:53,759 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 125 transitions, 265 flow [2022-12-06 04:24:53,762 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 110 transitions, 229 flow [2022-12-06 04:24:53,763 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:24:53,780 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 110 transitions, 229 flow [2022-12-06 04:24:53,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 110 transitions, 229 flow [2022-12-06 04:24:53,835 INFO L130 PetriNetUnfolder]: 1/110 cut-off events. [2022-12-06 04:24:53,836 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:24:53,837 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 41 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:24:53,839 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 110 transitions, 229 flow [2022-12-06 04:24:53,839 INFO L188 LiptonReduction]: Number of co-enabled transitions 1212 [2022-12-06 04:25:02,341 INFO L203 LiptonReduction]: Total number of compositions: 91 [2022-12-06 04:25:02,359 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:25:02,365 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;@2aaa0893, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:25:02,365 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 04:25:02,370 INFO L130 PetriNetUnfolder]: 0/14 cut-off events. [2022-12-06 04:25:02,371 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:25:02,371 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:25:02,371 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:25:02,372 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:25:02,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:25:02,375 INFO L85 PathProgramCache]: Analyzing trace with hash -745227295, now seen corresponding path program 1 times [2022-12-06 04:25:02,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:25:02,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111311953] [2022-12-06 04:25:02,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:25:02,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:25:02,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:25:02,523 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:25:02,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:25:02,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111311953] [2022-12-06 04:25:02,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111311953] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:25:02,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:25:02,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:25:02,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759462143] [2022-12-06 04:25:02,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:25:02,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 04:25:02,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:25:02,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 04:25:02,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 04:25:02,551 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2022-12-06 04:25:02,552 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 51 flow. Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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:25:02,552 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:25:02,552 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2022-12-06 04:25:02,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:25:02,711 INFO L130 PetriNetUnfolder]: 407/656 cut-off events. [2022-12-06 04:25:02,712 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-06 04:25:02,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1323 conditions, 656 events. 407/656 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2812 event pairs, 407 based on Foata normal form. 0/643 useless extension candidates. Maximal degree in co-relation 1312. Up to 631 conditions per place. [2022-12-06 04:25:02,717 INFO L137 encePairwiseOnDemand]: 20/21 looper letters, 17 selfloop transitions, 0 changer transitions 0/20 dead transitions. [2022-12-06 04:25:02,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 20 transitions, 83 flow [2022-12-06 04:25:02,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 04:25:02,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 04:25:02,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 24 transitions. [2022-12-06 04:25:02,726 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2022-12-06 04:25:02,727 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 51 flow. Second operand 2 states and 24 transitions. [2022-12-06 04:25:02,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 20 transitions, 83 flow [2022-12-06 04:25:02,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 20 transitions, 80 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:25:02,730 INFO L231 Difference]: Finished difference. Result has 28 places, 20 transitions, 46 flow [2022-12-06 04:25:02,731 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:25:02,734 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, -2 predicate places. [2022-12-06 04:25:02,734 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:25:02,734 INFO L89 Accepts]: Start accepts. Operand has 28 places, 20 transitions, 46 flow [2022-12-06 04:25:02,736 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:25:02,736 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:25:02,736 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 20 transitions, 46 flow [2022-12-06 04:25:02,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 20 transitions, 46 flow [2022-12-06 04:25:02,742 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-06 04:25:02,742 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:25:02,742 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 27 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:25:02,742 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 20 transitions, 46 flow [2022-12-06 04:25:02,742 INFO L188 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-06 04:25:02,938 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:25:02,939 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 205 [2022-12-06 04:25:02,939 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 20 transitions, 46 flow [2022-12-06 04:25:02,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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:25:02,939 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:25:02,939 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:25:02,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:25:02,940 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:25:02,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:25:02,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1096119191, now seen corresponding path program 1 times [2022-12-06 04:25:02,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:25:02,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757551575] [2022-12-06 04:25:02,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:25:02,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:25:03,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:25:03,314 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:25:03,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:25:03,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757551575] [2022-12-06 04:25:03,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757551575] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:25:03,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:25:03,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:25:03,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555645459] [2022-12-06 04:25:03,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:25:03,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:25:03,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:25:03,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:25:03,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:25:03,316 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2022-12-06 04:25:03,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 20 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:25:03,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:25:03,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2022-12-06 04:25:03,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:25:03,484 INFO L130 PetriNetUnfolder]: 378/633 cut-off events. [2022-12-06 04:25:03,484 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:25:03,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1256 conditions, 633 events. 378/633 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2790 event pairs, 102 based on Foata normal form. 12/641 useless extension candidates. Maximal degree in co-relation 1248. Up to 445 conditions per place. [2022-12-06 04:25:03,488 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 22 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2022-12-06 04:25:03,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 27 transitions, 108 flow [2022-12-06 04:25:03,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:25:03,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:25:03,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 04:25:03,489 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2022-12-06 04:25:03,490 INFO L175 Difference]: Start difference. First operand has 27 places, 20 transitions, 46 flow. Second operand 3 states and 34 transitions. [2022-12-06 04:25:03,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 27 transitions, 108 flow [2022-12-06 04:25:03,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 108 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:25:03,491 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 54 flow [2022-12-06 04:25:03,491 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:25:03,491 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 0 predicate places. [2022-12-06 04:25:03,492 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:25:03,492 INFO L89 Accepts]: Start accepts. Operand has 30 places, 20 transitions, 54 flow [2022-12-06 04:25:03,492 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:25:03,492 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:25:03,492 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 20 transitions, 54 flow [2022-12-06 04:25:03,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 20 transitions, 54 flow [2022-12-06 04:25:03,496 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-06 04:25:03,496 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:25:03,496 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 28 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:25:03,497 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 20 transitions, 54 flow [2022-12-06 04:25:03,497 INFO L188 LiptonReduction]: Number of co-enabled transitions 184 [2022-12-06 04:25:03,559 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:25:03,560 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 68 [2022-12-06 04:25:03,561 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 54 flow [2022-12-06 04:25:03,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:25:03,561 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:25:03,561 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:25:03,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:25:03,561 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:25:03,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:25:03,561 INFO L85 PathProgramCache]: Analyzing trace with hash -380044531, now seen corresponding path program 1 times [2022-12-06 04:25:03,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:25:03,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238491335] [2022-12-06 04:25:03,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:25:03,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:25:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:25:04,692 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:25:04,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:25:04,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238491335] [2022-12-06 04:25:04,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238491335] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:25:04,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:25:04,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:25:04,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322709593] [2022-12-06 04:25:04,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:25:04,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:25:04,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:25:04,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:25:04,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:25:04,699 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 04:25:04,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 54 flow. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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:25:04,701 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:25:04,706 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 04:25:04,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:25:05,015 INFO L130 PetriNetUnfolder]: 886/1380 cut-off events. [2022-12-06 04:25:05,016 INFO L131 PetriNetUnfolder]: For 140/140 co-relation queries the response was YES. [2022-12-06 04:25:05,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2927 conditions, 1380 events. 886/1380 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 6423 event pairs, 191 based on Foata normal form. 66/1446 useless extension candidates. Maximal degree in co-relation 2916. Up to 660 conditions per place. [2022-12-06 04:25:05,024 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 32 selfloop transitions, 4 changer transitions 12/49 dead transitions. [2022-12-06 04:25:05,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 49 transitions, 215 flow [2022-12-06 04:25:05,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:25:05,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:25:05,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-12-06 04:25:05,027 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.56 [2022-12-06 04:25:05,027 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 54 flow. Second operand 5 states and 56 transitions. [2022-12-06 04:25:05,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 49 transitions, 215 flow [2022-12-06 04:25:05,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 49 transitions, 209 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:25:05,029 INFO L231 Difference]: Finished difference. Result has 35 places, 22 transitions, 86 flow [2022-12-06 04:25:05,029 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=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=86, PETRI_PLACES=35, PETRI_TRANSITIONS=22} [2022-12-06 04:25:05,030 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2022-12-06 04:25:05,030 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:25:05,030 INFO L89 Accepts]: Start accepts. Operand has 35 places, 22 transitions, 86 flow [2022-12-06 04:25:05,031 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:25:05,031 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:25:05,031 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 22 transitions, 86 flow [2022-12-06 04:25:05,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 22 transitions, 86 flow [2022-12-06 04:25:05,043 INFO L130 PetriNetUnfolder]: 15/60 cut-off events. [2022-12-06 04:25:05,043 INFO L131 PetriNetUnfolder]: For 49/56 co-relation queries the response was YES. [2022-12-06 04:25:05,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 60 events. 15/60 cut-off events. For 49/56 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 9 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 130. Up to 28 conditions per place. [2022-12-06 04:25:05,044 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 22 transitions, 86 flow [2022-12-06 04:25:05,044 INFO L188 LiptonReduction]: Number of co-enabled transitions 184 [2022-12-06 04:25:05,067 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:25:05,068 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-06 04:25:05,069 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 86 flow [2022-12-06 04:25:05,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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:25:05,069 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:25:05,069 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:25:05,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:25:05,069 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:25:05,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:25:05,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1103549173, now seen corresponding path program 1 times [2022-12-06 04:25:05,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:25:05,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772409300] [2022-12-06 04:25:05,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:25:05,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:25:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:25:05,745 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:25:05,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:25:05,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772409300] [2022-12-06 04:25:05,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772409300] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:25:05,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:25:05,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:25:05,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122666102] [2022-12-06 04:25:05,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:25:05,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:25:05,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:25:05,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:25:05,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:25:05,747 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 04:25:05,747 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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:25:05,747 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:25:05,747 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 04:25:05,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:25:05,963 INFO L130 PetriNetUnfolder]: 564/874 cut-off events. [2022-12-06 04:25:05,963 INFO L131 PetriNetUnfolder]: For 792/792 co-relation queries the response was YES. [2022-12-06 04:25:05,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2494 conditions, 874 events. 564/874 cut-off events. For 792/792 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3660 event pairs, 389 based on Foata normal form. 13/886 useless extension candidates. Maximal degree in co-relation 2480. Up to 776 conditions per place. [2022-12-06 04:25:05,968 INFO L137 encePairwiseOnDemand]: 12/20 looper letters, 24 selfloop transitions, 8 changer transitions 0/33 dead transitions. [2022-12-06 04:25:05,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 33 transitions, 188 flow [2022-12-06 04:25:05,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:25:05,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:25:05,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-12-06 04:25:05,969 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.425 [2022-12-06 04:25:05,969 INFO L175 Difference]: Start difference. First operand has 34 places, 22 transitions, 86 flow. Second operand 4 states and 34 transitions. [2022-12-06 04:25:05,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 33 transitions, 188 flow [2022-12-06 04:25:05,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 33 transitions, 180 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 04:25:05,971 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 142 flow [2022-12-06 04:25:05,971 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2022-12-06 04:25:05,972 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 6 predicate places. [2022-12-06 04:25:05,972 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:25:05,972 INFO L89 Accepts]: Start accepts. Operand has 36 places, 28 transitions, 142 flow [2022-12-06 04:25:05,973 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:25:05,973 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:25:05,973 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 28 transitions, 142 flow [2022-12-06 04:25:05,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 28 transitions, 142 flow [2022-12-06 04:25:05,996 INFO L130 PetriNetUnfolder]: 40/117 cut-off events. [2022-12-06 04:25:05,997 INFO L131 PetriNetUnfolder]: For 130/141 co-relation queries the response was YES. [2022-12-06 04:25:05,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 338 conditions, 117 events. 40/117 cut-off events. For 130/141 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 456 event pairs, 9 based on Foata normal form. 2/109 useless extension candidates. Maximal degree in co-relation 326. Up to 67 conditions per place. [2022-12-06 04:25:06,000 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 28 transitions, 142 flow [2022-12-06 04:25:06,000 INFO L188 LiptonReduction]: Number of co-enabled transitions 198 [2022-12-06 04:25:06,110 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [649] L794-->L802: Formula: (let ((.cse10 (= (mod v_~y$r_buff0_thd2~0_32 256) 0))) (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_251 256) 0))) (.cse2 (not .cse10)) (.cse9 (= (mod v_~y$w_buff1_used~0_253 256) 0)) (.cse8 (= (mod v_~y$r_buff1_thd2~0_30 256) 0)) (.cse11 (= (mod v_~y$w_buff0_used~0_252 256) 0))) (let ((.cse3 (not .cse11)) (.cse5 (select |v_#memory_int_299| |v_~#y~0.base_206|)) (.cse0 (not .cse8)) (.cse7 (not .cse9)) (.cse4 (and .cse1 .cse2))) (and (= (ite (or (and .cse0 (not (= (mod v_~y$w_buff1_used~0_252 256) 0))) (and (not (= (mod v_~y$r_buff0_thd2~0_31 256) 0)) .cse1)) 0 v_~y$r_buff1_thd2~0_30) v_~y$r_buff1_thd2~0_29) (= v_~y$w_buff0_used~0_251 (ite (and .cse2 .cse3) 0 v_~y$w_buff0_used~0_252)) (= v_~y$r_buff0_thd2~0_31 (ite .cse4 0 v_~y$r_buff0_thd2~0_32)) (= (store |v_#memory_int_299| |v_~#y~0.base_206| (store .cse5 |v_~#y~0.offset_206| |v_P1_#t~ite13_27|)) |v_#memory_int_298|) (let ((.cse6 (= |v_P1Thread1of1ForFork2_#t~mem11_1| |v_P1_#t~mem11_30|))) (or (and (= |v_P1Thread1of1ForFork2_#t~ite12_1| |v_P1_#t~ite12_27|) (= |v_P1_#t~ite13_27| v_~y$w_buff0~0_116) .cse6 .cse2 .cse3) (and (= |v_P1_#t~ite12_27| |v_P1_#t~ite13_27|) (or (and .cse0 (= v_~y$w_buff1~0_132 |v_P1_#t~ite12_27|) .cse6 .cse7) (and (= |v_P1_#t~ite12_27| |v_P1_#t~mem11_30|) (= (select .cse5 |v_~#y~0.offset_206|) |v_P1_#t~mem11_30|) (or .cse8 .cse9))) (or .cse10 .cse11)))) (= (ite (or (and .cse0 .cse7) .cse4) 0 v_~y$w_buff1_used~0_253) v_~y$w_buff1_used~0_252))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_30, ~#y~0.offset=|v_~#y~0.offset_206|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_252, ~y$w_buff1~0=v_~y$w_buff1~0_132, ~y$w_buff0~0=v_~y$w_buff0~0_116, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_32, P1Thread1of1ForFork2_#t~mem11=|v_P1Thread1of1ForFork2_#t~mem11_1|, #memory_int=|v_#memory_int_299|, P1Thread1of1ForFork2_#t~ite12=|v_P1Thread1of1ForFork2_#t~ite12_1|, ~#y~0.base=|v_~#y~0.base_206|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_253} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_29, ~#y~0.offset=|v_~#y~0.offset_206|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_251, ~y$w_buff1~0=v_~y$w_buff1~0_132, ~y$w_buff0~0=v_~y$w_buff0~0_116, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_31, #memory_int=|v_#memory_int_298|, ~#y~0.base=|v_~#y~0.base_206|, P1Thread1of1ForFork2_#t~ite13=|v_P1Thread1of1ForFork2_#t~ite13_1|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_252} AuxVars[|v_P1_#t~mem11_30|, |v_P1_#t~ite12_27|, |v_P1_#t~ite13_27|] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~mem11, #memory_int, P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite13, ~y$w_buff1_used~0] and [686] $Ultimate##0-->L825: Formula: (let ((.cse3 (= (mod v_~y$r_buff1_thd3~0_87 256) 0)) (.cse0 (= (mod v_~y$w_buff1_used~0_281 256) 0)) (.cse13 (= (mod v_~y$r_buff0_thd3~0_86 256) 0)) (.cse16 (= (mod v_~y$w_buff0_used~0_280 256) 0))) (let ((.cse12 (= (mod v_~weak$$choice2~0_130 256) 0)) (.cse2 (not .cse16)) (.cse1 (not .cse13)) (.cse15 (and .cse13 .cse0)) (.cse14 (and .cse3 .cse13)) (.cse7 (select |v_#memory_int_339| |v_~#y~0.base_220|))) (let ((.cse5 (select .cse7 |v_~#y~0.offset_220|)) (.cse6 (or .cse16 .cse15 .cse14)) (.cse4 (and .cse2 .cse1)) (.cse9 (= (mod v_~y$w_buff1_used~0_280 256) 0)) (.cse8 (not .cse12)) (.cse11 (= (mod v_~y$w_buff0_used~0_279 256) 0))) (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_~y$w_buff1~0_151 v_~y$w_buff1~0_150) (or (and (or (not .cse0) .cse1) .cse2 (= |v_P2Thread1of1ForFork0_#t~mem17_6| |v_P2_#t~mem17_35|) (or .cse1 (not .cse3)) (= (ite .cse4 v_~y$w_buff0~0_135 v_~y$w_buff1~0_151) v_~__unbuffered_p2_EAX~0_32)) (and (= |v_P2_#t~mem17_35| v_~__unbuffered_p2_EAX~0_32) (= |v_P2_#t~mem17_35| .cse5) .cse6)) (= v_~y$mem_tmp~0_64 .cse5) (= (store |v_#memory_int_339| |v_~#y~0.base_220| (store .cse7 |v_~#y~0.offset_220| |v_P2_#t~ite21_38|)) |v_#memory_int_338|) (= v_~y$w_buff0_used~0_279 (ite .cse8 v_~y$w_buff0_used~0_280 (ite .cse6 v_~y$w_buff0_used~0_280 (ite .cse4 0 v_~y$w_buff0_used~0_280)))) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (= (ite .cse8 v_~y$r_buff1_thd3~0_87 (ite (let ((.cse10 (= (mod v_~y$r_buff0_thd3~0_85 256) 0))) (or (and .cse9 .cse10) .cse11 (and .cse3 .cse10))) v_~y$r_buff1_thd3~0_87 0)) v_~y$r_buff1_thd3~0_86) (= v_~weak$$choice0~0_37 |v_P2Thread1of1ForFork0_#t~nondet14_6|) (= v_~y$flush_delayed~0_106 0) (or (and .cse12 (= |v_P2_#t~ite21_38| |v_P2_#t~mem20_35|) (= |v_P2_#t~mem20_35| v_~__unbuffered_p2_EAX~0_32)) (and (= |v_P2_#t~ite21_38| v_~y$mem_tmp~0_64) (= |v_P2Thread1of1ForFork0_#t~mem20_6| |v_P2_#t~mem20_35|) .cse8)) (= (ite .cse8 v_~y$r_buff0_thd3~0_86 (ite (or .cse11 (and .cse9 .cse13) .cse14) v_~y$r_buff0_thd3~0_86 (ite (and (not .cse11) .cse1) 0 v_~y$r_buff0_thd3~0_86))) v_~y$r_buff0_thd3~0_85) (= v_~y$w_buff1_used~0_280 (ite .cse8 v_~y$w_buff1_used~0_281 (ite (or .cse15 .cse11 .cse14) v_~y$w_buff1_used~0_281 0))) (= v_~y$w_buff0~0_135 v_~y$w_buff0~0_134) (= v_~weak$$choice2~0_130 |v_P2Thread1of1ForFork0_#t~nondet15_6|))))) InVars {~#y~0.offset=|v_~#y~0.offset_220|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_280, P2Thread1of1ForFork0_#t~mem17=|v_P2Thread1of1ForFork0_#t~mem17_6|, P2Thread1of1ForFork0_#t~nondet15=|v_P2Thread1of1ForFork0_#t~nondet15_6|, P2Thread1of1ForFork0_#t~nondet14=|v_P2Thread1of1ForFork0_#t~nondet14_6|, ~#y~0.base=|v_~#y~0.base_220|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_87, ~y$w_buff1~0=v_~y$w_buff1~0_151, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_86, ~y$w_buff0~0=v_~y$w_buff0~0_135, #memory_int=|v_#memory_int_339|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_281, P2Thread1of1ForFork0_#t~mem20=|v_P2Thread1of1ForFork0_#t~mem20_6|} OutVars{P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_5|, ~#y~0.offset=|v_~#y~0.offset_220|, P2Thread1of1ForFork0_#t~mem16=|v_P2Thread1of1ForFork0_#t~mem16_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_279, ~#y~0.base=|v_~#y~0.base_220|, ~y$mem_tmp~0=v_~y$mem_tmp~0_64, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_86, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_5|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_85, ~y$w_buff0~0=v_~y$w_buff0~0_134, ~y$flush_delayed~0=v_~y$flush_delayed~0_106, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_32, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~weak$$choice0~0=v_~weak$$choice0~0_37, ~y$w_buff1~0=v_~y$w_buff1~0_150, #memory_int=|v_#memory_int_338|, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_5|, ~weak$$choice2~0=v_~weak$$choice2~0_130, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_280} AuxVars[|v_P2_#t~mem17_35|, |v_P2_#t~mem20_35|, |v_P2_#t~ite21_38|] AssignedVars[P2Thread1of1ForFork0_#t~mem19, P2Thread1of1ForFork0_#t~mem16, ~y$w_buff0_used~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0_#t~mem17, P2Thread1of1ForFork0_#t~nondet15, P2Thread1of1ForFork0_#t~nondet14, ~weak$$choice0~0, ~y$mem_tmp~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#t~ite21, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, #memory_int, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, ~y$w_buff1_used~0, P2Thread1of1ForFork0_#t~mem20] [2022-12-06 04:25:07,474 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [716] $Ultimate##0-->L777: Formula: (let ((.cse12 (= (mod v_~y$w_buff1_used~0_317 256) 0)) (.cse11 (= (mod v_~y$r_buff1_thd1~0_66 256) 0)) (.cse16 (= (mod v_~y$w_buff0_used~0_316 256) 0)) (.cse9 (= (mod v_~y$r_buff0_thd1~0_73 256) 0))) (let ((.cse0 (= (mod v_~weak$$choice2~0_146 256) 0)) (.cse10 (not .cse9)) (.cse13 (not .cse16)) (.cse14 (select |v_#memory_int_395| |v_~#y~0.base_242|)) (.cse2 (and .cse11 .cse9)) (.cse3 (and .cse12 .cse9))) (let ((.cse6 (or .cse2 .cse16 .cse3)) (.cse5 (select .cse14 |v_~#y~0.offset_242|)) (.cse7 (and .cse10 .cse13)) (.cse1 (not .cse0)) (.cse8 (= (mod v_~y$w_buff1_used~0_316 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_315 256) 0))) (and (or (and (= |v_P0_#t~ite10_36| |v_P0_#t~mem9_29|) (= v_~__unbuffered_p0_EAX~0_67 |v_P0_#t~mem9_29|) .cse0) (and (= |v_P0Thread1of1ForFork1_#t~mem9_10| |v_P0_#t~mem9_29|) (= |v_P0_#t~ite10_36| v_~y$mem_tmp~0_80) .cse1)) (= |v_~#y~0.base_242| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_54) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_~y$w_buff1_used~0_316 (ite .cse1 v_~y$w_buff1_used~0_317 (ite (or .cse2 .cse3 .cse4) v_~y$w_buff1_used~0_317 0))) (= v_~weak$$choice2~0_146 |v_P0Thread1of1ForFork1_#t~nondet4_10|) (= v_~y$mem_tmp~0_80 .cse5) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= (ite .cse1 v_~y$w_buff0_used~0_316 (ite .cse6 v_~y$w_buff0_used~0_316 (ite .cse7 0 v_~y$w_buff0_used~0_316))) v_~y$w_buff0_used~0_315) (= v_~y$r_buff0_thd1~0_72 (ite .cse1 v_~y$r_buff0_thd1~0_73 (ite (or .cse2 (and .cse8 .cse9) .cse4) v_~y$r_buff0_thd1~0_73 (ite (and .cse10 (not .cse4)) 0 v_~y$r_buff0_thd1~0_73)))) (= v_~y$w_buff1~0_179 v_~y$w_buff1~0_178) (= v_~y$flush_delayed~0_120 0) (or (and .cse6 (= v_~__unbuffered_p0_EAX~0_67 |v_P0_#t~mem6_47|) (= .cse5 |v_P0_#t~mem6_47|)) (and (= |v_P0Thread1of1ForFork1_#t~mem6_10| |v_P0_#t~mem6_47|) (or .cse10 (not .cse11)) (= (ite .cse7 v_~y$w_buff0~0_163 v_~y$w_buff1~0_179) v_~__unbuffered_p0_EAX~0_67) (or .cse10 (not .cse12)) .cse13)) (= v_~y$w_buff0~0_163 v_~y$w_buff0~0_162) (= |v_#memory_int_394| (store |v_#memory_int_395| |v_~#y~0.base_242| (store .cse14 |v_~#y~0.offset_242| |v_P0_#t~ite10_36|))) (= (ite .cse1 v_~y$r_buff1_thd1~0_66 (ite (let ((.cse15 (= (mod v_~y$r_buff0_thd1~0_72 256) 0))) (or (and .cse15 .cse11) (and .cse15 .cse8) .cse4)) v_~y$r_buff1_thd1~0_66 0)) v_~y$r_buff1_thd1~0_65) (= v_~__unbuffered_p0_EAX$read_delayed~0_53 1) (= |v_P0Thread1of1ForFork1_#t~nondet3_10| v_~weak$$choice0~0_55) (= v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_54 |v_~#y~0.offset_242|))))) InVars {~#y~0.offset=|v_~#y~0.offset_242|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_316, P0Thread1of1ForFork1_#t~mem9=|v_P0Thread1of1ForFork1_#t~mem9_10|, ~#y~0.base=|v_~#y~0.base_242|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, P0Thread1of1ForFork1_#t~mem6=|v_P0Thread1of1ForFork1_#t~mem6_10|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_66, ~y$w_buff1~0=v_~y$w_buff1~0_179, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~y$w_buff0~0=v_~y$w_buff0~0_163, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_73, #memory_int=|v_#memory_int_395|, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_10|, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_10|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_317} OutVars{P0Thread1of1ForFork1_#t~ite10=|v_P0Thread1of1ForFork1_#t~ite10_7|, ~#y~0.offset=|v_~#y~0.offset_242|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_315, ~#y~0.base=|v_~#y~0.base_242|, P0Thread1of1ForFork1_#t~mem8=|v_P0Thread1of1ForFork1_#t~mem8_7|, P0Thread1of1ForFork1_#t~mem5=|v_P0Thread1of1ForFork1_#t~mem5_7|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_65, ~y$mem_tmp~0=v_~y$mem_tmp~0_80, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_67, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~y$w_buff0~0=v_~y$w_buff0~0_162, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_72, ~y$flush_delayed~0=v_~y$flush_delayed~0_120, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_53, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_54, ~weak$$choice0~0=v_~weak$$choice0~0_55, ~y$w_buff1~0=v_~y$w_buff1~0_178, P0Thread1of1ForFork1_#t~ite7=|v_P0Thread1of1ForFork1_#t~ite7_7|, #memory_int=|v_#memory_int_394|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_54, ~weak$$choice2~0=v_~weak$$choice2~0_146, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_316} AuxVars[|v_P0_#t~mem9_29|, |v_P0_#t~mem6_47|, |v_P0_#t~ite10_36|] AssignedVars[P0Thread1of1ForFork1_#t~ite10, ~y$w_buff0_used~0, P0Thread1of1ForFork1_#t~mem9, P0Thread1of1ForFork1_#t~mem8, P0Thread1of1ForFork1_#t~mem5, P0Thread1of1ForFork1_~arg.base, P0Thread1of1ForFork1_#t~mem6, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_p0_EAX$read_delayed~0, ~__unbuffered_p0_EAX$read_delayed_var~0.base, ~weak$$choice0~0, ~y$w_buff1~0, P0Thread1of1ForFork1_#t~ite7, #memory_int, ~__unbuffered_p0_EAX$read_delayed_var~0.offset, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4, ~y$w_buff1_used~0] and [686] $Ultimate##0-->L825: Formula: (let ((.cse3 (= (mod v_~y$r_buff1_thd3~0_87 256) 0)) (.cse0 (= (mod v_~y$w_buff1_used~0_281 256) 0)) (.cse13 (= (mod v_~y$r_buff0_thd3~0_86 256) 0)) (.cse16 (= (mod v_~y$w_buff0_used~0_280 256) 0))) (let ((.cse12 (= (mod v_~weak$$choice2~0_130 256) 0)) (.cse2 (not .cse16)) (.cse1 (not .cse13)) (.cse15 (and .cse13 .cse0)) (.cse14 (and .cse3 .cse13)) (.cse7 (select |v_#memory_int_339| |v_~#y~0.base_220|))) (let ((.cse5 (select .cse7 |v_~#y~0.offset_220|)) (.cse6 (or .cse16 .cse15 .cse14)) (.cse4 (and .cse2 .cse1)) (.cse9 (= (mod v_~y$w_buff1_used~0_280 256) 0)) (.cse8 (not .cse12)) (.cse11 (= (mod v_~y$w_buff0_used~0_279 256) 0))) (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_~y$w_buff1~0_151 v_~y$w_buff1~0_150) (or (and (or (not .cse0) .cse1) .cse2 (= |v_P2Thread1of1ForFork0_#t~mem17_6| |v_P2_#t~mem17_35|) (or .cse1 (not .cse3)) (= (ite .cse4 v_~y$w_buff0~0_135 v_~y$w_buff1~0_151) v_~__unbuffered_p2_EAX~0_32)) (and (= |v_P2_#t~mem17_35| v_~__unbuffered_p2_EAX~0_32) (= |v_P2_#t~mem17_35| .cse5) .cse6)) (= v_~y$mem_tmp~0_64 .cse5) (= (store |v_#memory_int_339| |v_~#y~0.base_220| (store .cse7 |v_~#y~0.offset_220| |v_P2_#t~ite21_38|)) |v_#memory_int_338|) (= v_~y$w_buff0_used~0_279 (ite .cse8 v_~y$w_buff0_used~0_280 (ite .cse6 v_~y$w_buff0_used~0_280 (ite .cse4 0 v_~y$w_buff0_used~0_280)))) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (= (ite .cse8 v_~y$r_buff1_thd3~0_87 (ite (let ((.cse10 (= (mod v_~y$r_buff0_thd3~0_85 256) 0))) (or (and .cse9 .cse10) .cse11 (and .cse3 .cse10))) v_~y$r_buff1_thd3~0_87 0)) v_~y$r_buff1_thd3~0_86) (= v_~weak$$choice0~0_37 |v_P2Thread1of1ForFork0_#t~nondet14_6|) (= v_~y$flush_delayed~0_106 0) (or (and .cse12 (= |v_P2_#t~ite21_38| |v_P2_#t~mem20_35|) (= |v_P2_#t~mem20_35| v_~__unbuffered_p2_EAX~0_32)) (and (= |v_P2_#t~ite21_38| v_~y$mem_tmp~0_64) (= |v_P2Thread1of1ForFork0_#t~mem20_6| |v_P2_#t~mem20_35|) .cse8)) (= (ite .cse8 v_~y$r_buff0_thd3~0_86 (ite (or .cse11 (and .cse9 .cse13) .cse14) v_~y$r_buff0_thd3~0_86 (ite (and (not .cse11) .cse1) 0 v_~y$r_buff0_thd3~0_86))) v_~y$r_buff0_thd3~0_85) (= v_~y$w_buff1_used~0_280 (ite .cse8 v_~y$w_buff1_used~0_281 (ite (or .cse15 .cse11 .cse14) v_~y$w_buff1_used~0_281 0))) (= v_~y$w_buff0~0_135 v_~y$w_buff0~0_134) (= v_~weak$$choice2~0_130 |v_P2Thread1of1ForFork0_#t~nondet15_6|))))) InVars {~#y~0.offset=|v_~#y~0.offset_220|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_280, P2Thread1of1ForFork0_#t~mem17=|v_P2Thread1of1ForFork0_#t~mem17_6|, P2Thread1of1ForFork0_#t~nondet15=|v_P2Thread1of1ForFork0_#t~nondet15_6|, P2Thread1of1ForFork0_#t~nondet14=|v_P2Thread1of1ForFork0_#t~nondet14_6|, ~#y~0.base=|v_~#y~0.base_220|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_87, ~y$w_buff1~0=v_~y$w_buff1~0_151, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_86, ~y$w_buff0~0=v_~y$w_buff0~0_135, #memory_int=|v_#memory_int_339|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_281, P2Thread1of1ForFork0_#t~mem20=|v_P2Thread1of1ForFork0_#t~mem20_6|} OutVars{P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_5|, ~#y~0.offset=|v_~#y~0.offset_220|, P2Thread1of1ForFork0_#t~mem16=|v_P2Thread1of1ForFork0_#t~mem16_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_279, ~#y~0.base=|v_~#y~0.base_220|, ~y$mem_tmp~0=v_~y$mem_tmp~0_64, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_86, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_5|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_85, ~y$w_buff0~0=v_~y$w_buff0~0_134, ~y$flush_delayed~0=v_~y$flush_delayed~0_106, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_32, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~weak$$choice0~0=v_~weak$$choice0~0_37, ~y$w_buff1~0=v_~y$w_buff1~0_150, #memory_int=|v_#memory_int_338|, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_5|, ~weak$$choice2~0=v_~weak$$choice2~0_130, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_280} AuxVars[|v_P2_#t~mem17_35|, |v_P2_#t~mem20_35|, |v_P2_#t~ite21_38|] AssignedVars[P2Thread1of1ForFork0_#t~mem19, P2Thread1of1ForFork0_#t~mem16, ~y$w_buff0_used~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0_#t~mem17, P2Thread1of1ForFork0_#t~nondet15, P2Thread1of1ForFork0_#t~nondet14, ~weak$$choice0~0, ~y$mem_tmp~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#t~ite21, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, #memory_int, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, ~y$w_buff1_used~0, P2Thread1of1ForFork0_#t~mem20] [2022-12-06 04:25:09,081 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [655] L825-->L827: Formula: (= |v_#memory_int_25| (store |v_#memory_int_26| |v_~#y~0.base_19| (store (select |v_#memory_int_26| |v_~#y~0.base_19|) |v_~#y~0.offset_19| 2))) InVars {#memory_int=|v_#memory_int_26|, ~#y~0.offset=|v_~#y~0.offset_19|, ~#y~0.base=|v_~#y~0.base_19|} OutVars{#memory_int=|v_#memory_int_25|, ~#y~0.offset=|v_~#y~0.offset_19|, ~#y~0.base=|v_~#y~0.base_19|} AuxVars[] AssignedVars[#memory_int] and [686] $Ultimate##0-->L825: Formula: (let ((.cse3 (= (mod v_~y$r_buff1_thd3~0_87 256) 0)) (.cse0 (= (mod v_~y$w_buff1_used~0_281 256) 0)) (.cse13 (= (mod v_~y$r_buff0_thd3~0_86 256) 0)) (.cse16 (= (mod v_~y$w_buff0_used~0_280 256) 0))) (let ((.cse12 (= (mod v_~weak$$choice2~0_130 256) 0)) (.cse2 (not .cse16)) (.cse1 (not .cse13)) (.cse15 (and .cse13 .cse0)) (.cse14 (and .cse3 .cse13)) (.cse7 (select |v_#memory_int_339| |v_~#y~0.base_220|))) (let ((.cse5 (select .cse7 |v_~#y~0.offset_220|)) (.cse6 (or .cse16 .cse15 .cse14)) (.cse4 (and .cse2 .cse1)) (.cse9 (= (mod v_~y$w_buff1_used~0_280 256) 0)) (.cse8 (not .cse12)) (.cse11 (= (mod v_~y$w_buff0_used~0_279 256) 0))) (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_~y$w_buff1~0_151 v_~y$w_buff1~0_150) (or (and (or (not .cse0) .cse1) .cse2 (= |v_P2Thread1of1ForFork0_#t~mem17_6| |v_P2_#t~mem17_35|) (or .cse1 (not .cse3)) (= (ite .cse4 v_~y$w_buff0~0_135 v_~y$w_buff1~0_151) v_~__unbuffered_p2_EAX~0_32)) (and (= |v_P2_#t~mem17_35| v_~__unbuffered_p2_EAX~0_32) (= |v_P2_#t~mem17_35| .cse5) .cse6)) (= v_~y$mem_tmp~0_64 .cse5) (= (store |v_#memory_int_339| |v_~#y~0.base_220| (store .cse7 |v_~#y~0.offset_220| |v_P2_#t~ite21_38|)) |v_#memory_int_338|) (= v_~y$w_buff0_used~0_279 (ite .cse8 v_~y$w_buff0_used~0_280 (ite .cse6 v_~y$w_buff0_used~0_280 (ite .cse4 0 v_~y$w_buff0_used~0_280)))) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (= (ite .cse8 v_~y$r_buff1_thd3~0_87 (ite (let ((.cse10 (= (mod v_~y$r_buff0_thd3~0_85 256) 0))) (or (and .cse9 .cse10) .cse11 (and .cse3 .cse10))) v_~y$r_buff1_thd3~0_87 0)) v_~y$r_buff1_thd3~0_86) (= v_~weak$$choice0~0_37 |v_P2Thread1of1ForFork0_#t~nondet14_6|) (= v_~y$flush_delayed~0_106 0) (or (and .cse12 (= |v_P2_#t~ite21_38| |v_P2_#t~mem20_35|) (= |v_P2_#t~mem20_35| v_~__unbuffered_p2_EAX~0_32)) (and (= |v_P2_#t~ite21_38| v_~y$mem_tmp~0_64) (= |v_P2Thread1of1ForFork0_#t~mem20_6| |v_P2_#t~mem20_35|) .cse8)) (= (ite .cse8 v_~y$r_buff0_thd3~0_86 (ite (or .cse11 (and .cse9 .cse13) .cse14) v_~y$r_buff0_thd3~0_86 (ite (and (not .cse11) .cse1) 0 v_~y$r_buff0_thd3~0_86))) v_~y$r_buff0_thd3~0_85) (= v_~y$w_buff1_used~0_280 (ite .cse8 v_~y$w_buff1_used~0_281 (ite (or .cse15 .cse11 .cse14) v_~y$w_buff1_used~0_281 0))) (= v_~y$w_buff0~0_135 v_~y$w_buff0~0_134) (= v_~weak$$choice2~0_130 |v_P2Thread1of1ForFork0_#t~nondet15_6|))))) InVars {~#y~0.offset=|v_~#y~0.offset_220|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_280, P2Thread1of1ForFork0_#t~mem17=|v_P2Thread1of1ForFork0_#t~mem17_6|, P2Thread1of1ForFork0_#t~nondet15=|v_P2Thread1of1ForFork0_#t~nondet15_6|, P2Thread1of1ForFork0_#t~nondet14=|v_P2Thread1of1ForFork0_#t~nondet14_6|, ~#y~0.base=|v_~#y~0.base_220|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_87, ~y$w_buff1~0=v_~y$w_buff1~0_151, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_86, ~y$w_buff0~0=v_~y$w_buff0~0_135, #memory_int=|v_#memory_int_339|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_281, P2Thread1of1ForFork0_#t~mem20=|v_P2Thread1of1ForFork0_#t~mem20_6|} OutVars{P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_5|, ~#y~0.offset=|v_~#y~0.offset_220|, P2Thread1of1ForFork0_#t~mem16=|v_P2Thread1of1ForFork0_#t~mem16_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_279, ~#y~0.base=|v_~#y~0.base_220|, ~y$mem_tmp~0=v_~y$mem_tmp~0_64, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_86, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_5|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_85, ~y$w_buff0~0=v_~y$w_buff0~0_134, ~y$flush_delayed~0=v_~y$flush_delayed~0_106, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_32, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~weak$$choice0~0=v_~weak$$choice0~0_37, ~y$w_buff1~0=v_~y$w_buff1~0_150, #memory_int=|v_#memory_int_338|, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_5|, ~weak$$choice2~0=v_~weak$$choice2~0_130, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_280} AuxVars[|v_P2_#t~mem17_35|, |v_P2_#t~mem20_35|, |v_P2_#t~ite21_38|] AssignedVars[P2Thread1of1ForFork0_#t~mem19, P2Thread1of1ForFork0_#t~mem16, ~y$w_buff0_used~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0_#t~mem17, P2Thread1of1ForFork0_#t~nondet15, P2Thread1of1ForFork0_#t~nondet14, ~weak$$choice0~0, ~y$mem_tmp~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#t~ite21, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, #memory_int, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, ~y$w_buff1_used~0, P2Thread1of1ForFork0_#t~mem20] [2022-12-06 04:25:09,620 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [648] L792-->L794: Formula: (= |v_#memory_int_12| (store |v_#memory_int_13| |v_~#y~0.base_10| (store (select |v_#memory_int_13| |v_~#y~0.base_10|) |v_~#y~0.offset_10| 1))) InVars {#memory_int=|v_#memory_int_13|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} OutVars{#memory_int=|v_#memory_int_12|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} AuxVars[] AssignedVars[#memory_int] and [686] $Ultimate##0-->L825: Formula: (let ((.cse3 (= (mod v_~y$r_buff1_thd3~0_87 256) 0)) (.cse0 (= (mod v_~y$w_buff1_used~0_281 256) 0)) (.cse13 (= (mod v_~y$r_buff0_thd3~0_86 256) 0)) (.cse16 (= (mod v_~y$w_buff0_used~0_280 256) 0))) (let ((.cse12 (= (mod v_~weak$$choice2~0_130 256) 0)) (.cse2 (not .cse16)) (.cse1 (not .cse13)) (.cse15 (and .cse13 .cse0)) (.cse14 (and .cse3 .cse13)) (.cse7 (select |v_#memory_int_339| |v_~#y~0.base_220|))) (let ((.cse5 (select .cse7 |v_~#y~0.offset_220|)) (.cse6 (or .cse16 .cse15 .cse14)) (.cse4 (and .cse2 .cse1)) (.cse9 (= (mod v_~y$w_buff1_used~0_280 256) 0)) (.cse8 (not .cse12)) (.cse11 (= (mod v_~y$w_buff0_used~0_279 256) 0))) (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_~y$w_buff1~0_151 v_~y$w_buff1~0_150) (or (and (or (not .cse0) .cse1) .cse2 (= |v_P2Thread1of1ForFork0_#t~mem17_6| |v_P2_#t~mem17_35|) (or .cse1 (not .cse3)) (= (ite .cse4 v_~y$w_buff0~0_135 v_~y$w_buff1~0_151) v_~__unbuffered_p2_EAX~0_32)) (and (= |v_P2_#t~mem17_35| v_~__unbuffered_p2_EAX~0_32) (= |v_P2_#t~mem17_35| .cse5) .cse6)) (= v_~y$mem_tmp~0_64 .cse5) (= (store |v_#memory_int_339| |v_~#y~0.base_220| (store .cse7 |v_~#y~0.offset_220| |v_P2_#t~ite21_38|)) |v_#memory_int_338|) (= v_~y$w_buff0_used~0_279 (ite .cse8 v_~y$w_buff0_used~0_280 (ite .cse6 v_~y$w_buff0_used~0_280 (ite .cse4 0 v_~y$w_buff0_used~0_280)))) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (= (ite .cse8 v_~y$r_buff1_thd3~0_87 (ite (let ((.cse10 (= (mod v_~y$r_buff0_thd3~0_85 256) 0))) (or (and .cse9 .cse10) .cse11 (and .cse3 .cse10))) v_~y$r_buff1_thd3~0_87 0)) v_~y$r_buff1_thd3~0_86) (= v_~weak$$choice0~0_37 |v_P2Thread1of1ForFork0_#t~nondet14_6|) (= v_~y$flush_delayed~0_106 0) (or (and .cse12 (= |v_P2_#t~ite21_38| |v_P2_#t~mem20_35|) (= |v_P2_#t~mem20_35| v_~__unbuffered_p2_EAX~0_32)) (and (= |v_P2_#t~ite21_38| v_~y$mem_tmp~0_64) (= |v_P2Thread1of1ForFork0_#t~mem20_6| |v_P2_#t~mem20_35|) .cse8)) (= (ite .cse8 v_~y$r_buff0_thd3~0_86 (ite (or .cse11 (and .cse9 .cse13) .cse14) v_~y$r_buff0_thd3~0_86 (ite (and (not .cse11) .cse1) 0 v_~y$r_buff0_thd3~0_86))) v_~y$r_buff0_thd3~0_85) (= v_~y$w_buff1_used~0_280 (ite .cse8 v_~y$w_buff1_used~0_281 (ite (or .cse15 .cse11 .cse14) v_~y$w_buff1_used~0_281 0))) (= v_~y$w_buff0~0_135 v_~y$w_buff0~0_134) (= v_~weak$$choice2~0_130 |v_P2Thread1of1ForFork0_#t~nondet15_6|))))) InVars {~#y~0.offset=|v_~#y~0.offset_220|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_280, P2Thread1of1ForFork0_#t~mem17=|v_P2Thread1of1ForFork0_#t~mem17_6|, P2Thread1of1ForFork0_#t~nondet15=|v_P2Thread1of1ForFork0_#t~nondet15_6|, P2Thread1of1ForFork0_#t~nondet14=|v_P2Thread1of1ForFork0_#t~nondet14_6|, ~#y~0.base=|v_~#y~0.base_220|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_87, ~y$w_buff1~0=v_~y$w_buff1~0_151, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_86, ~y$w_buff0~0=v_~y$w_buff0~0_135, #memory_int=|v_#memory_int_339|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_281, P2Thread1of1ForFork0_#t~mem20=|v_P2Thread1of1ForFork0_#t~mem20_6|} OutVars{P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_5|, ~#y~0.offset=|v_~#y~0.offset_220|, P2Thread1of1ForFork0_#t~mem16=|v_P2Thread1of1ForFork0_#t~mem16_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_279, ~#y~0.base=|v_~#y~0.base_220|, ~y$mem_tmp~0=v_~y$mem_tmp~0_64, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_86, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_5|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_85, ~y$w_buff0~0=v_~y$w_buff0~0_134, ~y$flush_delayed~0=v_~y$flush_delayed~0_106, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_32, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~weak$$choice0~0=v_~weak$$choice0~0_37, ~y$w_buff1~0=v_~y$w_buff1~0_150, #memory_int=|v_#memory_int_338|, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_5|, ~weak$$choice2~0=v_~weak$$choice2~0_130, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_280} AuxVars[|v_P2_#t~mem17_35|, |v_P2_#t~mem20_35|, |v_P2_#t~ite21_38|] AssignedVars[P2Thread1of1ForFork0_#t~mem19, P2Thread1of1ForFork0_#t~mem16, ~y$w_buff0_used~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0_#t~mem17, P2Thread1of1ForFork0_#t~nondet15, P2Thread1of1ForFork0_#t~nondet14, ~weak$$choice0~0, ~y$mem_tmp~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#t~ite21, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, #memory_int, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, ~y$w_buff1_used~0, P2Thread1of1ForFork0_#t~mem20] [2022-12-06 04:25:10,090 ERROR L799 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-06 04:25:10,093 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:25:10,106 ERROR L123 eatedLiptonReduction]: Lipton reduction run adaptation of counterexample failed. [2022-12-06 04:25:10,106 INFO L89 Accepts]: Start accepts. Operand has 36 places, 28 transitions, 154 flow [2022-12-06 04:25:10,107 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:25:10,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:25:10,108 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 is no longer accepted by reduced abstraction! at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:132) 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:25:10,112 INFO L158 Benchmark]: Toolchain (without parser) took 18041.09ms. Allocated memory was 165.7MB in the beginning and 347.1MB in the end (delta: 181.4MB). Free memory was 140.2MB in the beginning and 240.6MB in the end (delta: -100.4MB). Peak memory consumption was 212.8MB. Max. memory is 8.0GB. [2022-12-06 04:25:10,112 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 165.7MB. Free memory is still 141.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:25:10,113 INFO L158 Benchmark]: CACSL2BoogieTranslator took 572.78ms. Allocated memory is still 165.7MB. Free memory was 140.0MB in the beginning and 110.8MB in the end (delta: 29.1MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-06 04:25:10,114 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.00ms. Allocated memory is still 165.7MB. Free memory was 110.8MB in the beginning and 108.0MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 04:25:10,115 INFO L158 Benchmark]: Boogie Preprocessor took 62.26ms. Allocated memory is still 165.7MB. Free memory was 108.0MB in the beginning and 105.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:25:10,116 INFO L158 Benchmark]: RCFGBuilder took 836.95ms. Allocated memory is still 165.7MB. Free memory was 105.3MB in the beginning and 114.3MB in the end (delta: -8.9MB). Peak memory consumption was 58.7MB. Max. memory is 8.0GB. [2022-12-06 04:25:10,116 INFO L158 Benchmark]: TraceAbstraction took 16501.06ms. Allocated memory was 165.7MB in the beginning and 347.1MB in the end (delta: 181.4MB). Free memory was 113.2MB in the beginning and 240.6MB in the end (delta: -127.4MB). Peak memory consumption was 185.6MB. Max. memory is 8.0GB. [2022-12-06 04:25:10,117 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.10ms. Allocated memory is still 165.7MB. Free memory is still 141.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 572.78ms. Allocated memory is still 165.7MB. Free memory was 140.0MB in the beginning and 110.8MB in the end (delta: 29.1MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 63.00ms. Allocated memory is still 165.7MB. Free memory was 110.8MB in the beginning and 108.0MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 62.26ms. Allocated memory is still 165.7MB. Free memory was 108.0MB in the beginning and 105.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 836.95ms. Allocated memory is still 165.7MB. Free memory was 105.3MB in the beginning and 114.3MB in the end (delta: -8.9MB). Peak memory consumption was 58.7MB. Max. memory is 8.0GB. * TraceAbstraction took 16501.06ms. Allocated memory was 165.7MB in the beginning and 347.1MB in the end (delta: 181.4MB). Free memory was 113.2MB in the beginning and 240.6MB in the end (delta: -127.4MB). Peak memory consumption was 185.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.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: 1062, independent: 995, independent conditional: 995, independent unconditional: 0, dependent: 67, dependent conditional: 67, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1062, independent: 995, independent conditional: 0, independent unconditional: 995, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1062, independent: 995, independent conditional: 0, independent unconditional: 995, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1062, independent: 995, independent conditional: 0, independent unconditional: 995, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 795, independent: 762, independent conditional: 0, independent unconditional: 762, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 795, independent: 736, independent conditional: 0, independent unconditional: 736, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 59, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 357, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 301, dependent conditional: 0, dependent unconditional: 301, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1062, independent: 233, independent conditional: 0, independent unconditional: 233, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 795, unknown conditional: 0, unknown unconditional: 795] , Statistics on independence cache: Total cache size (in pairs): 1340, Positive cache size: 1307, Positive conditional cache size: 0, Positive unconditional cache size: 1307, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, 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.2s, 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: 59, independent: 39, independent conditional: 39, 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: 59, independent: 39, independent conditional: 0, independent unconditional: 39, 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: 59, independent: 39, independent conditional: 0, independent unconditional: 39, 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: 59, independent: 39, independent conditional: 0, independent unconditional: 39, 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: 54, independent: 37, independent conditional: 0, independent unconditional: 37, 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: 54, independent: 33, independent conditional: 0, independent unconditional: 33, 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: 193, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 190, dependent conditional: 0, dependent unconditional: 190, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 59, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 54, unknown conditional: 0, unknown unconditional: 54] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, 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.1s, 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: 55, independent: 37, independent conditional: 37, 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: 55, independent: 37, independent conditional: 0, 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: 55, independent: 37, independent conditional: 0, independent unconditional: 37, 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: 55, independent: 37, independent conditional: 0, independent unconditional: 37, 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 61, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 55, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 58, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, 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, 34 PlacesBefore, 34 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 49, independent conditional: 49, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 60, independent: 49, independent conditional: 3, independent unconditional: 46, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 60, independent: 49, independent conditional: 3, independent unconditional: 46, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 60, independent: 49, independent conditional: 3, independent unconditional: 46, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 1, independent unconditional: 6, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 60, independent: 42, independent conditional: 2, independent unconditional: 40, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 8, unknown conditional: 1, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 66, Positive cache size: 44, Positive conditional cache size: 1, Positive unconditional cache size: 43, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, 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: 4.1s, 36 PlacesBefore, 36 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 198 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 118, independent: 94, independent conditional: 94, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 118, independent: 94, independent conditional: 32, independent unconditional: 62, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 121, independent: 94, independent conditional: 17, independent unconditional: 77, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 121, independent: 94, independent conditional: 17, independent unconditional: 77, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 12, independent conditional: 6, independent unconditional: 6, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 28, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 121, independent: 82, independent conditional: 11, independent unconditional: 71, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 13, unknown conditional: 6, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 62, Positive conditional cache size: 7, Positive unconditional cache size: 55, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 1 - ExceptionOrErrorResult: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word is no longer accepted by reduced abstraction! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word is no longer accepted by reduced abstraction!: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:132) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 04:25:10,139 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...