/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/weaver/popl20-commit-1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:26:37,652 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:26:37,653 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:26:37,682 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:26:37,684 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:26:37,686 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:26:37,688 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:26:37,691 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:26:37,694 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:26:37,697 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:26:37,698 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:26:37,700 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:26:37,700 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:26:37,701 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:26:37,702 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:26:37,703 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:26:37,704 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:26:37,705 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:26:37,707 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:26:37,709 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:26:37,710 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:26:37,710 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:26:37,711 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:26:37,712 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:26:37,717 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:26:37,717 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:26:37,717 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:26:37,718 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:26:37,719 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:26:37,719 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:26:37,719 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:26:37,723 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:26:37,724 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:26:37,724 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:26:37,725 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:26:37,725 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:26:37,725 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:26:37,725 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:26:37,726 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:26:37,726 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:26:37,726 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:26:37,728 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 05:26:37,753 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:26:37,753 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:26:37,754 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:26:37,754 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:26:37,754 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:26:37,755 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:26:37,755 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:26:37,755 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:26:37,755 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:26:37,755 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:26:37,756 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:26:37,756 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:26:37,756 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:26:37,756 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:26:37,756 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:26:37,757 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:26:37,757 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:26:37,757 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:26:37,757 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:26:37,757 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:26:37,757 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:26:37,757 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:26:37,757 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:26:37,757 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:26:37,758 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:26:37,758 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:26:37,758 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:26:37,758 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:26:37,758 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 05:26:38,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:26:38,040 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:26:38,042 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:26:38,042 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:26:38,043 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:26:38,044 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c [2022-12-06 05:26:38,907 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:26:39,087 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:26:39,088 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c [2022-12-06 05:26:39,094 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/325c41052/567d3c4728334b93ad0895c8af38154e/FLAG064cd3d0a [2022-12-06 05:26:39,111 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/325c41052/567d3c4728334b93ad0895c8af38154e [2022-12-06 05:26:39,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:26:39,114 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:26:39,116 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:26:39,116 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:26:39,118 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:26:39,118 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:26:39" (1/1) ... [2022-12-06 05:26:39,119 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6079b164 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:26:39, skipping insertion in model container [2022-12-06 05:26:39,119 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:26:39" (1/1) ... [2022-12-06 05:26:39,124 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:26:39,152 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:26:39,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:26:39,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:26:39,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:26:39,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:26:39,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:26:39,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:26:39,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:26:39,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:26:39,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:26:39,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:26:39,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:26:39,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:26:39,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:26:39,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:26:39,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:26:39,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:26:39,312 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c[4604,4617] [2022-12-06 05:26:39,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:26:39,326 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:26:39,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:26:39,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:26:39,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:26:39,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:26:39,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:26:39,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:26:39,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:26:39,351 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:26:39,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:26:39,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:26:39,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:26:39,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:26:39,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:26:39,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:26:39,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:26:39,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:26:39,363 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c[4604,4617] [2022-12-06 05:26:39,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:26:39,377 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:26:39,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:26:39 WrapperNode [2022-12-06 05:26:39,378 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:26:39,379 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:26:39,379 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:26:39,379 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:26:39,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:26:39" (1/1) ... [2022-12-06 05:26:39,412 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:26:39" (1/1) ... [2022-12-06 05:26:39,436 INFO L138 Inliner]: procedures = 25, calls = 68, calls flagged for inlining = 20, calls inlined = 24, statements flattened = 333 [2022-12-06 05:26:39,437 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:26:39,438 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:26:39,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:26:39,438 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:26:39,444 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:26:39" (1/1) ... [2022-12-06 05:26:39,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:26:39" (1/1) ... [2022-12-06 05:26:39,450 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:26:39" (1/1) ... [2022-12-06 05:26:39,450 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:26:39" (1/1) ... [2022-12-06 05:26:39,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:26:39" (1/1) ... [2022-12-06 05:26:39,469 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:26:39" (1/1) ... [2022-12-06 05:26:39,471 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:26:39" (1/1) ... [2022-12-06 05:26:39,472 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:26:39" (1/1) ... [2022-12-06 05:26:39,474 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:26:39,475 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:26:39,475 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:26:39,475 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:26:39,475 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:26:39" (1/1) ... [2022-12-06 05:26:39,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:26:39,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:26:39,500 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 05:26:39,507 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 05:26:39,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:26:39,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:26:39,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:26:39,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:26:39,526 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:26:39,526 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:26:39,526 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:26:39,526 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:26:39,526 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 05:26:39,526 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 05:26:39,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:26:39,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 05:26:39,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 05:26:39,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 05:26:39,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:26:39,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:26:39,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:26:39,528 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 05:26:39,637 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:26:39,638 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:26:39,959 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:26:40,113 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:26:40,113 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-06 05:26:40,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:26:40 BoogieIcfgContainer [2022-12-06 05:26:40,117 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:26:40,118 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:26:40,118 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:26:40,120 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:26:40,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:26:39" (1/3) ... [2022-12-06 05:26:40,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f19dbba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:26:40, skipping insertion in model container [2022-12-06 05:26:40,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:26:39" (2/3) ... [2022-12-06 05:26:40,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f19dbba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:26:40, skipping insertion in model container [2022-12-06 05:26:40,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:26:40" (3/3) ... [2022-12-06 05:26:40,123 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-commit-1.wvr.c [2022-12-06 05:26:40,137 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:26:40,137 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:26:40,137 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:26:40,200 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 05:26:40,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 225 places, 234 transitions, 492 flow [2022-12-06 05:26:40,376 INFO L130 PetriNetUnfolder]: 19/231 cut-off events. [2022-12-06 05:26:40,376 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:26:40,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 231 events. 19/231 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 132 event pairs, 0 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 196. Up to 2 conditions per place. [2022-12-06 05:26:40,380 INFO L82 GeneralOperation]: Start removeDead. Operand has 225 places, 234 transitions, 492 flow [2022-12-06 05:26:40,383 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 212 places, 221 transitions, 460 flow [2022-12-06 05:26:40,384 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:40,395 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 212 places, 221 transitions, 460 flow [2022-12-06 05:26:40,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 212 places, 221 transitions, 460 flow [2022-12-06 05:26:40,443 INFO L130 PetriNetUnfolder]: 19/221 cut-off events. [2022-12-06 05:26:40,443 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:26:40,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 221 events. 19/221 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 131 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 196. Up to 2 conditions per place. [2022-12-06 05:26:40,447 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 212 places, 221 transitions, 460 flow [2022-12-06 05:26:40,447 INFO L188 LiptonReduction]: Number of co-enabled transitions 1266 [2022-12-06 05:26:47,748 INFO L203 LiptonReduction]: Total number of compositions: 191 [2022-12-06 05:26:47,758 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:26:47,764 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;@3d249966, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:26:47,764 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 05:26:47,768 INFO L130 PetriNetUnfolder]: 6/29 cut-off events. [2022-12-06 05:26:47,768 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:26:47,768 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:47,769 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:47,769 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 05:26:47,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:47,773 INFO L85 PathProgramCache]: Analyzing trace with hash 340144083, now seen corresponding path program 1 times [2022-12-06 05:26:47,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:47,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225229935] [2022-12-06 05:26:47,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:47,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:48,265 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 05:26:48,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:48,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225229935] [2022-12-06 05:26:48,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225229935] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:48,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:48,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 05:26:48,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773892065] [2022-12-06 05:26:48,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:48,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:26:48,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:48,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:26:48,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:26:48,287 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 05:26:48,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 78 flow. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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 05:26:48,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:48,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 05:26:48,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:48,441 INFO L130 PetriNetUnfolder]: 451/666 cut-off events. [2022-12-06 05:26:48,442 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2022-12-06 05:26:48,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1414 conditions, 666 events. 451/666 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2319 event pairs, 73 based on Foata normal form. 1/500 useless extension candidates. Maximal degree in co-relation 1134. Up to 548 conditions per place. [2022-12-06 05:26:48,448 INFO L137 encePairwiseOnDemand]: 25/30 looper letters, 42 selfloop transitions, 4 changer transitions 1/47 dead transitions. [2022-12-06 05:26:48,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 47 transitions, 221 flow [2022-12-06 05:26:48,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:26:48,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:26:48,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-12-06 05:26:48,457 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2022-12-06 05:26:48,458 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 78 flow. Second operand 3 states and 48 transitions. [2022-12-06 05:26:48,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 47 transitions, 221 flow [2022-12-06 05:26:48,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 47 transitions, 199 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 05:26:48,462 INFO L231 Difference]: Finished difference. Result has 31 places, 33 transitions, 92 flow [2022-12-06 05:26:48,463 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=31, PETRI_TRANSITIONS=33} [2022-12-06 05:26:48,465 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -3 predicate places. [2022-12-06 05:26:48,465 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:48,466 INFO L89 Accepts]: Start accepts. Operand has 31 places, 33 transitions, 92 flow [2022-12-06 05:26:48,468 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:48,468 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:48,468 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 33 transitions, 92 flow [2022-12-06 05:26:48,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 33 transitions, 92 flow [2022-12-06 05:26:48,476 INFO L130 PetriNetUnfolder]: 24/70 cut-off events. [2022-12-06 05:26:48,477 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:26:48,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 70 events. 24/70 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 162 event pairs, 1 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 68. Up to 25 conditions per place. [2022-12-06 05:26:48,478 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 33 transitions, 92 flow [2022-12-06 05:26:48,478 INFO L188 LiptonReduction]: Number of co-enabled transitions 228 [2022-12-06 05:26:48,552 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:26:48,554 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-06 05:26:48,554 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 33 transitions, 92 flow [2022-12-06 05:26:48,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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 05:26:48,555 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:48,555 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:48,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:26:48,558 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 05:26:48,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:48,558 INFO L85 PathProgramCache]: Analyzing trace with hash -437421631, now seen corresponding path program 1 times [2022-12-06 05:26:48,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:48,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707755137] [2022-12-06 05:26:48,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:48,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:48,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:48,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:48,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:48,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707755137] [2022-12-06 05:26:48,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707755137] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:48,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:48,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:26:48,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775335453] [2022-12-06 05:26:48,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:48,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:48,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:48,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:48,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:48,691 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 05:26:48,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 33 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 05:26:48,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:48,691 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 05:26:48,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:48,832 INFO L130 PetriNetUnfolder]: 514/790 cut-off events. [2022-12-06 05:26:48,832 INFO L131 PetriNetUnfolder]: For 155/155 co-relation queries the response was YES. [2022-12-06 05:26:48,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1872 conditions, 790 events. 514/790 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2713 event pairs, 359 based on Foata normal form. 36/768 useless extension candidates. Maximal degree in co-relation 584. Up to 667 conditions per place. [2022-12-06 05:26:48,836 INFO L137 encePairwiseOnDemand]: 24/30 looper letters, 32 selfloop transitions, 2 changer transitions 20/54 dead transitions. [2022-12-06 05:26:48,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 54 transitions, 251 flow [2022-12-06 05:26:48,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:48,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:48,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-12-06 05:26:48,837 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45 [2022-12-06 05:26:48,837 INFO L175 Difference]: Start difference. First operand has 31 places, 33 transitions, 92 flow. Second operand 4 states and 54 transitions. [2022-12-06 05:26:48,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 54 transitions, 251 flow [2022-12-06 05:26:48,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 54 transitions, 246 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:26:48,839 INFO L231 Difference]: Finished difference. Result has 35 places, 34 transitions, 108 flow [2022-12-06 05:26:48,839 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=35, PETRI_TRANSITIONS=34} [2022-12-06 05:26:48,840 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2022-12-06 05:26:48,840 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:48,840 INFO L89 Accepts]: Start accepts. Operand has 35 places, 34 transitions, 108 flow [2022-12-06 05:26:48,841 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:48,841 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:48,841 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 34 transitions, 108 flow [2022-12-06 05:26:48,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 34 transitions, 108 flow [2022-12-06 05:26:48,849 INFO L130 PetriNetUnfolder]: 35/89 cut-off events. [2022-12-06 05:26:48,849 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-06 05:26:48,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 89 events. 35/89 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 235 event pairs, 3 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 147. Up to 29 conditions per place. [2022-12-06 05:26:48,850 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 34 transitions, 108 flow [2022-12-06 05:26:48,850 INFO L188 LiptonReduction]: Number of co-enabled transitions 220 [2022-12-06 05:26:49,875 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:49,876 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1036 [2022-12-06 05:26:49,876 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 33 transitions, 104 flow [2022-12-06 05:26:49,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 05:26:49,877 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:49,877 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:49,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:26:49,877 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 05:26:49,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:49,877 INFO L85 PathProgramCache]: Analyzing trace with hash -408540237, now seen corresponding path program 1 times [2022-12-06 05:26:49,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:49,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249022481] [2022-12-06 05:26:49,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:49,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:49,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:49,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:49,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:49,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249022481] [2022-12-06 05:26:49,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249022481] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:49,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:49,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:26:49,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226767158] [2022-12-06 05:26:49,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:49,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:26:49,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:49,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:26:49,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:26:49,993 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 05:26:49,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 33 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 05:26:49,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:49,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 05:26:49,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:50,104 INFO L130 PetriNetUnfolder]: 533/810 cut-off events. [2022-12-06 05:26:50,104 INFO L131 PetriNetUnfolder]: For 281/281 co-relation queries the response was YES. [2022-12-06 05:26:50,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2007 conditions, 810 events. 533/810 cut-off events. For 281/281 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2870 event pairs, 183 based on Foata normal form. 48/855 useless extension candidates. Maximal degree in co-relation 1996. Up to 512 conditions per place. [2022-12-06 05:26:50,107 INFO L137 encePairwiseOnDemand]: 27/30 looper letters, 48 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2022-12-06 05:26:50,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 50 transitions, 251 flow [2022-12-06 05:26:50,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:26:50,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:26:50,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-12-06 05:26:50,108 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5444444444444444 [2022-12-06 05:26:50,108 INFO L175 Difference]: Start difference. First operand has 33 places, 33 transitions, 104 flow. Second operand 3 states and 49 transitions. [2022-12-06 05:26:50,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 50 transitions, 251 flow [2022-12-06 05:26:50,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 50 transitions, 243 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 05:26:50,110 INFO L231 Difference]: Finished difference. Result has 34 places, 33 transitions, 104 flow [2022-12-06 05:26:50,110 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=34, PETRI_TRANSITIONS=33} [2022-12-06 05:26:50,110 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 0 predicate places. [2022-12-06 05:26:50,110 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:50,110 INFO L89 Accepts]: Start accepts. Operand has 34 places, 33 transitions, 104 flow [2022-12-06 05:26:50,111 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:50,111 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:50,111 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 33 transitions, 104 flow [2022-12-06 05:26:50,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 33 transitions, 104 flow [2022-12-06 05:26:50,120 INFO L130 PetriNetUnfolder]: 31/93 cut-off events. [2022-12-06 05:26:50,120 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-12-06 05:26:50,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 93 events. 31/93 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 289 event pairs, 9 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 127. Up to 28 conditions per place. [2022-12-06 05:26:50,121 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 33 transitions, 104 flow [2022-12-06 05:26:50,121 INFO L188 LiptonReduction]: Number of co-enabled transitions 220 [2022-12-06 05:26:50,122 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:26:50,122 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 05:26:50,122 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 33 transitions, 104 flow [2022-12-06 05:26:50,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 05:26:50,123 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:50,123 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:50,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:26:50,123 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 05:26:50,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:50,123 INFO L85 PathProgramCache]: Analyzing trace with hash -375745915, now seen corresponding path program 1 times [2022-12-06 05:26:50,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:50,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509914372] [2022-12-06 05:26:50,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:50,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:50,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:50,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:50,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:50,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509914372] [2022-12-06 05:26:50,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509914372] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:50,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:50,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:26:50,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652998337] [2022-12-06 05:26:50,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:50,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:26:50,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:50,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:26:50,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:26:50,212 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 05:26:50,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 33 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 05:26:50,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:50,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 05:26:50,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:50,312 INFO L130 PetriNetUnfolder]: 549/834 cut-off events. [2022-12-06 05:26:50,313 INFO L131 PetriNetUnfolder]: For 376/376 co-relation queries the response was YES. [2022-12-06 05:26:50,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2157 conditions, 834 events. 549/834 cut-off events. For 376/376 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2858 event pairs, 167 based on Foata normal form. 30/861 useless extension candidates. Maximal degree in co-relation 1614. Up to 520 conditions per place. [2022-12-06 05:26:50,316 INFO L137 encePairwiseOnDemand]: 27/30 looper letters, 42 selfloop transitions, 2 changer transitions 6/50 dead transitions. [2022-12-06 05:26:50,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 50 transitions, 249 flow [2022-12-06 05:26:50,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:26:50,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:26:50,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-12-06 05:26:50,317 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2022-12-06 05:26:50,317 INFO L175 Difference]: Start difference. First operand has 34 places, 33 transitions, 104 flow. Second operand 3 states and 51 transitions. [2022-12-06 05:26:50,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 50 transitions, 249 flow [2022-12-06 05:26:50,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 50 transitions, 247 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:26:50,319 INFO L231 Difference]: Finished difference. Result has 36 places, 33 transitions, 110 flow [2022-12-06 05:26:50,319 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=36, PETRI_TRANSITIONS=33} [2022-12-06 05:26:50,319 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2022-12-06 05:26:50,319 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:50,320 INFO L89 Accepts]: Start accepts. Operand has 36 places, 33 transitions, 110 flow [2022-12-06 05:26:50,320 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:50,320 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:50,320 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 33 transitions, 110 flow [2022-12-06 05:26:50,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 33 transitions, 110 flow [2022-12-06 05:26:50,330 INFO L130 PetriNetUnfolder]: 38/113 cut-off events. [2022-12-06 05:26:50,330 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2022-12-06 05:26:50,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 113 events. 38/113 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 360 event pairs, 11 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 169. Up to 32 conditions per place. [2022-12-06 05:26:50,331 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 33 transitions, 110 flow [2022-12-06 05:26:50,331 INFO L188 LiptonReduction]: Number of co-enabled transitions 222 [2022-12-06 05:26:50,332 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:26:50,332 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 05:26:50,332 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 33 transitions, 110 flow [2022-12-06 05:26:50,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 05:26:50,333 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:50,333 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:50,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 05:26:50,333 INFO L420 AbstractCegarLoop]: === Iteration 5 === 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 05:26:50,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:50,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1212829110, now seen corresponding path program 1 times [2022-12-06 05:26:50,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:50,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833314746] [2022-12-06 05:26:50,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:50,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:50,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:50,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:50,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:50,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833314746] [2022-12-06 05:26:50,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833314746] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:50,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:50,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:50,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330283347] [2022-12-06 05:26:50,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:50,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:50,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:50,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:50,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:50,435 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 05:26:50,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 33 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 05:26:50,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:50,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 05:26:50,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:50,565 INFO L130 PetriNetUnfolder]: 635/996 cut-off events. [2022-12-06 05:26:50,565 INFO L131 PetriNetUnfolder]: For 526/526 co-relation queries the response was YES. [2022-12-06 05:26:50,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2645 conditions, 996 events. 635/996 cut-off events. For 526/526 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3716 event pairs, 505 based on Foata normal form. 18/1009 useless extension candidates. Maximal degree in co-relation 1166. Up to 831 conditions per place. [2022-12-06 05:26:50,569 INFO L137 encePairwiseOnDemand]: 23/30 looper letters, 30 selfloop transitions, 6 changer transitions 17/53 dead transitions. [2022-12-06 05:26:50,569 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 53 transitions, 268 flow [2022-12-06 05:26:50,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:26:50,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:26:50,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-12-06 05:26:50,570 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34 [2022-12-06 05:26:50,570 INFO L175 Difference]: Start difference. First operand has 36 places, 33 transitions, 110 flow. Second operand 5 states and 51 transitions. [2022-12-06 05:26:50,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 53 transitions, 268 flow [2022-12-06 05:26:50,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 53 transitions, 266 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:26:50,572 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 140 flow [2022-12-06 05:26:50,572 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=140, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2022-12-06 05:26:50,572 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 7 predicate places. [2022-12-06 05:26:50,572 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:50,572 INFO L89 Accepts]: Start accepts. Operand has 41 places, 36 transitions, 140 flow [2022-12-06 05:26:50,573 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:50,573 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:50,573 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 36 transitions, 140 flow [2022-12-06 05:26:50,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 36 transitions, 140 flow [2022-12-06 05:26:50,584 INFO L130 PetriNetUnfolder]: 39/116 cut-off events. [2022-12-06 05:26:50,584 INFO L131 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2022-12-06 05:26:50,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 116 events. 39/116 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 357 event pairs, 11 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 205. Up to 32 conditions per place. [2022-12-06 05:26:50,585 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 36 transitions, 140 flow [2022-12-06 05:26:50,585 INFO L188 LiptonReduction]: Number of co-enabled transitions 222 [2022-12-06 05:26:52,562 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:26:52,563 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1991 [2022-12-06 05:26:52,563 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 34 transitions, 134 flow [2022-12-06 05:26:52,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 05:26:52,564 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:52,564 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:52,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 05:26:52,564 INFO L420 AbstractCegarLoop]: === Iteration 6 === 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 05:26:52,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:52,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1051098938, now seen corresponding path program 1 times [2022-12-06 05:26:52,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:52,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385702065] [2022-12-06 05:26:52,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:52,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:52,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:52,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:52,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:52,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385702065] [2022-12-06 05:26:52,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385702065] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:52,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:52,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:26:52,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983757160] [2022-12-06 05:26:52,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:52,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:26:52,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:52,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:26:52,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:26:52,660 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 05:26:52,660 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 05:26:52,660 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:52,660 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 05:26:52,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:52,797 INFO L130 PetriNetUnfolder]: 733/1145 cut-off events. [2022-12-06 05:26:52,797 INFO L131 PetriNetUnfolder]: For 675/675 co-relation queries the response was YES. [2022-12-06 05:26:52,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3054 conditions, 1145 events. 733/1145 cut-off events. For 675/675 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4417 event pairs, 587 based on Foata normal form. 26/1169 useless extension candidates. Maximal degree in co-relation 2231. Up to 833 conditions per place. [2022-12-06 05:26:52,801 INFO L137 encePairwiseOnDemand]: 28/31 looper letters, 31 selfloop transitions, 2 changer transitions 23/56 dead transitions. [2022-12-06 05:26:52,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 56 transitions, 316 flow [2022-12-06 05:26:52,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:26:52,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:26:52,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-12-06 05:26:52,804 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5806451612903226 [2022-12-06 05:26:52,804 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 134 flow. Second operand 3 states and 54 transitions. [2022-12-06 05:26:52,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 56 transitions, 316 flow [2022-12-06 05:26:52,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 56 transitions, 286 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-12-06 05:26:52,806 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 116 flow [2022-12-06 05:26:52,807 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2022-12-06 05:26:52,808 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2022-12-06 05:26:52,808 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:52,808 INFO L89 Accepts]: Start accepts. Operand has 38 places, 33 transitions, 116 flow [2022-12-06 05:26:52,810 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:52,810 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:52,810 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 33 transitions, 116 flow [2022-12-06 05:26:52,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 33 transitions, 116 flow [2022-12-06 05:26:52,821 INFO L130 PetriNetUnfolder]: 38/113 cut-off events. [2022-12-06 05:26:52,821 INFO L131 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2022-12-06 05:26:52,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 113 events. 38/113 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 363 event pairs, 11 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 205. Up to 32 conditions per place. [2022-12-06 05:26:52,822 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 33 transitions, 116 flow [2022-12-06 05:26:52,822 INFO L188 LiptonReduction]: Number of co-enabled transitions 222 [2022-12-06 05:26:52,823 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:26:52,824 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 05:26:52,824 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 116 flow [2022-12-06 05:26:52,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 05:26:52,824 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:52,825 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:52,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:26:52,825 INFO L420 AbstractCegarLoop]: === Iteration 7 === 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 05:26:52,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:52,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1611070646, now seen corresponding path program 1 times [2022-12-06 05:26:52,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:52,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434134327] [2022-12-06 05:26:52,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:52,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:52,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:53,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:53,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:53,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434134327] [2022-12-06 05:26:53,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434134327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:53,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:53,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:26:53,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75343066] [2022-12-06 05:26:53,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:53,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:26:53,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:53,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:26:53,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:26:53,002 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 05:26:53,002 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 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 05:26:53,002 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:53,002 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 05:26:53,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:53,073 INFO L130 PetriNetUnfolder]: 353/544 cut-off events. [2022-12-06 05:26:53,073 INFO L131 PetriNetUnfolder]: For 331/331 co-relation queries the response was YES. [2022-12-06 05:26:53,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1454 conditions, 544 events. 353/544 cut-off events. For 331/331 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1620 event pairs, 139 based on Foata normal form. 14/556 useless extension candidates. Maximal degree in co-relation 1434. Up to 460 conditions per place. [2022-12-06 05:26:53,076 INFO L137 encePairwiseOnDemand]: 27/30 looper letters, 34 selfloop transitions, 2 changer transitions 7/43 dead transitions. [2022-12-06 05:26:53,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 43 transitions, 227 flow [2022-12-06 05:26:53,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:26:53,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:26:53,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-12-06 05:26:53,076 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45555555555555555 [2022-12-06 05:26:53,076 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 116 flow. Second operand 3 states and 41 transitions. [2022-12-06 05:26:53,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 43 transitions, 227 flow [2022-12-06 05:26:53,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 43 transitions, 219 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-06 05:26:53,079 INFO L231 Difference]: Finished difference. Result has 38 places, 34 transitions, 122 flow [2022-12-06 05:26:53,079 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=38, PETRI_TRANSITIONS=34} [2022-12-06 05:26:53,079 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2022-12-06 05:26:53,080 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:53,080 INFO L89 Accepts]: Start accepts. Operand has 38 places, 34 transitions, 122 flow [2022-12-06 05:26:53,081 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:53,081 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:53,081 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 34 transitions, 122 flow [2022-12-06 05:26:53,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 34 transitions, 122 flow [2022-12-06 05:26:53,088 INFO L130 PetriNetUnfolder]: 22/72 cut-off events. [2022-12-06 05:26:53,088 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-12-06 05:26:53,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 72 events. 22/72 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 135 event pairs, 7 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 113. Up to 19 conditions per place. [2022-12-06 05:26:53,089 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 34 transitions, 122 flow [2022-12-06 05:26:53,089 INFO L188 LiptonReduction]: Number of co-enabled transitions 162 [2022-12-06 05:26:53,335 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:53,335 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 255 [2022-12-06 05:26:53,335 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 122 flow [2022-12-06 05:26:53,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 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 05:26:53,336 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:53,336 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:53,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 05:26:53,336 INFO L420 AbstractCegarLoop]: === Iteration 8 === 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 05:26:53,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:53,336 INFO L85 PathProgramCache]: Analyzing trace with hash -635535559, now seen corresponding path program 1 times [2022-12-06 05:26:53,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:53,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382964446] [2022-12-06 05:26:53,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:53,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:53,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:53,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:53,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:53,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382964446] [2022-12-06 05:26:53,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382964446] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:53,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:53,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:26:53,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135727582] [2022-12-06 05:26:53,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:53,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:26:53,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:53,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:26:53,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:26:53,495 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 05:26:53,495 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 122 flow. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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 05:26:53,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:53,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 05:26:53,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:53,665 INFO L130 PetriNetUnfolder]: 423/683 cut-off events. [2022-12-06 05:26:53,666 INFO L131 PetriNetUnfolder]: For 384/384 co-relation queries the response was YES. [2022-12-06 05:26:53,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1865 conditions, 683 events. 423/683 cut-off events. For 384/384 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2309 event pairs, 291 based on Foata normal form. 12/689 useless extension candidates. Maximal degree in co-relation 734. Up to 545 conditions per place. [2022-12-06 05:26:53,668 INFO L137 encePairwiseOnDemand]: 24/31 looper letters, 33 selfloop transitions, 2 changer transitions 33/68 dead transitions. [2022-12-06 05:26:53,669 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 68 transitions, 353 flow [2022-12-06 05:26:53,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:26:53,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:26:53,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2022-12-06 05:26:53,670 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3602150537634409 [2022-12-06 05:26:53,670 INFO L175 Difference]: Start difference. First operand has 38 places, 34 transitions, 122 flow. Second operand 6 states and 67 transitions. [2022-12-06 05:26:53,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 68 transitions, 353 flow [2022-12-06 05:26:53,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 68 transitions, 346 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 05:26:53,673 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 138 flow [2022-12-06 05:26:53,673 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=138, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2022-12-06 05:26:53,675 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 12 predicate places. [2022-12-06 05:26:53,675 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:53,675 INFO L89 Accepts]: Start accepts. Operand has 46 places, 35 transitions, 138 flow [2022-12-06 05:26:53,677 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:53,677 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:53,677 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 35 transitions, 138 flow [2022-12-06 05:26:53,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 35 transitions, 138 flow [2022-12-06 05:26:53,684 INFO L130 PetriNetUnfolder]: 22/73 cut-off events. [2022-12-06 05:26:53,684 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-12-06 05:26:53,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 73 events. 22/73 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 145 event pairs, 7 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 141. Up to 19 conditions per place. [2022-12-06 05:26:53,685 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 35 transitions, 138 flow [2022-12-06 05:26:53,685 INFO L188 LiptonReduction]: Number of co-enabled transitions 162 [2022-12-06 05:26:55,258 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:26:55,259 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1584 [2022-12-06 05:26:55,259 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 132 flow [2022-12-06 05:26:55,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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 05:26:55,259 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:55,259 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:55,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 05:26:55,259 INFO L420 AbstractCegarLoop]: === Iteration 9 === 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 05:26:55,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:55,260 INFO L85 PathProgramCache]: Analyzing trace with hash -847211587, now seen corresponding path program 1 times [2022-12-06 05:26:55,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:55,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119495814] [2022-12-06 05:26:55,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:55,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:55,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:55,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:55,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:55,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119495814] [2022-12-06 05:26:55,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119495814] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:55,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:55,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:55,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594558172] [2022-12-06 05:26:55,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:55,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:26:55,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:55,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:26:55,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:26:55,371 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 05:26:55,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 132 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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 05:26:55,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:55,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 05:26:55,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:55,499 INFO L130 PetriNetUnfolder]: 719/1094 cut-off events. [2022-12-06 05:26:55,500 INFO L131 PetriNetUnfolder]: For 895/895 co-relation queries the response was YES. [2022-12-06 05:26:55,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3160 conditions, 1094 events. 719/1094 cut-off events. For 895/895 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3954 event pairs, 290 based on Foata normal form. 42/1133 useless extension candidates. Maximal degree in co-relation 3140. Up to 400 conditions per place. [2022-12-06 05:26:55,505 INFO L137 encePairwiseOnDemand]: 24/30 looper letters, 56 selfloop transitions, 10 changer transitions 0/66 dead transitions. [2022-12-06 05:26:55,505 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 66 transitions, 384 flow [2022-12-06 05:26:55,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:55,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:55,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-12-06 05:26:55,506 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-06 05:26:55,506 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 132 flow. Second operand 4 states and 66 transitions. [2022-12-06 05:26:55,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 66 transitions, 384 flow [2022-12-06 05:26:55,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 66 transitions, 362 flow, removed 11 selfloop flow, removed 5 redundant places. [2022-12-06 05:26:55,508 INFO L231 Difference]: Finished difference. Result has 41 places, 40 transitions, 201 flow [2022-12-06 05:26:55,508 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=201, PETRI_PLACES=41, PETRI_TRANSITIONS=40} [2022-12-06 05:26:55,509 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 7 predicate places. [2022-12-06 05:26:55,509 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:55,509 INFO L89 Accepts]: Start accepts. Operand has 41 places, 40 transitions, 201 flow [2022-12-06 05:26:55,510 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:55,510 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:55,510 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 40 transitions, 201 flow [2022-12-06 05:26:55,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 40 transitions, 201 flow [2022-12-06 05:26:55,523 INFO L130 PetriNetUnfolder]: 47/141 cut-off events. [2022-12-06 05:26:55,523 INFO L131 PetriNetUnfolder]: For 128/130 co-relation queries the response was YES. [2022-12-06 05:26:55,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377 conditions, 141 events. 47/141 cut-off events. For 128/130 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 454 event pairs, 18 based on Foata normal form. 2/136 useless extension candidates. Maximal degree in co-relation 317. Up to 45 conditions per place. [2022-12-06 05:26:55,524 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 40 transitions, 201 flow [2022-12-06 05:26:55,524 INFO L188 LiptonReduction]: Number of co-enabled transitions 232 [2022-12-06 05:26:55,525 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:26:55,527 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 05:26:55,527 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 40 transitions, 201 flow [2022-12-06 05:26:55,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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 05:26:55,527 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:55,527 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:55,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 05:26:55,527 INFO L420 AbstractCegarLoop]: === Iteration 10 === 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 05:26:55,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:55,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1572785111, now seen corresponding path program 1 times [2022-12-06 05:26:55,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:55,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772646110] [2022-12-06 05:26:55,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:55,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:55,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:55,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:55,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:55,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772646110] [2022-12-06 05:26:55,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772646110] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:26:55,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622162650] [2022-12-06 05:26:55,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:55,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:26:55,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:26:55,793 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:26:55,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 05:26:55,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:55,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 05:26:55,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:26:56,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:56,038 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:26:56,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622162650] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:56,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:26:56,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-12-06 05:26:56,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923831843] [2022-12-06 05:26:56,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:56,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:26:56,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:56,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:26:56,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:26:56,039 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 05:26:56,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 40 transitions, 201 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 05:26:56,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:56,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 05:26:56,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:56,304 INFO L130 PetriNetUnfolder]: 1096/1822 cut-off events. [2022-12-06 05:26:56,305 INFO L131 PetriNetUnfolder]: For 2811/2811 co-relation queries the response was YES. [2022-12-06 05:26:56,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5743 conditions, 1822 events. 1096/1822 cut-off events. For 2811/2811 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8449 event pairs, 718 based on Foata normal form. 216/2032 useless extension candidates. Maximal degree in co-relation 1495. Up to 1093 conditions per place. [2022-12-06 05:26:56,311 INFO L137 encePairwiseOnDemand]: 22/30 looper letters, 38 selfloop transitions, 3 changer transitions 79/120 dead transitions. [2022-12-06 05:26:56,311 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 120 transitions, 785 flow [2022-12-06 05:26:56,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:26:56,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:26:56,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2022-12-06 05:26:56,312 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2022-12-06 05:26:56,312 INFO L175 Difference]: Start difference. First operand has 41 places, 40 transitions, 201 flow. Second operand 7 states and 102 transitions. [2022-12-06 05:26:56,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 120 transitions, 785 flow [2022-12-06 05:26:56,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 120 transitions, 745 flow, removed 20 selfloop flow, removed 0 redundant places. [2022-12-06 05:26:56,315 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 223 flow [2022-12-06 05:26:56,316 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=223, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2022-12-06 05:26:56,316 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 18 predicate places. [2022-12-06 05:26:56,316 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:56,316 INFO L89 Accepts]: Start accepts. Operand has 52 places, 41 transitions, 223 flow [2022-12-06 05:26:56,318 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:56,318 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:56,318 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 41 transitions, 223 flow [2022-12-06 05:26:56,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 41 transitions, 223 flow [2022-12-06 05:26:56,331 INFO L130 PetriNetUnfolder]: 47/142 cut-off events. [2022-12-06 05:26:56,332 INFO L131 PetriNetUnfolder]: For 222/224 co-relation queries the response was YES. [2022-12-06 05:26:56,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 410 conditions, 142 events. 47/142 cut-off events. For 222/224 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 459 event pairs, 18 based on Foata normal form. 2/139 useless extension candidates. Maximal degree in co-relation 381. Up to 45 conditions per place. [2022-12-06 05:26:56,333 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 41 transitions, 223 flow [2022-12-06 05:26:56,333 INFO L188 LiptonReduction]: Number of co-enabled transitions 232 [2022-12-06 05:26:56,763 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:56,764 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 448 [2022-12-06 05:26:56,764 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 219 flow [2022-12-06 05:26:56,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 05:26:56,764 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:56,765 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:56,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 05:26:56,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-06 05:26:56,965 INFO L420 AbstractCegarLoop]: === Iteration 11 === 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 05:26:56,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:56,966 INFO L85 PathProgramCache]: Analyzing trace with hash 220691871, now seen corresponding path program 1 times [2022-12-06 05:26:56,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:56,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194355634] [2022-12-06 05:26:56,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:56,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:59,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:59,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:59,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194355634] [2022-12-06 05:26:59,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194355634] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:26:59,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919720073] [2022-12-06 05:26:59,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:59,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:26:59,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:26:59,828 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:26:59,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 05:26:59,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:59,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 71 conjunts are in the unsatisfiable core [2022-12-06 05:26:59,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:27:00,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:00,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:27:30,912 WARN L233 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:28:04,599 WARN L233 SmtUtils]: Spent 17.52s on a formula simplification. DAG size of input: 54 DAG size of output: 51 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:28:40,805 WARN L233 SmtUtils]: Spent 36.13s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:30:26,050 WARN L233 SmtUtils]: Spent 1.72m on a formula simplification. DAG size of input: 76 DAG size of output: 72 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:30:26,173 INFO L321 Elim1Store]: treesize reduction 48, result has 71.4 percent of original size [2022-12-06 05:30:26,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 61 treesize of output 131 [2022-12-06 05:30:26,281 INFO L321 Elim1Store]: treesize reduction 48, result has 71.4 percent of original size [2022-12-06 05:30:26,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 131 [2022-12-06 05:30:26,360 INFO L321 Elim1Store]: treesize reduction 39, result has 75.9 percent of original size [2022-12-06 05:30:26,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 68 treesize of output 141 [2022-12-06 05:30:26,398 INFO L321 Elim1Store]: treesize reduction 163, result has 0.6 percent of original size [2022-12-06 05:30:26,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 63 treesize of output 1 [2022-12-06 05:30:30,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:30:30,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919720073] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:30:30,640 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:30:30,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-12-06 05:30:30,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26770432] [2022-12-06 05:30:30,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:30:30,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-06 05:30:30,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:30:30,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-06 05:30:30,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=978, Unknown=11, NotChecked=0, Total=1190 [2022-12-06 05:30:30,642 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 05:30:30,643 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 219 flow. Second operand has 35 states, 34 states have (on average 2.2941176470588234) internal successors, (78), 34 states have internal predecessors, (78), 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 05:30:30,643 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:30:30,643 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 05:30:30,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:30:42,866 WARN L233 SmtUtils]: Spent 12.15s on a formula simplification. DAG size of input: 111 DAG size of output: 78 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:31:52,191 WARN L233 SmtUtils]: Spent 1.11m on a formula simplification. DAG size of input: 73 DAG size of output: 68 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:32:04,586 WARN L233 SmtUtils]: Spent 12.15s on a formula simplification. DAG size of input: 104 DAG size of output: 65 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:32:06,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:32:08,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:32:10,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:32:12,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:32:14,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:32:16,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:32:18,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:32:20,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 05:32:22,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:32:24,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:32:26,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:32:38,951 WARN L233 SmtUtils]: Spent 12.13s on a formula simplification. DAG size of input: 109 DAG size of output: 72 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:32:41,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:32:43,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:32:45,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:32:47,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:32:49,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:32:51,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 05:32:53,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 05:32:55,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 05:32:57,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 05:32:59,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 05:33:01,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 05:33:03,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 05:33:05,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 05:33:07,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 05:33:09,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 05:33:11,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 05:33:13,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 05:33:15,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 05:33:27,430 WARN L233 SmtUtils]: Spent 12.11s on a formula simplification. DAG size of input: 91 DAG size of output: 70 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:33:29,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:33:31,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:33:33,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:33:35,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:33:37,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:33:39,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:33:41,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:33:43,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 05:33:45,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 05:33:47,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 05:33:49,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 05:33:50,066 INFO L130 PetriNetUnfolder]: 1106/1783 cut-off events. [2022-12-06 05:33:50,067 INFO L131 PetriNetUnfolder]: For 2958/2958 co-relation queries the response was YES. [2022-12-06 05:33:50,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5659 conditions, 1783 events. 1106/1783 cut-off events. For 2958/2958 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 7414 event pairs, 353 based on Foata normal form. 1/1781 useless extension candidates. Maximal degree in co-relation 4989. Up to 999 conditions per place. [2022-12-06 05:33:50,075 INFO L137 encePairwiseOnDemand]: 15/30 looper letters, 102 selfloop transitions, 45 changer transitions 65/212 dead transitions. [2022-12-06 05:33:50,075 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 212 transitions, 1202 flow [2022-12-06 05:33:50,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-06 05:33:50,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-12-06 05:33:50,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 206 transitions. [2022-12-06 05:33:50,077 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2019607843137255 [2022-12-06 05:33:50,077 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 219 flow. Second operand 34 states and 206 transitions. [2022-12-06 05:33:50,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 212 transitions, 1202 flow [2022-12-06 05:33:50,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 212 transitions, 1123 flow, removed 35 selfloop flow, removed 7 redundant places. [2022-12-06 05:33:50,083 INFO L231 Difference]: Finished difference. Result has 77 places, 80 transitions, 512 flow [2022-12-06 05:33:50,084 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=512, PETRI_PLACES=77, PETRI_TRANSITIONS=80} [2022-12-06 05:33:50,084 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 43 predicate places. [2022-12-06 05:33:50,084 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:33:50,084 INFO L89 Accepts]: Start accepts. Operand has 77 places, 80 transitions, 512 flow [2022-12-06 05:33:50,086 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:33:50,086 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:33:50,087 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 80 transitions, 512 flow [2022-12-06 05:33:50,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 80 transitions, 512 flow [2022-12-06 05:33:50,107 INFO L130 PetriNetUnfolder]: 61/249 cut-off events. [2022-12-06 05:33:50,107 INFO L131 PetriNetUnfolder]: For 226/238 co-relation queries the response was YES. [2022-12-06 05:33:50,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 633 conditions, 249 events. 61/249 cut-off events. For 226/238 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1076 event pairs, 11 based on Foata normal form. 2/241 useless extension candidates. Maximal degree in co-relation 521. Up to 58 conditions per place. [2022-12-06 05:33:50,109 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 80 transitions, 512 flow [2022-12-06 05:33:50,109 INFO L188 LiptonReduction]: Number of co-enabled transitions 402 [2022-12-06 05:33:51,089 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [974] L110-->L104: Formula: (and (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= (select (select |v_#memory_int_128| v_~manager~0.base_55) (+ (* v_~manager_back~0_104 4) v_~manager~0.offset_55)) v_~update~0_51) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|) (not (= (mod |v_thread3Thread1of1ForFork2_#t~nondet18#1_16| 256) 0)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|) (not (= (ite (and (< v_~manager_back~0_104 v_~manager_size~0_40) (<= 0 v_~manager_back~0_104)) 1 0) 0)) (= v_~manager_back~0_103 (+ v_~manager_back~0_104 1))) InVars {~manager~0.offset=v_~manager~0.offset_55, thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_16|, ~manager~0.base=v_~manager~0.base_55, #memory_int=|v_#memory_int_128|, ~manager_back~0=v_~manager_back~0_104, ~manager_size~0=v_~manager_size~0_40, ~update~0=v_~update~0_51} OutVars{thread3Thread1of1ForFork2_#t~post20#1=|v_thread3Thread1of1ForFork2_#t~post20#1_7|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~manager~0.offset=v_~manager~0.offset_55, ~manager~0.base=v_~manager~0.base_55, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_128|, thread3Thread1of1ForFork2_#t~mem19#1=|v_thread3Thread1of1ForFork2_#t~mem19#1_7|, ~manager_back~0=v_~manager_back~0_103, ~manager_size~0=v_~manager_size~0_40, ~update~0=v_~update~0_51} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post20#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~nondet18#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~mem19#1, ~manager_back~0] and [1092] L74-->L56: Formula: (let ((.cse0 (not |v_thread1_#t~short3#1_60|))) (and (= v_~safe~0_138 (ite (= (ite |v_thread1_#t~short3#1_59| 1 0) 0) 0 1)) (= (ite (and (<= 0 v_~manager_front~0_135) (< v_~manager_front~0_135 v_~manager_back~0_141) (< v_~manager_front~0_135 v_~manager_size~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|) (or (and (= |v_thread1_#t~short3#1_60| |v_thread1_#t~short3#1_59|) .cse0 (= |v_thread1_#t~mem2#1_35| |v_thread1Thread1of1ForFork0_#t~mem2#1_18|)) (and (let ((.cse1 (= |v_thread1_#t~mem2#1_35| v_~update~0_79))) (or (and |v_thread1_#t~short3#1_59| .cse1) (and (not .cse1) (not |v_thread1_#t~short3#1_59|)))) (= |v_thread1_#t~mem2#1_35| (select (select |v_#memory_int_214| v_~manager~0.base_89) (+ (* v_~manager_front~0_135 4) v_~manager~0.offset_89))) |v_thread1_#t~short3#1_60|)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|) (= (+ v_~manager_front~0_135 1) v_~manager_front~0_134) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_18| 256) 0)) (let ((.cse2 (= (mod v_~safe~0_139 256) 0))) (or (and |v_thread1_#t~short3#1_60| (not .cse2)) (and .cse0 .cse2))))) InVars {~manager_front~0=v_~manager_front~0_135, ~manager~0.offset=v_~manager~0.offset_89, ~manager~0.base=v_~manager~0.base_89, ~safe~0=v_~safe~0_139, #memory_int=|v_#memory_int_214|, ~manager_back~0=v_~manager_back~0_141, ~manager_size~0=v_~manager_size~0_74, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_18|, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_18|, ~update~0=v_~update~0_79} OutVars{~manager~0.offset=v_~manager~0.offset_89, ~manager~0.base=v_~manager~0.base_89, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_11|, ~manager_back~0=v_~manager_back~0_141, ~manager_front~0=v_~manager_front~0_134, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|, ~safe~0=v_~safe~0_138, #memory_int=|v_#memory_int_214|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35|, ~manager_size~0=v_~manager_size~0_74, thread1Thread1of1ForFork0_#t~short3#1=|v_thread1Thread1of1ForFork0_#t~short3#1_11|, ~update~0=v_~update~0_79} AuxVars[|v_thread1_#t~mem2#1_35|, |v_thread1_#t~short3#1_59|, |v_thread1_#t~short3#1_60|] AssignedVars[~manager_front~0, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, ~safe~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~nondet1#1, thread1Thread1of1ForFork0_#t~short3#1] [2022-12-06 05:33:51,322 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [974] L110-->L104: Formula: (and (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= (select (select |v_#memory_int_128| v_~manager~0.base_55) (+ (* v_~manager_back~0_104 4) v_~manager~0.offset_55)) v_~update~0_51) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|) (not (= (mod |v_thread3Thread1of1ForFork2_#t~nondet18#1_16| 256) 0)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|) (not (= (ite (and (< v_~manager_back~0_104 v_~manager_size~0_40) (<= 0 v_~manager_back~0_104)) 1 0) 0)) (= v_~manager_back~0_103 (+ v_~manager_back~0_104 1))) InVars {~manager~0.offset=v_~manager~0.offset_55, thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_16|, ~manager~0.base=v_~manager~0.base_55, #memory_int=|v_#memory_int_128|, ~manager_back~0=v_~manager_back~0_104, ~manager_size~0=v_~manager_size~0_40, ~update~0=v_~update~0_51} OutVars{thread3Thread1of1ForFork2_#t~post20#1=|v_thread3Thread1of1ForFork2_#t~post20#1_7|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~manager~0.offset=v_~manager~0.offset_55, ~manager~0.base=v_~manager~0.base_55, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_128|, thread3Thread1of1ForFork2_#t~mem19#1=|v_thread3Thread1of1ForFork2_#t~mem19#1_7|, ~manager_back~0=v_~manager_back~0_103, ~manager_size~0=v_~manager_size~0_40, ~update~0=v_~update~0_51} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post20#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~nondet18#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~mem19#1, ~manager_back~0] and [1092] L74-->L56: Formula: (let ((.cse0 (not |v_thread1_#t~short3#1_60|))) (and (= v_~safe~0_138 (ite (= (ite |v_thread1_#t~short3#1_59| 1 0) 0) 0 1)) (= (ite (and (<= 0 v_~manager_front~0_135) (< v_~manager_front~0_135 v_~manager_back~0_141) (< v_~manager_front~0_135 v_~manager_size~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|) (or (and (= |v_thread1_#t~short3#1_60| |v_thread1_#t~short3#1_59|) .cse0 (= |v_thread1_#t~mem2#1_35| |v_thread1Thread1of1ForFork0_#t~mem2#1_18|)) (and (let ((.cse1 (= |v_thread1_#t~mem2#1_35| v_~update~0_79))) (or (and |v_thread1_#t~short3#1_59| .cse1) (and (not .cse1) (not |v_thread1_#t~short3#1_59|)))) (= |v_thread1_#t~mem2#1_35| (select (select |v_#memory_int_214| v_~manager~0.base_89) (+ (* v_~manager_front~0_135 4) v_~manager~0.offset_89))) |v_thread1_#t~short3#1_60|)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|) (= (+ v_~manager_front~0_135 1) v_~manager_front~0_134) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_18| 256) 0)) (let ((.cse2 (= (mod v_~safe~0_139 256) 0))) (or (and |v_thread1_#t~short3#1_60| (not .cse2)) (and .cse0 .cse2))))) InVars {~manager_front~0=v_~manager_front~0_135, ~manager~0.offset=v_~manager~0.offset_89, ~manager~0.base=v_~manager~0.base_89, ~safe~0=v_~safe~0_139, #memory_int=|v_#memory_int_214|, ~manager_back~0=v_~manager_back~0_141, ~manager_size~0=v_~manager_size~0_74, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_18|, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_18|, ~update~0=v_~update~0_79} OutVars{~manager~0.offset=v_~manager~0.offset_89, ~manager~0.base=v_~manager~0.base_89, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_11|, ~manager_back~0=v_~manager_back~0_141, ~manager_front~0=v_~manager_front~0_134, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|, ~safe~0=v_~safe~0_138, #memory_int=|v_#memory_int_214|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35|, ~manager_size~0=v_~manager_size~0_74, thread1Thread1of1ForFork0_#t~short3#1=|v_thread1Thread1of1ForFork0_#t~short3#1_11|, ~update~0=v_~update~0_79} AuxVars[|v_thread1_#t~mem2#1_35|, |v_thread1_#t~short3#1_59|, |v_thread1_#t~short3#1_60|] AssignedVars[~manager_front~0, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, ~safe~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~nondet1#1, thread1Thread1of1ForFork0_#t~short3#1] [2022-12-06 05:33:51,927 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [882] L56-->L62: Formula: (and (= v_~node_back~0_40 (+ v_~node_back~0_41 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) (not (= (ite (and (<= 0 v_~node_back~0_41) (< v_~node_back~0_41 v_~node_size~0_14)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_3| 0)) (= (ite (= (select (select |v_#memory_int_76| v_~node~0.base_19) (+ v_~node~0.offset_19 (* v_~node_back~0_41 4))) v_~update~0_29) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|)) InVars {~node_back~0=v_~node_back~0_41, ~node_size~0=v_~node_size~0_14, ~node~0.base=v_~node~0.base_19, #memory_int=|v_#memory_int_76|, ~node~0.offset=v_~node~0.offset_19, ~update~0=v_~update~0_29} OutVars{~node_back~0=v_~node_back~0_40, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_1|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, ~node_size~0=v_~node_size~0_14, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_1|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, ~node~0.base=v_~node~0.base_19, #memory_int=|v_#memory_int_76|, ~node~0.offset=v_~node~0.offset_19, ~update~0=v_~update~0_29} AuxVars[] AssignedVars[~node_back~0, thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1] and [1121] L92-->L86: Formula: (let ((.cse0 (not |v_thread2_#t~short14#1_64|))) (and (= (+ 1 v_~node_front~0_79) v_~node_front~0_78) (or (and .cse0 (= |v_thread2_#t~mem13#1_37| |v_thread2Thread1of1ForFork1_#t~mem13#1_18|) (= |v_thread2_#t~short14#1_63| |v_thread2_#t~short14#1_64|)) (and (= (select (select |v_#memory_int_250| v_~node~0.base_63) (+ v_~node~0.offset_63 (* 4 v_~node_front~0_79))) |v_thread2_#t~mem13#1_37|) (let ((.cse1 (= |v_thread2_#t~mem13#1_37| v_~update~0_93))) (or (and |v_thread2_#t~short14#1_63| .cse1) (and (not |v_thread2_#t~short14#1_63|) (not .cse1)))) |v_thread2_#t~short14#1_64|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= (ite (and (< v_~node_front~0_79 v_~node_back~0_96) (< v_~node_front~0_79 v_~node_size~0_70) (<= 0 v_~node_front~0_79)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (not (= (mod |v_thread2Thread1of1ForFork1_#t~nondet12#1_24| 256) 0)) (let ((.cse2 (= (mod v_~safe~0_161 256) 0))) (or (and .cse2 .cse0) (and (not .cse2) |v_thread2_#t~short14#1_64|))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (= v_~safe~0_160 (ite (= (ite |v_thread2_#t~short14#1_63| 1 0) 0) 0 1)))) InVars {~node_back~0=v_~node_back~0_96, thread2Thread1of1ForFork1_#t~mem13#1=|v_thread2Thread1of1ForFork1_#t~mem13#1_18|, ~node_size~0=v_~node_size~0_70, ~safe~0=v_~safe~0_161, ~node~0.base=v_~node~0.base_63, #memory_int=|v_#memory_int_250|, ~node_front~0=v_~node_front~0_79, thread2Thread1of1ForFork1_#t~nondet12#1=|v_thread2Thread1of1ForFork1_#t~nondet12#1_24|, ~node~0.offset=v_~node~0.offset_63, ~update~0=v_~update~0_93} OutVars{~node_back~0=v_~node_back~0_96, thread2Thread1of1ForFork1_#t~post15#1=|v_thread2Thread1of1ForFork1_#t~post15#1_11|, ~node~0.base=v_~node~0.base_63, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, ~node~0.offset=v_~node~0.offset_63, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~node_size~0=v_~node_size~0_70, ~safe~0=v_~safe~0_160, #memory_int=|v_#memory_int_250|, ~node_front~0=v_~node_front~0_78, thread2Thread1of1ForFork1_#t~short14#1=|v_thread2Thread1of1ForFork1_#t~short14#1_11|, ~update~0=v_~update~0_93} AuxVars[|v_thread2_#t~mem13#1_37|, |v_thread2_#t~short14#1_63|, |v_thread2_#t~short14#1_64|] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem13#1, thread2Thread1of1ForFork1_#t~post15#1, ~safe~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~node_front~0, thread2Thread1of1ForFork1_#t~short14#1, thread2Thread1of1ForFork1_#t~nondet12#1] [2022-12-06 05:33:52,245 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [974] L110-->L104: Formula: (and (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= (select (select |v_#memory_int_128| v_~manager~0.base_55) (+ (* v_~manager_back~0_104 4) v_~manager~0.offset_55)) v_~update~0_51) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|) (not (= (mod |v_thread3Thread1of1ForFork2_#t~nondet18#1_16| 256) 0)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|) (not (= (ite (and (< v_~manager_back~0_104 v_~manager_size~0_40) (<= 0 v_~manager_back~0_104)) 1 0) 0)) (= v_~manager_back~0_103 (+ v_~manager_back~0_104 1))) InVars {~manager~0.offset=v_~manager~0.offset_55, thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_16|, ~manager~0.base=v_~manager~0.base_55, #memory_int=|v_#memory_int_128|, ~manager_back~0=v_~manager_back~0_104, ~manager_size~0=v_~manager_size~0_40, ~update~0=v_~update~0_51} OutVars{thread3Thread1of1ForFork2_#t~post20#1=|v_thread3Thread1of1ForFork2_#t~post20#1_7|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~manager~0.offset=v_~manager~0.offset_55, ~manager~0.base=v_~manager~0.base_55, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_128|, thread3Thread1of1ForFork2_#t~mem19#1=|v_thread3Thread1of1ForFork2_#t~mem19#1_7|, ~manager_back~0=v_~manager_back~0_103, ~manager_size~0=v_~manager_size~0_40, ~update~0=v_~update~0_51} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post20#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~nondet18#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~mem19#1, ~manager_back~0] and [1154] L74-->L62: Formula: (let ((.cse1 (not |v_thread1_#t~short3#1_108|))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_102| 0)) (or (and (= |v_thread1_#t~mem2#1_59| (select (select |v_#memory_int_382| v_~manager~0.base_163) (+ (* v_~manager_front~0_246 4) v_~manager~0.offset_163))) (let ((.cse0 (= |v_thread1_#t~mem2#1_59| v_~update~0_143))) (or (and (not .cse0) (not |v_thread1_#t~short3#1_107|)) (and .cse0 |v_thread1_#t~short3#1_107|))) |v_thread1_#t~short3#1_108|) (and (= |v_thread1_#t~mem2#1_59| |v_thread1Thread1of1ForFork0_#t~mem2#1_46|) .cse1 (= |v_thread1_#t~short3#1_107| |v_thread1_#t~short3#1_108|))) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_49| 256) 0)) (= (+ v_~manager_front~0_246 1) v_~manager_front~0_245) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_102| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_102|) (not (= (ite (and (< v_~manager_front~0_246 v_~manager_size~0_141) (< v_~manager_front~0_246 v_~manager_back~0_236) (<= 0 v_~manager_front~0_246)) 1 0) 0)) (= v_~safe~0_297 (ite (= (ite |v_thread1_#t~short3#1_107| 1 0) 0) 0 1)) (let ((.cse2 (= (mod v_~safe~0_298 256) 0))) (or (and (not .cse2) |v_thread1_#t~short3#1_108|) (and .cse2 .cse1))) (= (+ v_~node_back~0_149 1) v_~node_back~0_148) (= (ite (= (select (select |v_#memory_int_382| v_~node~0.base_92) (+ v_~node~0.offset_92 (* 4 v_~node_back~0_149))) v_~update~0_143) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_102|) (not (= (ite (and (<= 0 v_~node_back~0_149) (< v_~node_back~0_149 v_~node_size~0_111)) 1 0) 0)))) InVars {~node_back~0=v_~node_back~0_149, ~manager~0.offset=v_~manager~0.offset_163, ~manager~0.base=v_~manager~0.base_163, ~node~0.base=v_~node~0.base_92, ~manager_back~0=v_~manager_back~0_236, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_46|, ~node~0.offset=v_~node~0.offset_92, ~manager_front~0=v_~manager_front~0_246, ~node_size~0=v_~node_size~0_111, ~safe~0=v_~safe~0_298, #memory_int=|v_#memory_int_382|, ~manager_size~0=v_~manager_size~0_141, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_49|, ~update~0=v_~update~0_143} OutVars{~node_back~0=v_~node_back~0_148, ~manager~0.offset=v_~manager~0.offset_163, ~manager~0.base=v_~manager~0.base_163, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_26|, ~node~0.base=v_~node~0.base_92, ~manager_back~0=v_~manager_back~0_236, ~node~0.offset=v_~node~0.offset_92, ~manager_front~0=v_~manager_front~0_245, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_21|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_102|, ~node_size~0=v_~node_size~0_111, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_21|, ~safe~0=v_~safe~0_297, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_102|, #memory_int=|v_#memory_int_382|, ~manager_size~0=v_~manager_size~0_141, thread1Thread1of1ForFork0_#t~short3#1=|v_thread1Thread1of1ForFork0_#t~short3#1_26|, ~update~0=v_~update~0_143} AuxVars[|v_thread1_#t~short3#1_107|, |v_thread1_#t~short3#1_108|, |v_thread1_#t~mem2#1_59|] AssignedVars[~node_back~0, ~manager_front~0, thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_#t~post4#1, ~safe~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~nondet1#1, thread1Thread1of1ForFork0_#t~short3#1] [2022-12-06 05:33:52,529 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1146] L62-->L74: Formula: (let ((.cse1 (not |v_thread1_#t~short8#1_133|))) (and (let ((.cse0 (= (mod v_~safe~0_272 256) 0))) (or (and .cse0 .cse1) (and (not .cse0) |v_thread1_#t~short8#1_133|))) (= (+ v_~manager_front~0_225 1) v_~manager_front~0_224) (not (= (ite (and (<= 0 v_~client_back~0_123) (< v_~client_back~0_123 v_~client_size~0_88)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_86| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_86|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_86| 0)) (= (ite (= (select (select |v_#memory_int_345| v_~client~0.base_85) (+ (* v_~client_back~0_123 4) v_~client~0.offset_85)) v_~ok~0_137) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_86|) (= v_~safe~0_271 (ite (= (ite |v_thread1_#t~short8#1_134| 1 0) 0) 0 1)) (= (+ v_~client_back~0_123 1) v_~client_back~0_122) (not (= (ite (and (<= 0 v_~manager_front~0_225) (< v_~manager_front~0_225 v_~manager_back~0_219) (< v_~manager_front~0_225 v_~manager_size~0_131)) 1 0) 0)) (or (and (let ((.cse2 (= |v_thread1_#t~mem7#1_79| v_~ok~0_137))) (or (and .cse2 |v_thread1_#t~short8#1_134|) (and (not .cse2) (not |v_thread1_#t~short8#1_134|)))) (= |v_thread1_#t~mem7#1_79| (select (select |v_#memory_int_345| v_~manager~0.base_150) (+ (* v_~manager_front~0_225 4) v_~manager~0.offset_150))) |v_thread1_#t~short8#1_133|) (and (= |v_thread1_#t~mem7#1_79| |v_thread1Thread1of1ForFork0_#t~mem7#1_78|) (= |v_thread1_#t~short8#1_133| |v_thread1_#t~short8#1_134|) .cse1)))) InVars {~client_back~0=v_~client_back~0_123, ~client~0.offset=v_~client~0.offset_85, ~manager~0.offset=v_~manager~0.offset_150, ~ok~0=v_~ok~0_137, ~manager~0.base=v_~manager~0.base_150, ~manager_back~0=v_~manager_back~0_219, ~manager_front~0=v_~manager_front~0_225, ~safe~0=v_~safe~0_272, thread1Thread1of1ForFork0_#t~mem7#1=|v_thread1Thread1of1ForFork0_#t~mem7#1_78|, #memory_int=|v_#memory_int_345|, ~client_size~0=v_~client_size~0_88, ~manager_size~0=v_~manager_size~0_131, ~client~0.base=v_~client~0.base_85} OutVars{~client_back~0=v_~client_back~0_122, ~client~0.offset=v_~client~0.offset_85, ~manager~0.offset=v_~manager~0.offset_150, ~ok~0=v_~ok~0_137, ~manager~0.base=v_~manager~0.base_150, ~manager_back~0=v_~manager_back~0_219, thread1Thread1of1ForFork0_#t~post11#1=|v_thread1Thread1of1ForFork0_#t~post11#1_15|, thread1Thread1of1ForFork0_#t~short8#1=|v_thread1Thread1of1ForFork0_#t~short8#1_41|, ~manager_front~0=v_~manager_front~0_224, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_86|, thread1Thread1of1ForFork0_#t~mem10#1=|v_thread1Thread1of1ForFork0_#t~mem10#1_15|, ~safe~0=v_~safe~0_271, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_86|, #memory_int=|v_#memory_int_345|, ~client_size~0=v_~client_size~0_88, ~manager_size~0=v_~manager_size~0_131, thread1Thread1of1ForFork0_#t~post9#1=|v_thread1Thread1of1ForFork0_#t~post9#1_41|, ~client~0.base=v_~client~0.base_85} AuxVars[|v_thread1_#t~short8#1_134|, |v_thread1_#t~short8#1_133|, |v_thread1_#t~mem7#1_79|] AssignedVars[~manager_front~0, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~client_back~0, thread1Thread1of1ForFork0_#t~mem10#1, ~safe~0, thread1Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post9#1, thread1Thread1of1ForFork0_#t~post11#1, thread1Thread1of1ForFork0_#t~short8#1] and [902] L104-->L110: Formula: (let ((.cse0 (not |v_thread3_#t~short22#1_39|))) (and (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|) (= (ite (and (< v_~client_front~0_45 v_~client_back~0_36) (<= 0 v_~client_front~0_45) (< v_~client_back~0_36 v_~client_size~0_18)) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|) (= v_~client_front~0_44 (+ v_~client_front~0_45 1)) (not (= 0 |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|)) (= v_~safe~0_48 (ite (= (ite |v_thread3_#t~short22#1_40| 1 0) 0) 0 1)) (or (and (= |v_thread3Thread1of1ForFork2_#t~mem21#1_1| |v_thread3_#t~mem21#1_26|) .cse0 (= |v_thread3_#t~short22#1_39| |v_thread3_#t~short22#1_40|)) (and (let ((.cse1 (= |v_thread3_#t~mem21#1_26| v_~ok~0_45))) (or (and |v_thread3_#t~short22#1_40| .cse1) (and (not |v_thread3_#t~short22#1_40|) (not .cse1)))) |v_thread3_#t~short22#1_39| (= (select (select |v_#memory_int_94| v_~client~0.base_17) (+ (* v_~client_front~0_45 4) v_~client~0.offset_17)) |v_thread3_#t~mem21#1_26|))) (let ((.cse2 (= (mod v_~safe~0_49 256) 0))) (or (and .cse2 .cse0) (and (not .cse2) |v_thread3_#t~short22#1_39|))))) InVars {~client~0.offset=v_~client~0.offset_17, ~client_back~0=v_~client_back~0_36, ~client_front~0=v_~client_front~0_45, ~ok~0=v_~ok~0_45, thread3Thread1of1ForFork2_#t~mem21#1=|v_thread3Thread1of1ForFork2_#t~mem21#1_1|, ~safe~0=v_~safe~0_49, #memory_int=|v_#memory_int_94|, ~client_size~0=v_~client_size~0_18, ~client~0.base=v_~client~0.base_17} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|, ~client~0.offset=v_~client~0.offset_17, ~client_back~0=v_~client_back~0_36, ~ok~0=v_~ok~0_45, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|, thread3Thread1of1ForFork2_#t~short22#1=|v_thread3Thread1of1ForFork2_#t~short22#1_1|, ~client_front~0=v_~client_front~0_44, ~safe~0=v_~safe~0_48, #memory_int=|v_#memory_int_94|, thread3Thread1of1ForFork2_#t~post23#1=|v_thread3Thread1of1ForFork2_#t~post23#1_1|, ~client_size~0=v_~client_size~0_18, ~client~0.base=v_~client~0.base_17} AuxVars[|v_thread3_#t~short22#1_40|, |v_thread3_#t~short22#1_39|, |v_thread3_#t~mem21#1_26|] AssignedVars[thread3Thread1of1ForFork2_#t~short22#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~client_front~0, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~safe~0, thread3Thread1of1ForFork2_#t~mem21#1, thread3Thread1of1ForFork2_#t~post23#1] [2022-12-06 05:33:53,509 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [893] L86-->L92: Formula: (and (= (ite (= (select (select |v_#memory_int_74| v_~manager~0.base_31) (+ (* v_~manager_back~0_74 4) v_~manager~0.offset_31)) v_~ok~0_33) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|) (not (= (ite (and (<= 0 v_~manager_back~0_74) (< v_~manager_back~0_74 v_~manager_size~0_26)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_3| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|) (= (+ v_~manager_back~0_74 1) v_~manager_back~0_73)) InVars {~manager~0.offset=v_~manager~0.offset_31, ~ok~0=v_~ok~0_33, ~manager~0.base=v_~manager~0.base_31, #memory_int=|v_#memory_int_74|, ~manager_back~0=v_~manager_back~0_74, ~manager_size~0=v_~manager_size~0_26} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|, ~manager~0.offset=v_~manager~0.offset_31, ~ok~0=v_~ok~0_33, thread2Thread1of1ForFork1_#t~post17#1=|v_thread2Thread1of1ForFork1_#t~post17#1_1|, ~manager~0.base=v_~manager~0.base_31, #memory_int=|v_#memory_int_74|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|, thread2Thread1of1ForFork1_#t~mem16#1=|v_thread2Thread1of1ForFork1_#t~mem16#1_1|, ~manager_back~0=v_~manager_back~0_73, ~manager_size~0=v_~manager_size~0_26} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post17#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem16#1, ~manager_back~0] and [1157] L62-->L110: Formula: (let ((.cse0 (not |v_thread1_#t~short8#1_156|)) (.cse5 (select |v_#memory_int_388| v_~client~0.base_96)) (.cse3 (not |v_thread3_#t~short22#1_90|))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_110| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_110|) (not (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_47| 0)) (not (= (ite (and (< v_~manager_front~0_254 v_~manager_back~0_242) (< v_~manager_front~0_254 v_~manager_size~0_145) (<= 0 v_~manager_front~0_254)) 1 0) 0)) (= (+ v_~manager_front~0_254 1) v_~manager_front~0_253) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_110| 0)) (= (+ v_~client_front~0_130 1) v_~client_front~0_129) (or (and (= |v_thread1_#t~short8#1_155| |v_thread1_#t~short8#1_156|) (= |v_thread1_#t~mem7#1_90| |v_thread1Thread1of1ForFork0_#t~mem7#1_88|) .cse0) (and (let ((.cse1 (= |v_thread1_#t~mem7#1_90| v_~ok~0_146))) (or (and (not |v_thread1_#t~short8#1_155|) (not .cse1)) (and |v_thread1_#t~short8#1_155| .cse1))) (= |v_thread1_#t~mem7#1_90| (select (select |v_#memory_int_388| v_~manager~0.base_167) (+ (* v_~manager_front~0_254 4) v_~manager~0.offset_167))) |v_thread1_#t~short8#1_156|)) (let ((.cse2 (= (mod (ite (= (ite |v_thread1_#t~short8#1_155| 1 0) 0) 0 1) 256) 0))) (or (and |v_thread3_#t~short22#1_90| (not .cse2)) (and .cse3 .cse2))) (= (ite (and (<= 0 v_~client_front~0_130) (< v_~client_back~0_137 v_~client_size~0_97) (< v_~client_front~0_130 v_~client_back~0_137)) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_47|) (= (ite (= (ite |v_thread3_#t~short22#1_89| 1 0) 0) 0 1) v_~safe~0_309) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_47| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_47|) (let ((.cse4 (= (mod v_~safe~0_311 256) 0))) (or (and (not .cse4) |v_thread1_#t~short8#1_156|) (and .cse4 .cse0))) (= (+ v_~client_back~0_138 1) v_~client_back~0_137) (= (ite (= (select .cse5 (+ v_~client~0.offset_96 (* v_~client_back~0_138 4))) v_~ok~0_146) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_110|) (or (and |v_thread3_#t~short22#1_90| (= |v_thread3_#t~mem21#1_51| (select .cse5 (+ (* v_~client_front~0_130 4) v_~client~0.offset_96))) (let ((.cse6 (= |v_thread3_#t~mem21#1_51| v_~ok~0_146))) (or (and (not .cse6) (not |v_thread3_#t~short22#1_89|)) (and .cse6 |v_thread3_#t~short22#1_89|)))) (and (= |v_thread3Thread1of1ForFork2_#t~mem21#1_36| |v_thread3_#t~mem21#1_51|) (= |v_thread3_#t~short22#1_89| |v_thread3_#t~short22#1_90|) .cse3)))) InVars {~client~0.offset=v_~client~0.offset_96, ~client_back~0=v_~client_back~0_138, ~manager~0.offset=v_~manager~0.offset_167, ~ok~0=v_~ok~0_146, ~manager~0.base=v_~manager~0.base_167, thread3Thread1of1ForFork2_#t~mem21#1=|v_thread3Thread1of1ForFork2_#t~mem21#1_36|, ~manager_back~0=v_~manager_back~0_242, ~manager_front~0=v_~manager_front~0_254, ~client_front~0=v_~client_front~0_130, ~safe~0=v_~safe~0_311, thread1Thread1of1ForFork0_#t~mem7#1=|v_thread1Thread1of1ForFork0_#t~mem7#1_88|, #memory_int=|v_#memory_int_388|, ~client_size~0=v_~client_size~0_97, ~manager_size~0=v_~manager_size~0_145, ~client~0.base=v_~client~0.base_96} OutVars{~client~0.offset=v_~client~0.offset_96, ~client_back~0=v_~client_back~0_137, ~manager~0.offset=v_~manager~0.offset_167, ~manager_back~0=v_~manager_back~0_242, thread1Thread1of1ForFork0_#t~short8#1=|v_thread1Thread1of1ForFork0_#t~short8#1_47|, ~manager_front~0=v_~manager_front~0_253, thread1Thread1of1ForFork0_#t~mem10#1=|v_thread1Thread1of1ForFork0_#t~mem10#1_21|, ~client_front~0=v_~client_front~0_129, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_110|, thread1Thread1of1ForFork0_#t~post9#1=|v_thread1Thread1of1ForFork0_#t~post9#1_47|, ~client~0.base=v_~client~0.base_96, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_47|, ~ok~0=v_~ok~0_146, ~manager~0.base=v_~manager~0.base_167, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_47|, thread1Thread1of1ForFork0_#t~post11#1=|v_thread1Thread1of1ForFork0_#t~post11#1_21|, thread3Thread1of1ForFork2_#t~short22#1=|v_thread3Thread1of1ForFork2_#t~short22#1_21|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_110|, ~safe~0=v_~safe~0_309, #memory_int=|v_#memory_int_388|, thread3Thread1of1ForFork2_#t~post23#1=|v_thread3Thread1of1ForFork2_#t~post23#1_21|, ~client_size~0=v_~client_size~0_97, ~manager_size~0=v_~manager_size~0_145} AuxVars[|v_thread1_#t~short8#1_156|, |v_thread1_#t~short8#1_155|, |v_thread3_#t~short22#1_90|, |v_thread3_#t~mem21#1_51|, |v_thread1_#t~mem7#1_90|, |v_thread3_#t~short22#1_89|] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~client_back~0, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~mem21#1, thread1Thread1of1ForFork0_#t~short8#1, thread1Thread1of1ForFork0_#t~post11#1, ~manager_front~0, thread3Thread1of1ForFork2_#t~short22#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~mem10#1, ~client_front~0, ~safe~0, thread1Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~post23#1, thread1Thread1of1ForFork0_#t~post9#1] [2022-12-06 05:33:54,200 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [893] L86-->L92: Formula: (and (= (ite (= (select (select |v_#memory_int_74| v_~manager~0.base_31) (+ (* v_~manager_back~0_74 4) v_~manager~0.offset_31)) v_~ok~0_33) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|) (not (= (ite (and (<= 0 v_~manager_back~0_74) (< v_~manager_back~0_74 v_~manager_size~0_26)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_3| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|) (= (+ v_~manager_back~0_74 1) v_~manager_back~0_73)) InVars {~manager~0.offset=v_~manager~0.offset_31, ~ok~0=v_~ok~0_33, ~manager~0.base=v_~manager~0.base_31, #memory_int=|v_#memory_int_74|, ~manager_back~0=v_~manager_back~0_74, ~manager_size~0=v_~manager_size~0_26} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|, ~manager~0.offset=v_~manager~0.offset_31, ~ok~0=v_~ok~0_33, thread2Thread1of1ForFork1_#t~post17#1=|v_thread2Thread1of1ForFork1_#t~post17#1_1|, ~manager~0.base=v_~manager~0.base_31, #memory_int=|v_#memory_int_74|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|, thread2Thread1of1ForFork1_#t~mem16#1=|v_thread2Thread1of1ForFork1_#t~mem16#1_1|, ~manager_back~0=v_~manager_back~0_73, ~manager_size~0=v_~manager_size~0_26} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post17#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem16#1, ~manager_back~0] and [1146] L62-->L74: Formula: (let ((.cse1 (not |v_thread1_#t~short8#1_133|))) (and (let ((.cse0 (= (mod v_~safe~0_272 256) 0))) (or (and .cse0 .cse1) (and (not .cse0) |v_thread1_#t~short8#1_133|))) (= (+ v_~manager_front~0_225 1) v_~manager_front~0_224) (not (= (ite (and (<= 0 v_~client_back~0_123) (< v_~client_back~0_123 v_~client_size~0_88)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_86| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_86|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_86| 0)) (= (ite (= (select (select |v_#memory_int_345| v_~client~0.base_85) (+ (* v_~client_back~0_123 4) v_~client~0.offset_85)) v_~ok~0_137) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_86|) (= v_~safe~0_271 (ite (= (ite |v_thread1_#t~short8#1_134| 1 0) 0) 0 1)) (= (+ v_~client_back~0_123 1) v_~client_back~0_122) (not (= (ite (and (<= 0 v_~manager_front~0_225) (< v_~manager_front~0_225 v_~manager_back~0_219) (< v_~manager_front~0_225 v_~manager_size~0_131)) 1 0) 0)) (or (and (let ((.cse2 (= |v_thread1_#t~mem7#1_79| v_~ok~0_137))) (or (and .cse2 |v_thread1_#t~short8#1_134|) (and (not .cse2) (not |v_thread1_#t~short8#1_134|)))) (= |v_thread1_#t~mem7#1_79| (select (select |v_#memory_int_345| v_~manager~0.base_150) (+ (* v_~manager_front~0_225 4) v_~manager~0.offset_150))) |v_thread1_#t~short8#1_133|) (and (= |v_thread1_#t~mem7#1_79| |v_thread1Thread1of1ForFork0_#t~mem7#1_78|) (= |v_thread1_#t~short8#1_133| |v_thread1_#t~short8#1_134|) .cse1)))) InVars {~client_back~0=v_~client_back~0_123, ~client~0.offset=v_~client~0.offset_85, ~manager~0.offset=v_~manager~0.offset_150, ~ok~0=v_~ok~0_137, ~manager~0.base=v_~manager~0.base_150, ~manager_back~0=v_~manager_back~0_219, ~manager_front~0=v_~manager_front~0_225, ~safe~0=v_~safe~0_272, thread1Thread1of1ForFork0_#t~mem7#1=|v_thread1Thread1of1ForFork0_#t~mem7#1_78|, #memory_int=|v_#memory_int_345|, ~client_size~0=v_~client_size~0_88, ~manager_size~0=v_~manager_size~0_131, ~client~0.base=v_~client~0.base_85} OutVars{~client_back~0=v_~client_back~0_122, ~client~0.offset=v_~client~0.offset_85, ~manager~0.offset=v_~manager~0.offset_150, ~ok~0=v_~ok~0_137, ~manager~0.base=v_~manager~0.base_150, ~manager_back~0=v_~manager_back~0_219, thread1Thread1of1ForFork0_#t~post11#1=|v_thread1Thread1of1ForFork0_#t~post11#1_15|, thread1Thread1of1ForFork0_#t~short8#1=|v_thread1Thread1of1ForFork0_#t~short8#1_41|, ~manager_front~0=v_~manager_front~0_224, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_86|, thread1Thread1of1ForFork0_#t~mem10#1=|v_thread1Thread1of1ForFork0_#t~mem10#1_15|, ~safe~0=v_~safe~0_271, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_86|, #memory_int=|v_#memory_int_345|, ~client_size~0=v_~client_size~0_88, ~manager_size~0=v_~manager_size~0_131, thread1Thread1of1ForFork0_#t~post9#1=|v_thread1Thread1of1ForFork0_#t~post9#1_41|, ~client~0.base=v_~client~0.base_85} AuxVars[|v_thread1_#t~short8#1_134|, |v_thread1_#t~short8#1_133|, |v_thread1_#t~mem7#1_79|] AssignedVars[~manager_front~0, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~client_back~0, thread1Thread1of1ForFork0_#t~mem10#1, ~safe~0, thread1Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post9#1, thread1Thread1of1ForFork0_#t~post11#1, thread1Thread1of1ForFork0_#t~short8#1] [2022-12-06 05:33:55,027 WARN L322 ript$VariableManager]: TermVariable LBE544 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:33:55,028 WARN L322 ript$VariableManager]: TermVariable LBE566 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:33:55,028 WARN L322 ript$VariableManager]: TermVariable LBE135 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:33:55,028 WARN L322 ript$VariableManager]: TermVariable LBE552 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:33:55,028 WARN L322 ript$VariableManager]: TermVariable LBE55 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:33:55,028 WARN L322 ript$VariableManager]: TermVariable LBE563 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:33:55,028 WARN L322 ript$VariableManager]: TermVariable LBE144 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:33:55,028 WARN L322 ript$VariableManager]: TermVariable LBE43 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:33:55,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 05:33:55,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-06 05:33:55,230 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Function c_aux_v_thread2_#t~mem13#1_59 is already defined. at de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.declareFun(Scriptor.java:115) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.declareFun(HistoryRecordingScript.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.declareFun(ManagedScript.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:117) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:90) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:324) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToTransFormula(BranchEncoderRenaming.java:114) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToIcfgEdge(BranchEncoderRenaming.java:134) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:119) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:1) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:67) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.executeComposition(SequenceRule.java:724) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.applyInternal(SequenceRule.java:150) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:80) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.sequenceRuleWrapper(LiptonReduction.java:252) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:199) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.(LiptonReduction.java:143) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.PetriNetLargeBlockEncoding.(PetriNetLargeBlockEncoding.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:106) 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 05:33:55,232 INFO L158 Benchmark]: Toolchain (without parser) took 436118.59ms. Allocated memory was 179.3MB in the beginning and 434.1MB in the end (delta: 254.8MB). Free memory was 155.2MB in the beginning and 193.1MB in the end (delta: -37.9MB). Peak memory consumption was 269.5MB. Max. memory is 8.0GB. [2022-12-06 05:33:55,232 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 179.3MB. Free memory was 155.7MB in the beginning and 155.6MB in the end (delta: 73.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:33:55,233 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.09ms. Allocated memory is still 179.3MB. Free memory was 154.4MB in the beginning and 140.2MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 05:33:55,233 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.29ms. Allocated memory is still 179.3MB. Free memory was 140.2MB in the beginning and 137.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 05:33:55,233 INFO L158 Benchmark]: Boogie Preprocessor took 36.01ms. Allocated memory is still 179.3MB. Free memory was 137.6MB in the beginning and 135.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:33:55,233 INFO L158 Benchmark]: RCFGBuilder took 642.30ms. Allocated memory is still 179.3MB. Free memory was 135.5MB in the beginning and 85.7MB in the end (delta: 49.8MB). Peak memory consumption was 49.3MB. Max. memory is 8.0GB. [2022-12-06 05:33:55,233 INFO L158 Benchmark]: TraceAbstraction took 435113.83ms. Allocated memory was 179.3MB in the beginning and 434.1MB in the end (delta: 254.8MB). Free memory was 85.2MB in the beginning and 193.1MB in the end (delta: -107.9MB). Peak memory consumption was 199.2MB. Max. memory is 8.0GB. [2022-12-06 05:33:55,234 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.09ms. Allocated memory is still 179.3MB. Free memory was 155.7MB in the beginning and 155.6MB in the end (delta: 73.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 262.09ms. Allocated memory is still 179.3MB. Free memory was 154.4MB in the beginning and 140.2MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.29ms. Allocated memory is still 179.3MB. Free memory was 140.2MB in the beginning and 137.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.01ms. Allocated memory is still 179.3MB. Free memory was 137.6MB in the beginning and 135.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 642.30ms. Allocated memory is still 179.3MB. Free memory was 135.5MB in the beginning and 85.7MB in the end (delta: 49.8MB). Peak memory consumption was 49.3MB. Max. memory is 8.0GB. * TraceAbstraction took 435113.83ms. Allocated memory was 179.3MB in the beginning and 434.1MB in the end (delta: 254.8MB). Free memory was 85.2MB in the beginning and 193.1MB in the end (delta: -107.9MB). Peak memory consumption was 199.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.3s, 212 PlacesBefore, 34 PlacesAfterwards, 221 TransitionsBefore, 30 TransitionsAfterwards, 1266 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 151 TrivialYvCompositions, 27 ConcurrentYvCompositions, 13 ChoiceCompositions, 191 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 734, independent: 704, independent conditional: 704, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 734, independent: 704, independent conditional: 0, independent unconditional: 704, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 734, independent: 704, independent conditional: 0, independent unconditional: 704, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 734, independent: 704, independent conditional: 0, independent unconditional: 704, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 644, independent: 625, independent conditional: 0, independent unconditional: 625, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 644, independent: 617, independent conditional: 0, independent unconditional: 617, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 136, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 734, independent: 79, independent conditional: 0, independent unconditional: 79, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 644, unknown conditional: 0, unknown unconditional: 644] , Statistics on independence cache: Total cache size (in pairs): 950, Positive cache size: 931, Positive conditional cache size: 0, Positive unconditional cache size: 931, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 31 PlacesBefore, 31 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 228 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 42, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 42, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 33, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 6, dependent conditional: 1, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 33, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 6, dependent conditional: 1, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 72, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 28, dependent conditional: 5, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 42, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 33, unknown conditional: 1, unknown unconditional: 32] , Statistics on independence cache: Total cache size (in pairs): 33, Positive cache size: 27, Positive conditional cache size: 0, Positive unconditional cache size: 27, Negative cache size: 6, Negative conditional cache size: 1, Negative unconditional cache size: 5, 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: 1.0s, 34 PlacesBefore, 33 PlacesAfterwards, 34 TransitionsBefore, 33 TransitionsAfterwards, 220 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 64, independent: 52, independent conditional: 52, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 64, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 64, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 64, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 64, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 40, Positive cache size: 32, Positive conditional cache size: 0, Positive unconditional cache size: 32, Negative cache size: 8, Negative conditional cache size: 1, Negative unconditional cache size: 7, 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, 33 TransitionsBefore, 33 TransitionsAfterwards, 220 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 19, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 19, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 19, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 19, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 40, Positive cache size: 32, Positive conditional cache size: 0, Positive unconditional cache size: 32, Negative cache size: 8, Negative conditional cache size: 1, Negative unconditional cache size: 7, 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, 36 PlacesBefore, 36 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 222 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 40, Positive cache size: 32, Positive conditional cache size: 0, Positive unconditional cache size: 32, Negative cache size: 8, Negative conditional cache size: 1, Negative unconditional cache size: 7, 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: 2.0s, 41 PlacesBefore, 39 PlacesAfterwards, 36 TransitionsBefore, 34 TransitionsAfterwards, 222 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 40, Positive cache size: 32, Positive conditional cache size: 0, Positive unconditional cache size: 32, Negative cache size: 8, Negative conditional cache size: 1, Negative unconditional cache size: 7, 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, 38 PlacesBefore, 38 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 222 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 40, Positive cache size: 32, Positive conditional cache size: 0, Positive unconditional cache size: 32, Negative cache size: 8, Negative conditional cache size: 1, Negative unconditional cache size: 7, 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, 38 PlacesBefore, 38 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 162 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 45, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 8, Negative conditional cache size: 1, Negative unconditional cache size: 7, 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: 1.6s, 43 PlacesBefore, 41 PlacesAfterwards, 35 TransitionsBefore, 33 TransitionsAfterwards, 162 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 50, Positive cache size: 42, Positive conditional cache size: 0, Positive unconditional cache size: 42, Negative cache size: 8, Negative conditional cache size: 1, Negative unconditional cache size: 7, 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, 41 PlacesBefore, 41 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 232 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 50, Positive cache size: 42, Positive conditional cache size: 0, Positive unconditional cache size: 42, Negative cache size: 8, Negative conditional cache size: 1, Negative unconditional cache size: 7, 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.4s, 49 PlacesBefore, 48 PlacesAfterwards, 41 TransitionsBefore, 40 TransitionsAfterwards, 232 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 50, Positive cache size: 42, Positive conditional cache size: 0, Positive unconditional cache size: 42, Negative cache size: 8, Negative conditional cache size: 1, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - ExceptionOrErrorResult: SMTLIBException: Function c_aux_v_thread2_#t~mem13#1_59 is already defined. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Function c_aux_v_thread2_#t~mem13#1_59 is already defined.: de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 05:33:55,463 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-12-06 05:33:55,518 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 137 Received shutdown request...