/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-multiply-verify.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 00:19:53,355 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 00:19:53,356 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 00:19:53,387 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 00:19:53,387 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 00:19:53,389 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 00:19:53,392 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 00:19:53,396 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 00:19:53,400 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 00:19:53,405 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 00:19:53,405 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 00:19:53,406 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 00:19:53,407 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 00:19:53,407 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 00:19:53,408 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 00:19:53,408 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 00:19:53,409 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 00:19:53,409 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 00:19:53,410 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 00:19:53,411 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 00:19:53,412 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 00:19:53,413 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 00:19:53,413 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 00:19:53,414 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 00:19:53,416 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 00:19:53,417 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 00:19:53,417 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 00:19:53,417 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 00:19:53,418 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 00:19:53,418 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 00:19:53,418 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 00:19:53,420 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 00:19:53,420 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 00:19:53,421 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 00:19:53,421 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 00:19:53,421 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 00:19:53,422 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 00:19:53,422 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 00:19:53,422 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 00:19:53,423 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 00:19:53,423 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 00:19:53,428 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-RepeatedSemanticLbe.epf [2022-12-06 00:19:53,451 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 00:19:53,452 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 00:19:53,453 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 00:19:53,454 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 00:19:53,454 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 00:19:53,454 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 00:19:53,454 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 00:19:53,455 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 00:19:53,455 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 00:19:53,455 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 00:19:53,456 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 00:19:53,456 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 00:19:53,456 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 00:19:53,456 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 00:19:53,456 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 00:19:53,456 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 00:19:53,456 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 00:19:53,456 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 00:19:53,456 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 00:19:53,457 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 00:19:53,457 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 00:19:53,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:19:53,457 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 00:19:53,457 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 00:19:53,457 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 00:19:53,457 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 00:19:53,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 00:19:53,457 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 00:19:53,458 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 00:19:53,752 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 00:19:53,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 00:19:53,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 00:19:53,782 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 00:19:53,782 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 00:19:53,783 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-multiply-verify.wvr.c [2022-12-06 00:19:54,863 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 00:19:55,066 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 00:19:55,068 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-multiply-verify.wvr.c [2022-12-06 00:19:55,075 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a9686fcb/7f06fdfac3074a278f8f7d7e799be24d/FLAG9ba8011c0 [2022-12-06 00:19:55,092 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a9686fcb/7f06fdfac3074a278f8f7d7e799be24d [2022-12-06 00:19:55,094 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 00:19:55,095 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 00:19:55,097 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 00:19:55,097 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 00:19:55,099 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 00:19:55,099 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:19:55" (1/1) ... [2022-12-06 00:19:55,100 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b4f56da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:19:55, skipping insertion in model container [2022-12-06 00:19:55,100 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:19:55" (1/1) ... [2022-12-06 00:19:55,105 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 00:19:55,125 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 00:19:55,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:19:55,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:19:55,261 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:19:55,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:19:55,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:19:55,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:19:55,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:19:55,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:19:55,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:19:55,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:19:55,283 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-more-multiply-verify.wvr.c[3042,3055] [2022-12-06 00:19:55,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:19:55,305 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 00:19:55,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:19:55,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:19:55,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:19:55,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:19:55,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:19:55,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:19:55,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:19:55,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:19:55,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:19:55,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:19:55,339 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-more-multiply-verify.wvr.c[3042,3055] [2022-12-06 00:19:55,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:19:55,361 INFO L208 MainTranslator]: Completed translation [2022-12-06 00:19:55,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:19:55 WrapperNode [2022-12-06 00:19:55,363 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 00:19:55,364 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 00:19:55,364 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 00:19:55,364 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 00:19:55,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:19:55" (1/1) ... [2022-12-06 00:19:55,384 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:19:55" (1/1) ... [2022-12-06 00:19:55,406 INFO L138 Inliner]: procedures = 26, calls = 50, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 179 [2022-12-06 00:19:55,407 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 00:19:55,407 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 00:19:55,407 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 00:19:55,407 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 00:19:55,416 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:19:55" (1/1) ... [2022-12-06 00:19:55,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:19:55" (1/1) ... [2022-12-06 00:19:55,419 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:19:55" (1/1) ... [2022-12-06 00:19:55,419 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:19:55" (1/1) ... [2022-12-06 00:19:55,423 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:19:55" (1/1) ... [2022-12-06 00:19:55,426 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:19:55" (1/1) ... [2022-12-06 00:19:55,428 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:19:55" (1/1) ... [2022-12-06 00:19:55,429 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:19:55" (1/1) ... [2022-12-06 00:19:55,430 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 00:19:55,431 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 00:19:55,431 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 00:19:55,431 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 00:19:55,432 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:19:55" (1/1) ... [2022-12-06 00:19:55,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:19:55,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:19:55,465 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 00:19:55,482 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 00:19:55,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 00:19:55,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 00:19:55,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 00:19:55,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 00:19:55,507 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 00:19:55,507 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 00:19:55,507 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 00:19:55,507 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 00:19:55,507 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 00:19:55,507 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 00:19:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 00:19:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 00:19:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 00:19:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 00:19:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 00:19:55,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 00:19:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 00:19:55,509 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 00:19:55,580 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 00:19:55,582 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 00:19:55,844 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 00:19:55,919 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 00:19:55,920 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 00:19:55,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:19:55 BoogieIcfgContainer [2022-12-06 00:19:55,922 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 00:19:55,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 00:19:55,923 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 00:19:55,926 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 00:19:55,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 12:19:55" (1/3) ... [2022-12-06 00:19:55,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64be0523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:19:55, skipping insertion in model container [2022-12-06 00:19:55,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:19:55" (2/3) ... [2022-12-06 00:19:55,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64be0523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:19:55, skipping insertion in model container [2022-12-06 00:19:55,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:19:55" (3/3) ... [2022-12-06 00:19:55,928 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-multiply-verify.wvr.c [2022-12-06 00:19:55,941 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 00:19:55,941 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 00:19:55,941 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 00:19:56,029 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 00:19:56,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 144 transitions, 312 flow [2022-12-06 00:19:56,143 INFO L130 PetriNetUnfolder]: 9/141 cut-off events. [2022-12-06 00:19:56,144 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:19:56,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 9/141 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 86 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 107. Up to 2 conditions per place. [2022-12-06 00:19:56,149 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 144 transitions, 312 flow [2022-12-06 00:19:56,155 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 131 transitions, 280 flow [2022-12-06 00:19:56,157 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:19:56,176 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 131 transitions, 280 flow [2022-12-06 00:19:56,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 131 transitions, 280 flow [2022-12-06 00:19:56,220 INFO L130 PetriNetUnfolder]: 9/131 cut-off events. [2022-12-06 00:19:56,220 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:19:56,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 131 events. 9/131 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 85 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 107. Up to 2 conditions per place. [2022-12-06 00:19:56,223 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 131 transitions, 280 flow [2022-12-06 00:19:56,223 INFO L188 LiptonReduction]: Number of co-enabled transitions 1464 [2022-12-06 00:20:00,653 INFO L203 LiptonReduction]: Total number of compositions: 109 [2022-12-06 00:20:00,664 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 00:20:00,669 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;@2f4de926, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 00:20:00,669 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 00:20:00,673 INFO L130 PetriNetUnfolder]: 3/21 cut-off events. [2022-12-06 00:20:00,673 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:20:00,673 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:00,674 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 00:20:00,674 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 00:20:00,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:00,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1581976625, now seen corresponding path program 1 times [2022-12-06 00:20:00,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:00,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034376212] [2022-12-06 00:20:00,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:00,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:00,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:00,986 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 00:20:00,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:00,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034376212] [2022-12-06 00:20:00,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034376212] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:00,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:00,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:20:00,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654026945] [2022-12-06 00:20:00,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:00,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:20:00,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:01,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:20:01,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:20:01,025 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 00:20:01,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 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 00:20:01,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:01,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 00:20:01,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:01,127 INFO L130 PetriNetUnfolder]: 169/271 cut-off events. [2022-12-06 00:20:01,127 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-12-06 00:20:01,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 596 conditions, 271 events. 169/271 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 668 event pairs, 108 based on Foata normal form. 8/235 useless extension candidates. Maximal degree in co-relation 372. Up to 217 conditions per place. [2022-12-06 00:20:01,130 INFO L137 encePairwiseOnDemand]: 16/22 looper letters, 21 selfloop transitions, 2 changer transitions 11/34 dead transitions. [2022-12-06 00:20:01,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 34 transitions, 163 flow [2022-12-06 00:20:01,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:20:01,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:20:01,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-06 00:20:01,138 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42045454545454547 [2022-12-06 00:20:01,139 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 62 flow. Second operand 4 states and 37 transitions. [2022-12-06 00:20:01,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 34 transitions, 163 flow [2022-12-06 00:20:01,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 34 transitions, 145 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 00:20:01,143 INFO L231 Difference]: Finished difference. Result has 28 places, 23 transitions, 68 flow [2022-12-06 00:20:01,145 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=68, PETRI_PLACES=28, PETRI_TRANSITIONS=23} [2022-12-06 00:20:01,148 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, -1 predicate places. [2022-12-06 00:20:01,148 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:01,149 INFO L89 Accepts]: Start accepts. Operand has 28 places, 23 transitions, 68 flow [2022-12-06 00:20:01,151 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:01,152 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:01,152 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 23 transitions, 68 flow [2022-12-06 00:20:01,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 23 transitions, 68 flow [2022-12-06 00:20:01,158 INFO L130 PetriNetUnfolder]: 8/38 cut-off events. [2022-12-06 00:20:01,158 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:20:01,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 38 events. 8/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 67 event pairs, 5 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 53. Up to 13 conditions per place. [2022-12-06 00:20:01,159 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 23 transitions, 68 flow [2022-12-06 00:20:01,159 INFO L188 LiptonReduction]: Number of co-enabled transitions 94 [2022-12-06 00:20:02,302 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:20:02,305 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1157 [2022-12-06 00:20:02,305 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 22 transitions, 64 flow [2022-12-06 00:20:02,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 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 00:20:02,306 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:02,306 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 00:20:02,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 00:20:02,310 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 00:20:02,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:02,310 INFO L85 PathProgramCache]: Analyzing trace with hash 18405854, now seen corresponding path program 1 times [2022-12-06 00:20:02,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:02,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361426144] [2022-12-06 00:20:02,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:02,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:02,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:02,609 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 00:20:02,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:02,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361426144] [2022-12-06 00:20:02,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361426144] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:02,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:02,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:20:02,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621375653] [2022-12-06 00:20:02,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:02,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:20:02,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:02,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:20:02,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:20:02,624 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 00:20:02,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 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 00:20:02,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:02,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 00:20:02,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:02,710 INFO L130 PetriNetUnfolder]: 212/344 cut-off events. [2022-12-06 00:20:02,710 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2022-12-06 00:20:02,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 821 conditions, 344 events. 212/344 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 966 event pairs, 141 based on Foata normal form. 26/368 useless extension candidates. Maximal degree in co-relation 812. Up to 217 conditions per place. [2022-12-06 00:20:02,712 INFO L137 encePairwiseOnDemand]: 18/22 looper letters, 21 selfloop transitions, 2 changer transitions 17/40 dead transitions. [2022-12-06 00:20:02,712 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 40 transitions, 193 flow [2022-12-06 00:20:02,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:20:02,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:20:02,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-06 00:20:02,713 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4659090909090909 [2022-12-06 00:20:02,713 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 64 flow. Second operand 4 states and 41 transitions. [2022-12-06 00:20:02,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 40 transitions, 193 flow [2022-12-06 00:20:02,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 40 transitions, 181 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 00:20:02,714 INFO L231 Difference]: Finished difference. Result has 29 places, 23 transitions, 70 flow [2022-12-06 00:20:02,715 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=70, PETRI_PLACES=29, PETRI_TRANSITIONS=23} [2022-12-06 00:20:02,715 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places. [2022-12-06 00:20:02,715 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:02,715 INFO L89 Accepts]: Start accepts. Operand has 29 places, 23 transitions, 70 flow [2022-12-06 00:20:02,716 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:02,716 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:02,716 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 23 transitions, 70 flow [2022-12-06 00:20:02,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 23 transitions, 70 flow [2022-12-06 00:20:02,720 INFO L130 PetriNetUnfolder]: 8/38 cut-off events. [2022-12-06 00:20:02,720 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 00:20:02,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 38 events. 8/38 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 67 event pairs, 5 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 57. Up to 13 conditions per place. [2022-12-06 00:20:02,721 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 23 transitions, 70 flow [2022-12-06 00:20:02,721 INFO L188 LiptonReduction]: Number of co-enabled transitions 94 [2022-12-06 00:20:03,687 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:20:03,688 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 973 [2022-12-06 00:20:03,688 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 22 transitions, 66 flow [2022-12-06 00:20:03,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 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 00:20:03,689 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:03,689 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 00:20:03,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 00:20:03,689 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 00:20:03,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:03,689 INFO L85 PathProgramCache]: Analyzing trace with hash -826066017, now seen corresponding path program 1 times [2022-12-06 00:20:03,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:03,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646501356] [2022-12-06 00:20:03,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:03,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:03,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:05,158 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 00:20:05,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:05,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646501356] [2022-12-06 00:20:05,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646501356] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:05,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:05,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 00:20:05,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778855675] [2022-12-06 00:20:05,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:05,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 00:20:05,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:05,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 00:20:05,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-06 00:20:05,160 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 00:20:05,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 22 transitions, 66 flow. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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 00:20:05,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:05,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 00:20:05,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:05,919 INFO L130 PetriNetUnfolder]: 386/662 cut-off events. [2022-12-06 00:20:05,919 INFO L131 PetriNetUnfolder]: For 282/282 co-relation queries the response was YES. [2022-12-06 00:20:05,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1670 conditions, 662 events. 386/662 cut-off events. For 282/282 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2574 event pairs, 165 based on Foata normal form. 13/673 useless extension candidates. Maximal degree in co-relation 1660. Up to 217 conditions per place. [2022-12-06 00:20:05,924 INFO L137 encePairwiseOnDemand]: 10/22 looper letters, 94 selfloop transitions, 16 changer transitions 9/119 dead transitions. [2022-12-06 00:20:05,924 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 119 transitions, 571 flow [2022-12-06 00:20:05,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 00:20:05,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 00:20:05,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 122 transitions. [2022-12-06 00:20:05,925 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5041322314049587 [2022-12-06 00:20:05,926 INFO L175 Difference]: Start difference. First operand has 27 places, 22 transitions, 66 flow. Second operand 11 states and 122 transitions. [2022-12-06 00:20:05,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 119 transitions, 571 flow [2022-12-06 00:20:05,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 119 transitions, 547 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-06 00:20:05,928 INFO L231 Difference]: Finished difference. Result has 42 places, 38 transitions, 194 flow [2022-12-06 00:20:05,928 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=194, PETRI_PLACES=42, PETRI_TRANSITIONS=38} [2022-12-06 00:20:05,929 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 13 predicate places. [2022-12-06 00:20:05,929 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:05,929 INFO L89 Accepts]: Start accepts. Operand has 42 places, 38 transitions, 194 flow [2022-12-06 00:20:05,930 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:05,930 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:05,930 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 38 transitions, 194 flow [2022-12-06 00:20:05,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 38 transitions, 194 flow [2022-12-06 00:20:05,942 INFO L130 PetriNetUnfolder]: 30/132 cut-off events. [2022-12-06 00:20:05,942 INFO L131 PetriNetUnfolder]: For 129/144 co-relation queries the response was YES. [2022-12-06 00:20:05,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 132 events. 30/132 cut-off events. For 129/144 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 604 event pairs, 10 based on Foata normal form. 2/123 useless extension candidates. Maximal degree in co-relation 337. Up to 47 conditions per place. [2022-12-06 00:20:05,943 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 38 transitions, 194 flow [2022-12-06 00:20:05,943 INFO L188 LiptonReduction]: Number of co-enabled transitions 218 [2022-12-06 00:20:08,588 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [556] $Ultimate##0-->L51-5: Formula: (and (= |v_thread1Thread1of1ForFork2_~x~0#1_19| 0) (= |v_thread1Thread1of1ForFork2_~i~0#1_23| 0)) InVars {} OutVars{thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_19|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_23|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] and [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] [2022-12-06 00:20:09,011 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:20:09,012 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3083 [2022-12-06 00:20:09,012 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 36 transitions, 193 flow [2022-12-06 00:20:09,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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 00:20:09,012 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:09,012 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:09,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 00:20:09,013 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 00:20:09,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:09,015 INFO L85 PathProgramCache]: Analyzing trace with hash -925002003, now seen corresponding path program 1 times [2022-12-06 00:20:09,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:09,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064403843] [2022-12-06 00:20:09,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:09,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:09,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:10,163 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 00:20:10,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:10,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064403843] [2022-12-06 00:20:10,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064403843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:10,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:10,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:20:10,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980674056] [2022-12-06 00:20:10,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:10,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:20:10,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:10,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:20:10,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:20:10,165 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 00:20:10,165 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 193 flow. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:10,165 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:10,165 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 00:20:10,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:10,920 INFO L130 PetriNetUnfolder]: 567/978 cut-off events. [2022-12-06 00:20:10,920 INFO L131 PetriNetUnfolder]: For 2234/2234 co-relation queries the response was YES. [2022-12-06 00:20:10,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3689 conditions, 978 events. 567/978 cut-off events. For 2234/2234 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4438 event pairs, 174 based on Foata normal form. 1/964 useless extension candidates. Maximal degree in co-relation 3650. Up to 334 conditions per place. [2022-12-06 00:20:10,927 INFO L137 encePairwiseOnDemand]: 16/28 looper letters, 74 selfloop transitions, 20 changer transitions 12/106 dead transitions. [2022-12-06 00:20:10,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 106 transitions, 717 flow [2022-12-06 00:20:10,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:20:10,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:20:10,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2022-12-06 00:20:10,928 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 00:20:10,928 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 193 flow. Second operand 7 states and 98 transitions. [2022-12-06 00:20:10,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 106 transitions, 717 flow [2022-12-06 00:20:10,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 106 transitions, 659 flow, removed 29 selfloop flow, removed 3 redundant places. [2022-12-06 00:20:10,935 INFO L231 Difference]: Finished difference. Result has 47 places, 50 transitions, 353 flow [2022-12-06 00:20:10,935 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=353, PETRI_PLACES=47, PETRI_TRANSITIONS=50} [2022-12-06 00:20:10,936 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 18 predicate places. [2022-12-06 00:20:10,936 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:10,936 INFO L89 Accepts]: Start accepts. Operand has 47 places, 50 transitions, 353 flow [2022-12-06 00:20:10,936 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:10,936 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:10,937 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 50 transitions, 353 flow [2022-12-06 00:20:10,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 50 transitions, 353 flow [2022-12-06 00:20:10,955 INFO L130 PetriNetUnfolder]: 62/237 cut-off events. [2022-12-06 00:20:10,955 INFO L131 PetriNetUnfolder]: For 556/593 co-relation queries the response was YES. [2022-12-06 00:20:10,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 782 conditions, 237 events. 62/237 cut-off events. For 556/593 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1355 event pairs, 13 based on Foata normal form. 1/218 useless extension candidates. Maximal degree in co-relation 750. Up to 70 conditions per place. [2022-12-06 00:20:10,957 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 50 transitions, 353 flow [2022-12-06 00:20:10,957 INFO L188 LiptonReduction]: Number of co-enabled transitions 298 [2022-12-06 00:20:10,958 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:20:10,958 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 00:20:10,958 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 50 transitions, 353 flow [2022-12-06 00:20:10,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:10,959 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:10,959 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:10,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 00:20:10,959 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 00:20:10,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:10,959 INFO L85 PathProgramCache]: Analyzing trace with hash 28389899, now seen corresponding path program 1 times [2022-12-06 00:20:10,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:10,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442492624] [2022-12-06 00:20:10,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:10,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:11,043 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 00:20:11,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:11,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442492624] [2022-12-06 00:20:11,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442492624] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:11,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:11,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:20:11,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10066695] [2022-12-06 00:20:11,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:11,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:20:11,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:11,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:20:11,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:20:11,048 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 00:20:11,048 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 50 transitions, 353 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:11,048 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:11,048 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 00:20:11,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:11,188 INFO L130 PetriNetUnfolder]: 345/647 cut-off events. [2022-12-06 00:20:11,188 INFO L131 PetriNetUnfolder]: For 3209/3209 co-relation queries the response was YES. [2022-12-06 00:20:11,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2674 conditions, 647 events. 345/647 cut-off events. For 3209/3209 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2881 event pairs, 72 based on Foata normal form. 80/726 useless extension candidates. Maximal degree in co-relation 2638. Up to 287 conditions per place. [2022-12-06 00:20:11,191 INFO L137 encePairwiseOnDemand]: 20/28 looper letters, 45 selfloop transitions, 20 changer transitions 2/67 dead transitions. [2022-12-06 00:20:11,192 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 67 transitions, 553 flow [2022-12-06 00:20:11,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:20:11,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:20:11,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-12-06 00:20:11,193 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4107142857142857 [2022-12-06 00:20:11,193 INFO L175 Difference]: Start difference. First operand has 45 places, 50 transitions, 353 flow. Second operand 4 states and 46 transitions. [2022-12-06 00:20:11,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 67 transitions, 553 flow [2022-12-06 00:20:11,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 67 transitions, 549 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 00:20:11,201 INFO L231 Difference]: Finished difference. Result has 49 places, 49 transitions, 401 flow [2022-12-06 00:20:11,202 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=401, PETRI_PLACES=49, PETRI_TRANSITIONS=49} [2022-12-06 00:20:11,203 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 20 predicate places. [2022-12-06 00:20:11,203 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:11,204 INFO L89 Accepts]: Start accepts. Operand has 49 places, 49 transitions, 401 flow [2022-12-06 00:20:11,204 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:11,205 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:11,205 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 49 transitions, 401 flow [2022-12-06 00:20:11,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 49 transitions, 401 flow [2022-12-06 00:20:11,216 INFO L130 PetriNetUnfolder]: 25/141 cut-off events. [2022-12-06 00:20:11,216 INFO L131 PetriNetUnfolder]: For 441/486 co-relation queries the response was YES. [2022-12-06 00:20:11,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 481 conditions, 141 events. 25/141 cut-off events. For 441/486 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 692 event pairs, 0 based on Foata normal form. 2/136 useless extension candidates. Maximal degree in co-relation 388. Up to 31 conditions per place. [2022-12-06 00:20:11,217 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 49 transitions, 401 flow [2022-12-06 00:20:11,218 INFO L188 LiptonReduction]: Number of co-enabled transitions 276 [2022-12-06 00:20:11,219 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:20:11,219 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 00:20:11,219 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 49 transitions, 401 flow [2022-12-06 00:20:11,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:11,219 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:11,220 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:11,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 00:20:11,220 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 00:20:11,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:11,220 INFO L85 PathProgramCache]: Analyzing trace with hash 916594246, now seen corresponding path program 1 times [2022-12-06 00:20:11,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:11,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448472445] [2022-12-06 00:20:11,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:11,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:11,270 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 00:20:11,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:11,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448472445] [2022-12-06 00:20:11,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448472445] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:11,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:11,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:20:11,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137278741] [2022-12-06 00:20:11,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:11,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:20:11,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:11,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:20:11,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:20:11,274 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 00:20:11,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 49 transitions, 401 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:11,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:11,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 00:20:11,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:11,364 INFO L130 PetriNetUnfolder]: 279/537 cut-off events. [2022-12-06 00:20:11,364 INFO L131 PetriNetUnfolder]: For 3139/3139 co-relation queries the response was YES. [2022-12-06 00:20:11,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2506 conditions, 537 events. 279/537 cut-off events. For 3139/3139 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2253 event pairs, 153 based on Foata normal form. 30/566 useless extension candidates. Maximal degree in co-relation 2045. Up to 433 conditions per place. [2022-12-06 00:20:11,368 INFO L137 encePairwiseOnDemand]: 24/27 looper letters, 57 selfloop transitions, 1 changer transitions 1/59 dead transitions. [2022-12-06 00:20:11,368 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 59 transitions, 569 flow [2022-12-06 00:20:11,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:20:11,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:20:11,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-12-06 00:20:11,370 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2022-12-06 00:20:11,370 INFO L175 Difference]: Start difference. First operand has 47 places, 49 transitions, 401 flow. Second operand 3 states and 42 transitions. [2022-12-06 00:20:11,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 59 transitions, 569 flow [2022-12-06 00:20:11,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 59 transitions, 518 flow, removed 20 selfloop flow, removed 4 redundant places. [2022-12-06 00:20:11,377 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 330 flow [2022-12-06 00:20:11,377 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2022-12-06 00:20:11,379 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 17 predicate places. [2022-12-06 00:20:11,379 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:11,379 INFO L89 Accepts]: Start accepts. Operand has 46 places, 45 transitions, 330 flow [2022-12-06 00:20:11,380 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:11,380 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:11,380 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 45 transitions, 330 flow [2022-12-06 00:20:11,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 45 transitions, 330 flow [2022-12-06 00:20:11,390 INFO L130 PetriNetUnfolder]: 19/124 cut-off events. [2022-12-06 00:20:11,390 INFO L131 PetriNetUnfolder]: For 359/389 co-relation queries the response was YES. [2022-12-06 00:20:11,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 380 conditions, 124 events. 19/124 cut-off events. For 359/389 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 585 event pairs, 0 based on Foata normal form. 2/120 useless extension candidates. Maximal degree in co-relation 269. Up to 24 conditions per place. [2022-12-06 00:20:11,391 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 45 transitions, 330 flow [2022-12-06 00:20:11,391 INFO L188 LiptonReduction]: Number of co-enabled transitions 240 [2022-12-06 00:20:11,406 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [601] L102-4-->L103-3: Formula: (and (= (store |v_#memory_int_149| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_149| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre16#1_29|)) |v_#memory_int_148|) (= |v_#pthreadsForks_52| (+ |v_#pthreadsForks_53| 1)) (= |v_ULTIMATE.start_main_#t~pre16#1_29| |v_#pthreadsForks_53|)) InVars {#pthreadsForks=|v_#pthreadsForks_53|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{#pthreadsForks=|v_#pthreadsForks_52|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_41|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #memory_int=|v_#memory_int_148|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_29|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_23|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~pre14#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet15#1] [2022-12-06 00:20:11,574 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [615] $Ultimate##0-->thread1EXIT: Formula: (and (not (= (ite (and (<= 0 v_~end~0_195) (< v_~end~0_195 v_~n~0_121)) 1 0) 0)) (= |v_thread1Thread1of1ForFork2_~x~0#1_41| 0) (= |v_thread1Thread1of1ForFork2_#res#1.offset_17| 0) (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_41| 4294967296) (mod (select (select |v_#memory_int_178| v_~queue~0.base_111) (+ (* v_~end~0_195 4) v_~queue~0.offset_111)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_19|) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_37| 4294967296) (mod v_~A~0_73 4294967296))) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_19| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_19|) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_19| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.base_17| 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= |v_thread1Thread1of1ForFork2_~i~0#1_37| 0)) InVars {~queue~0.offset=v_~queue~0.offset_111, ~A~0=v_~A~0_73, #memory_int=|v_#memory_int_178|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_111, ~n~0=v_~n~0_121} OutVars{~queue~0.offset=v_~queue~0.offset_111, ~A~0=v_~A~0_73, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_41|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_19|, ~queue~0.base=v_~queue~0.base_111, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_19|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_37|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_19|, #memory_int=|v_#memory_int_178|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_17|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_121, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_17|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_19|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [601] L102-4-->L103-3: Formula: (and (= (store |v_#memory_int_149| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_149| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre16#1_29|)) |v_#memory_int_148|) (= |v_#pthreadsForks_52| (+ |v_#pthreadsForks_53| 1)) (= |v_ULTIMATE.start_main_#t~pre16#1_29| |v_#pthreadsForks_53|)) InVars {#pthreadsForks=|v_#pthreadsForks_53|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{#pthreadsForks=|v_#pthreadsForks_52|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_41|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #memory_int=|v_#memory_int_148|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_29|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_23|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~pre14#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet15#1] [2022-12-06 00:20:11,721 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [601] L102-4-->L103-3: Formula: (and (= (store |v_#memory_int_149| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_149| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre16#1_29|)) |v_#memory_int_148|) (= |v_#pthreadsForks_52| (+ |v_#pthreadsForks_53| 1)) (= |v_ULTIMATE.start_main_#t~pre16#1_29| |v_#pthreadsForks_53|)) InVars {#pthreadsForks=|v_#pthreadsForks_53|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{#pthreadsForks=|v_#pthreadsForks_52|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_41|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #memory_int=|v_#memory_int_148|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_29|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_23|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~pre14#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet15#1] [2022-12-06 00:20:11,901 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:20:11,901 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 522 [2022-12-06 00:20:11,901 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 44 transitions, 332 flow [2022-12-06 00:20:11,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:11,902 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:11,902 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:11,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 00:20:11,902 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 00:20:11,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:11,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1821594130, now seen corresponding path program 1 times [2022-12-06 00:20:11,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:11,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128589701] [2022-12-06 00:20:11,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:11,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:12,921 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 00:20:12,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:12,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128589701] [2022-12-06 00:20:12,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128589701] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:12,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:12,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:20:12,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075396019] [2022-12-06 00:20:12,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:12,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:20:12,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:12,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:20:12,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:20:12,922 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 00:20:12,922 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 44 transitions, 332 flow. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:12,922 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:12,922 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 00:20:12,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:13,194 INFO L130 PetriNetUnfolder]: 252/466 cut-off events. [2022-12-06 00:20:13,195 INFO L131 PetriNetUnfolder]: For 1652/1652 co-relation queries the response was YES. [2022-12-06 00:20:13,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1938 conditions, 466 events. 252/466 cut-off events. For 1652/1652 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1803 event pairs, 93 based on Foata normal form. 1/466 useless extension candidates. Maximal degree in co-relation 1680. Up to 349 conditions per place. [2022-12-06 00:20:13,197 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 45 selfloop transitions, 11 changer transitions 23/79 dead transitions. [2022-12-06 00:20:13,197 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 79 transitions, 604 flow [2022-12-06 00:20:13,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:20:13,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:20:13,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-12-06 00:20:13,198 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33163265306122447 [2022-12-06 00:20:13,198 INFO L175 Difference]: Start difference. First operand has 45 places, 44 transitions, 332 flow. Second operand 7 states and 65 transitions. [2022-12-06 00:20:13,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 79 transitions, 604 flow [2022-12-06 00:20:13,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 79 transitions, 581 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-06 00:20:13,201 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 349 flow [2022-12-06 00:20:13,201 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=349, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2022-12-06 00:20:13,202 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 24 predicate places. [2022-12-06 00:20:13,202 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:13,202 INFO L89 Accepts]: Start accepts. Operand has 53 places, 45 transitions, 349 flow [2022-12-06 00:20:13,202 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:13,202 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:13,203 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 45 transitions, 349 flow [2022-12-06 00:20:13,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 45 transitions, 349 flow [2022-12-06 00:20:13,211 INFO L130 PetriNetUnfolder]: 18/103 cut-off events. [2022-12-06 00:20:13,211 INFO L131 PetriNetUnfolder]: For 298/313 co-relation queries the response was YES. [2022-12-06 00:20:13,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336 conditions, 103 events. 18/103 cut-off events. For 298/313 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 428 event pairs, 0 based on Foata normal form. 2/102 useless extension candidates. Maximal degree in co-relation 311. Up to 19 conditions per place. [2022-12-06 00:20:13,212 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 45 transitions, 349 flow [2022-12-06 00:20:13,212 INFO L188 LiptonReduction]: Number of co-enabled transitions 240 [2022-12-06 00:20:13,214 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:20:13,437 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [613] $Ultimate##0-->thread2EXIT: Formula: (and (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_23| 0)) (= |v_thread1Thread1of1ForFork2_~x~0#1_35| 0) (not (= (ite (and (<= 0 v_~end~0_191) (< v_~end~0_191 v_~n~0_119)) 1 0) 0)) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_39| 4294967296) (mod v_~A~0_69 4294967296))) (= |v_thread2Thread1of1ForFork0_#res#1.base_13| 0) (= (ite (= (mod (select (select |v_#memory_int_176| v_~queue~0.base_109) (+ (* v_~end~0_191 4) v_~queue~0.offset_109)) 4294967296) (mod |v_thread2Thread1of1ForFork0_~x~1#1_37| 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_23|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_23|) (= |v_thread1Thread1of1ForFork2_~i~0#1_31| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_13| 0) (= v_~end~0_190 (+ v_~end~0_191 1))) InVars {~queue~0.offset=v_~queue~0.offset_109, ~A~0=v_~A~0_69, #memory_int=|v_#memory_int_176|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_39|, ~end~0=v_~end~0_191, ~queue~0.base=v_~queue~0.base_109, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_37|, ~n~0=v_~n~0_119} OutVars{~queue~0.offset=v_~queue~0.offset_109, ~A~0=v_~A~0_69, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_35|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_13|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_39|, ~queue~0.base=v_~queue~0.base_109, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_13|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_31|, #memory_int=|v_#memory_int_176|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_23|, ~end~0=v_~end~0_190, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_37|, ~n~0=v_~n~0_119, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [600] L51-5-->L51-5: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_~i~0#1_28| 1) |v_thread1Thread1of1ForFork2_~i~0#1_27|) (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_28| 4294967296) (mod v_~A~0_57 4294967296)) (= |v_thread1Thread1of1ForFork2_~x~0#1_31| (+ |v_thread1Thread1of1ForFork2_~x~0#1_32| v_~B~0_47))) InVars {~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_32|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_28|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_15|, ~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_31|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] [2022-12-06 00:20:13,523 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [619] $Ultimate##0-->L103-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre16#1_55| |v_#pthreadsForks_89|) (= |v_thread1Thread1of1ForFork2_#res#1.offset_33| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_35| 0)) (= (store |v_#memory_int_212| |v_ULTIMATE.start_main_~#t2~0#1.base_45| (store (select |v_#memory_int_212| |v_ULTIMATE.start_main_~#t2~0#1.base_45|) |v_ULTIMATE.start_main_~#t2~0#1.offset_43| |v_ULTIMATE.start_main_#t~pre16#1_55|)) |v_#memory_int_211|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_35| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_35|) (= v_~end~0_234 (+ v_~end~0_235 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_35| (ite (= (mod (select (select |v_#memory_int_212| v_~queue~0.base_132) (+ (* v_~end~0_235 4) v_~queue~0.offset_132)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_58| 4294967296)) 1 0)) (not (= (ite (and (<= 0 v_~end~0_235) (< v_~end~0_235 v_~n~0_142)) 1 0) 0)) (= |v_#pthreadsForks_88| (+ |v_#pthreadsForks_89| 1)) (= |v_thread1Thread1of1ForFork2_#res#1.base_33| 0) (= |v_thread1Thread1of1ForFork2_~x~0#1_58| 0) (= |v_thread1Thread1of1ForFork2_~i~0#1_53| 0) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_53| 4294967296) (mod v_~A~0_93 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_132, ~A~0=v_~A~0_93, #pthreadsForks=|v_#pthreadsForks_89|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_43|, #memory_int=|v_#memory_int_212|, ~end~0=v_~end~0_235, ~queue~0.base=v_~queue~0.base_132, ~n~0=v_~n~0_142, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|} OutVars{~queue~0.offset=v_~queue~0.offset_132, ~A~0=v_~A~0_93, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_58|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_43|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_35|, ~queue~0.base=v_~queue~0.base_132, #pthreadsForks=|v_#pthreadsForks_88|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_57|, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_35|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_53|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_35|, #memory_int=|v_#memory_int_211|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_55|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_33|, ~end~0=v_~end~0_234, ~n~0=v_~n~0_142, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_33|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_37|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_35|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_#t~mem2#1, #pthreadsForks, ULTIMATE.start_main_#t~pre14#1, thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, ULTIMATE.start_main_#t~nondet15#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [600] L51-5-->L51-5: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_~i~0#1_28| 1) |v_thread1Thread1of1ForFork2_~i~0#1_27|) (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_28| 4294967296) (mod v_~A~0_57 4294967296)) (= |v_thread1Thread1of1ForFork2_~x~0#1_31| (+ |v_thread1Thread1of1ForFork2_~x~0#1_32| v_~B~0_47))) InVars {~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_32|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_28|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_15|, ~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_31|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] [2022-12-06 00:20:13,546 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [613] $Ultimate##0-->thread2EXIT: Formula: (and (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_23| 0)) (= |v_thread1Thread1of1ForFork2_~x~0#1_35| 0) (not (= (ite (and (<= 0 v_~end~0_191) (< v_~end~0_191 v_~n~0_119)) 1 0) 0)) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_39| 4294967296) (mod v_~A~0_69 4294967296))) (= |v_thread2Thread1of1ForFork0_#res#1.base_13| 0) (= (ite (= (mod (select (select |v_#memory_int_176| v_~queue~0.base_109) (+ (* v_~end~0_191 4) v_~queue~0.offset_109)) 4294967296) (mod |v_thread2Thread1of1ForFork0_~x~1#1_37| 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_23|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_23|) (= |v_thread1Thread1of1ForFork2_~i~0#1_31| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_13| 0) (= v_~end~0_190 (+ v_~end~0_191 1))) InVars {~queue~0.offset=v_~queue~0.offset_109, ~A~0=v_~A~0_69, #memory_int=|v_#memory_int_176|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_39|, ~end~0=v_~end~0_191, ~queue~0.base=v_~queue~0.base_109, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_37|, ~n~0=v_~n~0_119} OutVars{~queue~0.offset=v_~queue~0.offset_109, ~A~0=v_~A~0_69, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_35|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_13|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_23|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_39|, ~queue~0.base=v_~queue~0.base_109, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_13|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_31|, #memory_int=|v_#memory_int_176|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_23|, ~end~0=v_~end~0_190, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_37|, ~n~0=v_~n~0_119, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [600] L51-5-->L51-5: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_~i~0#1_28| 1) |v_thread1Thread1of1ForFork2_~i~0#1_27|) (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_28| 4294967296) (mod v_~A~0_57 4294967296)) (= |v_thread1Thread1of1ForFork2_~x~0#1_31| (+ |v_thread1Thread1of1ForFork2_~x~0#1_32| v_~B~0_47))) InVars {~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_32|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_28|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_15|, ~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_31|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] [2022-12-06 00:20:13,891 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] [2022-12-06 00:20:14,088 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 00:20:14,089 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 887 [2022-12-06 00:20:14,089 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 392 flow [2022-12-06 00:20:14,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:14,089 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:14,089 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:14,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 00:20:14,089 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 00:20:14,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:14,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1281087246, now seen corresponding path program 1 times [2022-12-06 00:20:14,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:14,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120491793] [2022-12-06 00:20:14,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:14,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:14,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:14,680 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 00:20:14,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:14,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120491793] [2022-12-06 00:20:14,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120491793] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:14,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:14,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:20:14,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172825997] [2022-12-06 00:20:14,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:14,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:20:14,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:14,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:20:14,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:20:14,681 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 00:20:14,682 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 392 flow. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 00:20:14,682 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:14,682 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 00:20:14,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:15,038 INFO L130 PetriNetUnfolder]: 242/440 cut-off events. [2022-12-06 00:20:15,038 INFO L131 PetriNetUnfolder]: For 1843/1843 co-relation queries the response was YES. [2022-12-06 00:20:15,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1917 conditions, 440 events. 242/440 cut-off events. For 1843/1843 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1611 event pairs, 117 based on Foata normal form. 1/440 useless extension candidates. Maximal degree in co-relation 1890. Up to 214 conditions per place. [2022-12-06 00:20:15,041 INFO L137 encePairwiseOnDemand]: 24/31 looper letters, 59 selfloop transitions, 4 changer transitions 18/81 dead transitions. [2022-12-06 00:20:15,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 81 transitions, 660 flow [2022-12-06 00:20:15,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:20:15,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:20:15,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-12-06 00:20:15,042 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2022-12-06 00:20:15,042 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 392 flow. Second operand 6 states and 72 transitions. [2022-12-06 00:20:15,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 81 transitions, 660 flow [2022-12-06 00:20:15,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 81 transitions, 588 flow, removed 22 selfloop flow, removed 6 redundant places. [2022-12-06 00:20:15,046 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 270 flow [2022-12-06 00:20:15,046 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=270, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2022-12-06 00:20:15,048 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 25 predicate places. [2022-12-06 00:20:15,048 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:15,048 INFO L89 Accepts]: Start accepts. Operand has 54 places, 40 transitions, 270 flow [2022-12-06 00:20:15,048 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:15,048 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:15,048 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 40 transitions, 270 flow [2022-12-06 00:20:15,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 40 transitions, 270 flow [2022-12-06 00:20:15,056 INFO L130 PetriNetUnfolder]: 18/82 cut-off events. [2022-12-06 00:20:15,057 INFO L131 PetriNetUnfolder]: For 144/155 co-relation queries the response was YES. [2022-12-06 00:20:15,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 82 events. 18/82 cut-off events. For 144/155 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 274 event pairs, 0 based on Foata normal form. 2/81 useless extension candidates. Maximal degree in co-relation 221. Up to 17 conditions per place. [2022-12-06 00:20:15,057 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 40 transitions, 270 flow [2022-12-06 00:20:15,057 INFO L188 LiptonReduction]: Number of co-enabled transitions 218 [2022-12-06 00:20:15,057 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:20:15,059 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 00:20:15,059 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 270 flow [2022-12-06 00:20:15,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 00:20:15,059 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:15,059 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:15,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 00:20:15,059 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 00:20:15,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:15,060 INFO L85 PathProgramCache]: Analyzing trace with hash -507445429, now seen corresponding path program 1 times [2022-12-06 00:20:15,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:15,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53376461] [2022-12-06 00:20:15,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:15,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:15,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:15,115 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 00:20:15,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:15,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53376461] [2022-12-06 00:20:15,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53376461] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:15,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:15,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:20:15,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334120404] [2022-12-06 00:20:15,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:15,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:20:15,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:15,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:20:15,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:20:15,116 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 00:20:15,116 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 270 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:15,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:15,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 00:20:15,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:15,191 INFO L130 PetriNetUnfolder]: 279/510 cut-off events. [2022-12-06 00:20:15,192 INFO L131 PetriNetUnfolder]: For 1495/1495 co-relation queries the response was YES. [2022-12-06 00:20:15,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1981 conditions, 510 events. 279/510 cut-off events. For 1495/1495 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1973 event pairs, 108 based on Foata normal form. 4/513 useless extension candidates. Maximal degree in co-relation 1946. Up to 329 conditions per place. [2022-12-06 00:20:15,195 INFO L137 encePairwiseOnDemand]: 25/28 looper letters, 56 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2022-12-06 00:20:15,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 60 transitions, 496 flow [2022-12-06 00:20:15,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:20:15,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:20:15,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-12-06 00:20:15,195 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-06 00:20:15,195 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 270 flow. Second operand 3 states and 44 transitions. [2022-12-06 00:20:15,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 60 transitions, 496 flow [2022-12-06 00:20:15,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 60 transitions, 473 flow, removed 10 selfloop flow, removed 7 redundant places. [2022-12-06 00:20:15,198 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 267 flow [2022-12-06 00:20:15,198 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=267, PETRI_PLACES=43, PETRI_TRANSITIONS=41} [2022-12-06 00:20:15,199 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 14 predicate places. [2022-12-06 00:20:15,199 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:15,199 INFO L89 Accepts]: Start accepts. Operand has 43 places, 41 transitions, 267 flow [2022-12-06 00:20:15,199 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:15,199 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:15,200 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 41 transitions, 267 flow [2022-12-06 00:20:15,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 41 transitions, 267 flow [2022-12-06 00:20:15,212 INFO L130 PetriNetUnfolder]: 19/104 cut-off events. [2022-12-06 00:20:15,212 INFO L131 PetriNetUnfolder]: For 153/163 co-relation queries the response was YES. [2022-12-06 00:20:15,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287 conditions, 104 events. 19/104 cut-off events. For 153/163 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 428 event pairs, 0 based on Foata normal form. 2/102 useless extension candidates. Maximal degree in co-relation 133. Up to 23 conditions per place. [2022-12-06 00:20:15,212 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 41 transitions, 267 flow [2022-12-06 00:20:15,212 INFO L188 LiptonReduction]: Number of co-enabled transitions 238 [2022-12-06 00:20:15,213 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:20:15,214 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 00:20:15,214 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 267 flow [2022-12-06 00:20:15,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:15,214 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:15,214 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:15,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 00:20:15,214 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 00:20:15,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:15,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1560257784, now seen corresponding path program 1 times [2022-12-06 00:20:15,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:15,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366474275] [2022-12-06 00:20:15,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:15,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:15,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 00:20:15,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:15,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366474275] [2022-12-06 00:20:15,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366474275] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:15,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:15,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:20:15,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033831746] [2022-12-06 00:20:15,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:15,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:20:15,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:15,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:20:15,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:20:15,267 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 00:20:15,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 41 transitions, 267 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:15,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:15,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 00:20:15,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:15,377 INFO L130 PetriNetUnfolder]: 368/663 cut-off events. [2022-12-06 00:20:15,377 INFO L131 PetriNetUnfolder]: For 1700/1700 co-relation queries the response was YES. [2022-12-06 00:20:15,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2618 conditions, 663 events. 368/663 cut-off events. For 1700/1700 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2745 event pairs, 86 based on Foata normal form. 20/682 useless extension candidates. Maximal degree in co-relation 1155. Up to 477 conditions per place. [2022-12-06 00:20:15,381 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 66 selfloop transitions, 8 changer transitions 0/74 dead transitions. [2022-12-06 00:20:15,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 74 transitions, 584 flow [2022-12-06 00:20:15,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:20:15,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:20:15,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-12-06 00:20:15,382 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2022-12-06 00:20:15,382 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 267 flow. Second operand 4 states and 56 transitions. [2022-12-06 00:20:15,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 74 transitions, 584 flow [2022-12-06 00:20:15,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 74 transitions, 574 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 00:20:15,384 INFO L231 Difference]: Finished difference. Result has 48 places, 49 transitions, 367 flow [2022-12-06 00:20:15,385 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=367, PETRI_PLACES=48, PETRI_TRANSITIONS=49} [2022-12-06 00:20:15,385 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 19 predicate places. [2022-12-06 00:20:15,386 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:15,386 INFO L89 Accepts]: Start accepts. Operand has 48 places, 49 transitions, 367 flow [2022-12-06 00:20:15,388 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:15,388 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:15,388 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 49 transitions, 367 flow [2022-12-06 00:20:15,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 49 transitions, 367 flow [2022-12-06 00:20:15,399 INFO L130 PetriNetUnfolder]: 31/138 cut-off events. [2022-12-06 00:20:15,399 INFO L131 PetriNetUnfolder]: For 259/266 co-relation queries the response was YES. [2022-12-06 00:20:15,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 138 events. 31/138 cut-off events. For 259/266 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 623 event pairs, 1 based on Foata normal form. 3/136 useless extension candidates. Maximal degree in co-relation 192. Up to 35 conditions per place. [2022-12-06 00:20:15,401 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 49 transitions, 367 flow [2022-12-06 00:20:15,401 INFO L188 LiptonReduction]: Number of co-enabled transitions 312 [2022-12-06 00:20:15,401 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:20:15,401 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 00:20:15,402 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 49 transitions, 367 flow [2022-12-06 00:20:15,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:15,402 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:15,402 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:15,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 00:20:15,402 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 00:20:15,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:15,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1839844062, now seen corresponding path program 2 times [2022-12-06 00:20:15,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:15,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75630553] [2022-12-06 00:20:15,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:15,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:15,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:15,454 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 00:20:15,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:15,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75630553] [2022-12-06 00:20:15,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75630553] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:15,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:15,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:20:15,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236078957] [2022-12-06 00:20:15,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:15,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:20:15,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:15,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:20:15,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:20:15,456 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 00:20:15,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 49 transitions, 367 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:15,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:15,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 00:20:15,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:15,589 INFO L130 PetriNetUnfolder]: 372/655 cut-off events. [2022-12-06 00:20:15,589 INFO L131 PetriNetUnfolder]: For 2431/2431 co-relation queries the response was YES. [2022-12-06 00:20:15,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2834 conditions, 655 events. 372/655 cut-off events. For 2431/2431 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2599 event pairs, 112 based on Foata normal form. 20/674 useless extension candidates. Maximal degree in co-relation 1355. Up to 403 conditions per place. [2022-12-06 00:20:15,593 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 67 selfloop transitions, 15 changer transitions 0/82 dead transitions. [2022-12-06 00:20:15,593 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 82 transitions, 700 flow [2022-12-06 00:20:15,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:20:15,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:20:15,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-12-06 00:20:15,594 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2022-12-06 00:20:15,595 INFO L175 Difference]: Start difference. First operand has 48 places, 49 transitions, 367 flow. Second operand 4 states and 57 transitions. [2022-12-06 00:20:15,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 82 transitions, 700 flow [2022-12-06 00:20:15,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 82 transitions, 692 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-12-06 00:20:15,599 INFO L231 Difference]: Finished difference. Result has 53 places, 53 transitions, 450 flow [2022-12-06 00:20:15,599 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=450, PETRI_PLACES=53, PETRI_TRANSITIONS=53} [2022-12-06 00:20:15,600 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 24 predicate places. [2022-12-06 00:20:15,600 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:15,600 INFO L89 Accepts]: Start accepts. Operand has 53 places, 53 transitions, 450 flow [2022-12-06 00:20:15,601 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:15,601 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:15,601 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 53 transitions, 450 flow [2022-12-06 00:20:15,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 53 transitions, 450 flow [2022-12-06 00:20:15,615 INFO L130 PetriNetUnfolder]: 34/140 cut-off events. [2022-12-06 00:20:15,615 INFO L131 PetriNetUnfolder]: For 376/385 co-relation queries the response was YES. [2022-12-06 00:20:15,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 140 events. 34/140 cut-off events. For 376/385 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 613 event pairs, 1 based on Foata normal form. 3/139 useless extension candidates. Maximal degree in co-relation 255. Up to 35 conditions per place. [2022-12-06 00:20:15,616 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 53 transitions, 450 flow [2022-12-06 00:20:15,616 INFO L188 LiptonReduction]: Number of co-enabled transitions 342 [2022-12-06 00:20:15,616 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:20:15,617 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 00:20:15,617 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 53 transitions, 450 flow [2022-12-06 00:20:15,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:15,617 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:15,617 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:15,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 00:20:15,617 INFO L420 AbstractCegarLoop]: === Iteration 12 === 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 00:20:15,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:15,618 INFO L85 PathProgramCache]: Analyzing trace with hash 2011828472, now seen corresponding path program 1 times [2022-12-06 00:20:15,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:15,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446507787] [2022-12-06 00:20:15,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:15,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:15,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:16,345 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 00:20:16,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:16,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446507787] [2022-12-06 00:20:16,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446507787] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:16,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:16,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:20:16,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549198370] [2022-12-06 00:20:16,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:16,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:20:16,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:16,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:20:16,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:20:16,346 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 00:20:16,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 53 transitions, 450 flow. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:16,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:16,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 00:20:16,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:16,736 INFO L130 PetriNetUnfolder]: 451/795 cut-off events. [2022-12-06 00:20:16,736 INFO L131 PetriNetUnfolder]: For 4066/4066 co-relation queries the response was YES. [2022-12-06 00:20:16,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3816 conditions, 795 events. 451/795 cut-off events. For 4066/4066 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3387 event pairs, 157 based on Foata normal form. 1/795 useless extension candidates. Maximal degree in co-relation 2288. Up to 560 conditions per place. [2022-12-06 00:20:16,741 INFO L137 encePairwiseOnDemand]: 15/26 looper letters, 76 selfloop transitions, 22 changer transitions 13/111 dead transitions. [2022-12-06 00:20:16,741 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 111 transitions, 1035 flow [2022-12-06 00:20:16,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:20:16,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:20:16,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-12-06 00:20:16,743 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38461538461538464 [2022-12-06 00:20:16,743 INFO L175 Difference]: Start difference. First operand has 53 places, 53 transitions, 450 flow. Second operand 8 states and 80 transitions. [2022-12-06 00:20:16,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 111 transitions, 1035 flow [2022-12-06 00:20:16,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 111 transitions, 993 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 00:20:16,747 INFO L231 Difference]: Finished difference. Result has 64 places, 68 transitions, 667 flow [2022-12-06 00:20:16,747 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=667, PETRI_PLACES=64, PETRI_TRANSITIONS=68} [2022-12-06 00:20:16,748 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 35 predicate places. [2022-12-06 00:20:16,748 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:16,748 INFO L89 Accepts]: Start accepts. Operand has 64 places, 68 transitions, 667 flow [2022-12-06 00:20:16,749 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:16,749 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:16,749 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 68 transitions, 667 flow [2022-12-06 00:20:16,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 68 transitions, 667 flow [2022-12-06 00:20:16,771 INFO L130 PetriNetUnfolder]: 96/273 cut-off events. [2022-12-06 00:20:16,771 INFO L131 PetriNetUnfolder]: For 968/986 co-relation queries the response was YES. [2022-12-06 00:20:16,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1154 conditions, 273 events. 96/273 cut-off events. For 968/986 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1399 event pairs, 6 based on Foata normal form. 4/253 useless extension candidates. Maximal degree in co-relation 1122. Up to 74 conditions per place. [2022-12-06 00:20:16,773 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 68 transitions, 667 flow [2022-12-06 00:20:16,773 INFO L188 LiptonReduction]: Number of co-enabled transitions 408 [2022-12-06 00:20:16,776 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:20:16,891 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:20:16,892 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 144 [2022-12-06 00:20:16,892 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 67 transitions, 665 flow [2022-12-06 00:20:16,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:16,892 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:16,892 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:16,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 00:20:16,892 INFO L420 AbstractCegarLoop]: === Iteration 13 === 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 00:20:16,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:16,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1059145440, now seen corresponding path program 2 times [2022-12-06 00:20:16,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:16,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7100617] [2022-12-06 00:20:16,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:16,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:17,938 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 00:20:17,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:17,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7100617] [2022-12-06 00:20:17,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7100617] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:17,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:17,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 00:20:17,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015871611] [2022-12-06 00:20:17,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:17,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 00:20:17,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:17,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 00:20:17,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-06 00:20:17,939 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 00:20:17,939 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 67 transitions, 665 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:17,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:17,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 00:20:17,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:18,395 INFO L130 PetriNetUnfolder]: 470/831 cut-off events. [2022-12-06 00:20:18,395 INFO L131 PetriNetUnfolder]: For 4896/4896 co-relation queries the response was YES. [2022-12-06 00:20:18,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4344 conditions, 831 events. 470/831 cut-off events. For 4896/4896 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3643 event pairs, 172 based on Foata normal form. 1/831 useless extension candidates. Maximal degree in co-relation 4306. Up to 523 conditions per place. [2022-12-06 00:20:18,401 INFO L137 encePairwiseOnDemand]: 16/27 looper letters, 73 selfloop transitions, 22 changer transitions 15/110 dead transitions. [2022-12-06 00:20:18,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 110 transitions, 1125 flow [2022-12-06 00:20:18,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:20:18,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:20:18,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-12-06 00:20:18,402 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37037037037037035 [2022-12-06 00:20:18,402 INFO L175 Difference]: Start difference. First operand has 62 places, 67 transitions, 665 flow. Second operand 8 states and 80 transitions. [2022-12-06 00:20:18,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 110 transitions, 1125 flow [2022-12-06 00:20:18,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 110 transitions, 1077 flow, removed 19 selfloop flow, removed 3 redundant places. [2022-12-06 00:20:18,409 INFO L231 Difference]: Finished difference. Result has 69 places, 68 transitions, 704 flow [2022-12-06 00:20:18,409 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=704, PETRI_PLACES=69, PETRI_TRANSITIONS=68} [2022-12-06 00:20:18,410 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 40 predicate places. [2022-12-06 00:20:18,410 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:18,410 INFO L89 Accepts]: Start accepts. Operand has 69 places, 68 transitions, 704 flow [2022-12-06 00:20:18,411 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:18,411 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:18,411 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 68 transitions, 704 flow [2022-12-06 00:20:18,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 68 transitions, 704 flow [2022-12-06 00:20:18,430 INFO L130 PetriNetUnfolder]: 94/277 cut-off events. [2022-12-06 00:20:18,430 INFO L131 PetriNetUnfolder]: For 1352/1373 co-relation queries the response was YES. [2022-12-06 00:20:18,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1208 conditions, 277 events. 94/277 cut-off events. For 1352/1373 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1441 event pairs, 8 based on Foata normal form. 6/259 useless extension candidates. Maximal degree in co-relation 1175. Up to 70 conditions per place. [2022-12-06 00:20:18,436 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 68 transitions, 704 flow [2022-12-06 00:20:18,436 INFO L188 LiptonReduction]: Number of co-enabled transitions 416 [2022-12-06 00:20:18,436 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:20:18,437 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-06 00:20:18,437 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 68 transitions, 704 flow [2022-12-06 00:20:18,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:18,437 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:18,437 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 00:20:18,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 00:20:18,438 INFO L420 AbstractCegarLoop]: === Iteration 14 === 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 00:20:18,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:18,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1537088064, now seen corresponding path program 1 times [2022-12-06 00:20:18,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:18,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270481082] [2022-12-06 00:20:18,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:18,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:18,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:20,755 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 00:20:20,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:20,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270481082] [2022-12-06 00:20:20,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270481082] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:20,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:20,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 00:20:20,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30800386] [2022-12-06 00:20:20,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:20,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 00:20:20,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:20,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 00:20:20,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-06 00:20:20,757 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 00:20:20,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 68 transitions, 704 flow. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 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 00:20:20,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:20,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 00:20:20,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:21,820 INFO L130 PetriNetUnfolder]: 644/1084 cut-off events. [2022-12-06 00:20:21,820 INFO L131 PetriNetUnfolder]: For 7105/7105 co-relation queries the response was YES. [2022-12-06 00:20:21,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5684 conditions, 1084 events. 644/1084 cut-off events. For 7105/7105 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4800 event pairs, 151 based on Foata normal form. 1/1083 useless extension candidates. Maximal degree in co-relation 5645. Up to 746 conditions per place. [2022-12-06 00:20:21,829 INFO L137 encePairwiseOnDemand]: 11/26 looper letters, 104 selfloop transitions, 25 changer transitions 13/142 dead transitions. [2022-12-06 00:20:21,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 142 transitions, 1426 flow [2022-12-06 00:20:21,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 00:20:21,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 00:20:21,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 93 transitions. [2022-12-06 00:20:21,830 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3576923076923077 [2022-12-06 00:20:21,830 INFO L175 Difference]: Start difference. First operand has 67 places, 68 transitions, 704 flow. Second operand 10 states and 93 transitions. [2022-12-06 00:20:21,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 142 transitions, 1426 flow [2022-12-06 00:20:21,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 142 transitions, 1381 flow, removed 6 selfloop flow, removed 6 redundant places. [2022-12-06 00:20:21,838 INFO L231 Difference]: Finished difference. Result has 77 places, 84 transitions, 903 flow [2022-12-06 00:20:21,839 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=659, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=903, PETRI_PLACES=77, PETRI_TRANSITIONS=84} [2022-12-06 00:20:21,839 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 48 predicate places. [2022-12-06 00:20:21,839 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:21,839 INFO L89 Accepts]: Start accepts. Operand has 77 places, 84 transitions, 903 flow [2022-12-06 00:20:21,840 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:21,840 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:21,840 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 84 transitions, 903 flow [2022-12-06 00:20:21,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 84 transitions, 903 flow [2022-12-06 00:20:21,866 INFO L130 PetriNetUnfolder]: 130/361 cut-off events. [2022-12-06 00:20:21,866 INFO L131 PetriNetUnfolder]: For 1972/2006 co-relation queries the response was YES. [2022-12-06 00:20:21,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1698 conditions, 361 events. 130/361 cut-off events. For 1972/2006 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2012 event pairs, 9 based on Foata normal form. 8/338 useless extension candidates. Maximal degree in co-relation 1660. Up to 94 conditions per place. [2022-12-06 00:20:21,870 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 84 transitions, 903 flow [2022-12-06 00:20:21,870 INFO L188 LiptonReduction]: Number of co-enabled transitions 536 [2022-12-06 00:20:21,871 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:20:22,137 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [556] $Ultimate##0-->L51-5: Formula: (and (= |v_thread1Thread1of1ForFork2_~x~0#1_19| 0) (= |v_thread1Thread1of1ForFork2_~i~0#1_23| 0)) InVars {} OutVars{thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_19|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_23|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] and [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] [2022-12-06 00:20:25,290 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 00:20:25,290 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3451 [2022-12-06 00:20:25,291 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 83 transitions, 933 flow [2022-12-06 00:20:25,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 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 00:20:25,291 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:25,291 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:25,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 00:20:25,291 INFO L420 AbstractCegarLoop]: === Iteration 15 === 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 00:20:25,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:25,291 INFO L85 PathProgramCache]: Analyzing trace with hash 599754994, now seen corresponding path program 1 times [2022-12-06 00:20:25,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:25,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131939061] [2022-12-06 00:20:25,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:25,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:28,009 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 00:20:28,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:28,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131939061] [2022-12-06 00:20:28,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131939061] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:28,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:28,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:20:28,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913071036] [2022-12-06 00:20:28,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:28,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:20:28,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:28,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:20:28,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:20:28,010 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 00:20:28,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 83 transitions, 933 flow. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:28,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:28,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 00:20:28,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:28,691 INFO L130 PetriNetUnfolder]: 665/1122 cut-off events. [2022-12-06 00:20:28,691 INFO L131 PetriNetUnfolder]: For 9232/9232 co-relation queries the response was YES. [2022-12-06 00:20:28,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6429 conditions, 1122 events. 665/1122 cut-off events. For 9232/9232 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5086 event pairs, 147 based on Foata normal form. 1/1121 useless extension candidates. Maximal degree in co-relation 6385. Up to 810 conditions per place. [2022-12-06 00:20:28,698 INFO L137 encePairwiseOnDemand]: 23/35 looper letters, 81 selfloop transitions, 34 changer transitions 17/132 dead transitions. [2022-12-06 00:20:28,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 132 transitions, 1548 flow [2022-12-06 00:20:28,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:20:28,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:20:28,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2022-12-06 00:20:28,699 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33877551020408164 [2022-12-06 00:20:28,699 INFO L175 Difference]: Start difference. First operand has 75 places, 83 transitions, 933 flow. Second operand 7 states and 83 transitions. [2022-12-06 00:20:28,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 132 transitions, 1548 flow [2022-12-06 00:20:28,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 132 transitions, 1434 flow, removed 53 selfloop flow, removed 3 redundant places. [2022-12-06 00:20:28,710 INFO L231 Difference]: Finished difference. Result has 83 places, 95 transitions, 1118 flow [2022-12-06 00:20:28,710 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=853, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1118, PETRI_PLACES=83, PETRI_TRANSITIONS=95} [2022-12-06 00:20:28,711 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 54 predicate places. [2022-12-06 00:20:28,711 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:28,711 INFO L89 Accepts]: Start accepts. Operand has 83 places, 95 transitions, 1118 flow [2022-12-06 00:20:28,711 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:28,711 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:28,711 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 95 transitions, 1118 flow [2022-12-06 00:20:28,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 95 transitions, 1118 flow [2022-12-06 00:20:28,741 INFO L130 PetriNetUnfolder]: 161/414 cut-off events. [2022-12-06 00:20:28,741 INFO L131 PetriNetUnfolder]: For 2316/2353 co-relation queries the response was YES. [2022-12-06 00:20:28,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2110 conditions, 414 events. 161/414 cut-off events. For 2316/2353 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2313 event pairs, 10 based on Foata normal form. 8/384 useless extension candidates. Maximal degree in co-relation 2068. Up to 100 conditions per place. [2022-12-06 00:20:28,745 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 95 transitions, 1118 flow [2022-12-06 00:20:28,745 INFO L188 LiptonReduction]: Number of co-enabled transitions 570 [2022-12-06 00:20:28,747 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:20:28,858 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:20:28,859 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 148 [2022-12-06 00:20:28,859 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 94 transitions, 1116 flow [2022-12-06 00:20:28,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:28,859 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:28,859 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:28,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 00:20:28,859 INFO L420 AbstractCegarLoop]: === Iteration 16 === 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 00:20:28,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:28,860 INFO L85 PathProgramCache]: Analyzing trace with hash -2043715631, now seen corresponding path program 1 times [2022-12-06 00:20:28,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:28,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197317310] [2022-12-06 00:20:28,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:28,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:28,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:30,017 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 00:20:30,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:30,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197317310] [2022-12-06 00:20:30,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197317310] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:30,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:30,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:20:30,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759583714] [2022-12-06 00:20:30,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:30,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:20:30,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:30,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:20:30,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:20:30,019 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 00:20:30,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 94 transitions, 1116 flow. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:30,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:30,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 00:20:30,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:30,328 INFO L130 PetriNetUnfolder]: 632/1067 cut-off events. [2022-12-06 00:20:30,328 INFO L131 PetriNetUnfolder]: For 9199/9199 co-relation queries the response was YES. [2022-12-06 00:20:30,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6455 conditions, 1067 events. 632/1067 cut-off events. For 9199/9199 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4759 event pairs, 156 based on Foata normal form. 1/1067 useless extension candidates. Maximal degree in co-relation 6407. Up to 774 conditions per place. [2022-12-06 00:20:30,336 INFO L137 encePairwiseOnDemand]: 23/35 looper letters, 91 selfloop transitions, 20 changer transitions 14/125 dead transitions. [2022-12-06 00:20:30,336 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 125 transitions, 1522 flow [2022-12-06 00:20:30,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:20:30,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:20:30,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-12-06 00:20:30,337 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32857142857142857 [2022-12-06 00:20:30,337 INFO L175 Difference]: Start difference. First operand has 78 places, 94 transitions, 1116 flow. Second operand 6 states and 69 transitions. [2022-12-06 00:20:30,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 125 transitions, 1522 flow [2022-12-06 00:20:30,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 125 transitions, 1474 flow, removed 24 selfloop flow, removed 5 redundant places. [2022-12-06 00:20:30,348 INFO L231 Difference]: Finished difference. Result has 80 places, 93 transitions, 1106 flow [2022-12-06 00:20:30,348 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1078, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1106, PETRI_PLACES=80, PETRI_TRANSITIONS=93} [2022-12-06 00:20:30,349 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 51 predicate places. [2022-12-06 00:20:30,349 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:30,349 INFO L89 Accepts]: Start accepts. Operand has 80 places, 93 transitions, 1106 flow [2022-12-06 00:20:30,350 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:30,350 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:30,350 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 93 transitions, 1106 flow [2022-12-06 00:20:30,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 93 transitions, 1106 flow [2022-12-06 00:20:30,377 INFO L130 PetriNetUnfolder]: 159/408 cut-off events. [2022-12-06 00:20:30,378 INFO L131 PetriNetUnfolder]: For 2441/2483 co-relation queries the response was YES. [2022-12-06 00:20:30,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2061 conditions, 408 events. 159/408 cut-off events. For 2441/2483 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2231 event pairs, 11 based on Foata normal form. 8/381 useless extension candidates. Maximal degree in co-relation 2021. Up to 99 conditions per place. [2022-12-06 00:20:30,392 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 93 transitions, 1106 flow [2022-12-06 00:20:30,392 INFO L188 LiptonReduction]: Number of co-enabled transitions 562 [2022-12-06 00:20:30,392 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:20:30,393 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-06 00:20:30,393 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 93 transitions, 1106 flow [2022-12-06 00:20:30,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:30,393 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:30,393 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:30,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 00:20:30,393 INFO L420 AbstractCegarLoop]: === Iteration 17 === 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 00:20:30,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:30,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1698656871, now seen corresponding path program 1 times [2022-12-06 00:20:30,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:30,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054859349] [2022-12-06 00:20:30,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:30,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:31,004 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 00:20:31,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:31,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054859349] [2022-12-06 00:20:31,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054859349] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:31,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:31,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:20:31,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465930886] [2022-12-06 00:20:31,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:31,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:20:31,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:31,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:20:31,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:20:31,006 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 00:20:31,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 93 transitions, 1106 flow. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:31,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:31,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 00:20:31,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:31,297 INFO L130 PetriNetUnfolder]: 643/1087 cut-off events. [2022-12-06 00:20:31,297 INFO L131 PetriNetUnfolder]: For 8920/8920 co-relation queries the response was YES. [2022-12-06 00:20:31,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6450 conditions, 1087 events. 643/1087 cut-off events. For 8920/8920 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4921 event pairs, 147 based on Foata normal form. 1/1087 useless extension candidates. Maximal degree in co-relation 6404. Up to 789 conditions per place. [2022-12-06 00:20:31,303 INFO L137 encePairwiseOnDemand]: 22/34 looper letters, 81 selfloop transitions, 33 changer transitions 15/129 dead transitions. [2022-12-06 00:20:31,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 129 transitions, 1558 flow [2022-12-06 00:20:31,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:20:31,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:20:31,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-12-06 00:20:31,304 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3319327731092437 [2022-12-06 00:20:31,304 INFO L175 Difference]: Start difference. First operand has 78 places, 93 transitions, 1106 flow. Second operand 7 states and 79 transitions. [2022-12-06 00:20:31,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 129 transitions, 1558 flow [2022-12-06 00:20:31,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 129 transitions, 1510 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-12-06 00:20:31,314 INFO L231 Difference]: Finished difference. Result has 82 places, 94 transitions, 1152 flow [2022-12-06 00:20:31,314 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1062, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1152, PETRI_PLACES=82, PETRI_TRANSITIONS=94} [2022-12-06 00:20:31,315 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 53 predicate places. [2022-12-06 00:20:31,315 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:31,315 INFO L89 Accepts]: Start accepts. Operand has 82 places, 94 transitions, 1152 flow [2022-12-06 00:20:31,315 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:31,315 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:31,316 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 94 transitions, 1152 flow [2022-12-06 00:20:31,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 94 transitions, 1152 flow [2022-12-06 00:20:31,350 INFO L130 PetriNetUnfolder]: 158/408 cut-off events. [2022-12-06 00:20:31,350 INFO L131 PetriNetUnfolder]: For 2473/2514 co-relation queries the response was YES. [2022-12-06 00:20:31,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2106 conditions, 408 events. 158/408 cut-off events. For 2473/2514 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2258 event pairs, 12 based on Foata normal form. 9/381 useless extension candidates. Maximal degree in co-relation 2065. Up to 99 conditions per place. [2022-12-06 00:20:31,354 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 94 transitions, 1152 flow [2022-12-06 00:20:31,354 INFO L188 LiptonReduction]: Number of co-enabled transitions 574 [2022-12-06 00:20:31,354 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:20:31,355 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-06 00:20:31,355 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 94 transitions, 1152 flow [2022-12-06 00:20:31,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:31,355 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:31,355 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:31,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 00:20:31,355 INFO L420 AbstractCegarLoop]: === Iteration 18 === 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 00:20:31,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:31,356 INFO L85 PathProgramCache]: Analyzing trace with hash -213775677, now seen corresponding path program 1 times [2022-12-06 00:20:31,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:31,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500279502] [2022-12-06 00:20:31,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:31,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:31,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:31,392 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 00:20:31,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:31,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500279502] [2022-12-06 00:20:31,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500279502] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:31,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:31,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:20:31,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551777723] [2022-12-06 00:20:31,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:31,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:20:31,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:31,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:20:31,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:20:31,393 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 00:20:31,394 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 94 transitions, 1152 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:31,394 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:31,394 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 00:20:31,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:31,528 INFO L130 PetriNetUnfolder]: 628/1103 cut-off events. [2022-12-06 00:20:31,528 INFO L131 PetriNetUnfolder]: For 10156/10156 co-relation queries the response was YES. [2022-12-06 00:20:31,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6554 conditions, 1103 events. 628/1103 cut-off events. For 10156/10156 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 5208 event pairs, 261 based on Foata normal form. 29/1131 useless extension candidates. Maximal degree in co-relation 6501. Up to 1000 conditions per place. [2022-12-06 00:20:31,534 INFO L137 encePairwiseOnDemand]: 30/33 looper letters, 102 selfloop transitions, 1 changer transitions 2/105 dead transitions. [2022-12-06 00:20:31,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 105 transitions, 1400 flow [2022-12-06 00:20:31,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:20:31,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:20:31,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-12-06 00:20:31,535 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2022-12-06 00:20:31,535 INFO L175 Difference]: Start difference. First operand has 80 places, 94 transitions, 1152 flow. Second operand 3 states and 48 transitions. [2022-12-06 00:20:31,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 105 transitions, 1400 flow [2022-12-06 00:20:31,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 105 transitions, 1335 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-12-06 00:20:31,546 INFO L231 Difference]: Finished difference. Result has 78 places, 90 transitions, 1039 flow [2022-12-06 00:20:31,546 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1048, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1039, PETRI_PLACES=78, PETRI_TRANSITIONS=90} [2022-12-06 00:20:31,547 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 49 predicate places. [2022-12-06 00:20:31,547 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:31,547 INFO L89 Accepts]: Start accepts. Operand has 78 places, 90 transitions, 1039 flow [2022-12-06 00:20:31,547 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:31,547 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:31,547 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 90 transitions, 1039 flow [2022-12-06 00:20:31,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 90 transitions, 1039 flow [2022-12-06 00:20:31,575 INFO L130 PetriNetUnfolder]: 148/409 cut-off events. [2022-12-06 00:20:31,575 INFO L131 PetriNetUnfolder]: For 2193/2235 co-relation queries the response was YES. [2022-12-06 00:20:31,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1978 conditions, 409 events. 148/409 cut-off events. For 2193/2235 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2353 event pairs, 13 based on Foata normal form. 10/384 useless extension candidates. Maximal degree in co-relation 1852. Up to 100 conditions per place. [2022-12-06 00:20:31,578 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 90 transitions, 1039 flow [2022-12-06 00:20:31,578 INFO L188 LiptonReduction]: Number of co-enabled transitions 542 [2022-12-06 00:20:31,587 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [633] $Ultimate##0-->thread1EXIT: Formula: (and (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_56| 0)) (= |v_thread1Thread1of1ForFork2_~x~0#1_119| 0) (= v_~end~0_373 (+ v_~end~0_374 1)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_54| 0) (= |v_thread1Thread1of1ForFork2_~i~0#1_114| 0) (= |v_thread1Thread1of1ForFork2_#res#1.base_54| 0) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_114| 4294967296) (mod v_~A~0_160 4294967296))) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_56| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_56|) (= (ite (= (mod (select (select |v_#memory_int_329| v_~queue~0.base_204) (+ (* v_~end~0_374 4) v_~queue~0.offset_204)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_119| 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_56|) (not (= (ite (and (< v_~end~0_374 v_~n~0_214) (<= 0 v_~end~0_374)) 1 0) 0))) InVars {~queue~0.offset=v_~queue~0.offset_204, ~A~0=v_~A~0_160, #memory_int=|v_#memory_int_329|, ~end~0=v_~end~0_374, ~queue~0.base=v_~queue~0.base_204, ~n~0=v_~n~0_214} OutVars{~queue~0.offset=v_~queue~0.offset_204, ~A~0=v_~A~0_160, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_119|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_56|, ~queue~0.base=v_~queue~0.base_204, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_56|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_114|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_56|, #memory_int=|v_#memory_int_329|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_54|, ~end~0=v_~end~0_373, ~n~0=v_~n~0_214, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_54|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_56|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [601] L102-4-->L103-3: Formula: (and (= (store |v_#memory_int_149| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_149| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre16#1_29|)) |v_#memory_int_148|) (= |v_#pthreadsForks_52| (+ |v_#pthreadsForks_53| 1)) (= |v_ULTIMATE.start_main_#t~pre16#1_29| |v_#pthreadsForks_53|)) InVars {#pthreadsForks=|v_#pthreadsForks_53|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{#pthreadsForks=|v_#pthreadsForks_52|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_41|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #memory_int=|v_#memory_int_148|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_29|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_23|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~pre14#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet15#1] [2022-12-06 00:20:31,686 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:20:31,686 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-06 00:20:31,686 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 90 transitions, 1053 flow [2022-12-06 00:20:31,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:31,687 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:31,687 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:31,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 00:20:31,687 INFO L420 AbstractCegarLoop]: === Iteration 19 === 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 00:20:31,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:31,687 INFO L85 PathProgramCache]: Analyzing trace with hash -669422823, now seen corresponding path program 1 times [2022-12-06 00:20:31,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:31,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165761588] [2022-12-06 00:20:31,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:31,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:32,456 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 00:20:32,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:32,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165761588] [2022-12-06 00:20:32,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165761588] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:32,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:32,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:20:32,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110520533] [2022-12-06 00:20:32,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:32,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:20:32,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:32,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:20:32,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:20:32,458 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 00:20:32,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 90 transitions, 1053 flow. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:32,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:32,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 00:20:32,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:32,868 INFO L130 PetriNetUnfolder]: 640/1133 cut-off events. [2022-12-06 00:20:32,868 INFO L131 PetriNetUnfolder]: For 9007/9007 co-relation queries the response was YES. [2022-12-06 00:20:32,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6567 conditions, 1133 events. 640/1133 cut-off events. For 9007/9007 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5491 event pairs, 183 based on Foata normal form. 1/1133 useless extension candidates. Maximal degree in co-relation 6043. Up to 866 conditions per place. [2022-12-06 00:20:32,878 INFO L137 encePairwiseOnDemand]: 19/33 looper letters, 80 selfloop transitions, 36 changer transitions 13/129 dead transitions. [2022-12-06 00:20:32,879 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 129 transitions, 1528 flow [2022-12-06 00:20:32,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:20:32,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:20:32,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2022-12-06 00:20:32,881 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33766233766233766 [2022-12-06 00:20:32,881 INFO L175 Difference]: Start difference. First operand has 78 places, 90 transitions, 1053 flow. Second operand 7 states and 78 transitions. [2022-12-06 00:20:32,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 129 transitions, 1528 flow [2022-12-06 00:20:32,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 129 transitions, 1520 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-06 00:20:32,893 INFO L231 Difference]: Finished difference. Result has 86 places, 97 transitions, 1213 flow [2022-12-06 00:20:32,893 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1047, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1213, PETRI_PLACES=86, PETRI_TRANSITIONS=97} [2022-12-06 00:20:32,894 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 57 predicate places. [2022-12-06 00:20:32,894 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:32,894 INFO L89 Accepts]: Start accepts. Operand has 86 places, 97 transitions, 1213 flow [2022-12-06 00:20:32,894 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:32,894 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:32,895 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 97 transitions, 1213 flow [2022-12-06 00:20:32,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 97 transitions, 1213 flow [2022-12-06 00:20:32,925 INFO L130 PetriNetUnfolder]: 156/440 cut-off events. [2022-12-06 00:20:32,926 INFO L131 PetriNetUnfolder]: For 2870/2914 co-relation queries the response was YES. [2022-12-06 00:20:32,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2265 conditions, 440 events. 156/440 cut-off events. For 2870/2914 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2614 event pairs, 13 based on Foata normal form. 8/414 useless extension candidates. Maximal degree in co-relation 2218. Up to 107 conditions per place. [2022-12-06 00:20:32,929 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 97 transitions, 1213 flow [2022-12-06 00:20:32,929 INFO L188 LiptonReduction]: Number of co-enabled transitions 552 [2022-12-06 00:20:32,931 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:20:33,040 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:20:33,041 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 146 [2022-12-06 00:20:33,041 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 96 transitions, 1209 flow [2022-12-06 00:20:33,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:33,041 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:33,041 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:33,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 00:20:33,041 INFO L420 AbstractCegarLoop]: === Iteration 20 === 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 00:20:33,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:33,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1411447523, now seen corresponding path program 1 times [2022-12-06 00:20:33,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:33,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504866639] [2022-12-06 00:20:33,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:33,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:33,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:34,698 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 00:20:34,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:34,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504866639] [2022-12-06 00:20:34,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504866639] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:34,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:34,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:20:34,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350245886] [2022-12-06 00:20:34,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:34,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:20:34,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:34,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:20:34,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:20:34,699 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 00:20:34,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 96 transitions, 1209 flow. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:34,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:34,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 00:20:34,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:35,225 INFO L130 PetriNetUnfolder]: 637/1129 cut-off events. [2022-12-06 00:20:35,226 INFO L131 PetriNetUnfolder]: For 10599/10599 co-relation queries the response was YES. [2022-12-06 00:20:35,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6905 conditions, 1129 events. 637/1129 cut-off events. For 10599/10599 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5461 event pairs, 176 based on Foata normal form. 1/1129 useless extension candidates. Maximal degree in co-relation 6850. Up to 841 conditions per place. [2022-12-06 00:20:35,233 INFO L137 encePairwiseOnDemand]: 22/34 looper letters, 90 selfloop transitions, 22 changer transitions 19/131 dead transitions. [2022-12-06 00:20:35,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 131 transitions, 1649 flow [2022-12-06 00:20:35,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:20:35,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:20:35,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-12-06 00:20:35,234 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31092436974789917 [2022-12-06 00:20:35,234 INFO L175 Difference]: Start difference. First operand has 84 places, 96 transitions, 1209 flow. Second operand 7 states and 74 transitions. [2022-12-06 00:20:35,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 131 transitions, 1649 flow [2022-12-06 00:20:35,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 131 transitions, 1569 flow, removed 17 selfloop flow, removed 4 redundant places. [2022-12-06 00:20:35,249 INFO L231 Difference]: Finished difference. Result has 90 places, 98 transitions, 1222 flow [2022-12-06 00:20:35,249 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1138, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1222, PETRI_PLACES=90, PETRI_TRANSITIONS=98} [2022-12-06 00:20:35,249 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 61 predicate places. [2022-12-06 00:20:35,249 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:35,250 INFO L89 Accepts]: Start accepts. Operand has 90 places, 98 transitions, 1222 flow [2022-12-06 00:20:35,250 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:35,250 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:35,250 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 98 transitions, 1222 flow [2022-12-06 00:20:35,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 98 transitions, 1222 flow [2022-12-06 00:20:35,284 INFO L130 PetriNetUnfolder]: 155/441 cut-off events. [2022-12-06 00:20:35,285 INFO L131 PetriNetUnfolder]: For 3041/3079 co-relation queries the response was YES. [2022-12-06 00:20:35,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2247 conditions, 441 events. 155/441 cut-off events. For 3041/3079 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2635 event pairs, 14 based on Foata normal form. 9/415 useless extension candidates. Maximal degree in co-relation 2198. Up to 103 conditions per place. [2022-12-06 00:20:35,288 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 98 transitions, 1222 flow [2022-12-06 00:20:35,288 INFO L188 LiptonReduction]: Number of co-enabled transitions 556 [2022-12-06 00:20:35,290 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:20:35,533 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:20:35,534 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 285 [2022-12-06 00:20:35,534 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 96 transitions, 1214 flow [2022-12-06 00:20:35,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:35,534 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:35,534 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:35,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 00:20:35,534 INFO L420 AbstractCegarLoop]: === Iteration 21 === 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 00:20:35,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:35,534 INFO L85 PathProgramCache]: Analyzing trace with hash -491321498, now seen corresponding path program 1 times [2022-12-06 00:20:35,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:35,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325324159] [2022-12-06 00:20:35,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:35,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:36,938 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 00:20:36,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:36,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325324159] [2022-12-06 00:20:36,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325324159] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:36,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:36,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:20:36,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885738052] [2022-12-06 00:20:36,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:36,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:20:36,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:36,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:20:36,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:20:36,940 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 00:20:36,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 96 transitions, 1214 flow. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:36,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:36,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 00:20:36,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:37,429 INFO L130 PetriNetUnfolder]: 632/1119 cut-off events. [2022-12-06 00:20:37,429 INFO L131 PetriNetUnfolder]: For 10638/10638 co-relation queries the response was YES. [2022-12-06 00:20:37,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6855 conditions, 1119 events. 632/1119 cut-off events. For 10638/10638 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5436 event pairs, 149 based on Foata normal form. 2/1120 useless extension candidates. Maximal degree in co-relation 6801. Up to 816 conditions per place. [2022-12-06 00:20:37,438 INFO L137 encePairwiseOnDemand]: 20/35 looper letters, 79 selfloop transitions, 32 changer transitions 18/129 dead transitions. [2022-12-06 00:20:37,438 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 129 transitions, 1643 flow [2022-12-06 00:20:37,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:20:37,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:20:37,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2022-12-06 00:20:37,439 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3183673469387755 [2022-12-06 00:20:37,439 INFO L175 Difference]: Start difference. First operand has 87 places, 96 transitions, 1214 flow. Second operand 7 states and 78 transitions. [2022-12-06 00:20:37,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 129 transitions, 1643 flow [2022-12-06 00:20:37,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 129 transitions, 1584 flow, removed 12 selfloop flow, removed 5 redundant places. [2022-12-06 00:20:37,478 INFO L231 Difference]: Finished difference. Result has 91 places, 94 transitions, 1195 flow [2022-12-06 00:20:37,478 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1161, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1195, PETRI_PLACES=91, PETRI_TRANSITIONS=94} [2022-12-06 00:20:37,479 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 62 predicate places. [2022-12-06 00:20:37,479 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:37,479 INFO L89 Accepts]: Start accepts. Operand has 91 places, 94 transitions, 1195 flow [2022-12-06 00:20:37,480 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:37,480 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:37,480 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 94 transitions, 1195 flow [2022-12-06 00:20:37,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 94 transitions, 1195 flow [2022-12-06 00:20:37,513 INFO L130 PetriNetUnfolder]: 153/420 cut-off events. [2022-12-06 00:20:37,513 INFO L131 PetriNetUnfolder]: For 2979/3016 co-relation queries the response was YES. [2022-12-06 00:20:37,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2194 conditions, 420 events. 153/420 cut-off events. For 2979/3016 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2447 event pairs, 15 based on Foata normal form. 8/393 useless extension candidates. Maximal degree in co-relation 2147. Up to 102 conditions per place. [2022-12-06 00:20:37,517 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 94 transitions, 1195 flow [2022-12-06 00:20:37,517 INFO L188 LiptonReduction]: Number of co-enabled transitions 550 [2022-12-06 00:20:37,518 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:20:37,519 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-06 00:20:37,519 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 94 transitions, 1195 flow [2022-12-06 00:20:37,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:37,519 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:37,519 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:37,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 00:20:37,519 INFO L420 AbstractCegarLoop]: === Iteration 22 === 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 00:20:37,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:37,520 INFO L85 PathProgramCache]: Analyzing trace with hash 747385120, now seen corresponding path program 1 times [2022-12-06 00:20:37,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:37,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448393631] [2022-12-06 00:20:37,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:37,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:37,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:37,572 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 00:20:37,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:37,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448393631] [2022-12-06 00:20:37,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448393631] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:37,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:37,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:20:37,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416853473] [2022-12-06 00:20:37,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:37,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:20:37,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:37,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:20:37,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:20:37,573 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 00:20:37,573 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 94 transitions, 1195 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:37,573 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:37,573 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 00:20:37,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:37,802 INFO L130 PetriNetUnfolder]: 602/1027 cut-off events. [2022-12-06 00:20:37,802 INFO L131 PetriNetUnfolder]: For 8685/8685 co-relation queries the response was YES. [2022-12-06 00:20:37,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6415 conditions, 1027 events. 602/1027 cut-off events. For 8685/8685 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4666 event pairs, 52 based on Foata normal form. 4/1030 useless extension candidates. Maximal degree in co-relation 6364. Up to 565 conditions per place. [2022-12-06 00:20:37,837 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 101 selfloop transitions, 30 changer transitions 2/133 dead transitions. [2022-12-06 00:20:37,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 133 transitions, 1690 flow [2022-12-06 00:20:37,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:20:37,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:20:37,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2022-12-06 00:20:37,838 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46875 [2022-12-06 00:20:37,838 INFO L175 Difference]: Start difference. First operand has 89 places, 94 transitions, 1195 flow. Second operand 5 states and 75 transitions. [2022-12-06 00:20:37,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 133 transitions, 1690 flow [2022-12-06 00:20:37,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 133 transitions, 1613 flow, removed 10 selfloop flow, removed 6 redundant places. [2022-12-06 00:20:37,873 INFO L231 Difference]: Finished difference. Result has 87 places, 90 transitions, 1128 flow [2022-12-06 00:20:37,874 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1094, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1128, PETRI_PLACES=87, PETRI_TRANSITIONS=90} [2022-12-06 00:20:37,874 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 58 predicate places. [2022-12-06 00:20:37,874 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:37,874 INFO L89 Accepts]: Start accepts. Operand has 87 places, 90 transitions, 1128 flow [2022-12-06 00:20:37,879 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:37,879 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:37,880 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 90 transitions, 1128 flow [2022-12-06 00:20:37,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 90 transitions, 1128 flow [2022-12-06 00:20:37,953 INFO L130 PetriNetUnfolder]: 151/388 cut-off events. [2022-12-06 00:20:37,953 INFO L131 PetriNetUnfolder]: For 2630/2663 co-relation queries the response was YES. [2022-12-06 00:20:37,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2036 conditions, 388 events. 151/388 cut-off events. For 2630/2663 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2095 event pairs, 14 based on Foata normal form. 6/361 useless extension candidates. Maximal degree in co-relation 1752. Up to 100 conditions per place. [2022-12-06 00:20:37,958 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 90 transitions, 1128 flow [2022-12-06 00:20:37,973 INFO L188 LiptonReduction]: Number of co-enabled transitions 528 [2022-12-06 00:20:37,974 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [634] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_61| 0) (= |v_thread1Thread1of1ForFork2_~x~0#1_121| 0) (= |v_thread2Thread1of1ForFork0_#res#1.base_61| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_91| 4294967296) (mod v_~A~0_162 4294967296))) (= |v_thread1Thread1of1ForFork2_~i~0#1_116| 0) (= v_~end~0_377 (+ v_~end~0_378 1)) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_96| 4294967296) (mod (select (select |v_#memory_int_331| v_~queue~0.base_206) (+ (* v_~end~0_378 4) v_~queue~0.offset_206)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_71|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_71| 0)) (not (= (ite (and (< v_~end~0_378 v_~n~0_216) (<= 0 v_~end~0_378)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_71| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_71|)) InVars {~queue~0.offset=v_~queue~0.offset_206, ~A~0=v_~A~0_162, #memory_int=|v_#memory_int_331|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_91|, ~end~0=v_~end~0_378, ~queue~0.base=v_~queue~0.base_206, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_96|, ~n~0=v_~n~0_216} OutVars{~queue~0.offset=v_~queue~0.offset_206, ~A~0=v_~A~0_162, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_121|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_61|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_71|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_91|, ~queue~0.base=v_~queue~0.base_206, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_71|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_61|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_116|, #memory_int=|v_#memory_int_331|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_71|, ~end~0=v_~end~0_377, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_96|, ~n~0=v_~n~0_216, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_71|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [600] L51-5-->L51-5: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_~i~0#1_28| 1) |v_thread1Thread1of1ForFork2_~i~0#1_27|) (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_28| 4294967296) (mod v_~A~0_57 4294967296)) (= |v_thread1Thread1of1ForFork2_~x~0#1_31| (+ |v_thread1Thread1of1ForFork2_~x~0#1_32| v_~B~0_47))) InVars {~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_32|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_28|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_15|, ~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_31|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] [2022-12-06 00:20:38,124 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [634] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_61| 0) (= |v_thread1Thread1of1ForFork2_~x~0#1_121| 0) (= |v_thread2Thread1of1ForFork0_#res#1.base_61| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_91| 4294967296) (mod v_~A~0_162 4294967296))) (= |v_thread1Thread1of1ForFork2_~i~0#1_116| 0) (= v_~end~0_377 (+ v_~end~0_378 1)) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_96| 4294967296) (mod (select (select |v_#memory_int_331| v_~queue~0.base_206) (+ (* v_~end~0_378 4) v_~queue~0.offset_206)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_71|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_71| 0)) (not (= (ite (and (< v_~end~0_378 v_~n~0_216) (<= 0 v_~end~0_378)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_71| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_71|)) InVars {~queue~0.offset=v_~queue~0.offset_206, ~A~0=v_~A~0_162, #memory_int=|v_#memory_int_331|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_91|, ~end~0=v_~end~0_378, ~queue~0.base=v_~queue~0.base_206, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_96|, ~n~0=v_~n~0_216} OutVars{~queue~0.offset=v_~queue~0.offset_206, ~A~0=v_~A~0_162, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_121|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_61|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_71|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_91|, ~queue~0.base=v_~queue~0.base_206, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_71|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_61|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_116|, #memory_int=|v_#memory_int_331|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_71|, ~end~0=v_~end~0_377, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_96|, ~n~0=v_~n~0_216, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_71|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:20:38,276 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] $Ultimate##0-->L104-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre18#1_122| |v_#pthreadsForks_235|) (= |v_thread2Thread1of1ForFork0_#res#1.offset_73| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_83| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_83| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_83|) (not (= (ite (and (<= 0 v_~end~0_428) (< v_~end~0_428 v_~n~0_244)) 1 0) 0)) (= (store |v_#memory_int_386| |v_ULTIMATE.start_main_~#t3~0#1.base_142| (store (select |v_#memory_int_386| |v_ULTIMATE.start_main_~#t3~0#1.base_142|) |v_ULTIMATE.start_main_~#t3~0#1.offset_126| |v_ULTIMATE.start_main_#t~pre18#1_122|)) |v_#memory_int_385|) (= |v_#pthreadsForks_234| (+ |v_#pthreadsForks_235| 1)) (= |v_thread1Thread1of1ForFork2_~x~0#1_141| 0) (= |v_thread1Thread1of1ForFork2_~i~0#1_136| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_107| 4294967296) (mod v_~A~0_192 4294967296))) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_112| 4294967296) (mod (select (select |v_#memory_int_386| v_~queue~0.base_236) (+ (* v_~end~0_428 4) v_~queue~0.offset_236)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_83|) (= |v_thread2Thread1of1ForFork0_#res#1.base_73| 0) (= v_~end~0_427 (+ v_~end~0_428 1))) InVars {~queue~0.offset=v_~queue~0.offset_236, ~A~0=v_~A~0_192, #pthreadsForks=|v_#pthreadsForks_235|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_126|, #memory_int=|v_#memory_int_386|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_142|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_107|, ~end~0=v_~end~0_428, ~queue~0.base=v_~queue~0.base_236, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_112|, ~n~0=v_~n~0_244} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_122|, ~queue~0.offset=v_~queue~0.offset_236, ~A~0=v_~A~0_192, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_141|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_126|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_73|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_83|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_142|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_107|, ~queue~0.base=v_~queue~0.base_236, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_83|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_73|, #pthreadsForks=|v_#pthreadsForks_234|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_136|, #memory_int=|v_#memory_int_385|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_130|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_83|, ~end~0=v_~end~0_427, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_110|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_112|, ~n~0=v_~n~0_244, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_83|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread1Thread1of1ForFork2_~x~0#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, #pthreadsForks, thread1Thread1of1ForFork2_~i~0#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, ULTIMATE.start_main_#t~nondet17#1, thread2Thread1of1ForFork0_#t~post6#1] and [600] L51-5-->L51-5: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_~i~0#1_28| 1) |v_thread1Thread1of1ForFork2_~i~0#1_27|) (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_28| 4294967296) (mod v_~A~0_57 4294967296)) (= |v_thread1Thread1of1ForFork2_~x~0#1_31| (+ |v_thread1Thread1of1ForFork2_~x~0#1_32| v_~B~0_47))) InVars {~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_32|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_28|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_15|, ~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_31|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] [2022-12-06 00:20:38,470 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:20:38,471 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 597 [2022-12-06 00:20:38,471 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 88 transitions, 1136 flow [2022-12-06 00:20:38,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:38,471 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:38,471 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:38,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 00:20:38,471 INFO L420 AbstractCegarLoop]: === Iteration 23 === 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 00:20:38,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:38,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1025211, now seen corresponding path program 1 times [2022-12-06 00:20:38,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:38,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273059658] [2022-12-06 00:20:38,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:38,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:38,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:38,579 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 00:20:38,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:38,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273059658] [2022-12-06 00:20:38,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273059658] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:38,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:38,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:20:38,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475643319] [2022-12-06 00:20:38,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:38,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:20:38,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:38,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:20:38,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:20:38,583 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 00:20:38,584 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 88 transitions, 1136 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:38,584 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:38,584 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 00:20:38,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:38,864 INFO L130 PetriNetUnfolder]: 604/1017 cut-off events. [2022-12-06 00:20:38,864 INFO L131 PetriNetUnfolder]: For 8414/8414 co-relation queries the response was YES. [2022-12-06 00:20:38,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6287 conditions, 1017 events. 604/1017 cut-off events. For 8414/8414 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4502 event pairs, 51 based on Foata normal form. 13/1029 useless extension candidates. Maximal degree in co-relation 5736. Up to 561 conditions per place. [2022-12-06 00:20:38,871 INFO L137 encePairwiseOnDemand]: 22/33 looper letters, 102 selfloop transitions, 31 changer transitions 0/133 dead transitions. [2022-12-06 00:20:38,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 133 transitions, 1629 flow [2022-12-06 00:20:38,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:20:38,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:20:38,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2022-12-06 00:20:38,872 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2022-12-06 00:20:38,872 INFO L175 Difference]: Start difference. First operand has 81 places, 88 transitions, 1136 flow. Second operand 6 states and 81 transitions. [2022-12-06 00:20:38,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 133 transitions, 1629 flow [2022-12-06 00:20:38,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 133 transitions, 1529 flow, removed 18 selfloop flow, removed 6 redundant places. [2022-12-06 00:20:38,887 INFO L231 Difference]: Finished difference. Result has 82 places, 88 transitions, 1083 flow [2022-12-06 00:20:38,887 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=967, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1083, PETRI_PLACES=82, PETRI_TRANSITIONS=88} [2022-12-06 00:20:38,887 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 53 predicate places. [2022-12-06 00:20:38,888 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:38,888 INFO L89 Accepts]: Start accepts. Operand has 82 places, 88 transitions, 1083 flow [2022-12-06 00:20:38,888 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:38,888 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:38,888 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 88 transitions, 1083 flow [2022-12-06 00:20:38,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 88 transitions, 1083 flow [2022-12-06 00:20:38,918 INFO L130 PetriNetUnfolder]: 152/384 cut-off events. [2022-12-06 00:20:38,918 INFO L131 PetriNetUnfolder]: For 2655/2681 co-relation queries the response was YES. [2022-12-06 00:20:38,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2089 conditions, 384 events. 152/384 cut-off events. For 2655/2681 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2032 event pairs, 14 based on Foata normal form. 8/358 useless extension candidates. Maximal degree in co-relation 1850. Up to 99 conditions per place. [2022-12-06 00:20:38,922 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 88 transitions, 1083 flow [2022-12-06 00:20:38,922 INFO L188 LiptonReduction]: Number of co-enabled transitions 528 [2022-12-06 00:20:38,945 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:20:38,946 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 59 [2022-12-06 00:20:38,946 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 88 transitions, 1093 flow [2022-12-06 00:20:38,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:38,947 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:38,947 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:38,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-06 00:20:38,947 INFO L420 AbstractCegarLoop]: === Iteration 24 === 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 00:20:38,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:38,947 INFO L85 PathProgramCache]: Analyzing trace with hash 914593211, now seen corresponding path program 1 times [2022-12-06 00:20:38,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:38,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308303858] [2022-12-06 00:20:38,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:38,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:38,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:40,598 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 00:20:40,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:40,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308303858] [2022-12-06 00:20:40,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308303858] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:40,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:40,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 00:20:40,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895066182] [2022-12-06 00:20:40,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:40,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 00:20:40,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:40,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 00:20:40,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-06 00:20:40,599 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 00:20:40,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 88 transitions, 1093 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:40,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:40,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 00:20:40,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:41,441 INFO L130 PetriNetUnfolder]: 597/1021 cut-off events. [2022-12-06 00:20:41,441 INFO L131 PetriNetUnfolder]: For 9880/9880 co-relation queries the response was YES. [2022-12-06 00:20:41,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6499 conditions, 1021 events. 597/1021 cut-off events. For 9880/9880 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4547 event pairs, 152 based on Foata normal form. 1/1021 useless extension candidates. Maximal degree in co-relation 5819. Up to 760 conditions per place. [2022-12-06 00:20:41,447 INFO L137 encePairwiseOnDemand]: 19/32 looper letters, 78 selfloop transitions, 33 changer transitions 13/124 dead transitions. [2022-12-06 00:20:41,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 124 transitions, 1544 flow [2022-12-06 00:20:41,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:20:41,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:20:41,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2022-12-06 00:20:41,448 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30078125 [2022-12-06 00:20:41,448 INFO L175 Difference]: Start difference. First operand has 82 places, 88 transitions, 1093 flow. Second operand 8 states and 77 transitions. [2022-12-06 00:20:41,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 124 transitions, 1544 flow [2022-12-06 00:20:41,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 124 transitions, 1472 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-06 00:20:41,460 INFO L231 Difference]: Finished difference. Result has 89 places, 93 transitions, 1161 flow [2022-12-06 00:20:41,460 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1023, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1161, PETRI_PLACES=89, PETRI_TRANSITIONS=93} [2022-12-06 00:20:41,461 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 60 predicate places. [2022-12-06 00:20:41,461 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:41,461 INFO L89 Accepts]: Start accepts. Operand has 89 places, 93 transitions, 1161 flow [2022-12-06 00:20:41,462 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:41,462 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:41,462 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 93 transitions, 1161 flow [2022-12-06 00:20:41,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 93 transitions, 1161 flow [2022-12-06 00:20:41,492 INFO L130 PetriNetUnfolder]: 153/391 cut-off events. [2022-12-06 00:20:41,492 INFO L131 PetriNetUnfolder]: For 2845/2873 co-relation queries the response was YES. [2022-12-06 00:20:41,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2169 conditions, 391 events. 153/391 cut-off events. For 2845/2873 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2087 event pairs, 12 based on Foata normal form. 10/366 useless extension candidates. Maximal degree in co-relation 2125. Up to 101 conditions per place. [2022-12-06 00:20:41,496 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 93 transitions, 1161 flow [2022-12-06 00:20:41,496 INFO L188 LiptonReduction]: Number of co-enabled transitions 532 [2022-12-06 00:20:41,508 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [634] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_61| 0) (= |v_thread1Thread1of1ForFork2_~x~0#1_121| 0) (= |v_thread2Thread1of1ForFork0_#res#1.base_61| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_91| 4294967296) (mod v_~A~0_162 4294967296))) (= |v_thread1Thread1of1ForFork2_~i~0#1_116| 0) (= v_~end~0_377 (+ v_~end~0_378 1)) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_96| 4294967296) (mod (select (select |v_#memory_int_331| v_~queue~0.base_206) (+ (* v_~end~0_378 4) v_~queue~0.offset_206)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_71|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_71| 0)) (not (= (ite (and (< v_~end~0_378 v_~n~0_216) (<= 0 v_~end~0_378)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_71| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_71|)) InVars {~queue~0.offset=v_~queue~0.offset_206, ~A~0=v_~A~0_162, #memory_int=|v_#memory_int_331|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_91|, ~end~0=v_~end~0_378, ~queue~0.base=v_~queue~0.base_206, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_96|, ~n~0=v_~n~0_216} OutVars{~queue~0.offset=v_~queue~0.offset_206, ~A~0=v_~A~0_162, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_121|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_61|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_71|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_91|, ~queue~0.base=v_~queue~0.base_206, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_71|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_61|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_116|, #memory_int=|v_#memory_int_331|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_71|, ~end~0=v_~end~0_377, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_96|, ~n~0=v_~n~0_216, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_71|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [600] L51-5-->L51-5: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_~i~0#1_28| 1) |v_thread1Thread1of1ForFork2_~i~0#1_27|) (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_28| 4294967296) (mod v_~A~0_57 4294967296)) (= |v_thread1Thread1of1ForFork2_~x~0#1_31| (+ |v_thread1Thread1of1ForFork2_~x~0#1_32| v_~B~0_47))) InVars {~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_32|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_28|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_15|, ~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_31|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] [2022-12-06 00:20:41,621 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [556] $Ultimate##0-->L51-5: Formula: (and (= |v_thread1Thread1of1ForFork2_~x~0#1_19| 0) (= |v_thread1Thread1of1ForFork2_~i~0#1_23| 0)) InVars {} OutVars{thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_19|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_23|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:20:41,793 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [651] $Ultimate##0-->thread1EXIT: Formula: (and (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_68| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.base_66| 0) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_158| 4294967296) (mod v_~A~0_206 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_66| 0) (not (= (ite (and (<= 0 v_~end~0_454) (< v_~end~0_454 v_~n~0_258)) 1 0) 0)) (= |v_thread1Thread1of1ForFork2_~x~0#1_163| 0) (= v_~end~0_453 (+ v_~end~0_454 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_68| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_68|) (= |v_thread1Thread1of1ForFork2_~i~0#1_158| 0) (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_163| 4294967296) (mod (select (select |v_#memory_int_413| v_~queue~0.base_250) (+ (* v_~end~0_454 4) v_~queue~0.offset_250)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_68|)) InVars {~queue~0.offset=v_~queue~0.offset_250, ~A~0=v_~A~0_206, #memory_int=|v_#memory_int_413|, ~end~0=v_~end~0_454, ~queue~0.base=v_~queue~0.base_250, ~n~0=v_~n~0_258} OutVars{~queue~0.offset=v_~queue~0.offset_250, ~A~0=v_~A~0_206, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_163|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_68|, ~queue~0.base=v_~queue~0.base_250, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_68|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_158|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_68|, #memory_int=|v_#memory_int_413|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_66|, ~end~0=v_~end~0_453, ~n~0=v_~n~0_258, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_66|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_68|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] [2022-12-06 00:20:42,030 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [650] $Ultimate##0-->L104-3: Formula: (and (= (+ |v_#pthreadsForks_255| 1) |v_#pthreadsForks_254|) (= |v_thread1Thread1of1ForFork2_~x~0#1_161| 0) (= |v_thread1Thread1of1ForFork2_~i~0#1_156| 0) (= |v_ULTIMATE.start_main_#t~pre18#1_132| |v_#pthreadsForks_255|) (= (store |v_#memory_int_410| |v_ULTIMATE.start_main_~#t3~0#1.base_154| (store (select |v_#memory_int_410| |v_ULTIMATE.start_main_~#t3~0#1.base_154|) |v_ULTIMATE.start_main_~#t3~0#1.offset_136| |v_ULTIMATE.start_main_#t~pre18#1_132|)) |v_#memory_int_409|)) InVars {#pthreadsForks=|v_#pthreadsForks_255|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_136|, #memory_int=|v_#memory_int_410|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_154|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_132|, #pthreadsForks=|v_#pthreadsForks_254|, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_161|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_156|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_136|, #memory_int=|v_#memory_int_409|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_154|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_140|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_120|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:20:42,164 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [653] L67-5-->thread1EXIT: Formula: (let ((.cse0 (select |v_#memory_int_415| v_~queue~0.base_252))) (and (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_70| 0)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_164| 4294967296) (mod v_~A~0_210 4294967296))) (not (= (ite (and (<= 0 v_~end~0_459) (< v_~end~0_459 v_~n~0_260)) 1 0) 0)) (= (ite (= (mod (select .cse0 (+ (* v_~end~0_457 4) (- 4) v_~queue~0.offset_252)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_169| 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_70|) (= |v_thread2Thread1of1ForFork0_#res#1.offset_85| 0) (= |v_thread1Thread1of1ForFork2_~x~0#1_169| 0) (= v_~end~0_457 (+ v_~end~0_459 2)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_95| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_95|) (= |v_thread1Thread1of1ForFork2_#res#1.base_68| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_70| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_70|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_95| 0)) (not (= (ite (and (<= 1 v_~end~0_457) (< v_~end~0_457 (+ v_~n~0_260 1))) 1 0) 0)) (= |v_thread1Thread1of1ForFork2_~i~0#1_164| 0) (= |v_thread2Thread1of1ForFork0_#res#1.base_85| 0) (= |v_thread1Thread1of1ForFork2_#res#1.offset_68| 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_95| (ite (= (mod (select .cse0 (+ (* v_~end~0_459 4) v_~queue~0.offset_252)) 4294967296) (mod |v_thread2Thread1of1ForFork0_~x~1#1_124| 4294967296)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_252, ~A~0=v_~A~0_210, #memory_int=|v_#memory_int_415|, ~end~0=v_~end~0_459, ~queue~0.base=v_~queue~0.base_252, ~n~0=v_~n~0_260, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_124|} OutVars{~queue~0.offset=v_~queue~0.offset_252, ~A~0=v_~A~0_210, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_169|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_85|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_70|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_95|, ~queue~0.base=v_~queue~0.base_252, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_95|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_85|, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_70|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_164|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_70|, #memory_int=|v_#memory_int_415|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_68|, ~end~0=v_~end~0_457, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_95|, ~n~0=v_~n~0_260, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_124|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_68|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_70|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_95|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~x~0#1, thread2Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread2Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:20:42,347 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 00:20:42,348 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 887 [2022-12-06 00:20:42,348 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 91 transitions, 1215 flow [2022-12-06 00:20:42,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:42,348 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:42,348 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:42,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-06 00:20:42,348 INFO L420 AbstractCegarLoop]: === Iteration 25 === 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 00:20:42,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:42,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1906731295, now seen corresponding path program 2 times [2022-12-06 00:20:42,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:42,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209018696] [2022-12-06 00:20:42,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:42,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:42,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:44,879 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 00:20:44,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:44,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209018696] [2022-12-06 00:20:44,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209018696] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:44,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:44,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 00:20:44,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054142309] [2022-12-06 00:20:44,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:44,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 00:20:44,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:44,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 00:20:44,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-06 00:20:44,881 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 00:20:44,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 91 transitions, 1215 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:44,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:44,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 00:20:44,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:46,060 INFO L130 PetriNetUnfolder]: 596/1029 cut-off events. [2022-12-06 00:20:46,060 INFO L131 PetriNetUnfolder]: For 10436/10436 co-relation queries the response was YES. [2022-12-06 00:20:46,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6616 conditions, 1029 events. 596/1029 cut-off events. For 10436/10436 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4698 event pairs, 146 based on Foata normal form. 2/1030 useless extension candidates. Maximal degree in co-relation 6566. Up to 738 conditions per place. [2022-12-06 00:20:46,066 INFO L137 encePairwiseOnDemand]: 21/36 looper letters, 78 selfloop transitions, 31 changer transitions 29/138 dead transitions. [2022-12-06 00:20:46,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 138 transitions, 1726 flow [2022-12-06 00:20:46,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 00:20:46,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 00:20:46,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 93 transitions. [2022-12-06 00:20:46,067 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25833333333333336 [2022-12-06 00:20:46,067 INFO L175 Difference]: Start difference. First operand has 86 places, 91 transitions, 1215 flow. Second operand 10 states and 93 transitions. [2022-12-06 00:20:46,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 138 transitions, 1726 flow [2022-12-06 00:20:46,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 138 transitions, 1606 flow, removed 29 selfloop flow, removed 7 redundant places. [2022-12-06 00:20:46,081 INFO L231 Difference]: Finished difference. Result has 94 places, 91 transitions, 1164 flow [2022-12-06 00:20:46,081 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1105, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1164, PETRI_PLACES=94, PETRI_TRANSITIONS=91} [2022-12-06 00:20:46,082 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 65 predicate places. [2022-12-06 00:20:46,082 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:46,082 INFO L89 Accepts]: Start accepts. Operand has 94 places, 91 transitions, 1164 flow [2022-12-06 00:20:46,082 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:46,083 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:46,083 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 91 transitions, 1164 flow [2022-12-06 00:20:46,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 91 transitions, 1164 flow [2022-12-06 00:20:46,111 INFO L130 PetriNetUnfolder]: 150/377 cut-off events. [2022-12-06 00:20:46,111 INFO L131 PetriNetUnfolder]: For 2939/2970 co-relation queries the response was YES. [2022-12-06 00:20:46,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2121 conditions, 377 events. 150/377 cut-off events. For 2939/2970 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 1987 event pairs, 13 based on Foata normal form. 8/353 useless extension candidates. Maximal degree in co-relation 2069. Up to 100 conditions per place. [2022-12-06 00:20:46,114 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 91 transitions, 1164 flow [2022-12-06 00:20:46,115 INFO L188 LiptonReduction]: Number of co-enabled transitions 526 [2022-12-06 00:20:46,117 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [654] L67-5-->L104-3: Formula: (and (= |v_thread1Thread1of1ForFork2_~x~0#1_171| 0) (= v_~end~0_463 (+ v_~end~0_464 1)) (= |v_#memory_int_417| (store |v_#memory_int_418| |v_ULTIMATE.start_main_~#t3~0#1.base_156| (store (select |v_#memory_int_418| |v_ULTIMATE.start_main_~#t3~0#1.base_156|) |v_ULTIMATE.start_main_~#t3~0#1.offset_138| |v_ULTIMATE.start_main_#t~pre18#1_134|))) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_97| 0)) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_121| 4294967296) (mod v_~A~0_212 4294967296))) (= |v_thread2Thread1of1ForFork0_#res#1.base_87| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_87| 0) (= (ite (= (mod (select (select |v_#memory_int_418| v_~queue~0.base_254) (+ (* v_~end~0_464 4) v_~queue~0.offset_254)) 4294967296) (mod |v_thread2Thread1of1ForFork0_~x~1#1_126| 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_97|) (= |v_thread1Thread1of1ForFork2_~i~0#1_166| 0) (not (= (ite (and (<= 0 v_~end~0_464) (< v_~end~0_464 v_~n~0_262)) 1 0) 0)) (= |v_ULTIMATE.start_main_#t~pre18#1_134| |v_#pthreadsForks_259|) (= (+ |v_#pthreadsForks_259| 1) |v_#pthreadsForks_258|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_97| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_97|)) InVars {~queue~0.offset=v_~queue~0.offset_254, ~A~0=v_~A~0_212, #pthreadsForks=|v_#pthreadsForks_259|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_138|, #memory_int=|v_#memory_int_418|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_156|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_121|, ~end~0=v_~end~0_464, ~queue~0.base=v_~queue~0.base_254, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_126|, ~n~0=v_~n~0_262} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_134|, ~queue~0.offset=v_~queue~0.offset_254, ~A~0=v_~A~0_212, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_171|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_138|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_87|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_97|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_156|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_121|, ~queue~0.base=v_~queue~0.base_254, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_97|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_87|, #pthreadsForks=|v_#pthreadsForks_258|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_166|, #memory_int=|v_#memory_int_417|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_142|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_97|, ~end~0=v_~end~0_463, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_122|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_126|, ~n~0=v_~n~0_262, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_97|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread1Thread1of1ForFork2_~x~0#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, #pthreadsForks, thread1Thread1of1ForFork2_~i~0#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, ULTIMATE.start_main_#t~nondet17#1, thread2Thread1of1ForFork0_#t~post6#1] and [600] L51-5-->L51-5: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_~i~0#1_28| 1) |v_thread1Thread1of1ForFork2_~i~0#1_27|) (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_28| 4294967296) (mod v_~A~0_57 4294967296)) (= |v_thread1Thread1of1ForFork2_~x~0#1_31| (+ |v_thread1Thread1of1ForFork2_~x~0#1_32| v_~B~0_47))) InVars {~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_32|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_28|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_15|, ~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_31|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] [2022-12-06 00:20:46,260 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:20:46,260 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 00:20:46,261 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 90 transitions, 1165 flow [2022-12-06 00:20:46,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:46,261 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:46,261 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:46,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-06 00:20:46,261 INFO L420 AbstractCegarLoop]: === Iteration 26 === 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 00:20:46,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:46,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1624444292, now seen corresponding path program 1 times [2022-12-06 00:20:46,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:46,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626955061] [2022-12-06 00:20:46,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:46,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:46,302 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 00:20:46,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:46,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626955061] [2022-12-06 00:20:46,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626955061] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:46,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:46,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:20:46,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162217541] [2022-12-06 00:20:46,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:46,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:20:46,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:46,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:20:46,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:20:46,303 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 00:20:46,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 90 transitions, 1165 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:46,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:46,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 00:20:46,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:46,464 INFO L130 PetriNetUnfolder]: 578/976 cut-off events. [2022-12-06 00:20:46,465 INFO L131 PetriNetUnfolder]: For 9425/9425 co-relation queries the response was YES. [2022-12-06 00:20:46,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6300 conditions, 976 events. 578/976 cut-off events. For 9425/9425 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4258 event pairs, 123 based on Foata normal form. 1/976 useless extension candidates. Maximal degree in co-relation 6242. Up to 613 conditions per place. [2022-12-06 00:20:46,470 INFO L137 encePairwiseOnDemand]: 32/35 looper letters, 84 selfloop transitions, 22 changer transitions 0/106 dead transitions. [2022-12-06 00:20:46,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 106 transitions, 1469 flow [2022-12-06 00:20:46,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:20:46,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:20:46,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-12-06 00:20:46,471 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2022-12-06 00:20:46,471 INFO L175 Difference]: Start difference. First operand has 88 places, 90 transitions, 1165 flow. Second operand 3 states and 51 transitions. [2022-12-06 00:20:46,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 106 transitions, 1469 flow [2022-12-06 00:20:46,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 106 transitions, 1382 flow, removed 23 selfloop flow, removed 9 redundant places. [2022-12-06 00:20:46,485 INFO L231 Difference]: Finished difference. Result has 81 places, 89 transitions, 1098 flow [2022-12-06 00:20:46,485 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1054, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1098, PETRI_PLACES=81, PETRI_TRANSITIONS=89} [2022-12-06 00:20:46,485 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 52 predicate places. [2022-12-06 00:20:46,485 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:46,485 INFO L89 Accepts]: Start accepts. Operand has 81 places, 89 transitions, 1098 flow [2022-12-06 00:20:46,486 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:46,486 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:46,486 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 89 transitions, 1098 flow [2022-12-06 00:20:46,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 89 transitions, 1098 flow [2022-12-06 00:20:46,514 INFO L130 PetriNetUnfolder]: 149/377 cut-off events. [2022-12-06 00:20:46,514 INFO L131 PetriNetUnfolder]: For 2538/2560 co-relation queries the response was YES. [2022-12-06 00:20:46,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1991 conditions, 377 events. 149/377 cut-off events. For 2538/2560 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 1982 event pairs, 14 based on Foata normal form. 10/354 useless extension candidates. Maximal degree in co-relation 1844. Up to 99 conditions per place. [2022-12-06 00:20:46,517 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 89 transitions, 1098 flow [2022-12-06 00:20:46,517 INFO L188 LiptonReduction]: Number of co-enabled transitions 522 [2022-12-06 00:20:46,517 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:20:46,518 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-06 00:20:46,518 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 89 transitions, 1098 flow [2022-12-06 00:20:46,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:46,518 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:46,518 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:46,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-06 00:20:46,518 INFO L420 AbstractCegarLoop]: === Iteration 27 === 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 00:20:46,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:46,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1787957051, now seen corresponding path program 1 times [2022-12-06 00:20:46,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:46,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767327303] [2022-12-06 00:20:46,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:46,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:46,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:46,560 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 00:20:46,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:46,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767327303] [2022-12-06 00:20:46,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767327303] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:46,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:46,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:20:46,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878233081] [2022-12-06 00:20:46,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:46,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:20:46,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:46,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:20:46,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:20:46,561 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 00:20:46,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 89 transitions, 1098 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:46,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:46,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 00:20:46,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:46,715 INFO L130 PetriNetUnfolder]: 544/915 cut-off events. [2022-12-06 00:20:46,715 INFO L131 PetriNetUnfolder]: For 8558/8558 co-relation queries the response was YES. [2022-12-06 00:20:46,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5794 conditions, 915 events. 544/915 cut-off events. For 8558/8558 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3905 event pairs, 119 based on Foata normal form. 11/925 useless extension candidates. Maximal degree in co-relation 5698. Up to 613 conditions per place. [2022-12-06 00:20:46,720 INFO L137 encePairwiseOnDemand]: 28/34 looper letters, 82 selfloop transitions, 24 changer transitions 2/108 dead transitions. [2022-12-06 00:20:46,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 108 transitions, 1410 flow [2022-12-06 00:20:46,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:20:46,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:20:46,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-12-06 00:20:46,722 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4264705882352941 [2022-12-06 00:20:46,722 INFO L175 Difference]: Start difference. First operand has 81 places, 89 transitions, 1098 flow. Second operand 4 states and 58 transitions. [2022-12-06 00:20:46,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 108 transitions, 1410 flow [2022-12-06 00:20:46,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 108 transitions, 1353 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-06 00:20:46,733 INFO L231 Difference]: Finished difference. Result has 82 places, 85 transitions, 1078 flow [2022-12-06 00:20:46,734 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=995, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1078, PETRI_PLACES=82, PETRI_TRANSITIONS=85} [2022-12-06 00:20:46,734 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 53 predicate places. [2022-12-06 00:20:46,734 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:46,734 INFO L89 Accepts]: Start accepts. Operand has 82 places, 85 transitions, 1078 flow [2022-12-06 00:20:46,735 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:46,735 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:46,735 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 85 transitions, 1078 flow [2022-12-06 00:20:46,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 85 transitions, 1078 flow [2022-12-06 00:20:46,760 INFO L130 PetriNetUnfolder]: 138/341 cut-off events. [2022-12-06 00:20:46,760 INFO L131 PetriNetUnfolder]: For 2530/2552 co-relation queries the response was YES. [2022-12-06 00:20:46,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1869 conditions, 341 events. 138/341 cut-off events. For 2530/2552 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1691 event pairs, 12 based on Foata normal form. 10/320 useless extension candidates. Maximal degree in co-relation 1735. Up to 90 conditions per place. [2022-12-06 00:20:46,763 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 85 transitions, 1078 flow [2022-12-06 00:20:46,763 INFO L188 LiptonReduction]: Number of co-enabled transitions 516 [2022-12-06 00:20:46,763 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:20:46,763 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-06 00:20:46,764 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 85 transitions, 1078 flow [2022-12-06 00:20:46,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:46,764 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:46,764 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:46,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-06 00:20:46,764 INFO L420 AbstractCegarLoop]: === Iteration 28 === 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 00:20:46,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:46,765 INFO L85 PathProgramCache]: Analyzing trace with hash -351892918, now seen corresponding path program 1 times [2022-12-06 00:20:46,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:46,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121475472] [2022-12-06 00:20:46,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:46,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:46,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:48,246 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 00:20:48,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:48,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121475472] [2022-12-06 00:20:48,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121475472] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:48,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:48,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 00:20:48,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200361425] [2022-12-06 00:20:48,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:48,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 00:20:48,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:48,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 00:20:48,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-06 00:20:48,248 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 00:20:48,248 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 85 transitions, 1078 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:48,248 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:48,248 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 00:20:48,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:49,020 INFO L130 PetriNetUnfolder]: 614/1037 cut-off events. [2022-12-06 00:20:49,020 INFO L131 PetriNetUnfolder]: For 10431/10431 co-relation queries the response was YES. [2022-12-06 00:20:49,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6643 conditions, 1037 events. 614/1037 cut-off events. For 10431/10431 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4590 event pairs, 120 based on Foata normal form. 1/1037 useless extension candidates. Maximal degree in co-relation 6177. Up to 599 conditions per place. [2022-12-06 00:20:49,049 INFO L137 encePairwiseOnDemand]: 19/32 looper letters, 89 selfloop transitions, 41 changer transitions 13/143 dead transitions. [2022-12-06 00:20:49,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 143 transitions, 1809 flow [2022-12-06 00:20:49,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:20:49,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:20:49,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-12-06 00:20:49,050 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34375 [2022-12-06 00:20:49,050 INFO L175 Difference]: Start difference. First operand has 80 places, 85 transitions, 1078 flow. Second operand 8 states and 88 transitions. [2022-12-06 00:20:49,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 143 transitions, 1809 flow [2022-12-06 00:20:49,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 143 transitions, 1761 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 00:20:49,062 INFO L231 Difference]: Finished difference. Result has 88 places, 95 transitions, 1284 flow [2022-12-06 00:20:49,062 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1038, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1284, PETRI_PLACES=88, PETRI_TRANSITIONS=95} [2022-12-06 00:20:49,062 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 59 predicate places. [2022-12-06 00:20:49,062 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:49,062 INFO L89 Accepts]: Start accepts. Operand has 88 places, 95 transitions, 1284 flow [2022-12-06 00:20:49,063 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:49,063 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:49,063 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 95 transitions, 1284 flow [2022-12-06 00:20:49,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 95 transitions, 1284 flow [2022-12-06 00:20:49,094 INFO L130 PetriNetUnfolder]: 155/391 cut-off events. [2022-12-06 00:20:49,094 INFO L131 PetriNetUnfolder]: For 3502/3575 co-relation queries the response was YES. [2022-12-06 00:20:49,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2319 conditions, 391 events. 155/391 cut-off events. For 3502/3575 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2070 event pairs, 10 based on Foata normal form. 8/359 useless extension candidates. Maximal degree in co-relation 2277. Up to 101 conditions per place. [2022-12-06 00:20:49,098 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 95 transitions, 1284 flow [2022-12-06 00:20:49,098 INFO L188 LiptonReduction]: Number of co-enabled transitions 560 [2022-12-06 00:20:49,100 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:20:49,215 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:20:49,216 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 154 [2022-12-06 00:20:49,216 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 94 transitions, 1280 flow [2022-12-06 00:20:49,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:49,216 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:49,216 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:49,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-06 00:20:49,216 INFO L420 AbstractCegarLoop]: === Iteration 29 === 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 00:20:49,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:49,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1418069074, now seen corresponding path program 2 times [2022-12-06 00:20:49,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:49,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872247266] [2022-12-06 00:20:49,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:49,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:49,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:50,385 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 00:20:50,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:50,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872247266] [2022-12-06 00:20:50,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872247266] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:50,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:20:50,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 00:20:50,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051150163] [2022-12-06 00:20:50,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:50,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 00:20:50,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:50,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 00:20:50,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-06 00:20:50,387 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 00:20:50,387 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 94 transitions, 1280 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:50,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:50,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 00:20:50,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:51,000 INFO L130 PetriNetUnfolder]: 641/1091 cut-off events. [2022-12-06 00:20:51,000 INFO L131 PetriNetUnfolder]: For 12276/12276 co-relation queries the response was YES. [2022-12-06 00:20:51,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7363 conditions, 1091 events. 641/1091 cut-off events. For 12276/12276 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4968 event pairs, 151 based on Foata normal form. 1/1091 useless extension candidates. Maximal degree in co-relation 7316. Up to 527 conditions per place. [2022-12-06 00:20:51,006 INFO L137 encePairwiseOnDemand]: 20/33 looper letters, 85 selfloop transitions, 42 changer transitions 15/142 dead transitions. [2022-12-06 00:20:51,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 142 transitions, 1920 flow [2022-12-06 00:20:51,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:20:51,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:20:51,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-12-06 00:20:51,008 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-06 00:20:51,008 INFO L175 Difference]: Start difference. First operand has 86 places, 94 transitions, 1280 flow. Second operand 8 states and 88 transitions. [2022-12-06 00:20:51,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 142 transitions, 1920 flow [2022-12-06 00:20:51,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 142 transitions, 1804 flow, removed 29 selfloop flow, removed 6 redundant places. [2022-12-06 00:20:51,025 INFO L231 Difference]: Finished difference. Result has 90 places, 95 transitions, 1318 flow [2022-12-06 00:20:51,025 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1184, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1318, PETRI_PLACES=90, PETRI_TRANSITIONS=95} [2022-12-06 00:20:51,026 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 61 predicate places. [2022-12-06 00:20:51,026 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:51,026 INFO L89 Accepts]: Start accepts. Operand has 90 places, 95 transitions, 1318 flow [2022-12-06 00:20:51,026 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:51,026 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:51,026 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 95 transitions, 1318 flow [2022-12-06 00:20:51,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 95 transitions, 1318 flow [2022-12-06 00:20:51,056 INFO L130 PetriNetUnfolder]: 152/391 cut-off events. [2022-12-06 00:20:51,056 INFO L131 PetriNetUnfolder]: For 3810/3873 co-relation queries the response was YES. [2022-12-06 00:20:51,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2369 conditions, 391 events. 152/391 cut-off events. For 3810/3873 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2129 event pairs, 11 based on Foata normal form. 8/359 useless extension candidates. Maximal degree in co-relation 2327. Up to 101 conditions per place. [2022-12-06 00:20:51,060 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 95 transitions, 1318 flow [2022-12-06 00:20:51,060 INFO L188 LiptonReduction]: Number of co-enabled transitions 568 [2022-12-06 00:20:51,060 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:20:51,061 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-06 00:20:51,061 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 95 transitions, 1318 flow [2022-12-06 00:20:51,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:51,061 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:51,061 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 00:20:51,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-06 00:20:51,061 INFO L420 AbstractCegarLoop]: === Iteration 30 === 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 00:20:51,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:51,062 INFO L85 PathProgramCache]: Analyzing trace with hash 539111118, now seen corresponding path program 1 times [2022-12-06 00:20:51,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:51,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040431507] [2022-12-06 00:20:51,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:51,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:51,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:51,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:20:51,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:51,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040431507] [2022-12-06 00:20:51,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040431507] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:20:51,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326271150] [2022-12-06 00:20:51,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:51,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:20:51,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:20:51,939 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 00:20:52,001 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 00:20:52,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:52,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-06 00:20:52,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:20:52,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-12-06 00:20:52,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 00:20:52,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 00:20:52,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 00:20:52,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:20:52,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:20:52,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:20:52,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326271150] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:20:52,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:20:52,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-12-06 00:20:52,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732868362] [2022-12-06 00:20:52,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:20:52,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-06 00:20:52,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:52,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-06 00:20:52,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=568, Unknown=4, NotChecked=0, Total=702 [2022-12-06 00:20:52,890 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 00:20:52,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 95 transitions, 1318 flow. Second operand has 27 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 27 states have internal predecessors, (53), 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 00:20:52,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:52,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 00:20:52,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:04,970 INFO L130 PetriNetUnfolder]: 1127/1939 cut-off events. [2022-12-06 00:21:04,971 INFO L131 PetriNetUnfolder]: For 22999/22999 co-relation queries the response was YES. [2022-12-06 00:21:04,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12971 conditions, 1939 events. 1127/1939 cut-off events. For 22999/22999 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 10237 event pairs, 164 based on Foata normal form. 2/1939 useless extension candidates. Maximal degree in co-relation 12909. Up to 596 conditions per place. [2022-12-06 00:21:04,984 INFO L137 encePairwiseOnDemand]: 11/32 looper letters, 224 selfloop transitions, 137 changer transitions 26/387 dead transitions. [2022-12-06 00:21:04,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 387 transitions, 4501 flow [2022-12-06 00:21:04,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-06 00:21:04,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-12-06 00:21:04,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 276 transitions. [2022-12-06 00:21:04,987 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26136363636363635 [2022-12-06 00:21:04,987 INFO L175 Difference]: Start difference. First operand has 88 places, 95 transitions, 1318 flow. Second operand 33 states and 276 transitions. [2022-12-06 00:21:04,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 387 transitions, 4501 flow [2022-12-06 00:21:05,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 387 transitions, 4329 flow, removed 13 selfloop flow, removed 6 redundant places. [2022-12-06 00:21:05,016 INFO L231 Difference]: Finished difference. Result has 124 places, 203 transitions, 3023 flow [2022-12-06 00:21:05,016 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1242, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=3023, PETRI_PLACES=124, PETRI_TRANSITIONS=203} [2022-12-06 00:21:05,016 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 95 predicate places. [2022-12-06 00:21:05,016 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:05,016 INFO L89 Accepts]: Start accepts. Operand has 124 places, 203 transitions, 3023 flow [2022-12-06 00:21:05,017 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:05,017 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:05,018 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 203 transitions, 3023 flow [2022-12-06 00:21:05,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 203 transitions, 3023 flow [2022-12-06 00:21:05,081 INFO L130 PetriNetUnfolder]: 270/745 cut-off events. [2022-12-06 00:21:05,082 INFO L131 PetriNetUnfolder]: For 7879/8017 co-relation queries the response was YES. [2022-12-06 00:21:05,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4555 conditions, 745 events. 270/745 cut-off events. For 7879/8017 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5022 event pairs, 10 based on Foata normal form. 14/714 useless extension candidates. Maximal degree in co-relation 4486. Up to 184 conditions per place. [2022-12-06 00:21:05,089 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 203 transitions, 3023 flow [2022-12-06 00:21:05,089 INFO L188 LiptonReduction]: Number of co-enabled transitions 998 [2022-12-06 00:21:05,276 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [580] L67-5-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_31| (+ |v_thread2Thread1of1ForFork0_~i~1#1_32| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_32| 4294967296) (mod v_~A~0_35 4294967296)) (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_30| v_~B~0_29) |v_thread2Thread1of1ForFork0_~x~1#1_29|)) InVars {~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_32|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_30|} OutVars{~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_31|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_13|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:21:05,512 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [581] $Ultimate##0-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_35| 0) (= |v_thread2Thread1of1ForFork0_~x~1#1_33| 0)) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_35|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_~x~1#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:21:05,540 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [662] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse0 (mod v_~A~0_228 4294967296))) (and (= |v_thread2Thread1of1ForFork0_~i~1#1_142| 1) (not (= (ite (and (< v_~end~0_488 v_~n~0_272) (<= 0 v_~end~0_488)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_97| 0) (< 0 .cse0) (= |v_thread2Thread1of1ForFork0_~x~1#1_150| v_~B~0_114) (= |v_thread2Thread1of1ForFork0_#res#1.offset_97| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_107| 0)) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_142| 4294967296) .cse0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_107| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_107|) (= (+ v_~end~0_488 1) v_~end~0_487) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_107| (ite (= (mod (select (select |v_#memory_int_444| v_~queue~0.base_264) (+ (* v_~end~0_488 4) v_~queue~0.offset_264)) 4294967296) (mod |v_thread2Thread1of1ForFork0_~x~1#1_150| 4294967296)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_264, ~A~0=v_~A~0_228, ~B~0=v_~B~0_114, #memory_int=|v_#memory_int_444|, ~end~0=v_~end~0_488, ~queue~0.base=v_~queue~0.base_264, ~n~0=v_~n~0_272} OutVars{~queue~0.offset=v_~queue~0.offset_264, ~A~0=v_~A~0_228, ~B~0=v_~B~0_114, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_97|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_107|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_142|, ~queue~0.base=v_~queue~0.base_264, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_107|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_97|, #memory_int=|v_#memory_int_444|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_107|, ~end~0=v_~end~0_487, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_150|, ~n~0=v_~n~0_272, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_31|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_107|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_~x~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:21:05,673 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [580] L67-5-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_31| (+ |v_thread2Thread1of1ForFork0_~i~1#1_32| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_32| 4294967296) (mod v_~A~0_35 4294967296)) (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_30| v_~B~0_29) |v_thread2Thread1of1ForFork0_~x~1#1_29|)) InVars {~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_32|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_30|} OutVars{~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_31|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_13|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:21:05,935 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [631] $Ultimate##0-->L51-5: Formula: (and (< 0 (mod v_~A~0_156 4294967296)) (= |v_thread1Thread1of1ForFork2_~i~0#1_106| 1) (= |v_thread1Thread1of1ForFork2_~x~0#1_111| v_~B~0_82)) InVars {~A~0=v_~A~0_156, ~B~0=v_~B~0_82} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_38|, ~A~0=v_~A~0_156, ~B~0=v_~B~0_82, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_111|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_106|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] and [601] L102-4-->L103-3: Formula: (and (= (store |v_#memory_int_149| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_149| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre16#1_29|)) |v_#memory_int_148|) (= |v_#pthreadsForks_52| (+ |v_#pthreadsForks_53| 1)) (= |v_ULTIMATE.start_main_#t~pre16#1_29| |v_#pthreadsForks_53|)) InVars {#pthreadsForks=|v_#pthreadsForks_53|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{#pthreadsForks=|v_#pthreadsForks_52|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_41|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #memory_int=|v_#memory_int_148|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_29|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_23|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~pre14#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet15#1] [2022-12-06 00:21:06,097 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [669] L67-5-->thread2EXIT: Formula: (let ((.cse0 (mod v_~A~0_240 4294967296))) (and (= (+ v_~end~0_496 1) v_~end~0_495) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_168| 4294967296) .cse0)) (not (= (ite (and (< v_~end~0_496 v_~n~0_276) (<= 0 v_~end~0_496)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_111| 0)) (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_169| 1) |v_thread2Thread1of1ForFork0_~i~1#1_168|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_111| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_111|) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_176| 4294967296) (mod (select (select |v_#memory_int_462| v_~queue~0.base_268) (+ v_~queue~0.offset_268 (* v_~end~0_496 4))) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_111|) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_169| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork0_#res#1.base_101| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_101| 0) (= |v_thread2Thread1of1ForFork0_~x~1#1_176| (+ |v_thread2Thread1of1ForFork0_~x~1#1_177| v_~B~0_126)))) InVars {~queue~0.offset=v_~queue~0.offset_268, ~A~0=v_~A~0_240, ~B~0=v_~B~0_126, #memory_int=|v_#memory_int_462|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_169|, ~end~0=v_~end~0_496, ~queue~0.base=v_~queue~0.base_268, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_177|, ~n~0=v_~n~0_276} OutVars{~queue~0.offset=v_~queue~0.offset_268, ~A~0=v_~A~0_240, ~B~0=v_~B~0_126, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_101|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_111|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_168|, ~queue~0.base=v_~queue~0.base_268, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_111|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_101|, #memory_int=|v_#memory_int_462|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_111|, ~end~0=v_~end~0_495, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_176|, ~n~0=v_~n~0_276, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_45|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_111|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_~x~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:21:06,216 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 00:21:06,219 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1203 [2022-12-06 00:21:06,219 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 197 transitions, 3093 flow [2022-12-06 00:21:06,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 27 states have internal predecessors, (53), 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 00:21:06,220 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:06,221 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:21:06,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 00:21:06,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:21:06,427 INFO L420 AbstractCegarLoop]: === Iteration 31 === 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 00:21:06,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:06,427 INFO L85 PathProgramCache]: Analyzing trace with hash 278805811, now seen corresponding path program 1 times [2022-12-06 00:21:06,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:06,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986587589] [2022-12-06 00:21:06,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:06,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:06,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:07,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:21:07,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:07,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986587589] [2022-12-06 00:21:07,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986587589] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:21:07,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442591598] [2022-12-06 00:21:07,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:07,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:21:07,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:21:07,304 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 00:21:07,383 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 00:21:07,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:07,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-06 00:21:07,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:21:07,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:21:07,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2022-12-06 00:21:07,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:21:07,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2022-12-06 00:21:07,800 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:21:07,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 56 [2022-12-06 00:21:07,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:21:07,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:21:08,288 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_~start~0 4))) (let ((.cse6 (+ .cse10 c_~queue~0.offset 4)) (.cse5 (+ .cse10 c_~queue~0.offset)) (.cse1 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse2 (mod c_~B~0 4294967296))) (and (forall ((v_ArrVal_885 (Array Int Int)) (v_ArrVal_884 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_884) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_885) c_~queue~0.base))) (or (not (= (mod (select .cse0 .cse1) 4294967296) .cse2)) (let ((.cse4 (select .cse0 .cse6)) (.cse3 (select .cse0 .cse5))) (<= (+ .cse3 (* (div .cse4 4294967296) 4294967296)) (+ .cse4 (* (div .cse3 4294967296) 4294967296))))))) (forall ((v_ArrVal_885 (Array Int Int)) (v_ArrVal_884 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_884) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_885) c_~queue~0.base))) (or (let ((.cse8 (select .cse9 .cse5)) (.cse7 (select .cse9 .cse6))) (< (+ .cse7 (* (div .cse8 4294967296) 4294967296)) (+ .cse8 (* (div .cse7 4294967296) 4294967296) 1))) (not (= (mod (select .cse9 .cse1) 4294967296) .cse2)))))))) is different from false [2022-12-06 00:21:08,361 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:21:08,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 680 treesize of output 582 [2022-12-06 00:21:08,399 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:21:08,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 354 treesize of output 314 [2022-12-06 00:21:08,426 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:21:08,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 464 treesize of output 358 [2022-12-06 00:21:09,510 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 00:21:09,510 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 00:21:09,515 INFO L321 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-12-06 00:21:09,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 1 [2022-12-06 00:21:09,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:21:09,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442591598] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:21:09,546 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:21:09,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 20 [2022-12-06 00:21:09,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726590907] [2022-12-06 00:21:09,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:21:09,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 00:21:09,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:09,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 00:21:09,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=354, Unknown=3, NotChecked=38, Total=462 [2022-12-06 00:21:09,548 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 00:21:09,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 197 transitions, 3093 flow. Second operand has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:09,548 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:09,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 00:21:09,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:13,076 INFO L130 PetriNetUnfolder]: 1154/1984 cut-off events. [2022-12-06 00:21:13,077 INFO L131 PetriNetUnfolder]: For 29684/29684 co-relation queries the response was YES. [2022-12-06 00:21:13,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14457 conditions, 1984 events. 1154/1984 cut-off events. For 29684/29684 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 10470 event pairs, 302 based on Foata normal form. 1/1983 useless extension candidates. Maximal degree in co-relation 14374. Up to 1328 conditions per place. [2022-12-06 00:21:13,090 INFO L137 encePairwiseOnDemand]: 28/42 looper letters, 191 selfloop transitions, 60 changer transitions 13/264 dead transitions. [2022-12-06 00:21:13,090 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 264 transitions, 4111 flow [2022-12-06 00:21:13,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 00:21:13,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 00:21:13,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 107 transitions. [2022-12-06 00:21:13,092 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23160173160173161 [2022-12-06 00:21:13,092 INFO L175 Difference]: Start difference. First operand has 116 places, 197 transitions, 3093 flow. Second operand 11 states and 107 transitions. [2022-12-06 00:21:13,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 264 transitions, 4111 flow [2022-12-06 00:21:13,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 264 transitions, 3449 flow, removed 321 selfloop flow, removed 9 redundant places. [2022-12-06 00:21:13,145 INFO L231 Difference]: Finished difference. Result has 123 places, 207 transitions, 2839 flow [2022-12-06 00:21:13,146 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2547, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2839, PETRI_PLACES=123, PETRI_TRANSITIONS=207} [2022-12-06 00:21:13,146 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 94 predicate places. [2022-12-06 00:21:13,146 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:13,146 INFO L89 Accepts]: Start accepts. Operand has 123 places, 207 transitions, 2839 flow [2022-12-06 00:21:13,147 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:13,147 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:13,147 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 207 transitions, 2839 flow [2022-12-06 00:21:13,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 207 transitions, 2839 flow [2022-12-06 00:21:13,209 INFO L130 PetriNetUnfolder]: 277/767 cut-off events. [2022-12-06 00:21:13,209 INFO L131 PetriNetUnfolder]: For 7706/7816 co-relation queries the response was YES. [2022-12-06 00:21:13,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4259 conditions, 767 events. 277/767 cut-off events. For 7706/7816 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 5199 event pairs, 14 based on Foata normal form. 14/746 useless extension candidates. Maximal degree in co-relation 4198. Up to 143 conditions per place. [2022-12-06 00:21:13,216 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 207 transitions, 2839 flow [2022-12-06 00:21:13,216 INFO L188 LiptonReduction]: Number of co-enabled transitions 1012 [2022-12-06 00:21:15,135 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [676] L67-5-->thread2EXIT: Formula: (let ((.cse0 (mod v_~A~0_254 4294967296))) (and (= |v_thread2Thread1of1ForFork0_~x~1#1_194| (+ |v_thread2Thread1of1ForFork0_~x~1#1_195| v_~B~0_140)) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_185| 4294967296) .cse0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_117| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_117|) (not (= (ite (and (< v_~end~0_513 v_~n~0_284) (<= 0 v_~end~0_513)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_107| 0) (= v_~end~0_512 (+ v_~end~0_513 1)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_117| 0)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_186| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork0_#res#1.base_107| 0) (= |v_thread2Thread1of1ForFork0_~i~1#1_185| (+ |v_thread2Thread1of1ForFork0_~i~1#1_186| 1)) (= (ite (= (mod (select (select |v_#memory_int_484| v_~queue~0.base_278) (+ (* v_~end~0_513 4) v_~queue~0.offset_278)) 4294967296) (mod |v_thread2Thread1of1ForFork0_~x~1#1_194| 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_117|))) InVars {~queue~0.offset=v_~queue~0.offset_278, ~A~0=v_~A~0_254, ~B~0=v_~B~0_140, #memory_int=|v_#memory_int_484|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_186|, ~end~0=v_~end~0_513, ~queue~0.base=v_~queue~0.base_278, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_195|, ~n~0=v_~n~0_284} OutVars{~queue~0.offset=v_~queue~0.offset_278, ~A~0=v_~A~0_254, ~B~0=v_~B~0_140, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_107|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_117|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_185|, ~queue~0.base=v_~queue~0.base_278, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_117|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_107|, #memory_int=|v_#memory_int_484|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_117|, ~end~0=v_~end~0_512, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_194|, ~n~0=v_~n~0_284, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_55|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_117|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_~x~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:21:15,470 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 00:21:15,470 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2324 [2022-12-06 00:21:15,470 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 205 transitions, 2874 flow [2022-12-06 00:21:15,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:15,470 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:15,470 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:21:15,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-06 00:21:15,671 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,SelfDestructingSolverStorable30 [2022-12-06 00:21:15,671 INFO L420 AbstractCegarLoop]: === Iteration 32 === 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 00:21:15,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:15,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1287188282, now seen corresponding path program 1 times [2022-12-06 00:21:15,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:15,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123278888] [2022-12-06 00:21:15,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:15,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:15,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:17,087 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 00:21:17,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:17,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123278888] [2022-12-06 00:21:17,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123278888] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:17,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:17,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:21:17,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505752719] [2022-12-06 00:21:17,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:17,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:21:17,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:17,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:21:17,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:21:17,088 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 00:21:17,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 205 transitions, 2874 flow. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:17,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:17,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 00:21:17,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:17,679 INFO L130 PetriNetUnfolder]: 1169/2016 cut-off events. [2022-12-06 00:21:17,679 INFO L131 PetriNetUnfolder]: For 27131/27131 co-relation queries the response was YES. [2022-12-06 00:21:17,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13376 conditions, 2016 events. 1169/2016 cut-off events. For 27131/27131 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 10792 event pairs, 266 based on Foata normal form. 1/2016 useless extension candidates. Maximal degree in co-relation 13304. Up to 1265 conditions per place. [2022-12-06 00:21:17,694 INFO L137 encePairwiseOnDemand]: 28/46 looper letters, 175 selfloop transitions, 70 changer transitions 15/260 dead transitions. [2022-12-06 00:21:17,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 260 transitions, 3863 flow [2022-12-06 00:21:17,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:21:17,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:21:17,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2022-12-06 00:21:17,711 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2826086956521739 [2022-12-06 00:21:17,712 INFO L175 Difference]: Start difference. First operand has 120 places, 205 transitions, 2874 flow. Second operand 7 states and 91 transitions. [2022-12-06 00:21:17,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 260 transitions, 3863 flow [2022-12-06 00:21:17,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 260 transitions, 3718 flow, removed 50 selfloop flow, removed 5 redundant places. [2022-12-06 00:21:17,769 INFO L231 Difference]: Finished difference. Result has 125 places, 207 transitions, 2964 flow [2022-12-06 00:21:17,770 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=2731, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2964, PETRI_PLACES=125, PETRI_TRANSITIONS=207} [2022-12-06 00:21:17,770 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 96 predicate places. [2022-12-06 00:21:17,771 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:17,771 INFO L89 Accepts]: Start accepts. Operand has 125 places, 207 transitions, 2964 flow [2022-12-06 00:21:17,771 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:17,771 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:17,772 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 207 transitions, 2964 flow [2022-12-06 00:21:17,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 207 transitions, 2964 flow [2022-12-06 00:21:17,836 INFO L130 PetriNetUnfolder]: 280/781 cut-off events. [2022-12-06 00:21:17,837 INFO L131 PetriNetUnfolder]: For 8130/8254 co-relation queries the response was YES. [2022-12-06 00:21:17,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4547 conditions, 781 events. 280/781 cut-off events. For 8130/8254 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 5409 event pairs, 14 based on Foata normal form. 15/756 useless extension candidates. Maximal degree in co-relation 4484. Up to 145 conditions per place. [2022-12-06 00:21:17,844 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 207 transitions, 2964 flow [2022-12-06 00:21:17,844 INFO L188 LiptonReduction]: Number of co-enabled transitions 1004 [2022-12-06 00:21:17,854 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:21:17,855 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 00:21:17,855 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 207 transitions, 2964 flow [2022-12-06 00:21:17,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:17,855 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:17,855 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:21:17,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-06 00:21:17,855 INFO L420 AbstractCegarLoop]: === Iteration 33 === 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 00:21:17,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:17,856 INFO L85 PathProgramCache]: Analyzing trace with hash 2126455981, now seen corresponding path program 1 times [2022-12-06 00:21:17,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:17,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058789079] [2022-12-06 00:21:17,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:17,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:17,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:18,821 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 00:21:18,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:18,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058789079] [2022-12-06 00:21:18,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058789079] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:18,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:18,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:21:18,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697313167] [2022-12-06 00:21:18,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:18,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:21:18,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:18,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:21:18,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:21:18,822 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 00:21:18,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 207 transitions, 2964 flow. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:18,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:18,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 00:21:18,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:19,484 INFO L130 PetriNetUnfolder]: 1159/1985 cut-off events. [2022-12-06 00:21:19,484 INFO L131 PetriNetUnfolder]: For 27018/27018 co-relation queries the response was YES. [2022-12-06 00:21:19,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13627 conditions, 1985 events. 1159/1985 cut-off events. For 27018/27018 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 10505 event pairs, 313 based on Foata normal form. 1/1985 useless extension candidates. Maximal degree in co-relation 13556. Up to 1499 conditions per place. [2022-12-06 00:21:19,496 INFO L137 encePairwiseOnDemand]: 34/44 looper letters, 179 selfloop transitions, 44 changer transitions 14/237 dead transitions. [2022-12-06 00:21:19,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 237 transitions, 3590 flow [2022-12-06 00:21:19,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:21:19,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:21:19,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-12-06 00:21:19,497 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29545454545454547 [2022-12-06 00:21:19,497 INFO L175 Difference]: Start difference. First operand has 122 places, 207 transitions, 2964 flow. Second operand 6 states and 78 transitions. [2022-12-06 00:21:19,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 237 transitions, 3590 flow [2022-12-06 00:21:19,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 237 transitions, 3539 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-06 00:21:19,533 INFO L231 Difference]: Finished difference. Result has 125 places, 206 transitions, 2990 flow [2022-12-06 00:21:19,533 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2919, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2990, PETRI_PLACES=125, PETRI_TRANSITIONS=206} [2022-12-06 00:21:19,533 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 96 predicate places. [2022-12-06 00:21:19,534 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:19,534 INFO L89 Accepts]: Start accepts. Operand has 125 places, 206 transitions, 2990 flow [2022-12-06 00:21:19,541 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:19,541 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:19,541 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 206 transitions, 2990 flow [2022-12-06 00:21:19,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 206 transitions, 2990 flow [2022-12-06 00:21:19,601 INFO L130 PetriNetUnfolder]: 280/771 cut-off events. [2022-12-06 00:21:19,601 INFO L131 PetriNetUnfolder]: For 8959/9082 co-relation queries the response was YES. [2022-12-06 00:21:19,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4515 conditions, 771 events. 280/771 cut-off events. For 8959/9082 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 5317 event pairs, 14 based on Foata normal form. 16/748 useless extension candidates. Maximal degree in co-relation 4459. Up to 144 conditions per place. [2022-12-06 00:21:19,608 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 206 transitions, 2990 flow [2022-12-06 00:21:19,608 INFO L188 LiptonReduction]: Number of co-enabled transitions 1004 [2022-12-06 00:21:19,609 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:21:19,610 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 00:21:19,610 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 206 transitions, 2990 flow [2022-12-06 00:21:19,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:19,610 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:19,610 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:21:19,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-06 00:21:19,610 INFO L420 AbstractCegarLoop]: === Iteration 34 === 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 00:21:19,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:19,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1850105592, now seen corresponding path program 1 times [2022-12-06 00:21:19,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:19,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180231831] [2022-12-06 00:21:19,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:19,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:19,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:20,162 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 00:21:20,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:20,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180231831] [2022-12-06 00:21:20,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180231831] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:20,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:20,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:21:20,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061155246] [2022-12-06 00:21:20,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:20,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:21:20,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:20,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:21:20,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:21:20,163 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 00:21:20,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 206 transitions, 2990 flow. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:20,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:20,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 00:21:20,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:20,956 INFO L130 PetriNetUnfolder]: 1203/2140 cut-off events. [2022-12-06 00:21:20,956 INFO L131 PetriNetUnfolder]: For 28472/28472 co-relation queries the response was YES. [2022-12-06 00:21:20,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14094 conditions, 2140 events. 1203/2140 cut-off events. For 28472/28472 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 11901 event pairs, 320 based on Foata normal form. 1/2140 useless extension candidates. Maximal degree in co-relation 14006. Up to 1157 conditions per place. [2022-12-06 00:21:20,970 INFO L137 encePairwiseOnDemand]: 29/43 looper letters, 221 selfloop transitions, 40 changer transitions 14/275 dead transitions. [2022-12-06 00:21:20,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 275 transitions, 4011 flow [2022-12-06 00:21:20,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:21:20,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:21:20,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2022-12-06 00:21:20,972 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3168604651162791 [2022-12-06 00:21:20,972 INFO L175 Difference]: Start difference. First operand has 122 places, 206 transitions, 2990 flow. Second operand 8 states and 109 transitions. [2022-12-06 00:21:20,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 275 transitions, 4011 flow [2022-12-06 00:21:21,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 275 transitions, 3915 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-12-06 00:21:21,013 INFO L231 Difference]: Finished difference. Result has 128 places, 214 transitions, 3157 flow [2022-12-06 00:21:21,013 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2898, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3157, PETRI_PLACES=128, PETRI_TRANSITIONS=214} [2022-12-06 00:21:21,013 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 99 predicate places. [2022-12-06 00:21:21,013 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:21,013 INFO L89 Accepts]: Start accepts. Operand has 128 places, 214 transitions, 3157 flow [2022-12-06 00:21:21,014 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:21,014 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:21,014 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 214 transitions, 3157 flow [2022-12-06 00:21:21,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 214 transitions, 3157 flow [2022-12-06 00:21:21,081 INFO L130 PetriNetUnfolder]: 276/832 cut-off events. [2022-12-06 00:21:21,081 INFO L131 PetriNetUnfolder]: For 9073/9196 co-relation queries the response was YES. [2022-12-06 00:21:21,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4689 conditions, 832 events. 276/832 cut-off events. For 9073/9196 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 6056 event pairs, 14 based on Foata normal form. 16/809 useless extension candidates. Maximal degree in co-relation 4615. Up to 147 conditions per place. [2022-12-06 00:21:21,089 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 214 transitions, 3157 flow [2022-12-06 00:21:21,089 INFO L188 LiptonReduction]: Number of co-enabled transitions 1064 [2022-12-06 00:21:21,090 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:21:21,090 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 00:21:21,090 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 214 transitions, 3157 flow [2022-12-06 00:21:21,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:21,090 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:21,090 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:21:21,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-06 00:21:21,091 INFO L420 AbstractCegarLoop]: === Iteration 35 === 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 00:21:21,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:21,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1595528476, now seen corresponding path program 1 times [2022-12-06 00:21:21,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:21,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985262417] [2022-12-06 00:21:21,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:21,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:22,151 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 00:21:22,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:22,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985262417] [2022-12-06 00:21:22,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985262417] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:22,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:22,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:21:22,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241030085] [2022-12-06 00:21:22,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:22,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:21:22,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:22,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:21:22,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:21:22,152 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 00:21:22,153 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 214 transitions, 3157 flow. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:22,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:22,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 00:21:22,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:23,114 INFO L130 PetriNetUnfolder]: 1211/2153 cut-off events. [2022-12-06 00:21:23,115 INFO L131 PetriNetUnfolder]: For 29962/29962 co-relation queries the response was YES. [2022-12-06 00:21:23,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14421 conditions, 2153 events. 1211/2153 cut-off events. For 29962/29962 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 11897 event pairs, 289 based on Foata normal form. 1/2153 useless extension candidates. Maximal degree in co-relation 14331. Up to 1254 conditions per place. [2022-12-06 00:21:23,132 INFO L137 encePairwiseOnDemand]: 23/42 looper letters, 182 selfloop transitions, 80 changer transitions 14/276 dead transitions. [2022-12-06 00:21:23,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 276 transitions, 4179 flow [2022-12-06 00:21:23,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:21:23,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:21:23,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2022-12-06 00:21:23,133 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26455026455026454 [2022-12-06 00:21:23,134 INFO L175 Difference]: Start difference. First operand has 126 places, 214 transitions, 3157 flow. Second operand 9 states and 100 transitions. [2022-12-06 00:21:23,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 276 transitions, 4179 flow [2022-12-06 00:21:23,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 276 transitions, 4156 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-06 00:21:23,189 INFO L231 Difference]: Finished difference. Result has 135 places, 215 transitions, 3314 flow [2022-12-06 00:21:23,190 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3138, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3314, PETRI_PLACES=135, PETRI_TRANSITIONS=215} [2022-12-06 00:21:23,190 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 106 predicate places. [2022-12-06 00:21:23,190 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:23,190 INFO L89 Accepts]: Start accepts. Operand has 135 places, 215 transitions, 3314 flow [2022-12-06 00:21:23,191 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:23,192 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:23,193 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 215 transitions, 3314 flow [2022-12-06 00:21:23,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 215 transitions, 3314 flow [2022-12-06 00:21:23,288 INFO L130 PetriNetUnfolder]: 273/832 cut-off events. [2022-12-06 00:21:23,288 INFO L131 PetriNetUnfolder]: For 9752/9852 co-relation queries the response was YES. [2022-12-06 00:21:23,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4843 conditions, 832 events. 273/832 cut-off events. For 9752/9852 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 6023 event pairs, 14 based on Foata normal form. 10/806 useless extension candidates. Maximal degree in co-relation 4783. Up to 146 conditions per place. [2022-12-06 00:21:23,296 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 215 transitions, 3314 flow [2022-12-06 00:21:23,297 INFO L188 LiptonReduction]: Number of co-enabled transitions 1072 [2022-12-06 00:21:23,300 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] $Ultimate##0-->L104-3: Formula: (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork0_~i~1#1_150|) 4294967296) (mod v_~A~0_232 4294967296)) (= |v_#memory_int_446| (store |v_#memory_int_447| |v_ULTIMATE.start_main_~#t3~0#1.base_166| (store (select |v_#memory_int_447| |v_ULTIMATE.start_main_~#t3~0#1.base_166|) |v_ULTIMATE.start_main_~#t3~0#1.offset_148| |v_ULTIMATE.start_main_#t~pre18#1_146|))) (= |v_thread2Thread1of1ForFork0_~x~1#1_158| v_~B~0_118) (= |v_ULTIMATE.start_main_#t~pre18#1_146| |v_#pthreadsForks_281|) (= |v_#pthreadsForks_280| (+ |v_#pthreadsForks_281| 1)) (= |v_thread2Thread1of1ForFork0_~i~1#1_150| 1)) InVars {~A~0=v_~A~0_232, #pthreadsForks=|v_#pthreadsForks_281|, ~B~0=v_~B~0_118, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_148|, #memory_int=|v_#memory_int_447|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_166|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_146|, ~A~0=v_~A~0_232, #pthreadsForks=|v_#pthreadsForks_280|, ~B~0=v_~B~0_118, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_148|, #memory_int=|v_#memory_int_446|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_166|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_154|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_150|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_133|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_35|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_158|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, thread2Thread1of1ForFork0_~i~1#1, ULTIMATE.start_main_#t~nondet17#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] and [580] L67-5-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_31| (+ |v_thread2Thread1of1ForFork0_~i~1#1_32| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_32| 4294967296) (mod v_~A~0_35 4294967296)) (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_30| v_~B~0_29) |v_thread2Thread1of1ForFork0_~x~1#1_29|)) InVars {~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_32|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_30|} OutVars{~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_31|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_13|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] [2022-12-06 00:21:23,366 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:21:23,367 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 00:21:23,367 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 214 transitions, 3308 flow [2022-12-06 00:21:23,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:23,367 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:23,367 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:21:23,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-06 00:21:23,367 INFO L420 AbstractCegarLoop]: === Iteration 36 === 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 00:21:23,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:23,368 INFO L85 PathProgramCache]: Analyzing trace with hash 66329345, now seen corresponding path program 1 times [2022-12-06 00:21:23,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:23,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884589482] [2022-12-06 00:21:23,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:23,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:23,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:23,406 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 00:21:23,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:23,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884589482] [2022-12-06 00:21:23,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884589482] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:23,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:23,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:21:23,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133073209] [2022-12-06 00:21:23,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:23,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:21:23,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:23,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:21:23,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:21:23,407 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 00:21:23,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 214 transitions, 3308 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:23,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:23,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 00:21:23,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:23,775 INFO L130 PetriNetUnfolder]: 1254/2310 cut-off events. [2022-12-06 00:21:23,775 INFO L131 PetriNetUnfolder]: For 33159/33159 co-relation queries the response was YES. [2022-12-06 00:21:23,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15517 conditions, 2310 events. 1254/2310 cut-off events. For 33159/33159 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 13435 event pairs, 387 based on Foata normal form. 19/2328 useless extension candidates. Maximal degree in co-relation 15407. Up to 1345 conditions per place. [2022-12-06 00:21:23,795 INFO L137 encePairwiseOnDemand]: 26/42 looper letters, 204 selfloop transitions, 61 changer transitions 2/267 dead transitions. [2022-12-06 00:21:23,795 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 267 transitions, 4382 flow [2022-12-06 00:21:23,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:21:23,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:21:23,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-12-06 00:21:23,796 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39880952380952384 [2022-12-06 00:21:23,796 INFO L175 Difference]: Start difference. First operand has 132 places, 214 transitions, 3308 flow. Second operand 4 states and 67 transitions. [2022-12-06 00:21:23,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 267 transitions, 4382 flow [2022-12-06 00:21:23,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 267 transitions, 4239 flow, removed 7 selfloop flow, removed 7 redundant places. [2022-12-06 00:21:23,856 INFO L231 Difference]: Finished difference. Result has 129 places, 216 transitions, 3388 flow [2022-12-06 00:21:23,856 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3103, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3388, PETRI_PLACES=129, PETRI_TRANSITIONS=216} [2022-12-06 00:21:23,856 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 100 predicate places. [2022-12-06 00:21:23,856 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:23,856 INFO L89 Accepts]: Start accepts. Operand has 129 places, 216 transitions, 3388 flow [2022-12-06 00:21:23,857 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:23,857 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:23,857 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 216 transitions, 3388 flow [2022-12-06 00:21:23,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 216 transitions, 3388 flow [2022-12-06 00:21:23,931 INFO L130 PetriNetUnfolder]: 273/899 cut-off events. [2022-12-06 00:21:23,931 INFO L131 PetriNetUnfolder]: For 10631/10752 co-relation queries the response was YES. [2022-12-06 00:21:23,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5101 conditions, 899 events. 273/899 cut-off events. For 10631/10752 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 6892 event pairs, 15 based on Foata normal form. 18/877 useless extension candidates. Maximal degree in co-relation 4963. Up to 149 conditions per place. [2022-12-06 00:21:23,939 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 216 transitions, 3388 flow [2022-12-06 00:21:23,939 INFO L188 LiptonReduction]: Number of co-enabled transitions 1066 [2022-12-06 00:21:23,940 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:21:23,941 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-06 00:21:23,941 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 216 transitions, 3388 flow [2022-12-06 00:21:23,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:23,941 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:23,941 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:21:23,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-06 00:21:23,941 INFO L420 AbstractCegarLoop]: === Iteration 37 === 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 00:21:23,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:23,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1498197417, now seen corresponding path program 1 times [2022-12-06 00:21:23,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:23,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048492893] [2022-12-06 00:21:23,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:23,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:24,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:21:24,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:24,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048492893] [2022-12-06 00:21:24,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048492893] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:21:24,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740299005] [2022-12-06 00:21:24,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:24,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:21:24,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:21:24,856 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:21:24,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 00:21:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:24,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-06 00:21:24,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:21:25,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:21:25,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-06 00:21:25,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:21:25,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:21:25,432 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-06 00:21:25,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 86 [2022-12-06 00:21:25,446 INFO L321 Elim1Store]: treesize reduction 23, result has 14.8 percent of original size [2022-12-06 00:21:25,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 42 [2022-12-06 00:21:25,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:21:25,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740299005] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:21:25,525 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:21:25,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-12-06 00:21:25,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991853284] [2022-12-06 00:21:25,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:21:25,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 00:21:25,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:25,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 00:21:25,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2022-12-06 00:21:25,526 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 00:21:25,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 216 transitions, 3388 flow. Second operand has 23 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 22 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:25,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:25,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 00:21:25,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:27,297 INFO L130 PetriNetUnfolder]: 1677/3071 cut-off events. [2022-12-06 00:21:27,298 INFO L131 PetriNetUnfolder]: For 42713/42713 co-relation queries the response was YES. [2022-12-06 00:21:27,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20200 conditions, 3071 events. 1677/3071 cut-off events. For 42713/42713 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 19204 event pairs, 226 based on Foata normal form. 2/3072 useless extension candidates. Maximal degree in co-relation 19695. Up to 545 conditions per place. [2022-12-06 00:21:27,319 INFO L137 encePairwiseOnDemand]: 12/37 looper letters, 229 selfloop transitions, 179 changer transitions 16/424 dead transitions. [2022-12-06 00:21:27,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 424 transitions, 6102 flow [2022-12-06 00:21:27,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 00:21:27,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 00:21:27,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 192 transitions. [2022-12-06 00:21:27,320 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2594594594594595 [2022-12-06 00:21:27,321 INFO L175 Difference]: Start difference. First operand has 128 places, 216 transitions, 3388 flow. Second operand 20 states and 192 transitions. [2022-12-06 00:21:27,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 424 transitions, 6102 flow [2022-12-06 00:21:27,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 424 transitions, 6016 flow, removed 20 selfloop flow, removed 2 redundant places. [2022-12-06 00:21:27,389 INFO L231 Difference]: Finished difference. Result has 156 places, 268 transitions, 4572 flow [2022-12-06 00:21:27,390 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3331, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=4572, PETRI_PLACES=156, PETRI_TRANSITIONS=268} [2022-12-06 00:21:27,390 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 127 predicate places. [2022-12-06 00:21:27,390 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:27,390 INFO L89 Accepts]: Start accepts. Operand has 156 places, 268 transitions, 4572 flow [2022-12-06 00:21:27,391 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:27,391 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:27,392 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 268 transitions, 4572 flow [2022-12-06 00:21:27,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 268 transitions, 4572 flow [2022-12-06 00:21:27,503 INFO L130 PetriNetUnfolder]: 336/1150 cut-off events. [2022-12-06 00:21:27,503 INFO L131 PetriNetUnfolder]: For 15539/15664 co-relation queries the response was YES. [2022-12-06 00:21:27,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6784 conditions, 1150 events. 336/1150 cut-off events. For 15539/15664 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 9540 event pairs, 21 based on Foata normal form. 20/1135 useless extension candidates. Maximal degree in co-relation 6688. Up to 196 conditions per place. [2022-12-06 00:21:27,517 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 268 transitions, 4572 flow [2022-12-06 00:21:27,517 INFO L188 LiptonReduction]: Number of co-enabled transitions 1360 [2022-12-06 00:21:27,519 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:21:27,834 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [648] $Ultimate##0-->L51-5: Formula: (and (= |v_thread1Thread1of1ForFork2_~i~0#1_142| 1) (= |v_thread1Thread1of1ForFork2_~x~0#1_147| v_~B~0_98) (< (mod (+ |v_thread1Thread1of1ForFork2_~i~0#1_142| 4294967295) 4294967296) (mod v_~A~0_196 4294967296))) InVars {~A~0=v_~A~0_196, ~B~0=v_~B~0_98} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_48|, ~A~0=v_~A~0_196, ~B~0=v_~B~0_98, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_147|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_142|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] and [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] [2022-12-06 00:21:27,969 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:21:27,969 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 579 [2022-12-06 00:21:27,969 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 267 transitions, 4618 flow [2022-12-06 00:21:27,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 22 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:27,970 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:27,970 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:21:27,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-06 00:21:28,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:21:28,170 INFO L420 AbstractCegarLoop]: === Iteration 38 === 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 00:21:28,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:28,171 INFO L85 PathProgramCache]: Analyzing trace with hash 2067507264, now seen corresponding path program 1 times [2022-12-06 00:21:28,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:28,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003144593] [2022-12-06 00:21:28,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:28,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:28,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:29,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:21:29,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:29,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003144593] [2022-12-06 00:21:29,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003144593] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:21:29,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234459417] [2022-12-06 00:21:29,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:29,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:21:29,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:21:29,160 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:21:29,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 00:21:29,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:29,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-06 00:21:29,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:21:29,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:21:29,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-12-06 00:21:29,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:21:29,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:21:29,713 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-06 00:21:29,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 87 treesize of output 61 [2022-12-06 00:21:29,718 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:21:29,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 7 [2022-12-06 00:21:29,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:21:29,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234459417] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:21:29,787 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:21:29,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-12-06 00:21:29,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379001951] [2022-12-06 00:21:29,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:21:29,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 00:21:29,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:29,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 00:21:29,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2022-12-06 00:21:29,788 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 00:21:29,788 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 267 transitions, 4618 flow. Second operand has 23 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 22 states have internal predecessors, (51), 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 00:21:29,788 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:29,788 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 00:21:29,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:32,155 INFO L130 PetriNetUnfolder]: 1715/3149 cut-off events. [2022-12-06 00:21:32,155 INFO L131 PetriNetUnfolder]: For 55292/55292 co-relation queries the response was YES. [2022-12-06 00:21:32,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22480 conditions, 3149 events. 1715/3149 cut-off events. For 55292/55292 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 19945 event pairs, 267 based on Foata normal form. 1/3150 useless extension candidates. Maximal degree in co-relation 22362. Up to 682 conditions per place. [2022-12-06 00:21:32,178 INFO L137 encePairwiseOnDemand]: 14/41 looper letters, 267 selfloop transitions, 150 changer transitions 14/431 dead transitions. [2022-12-06 00:21:32,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 431 transitions, 6944 flow [2022-12-06 00:21:32,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 00:21:32,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 00:21:32,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 180 transitions. [2022-12-06 00:21:32,179 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23106546854942234 [2022-12-06 00:21:32,179 INFO L175 Difference]: Start difference. First operand has 154 places, 267 transitions, 4618 flow. Second operand 19 states and 180 transitions. [2022-12-06 00:21:32,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 431 transitions, 6944 flow [2022-12-06 00:21:32,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 431 transitions, 6612 flow, removed 87 selfloop flow, removed 7 redundant places. [2022-12-06 00:21:32,312 INFO L231 Difference]: Finished difference. Result has 169 places, 275 transitions, 4746 flow [2022-12-06 00:21:32,312 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4298, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4746, PETRI_PLACES=169, PETRI_TRANSITIONS=275} [2022-12-06 00:21:32,312 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 140 predicate places. [2022-12-06 00:21:32,312 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:32,312 INFO L89 Accepts]: Start accepts. Operand has 169 places, 275 transitions, 4746 flow [2022-12-06 00:21:32,313 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:32,313 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:32,313 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 275 transitions, 4746 flow [2022-12-06 00:21:32,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 275 transitions, 4746 flow [2022-12-06 00:21:32,417 INFO L130 PetriNetUnfolder]: 347/1217 cut-off events. [2022-12-06 00:21:32,417 INFO L131 PetriNetUnfolder]: For 15611/15775 co-relation queries the response was YES. [2022-12-06 00:21:32,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7153 conditions, 1217 events. 347/1217 cut-off events. For 15611/15775 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 10337 event pairs, 18 based on Foata normal form. 17/1190 useless extension candidates. Maximal degree in co-relation 7084. Up to 214 conditions per place. [2022-12-06 00:21:32,428 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 167 places, 275 transitions, 4746 flow [2022-12-06 00:21:32,428 INFO L188 LiptonReduction]: Number of co-enabled transitions 1410 [2022-12-06 00:21:32,518 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [667] L67-5-->L104-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre18#1_152| |v_#pthreadsForks_293|) (= (store |v_#memory_int_459| |v_ULTIMATE.start_main_~#t3~0#1.base_172| (store (select |v_#memory_int_459| |v_ULTIMATE.start_main_~#t3~0#1.base_172|) |v_ULTIMATE.start_main_~#t3~0#1.offset_154| |v_ULTIMATE.start_main_#t~pre18#1_152|)) |v_#memory_int_458|) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_159| 4294967296) (mod v_~A~0_236 4294967296)) (= |v_thread2Thread1of1ForFork0_~i~1#1_158| (+ |v_thread2Thread1of1ForFork0_~i~1#1_159| 1)) (= |v_thread2Thread1of1ForFork0_~x~1#1_166| (+ |v_thread2Thread1of1ForFork0_~x~1#1_167| v_~B~0_122)) (= (+ |v_#pthreadsForks_293| 1) |v_#pthreadsForks_292|)) InVars {~A~0=v_~A~0_236, #pthreadsForks=|v_#pthreadsForks_293|, ~B~0=v_~B~0_122, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_154|, #memory_int=|v_#memory_int_459|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_172|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_159|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_167|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_152|, ~A~0=v_~A~0_236, #pthreadsForks=|v_#pthreadsForks_292|, ~B~0=v_~B~0_122, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_154|, #memory_int=|v_#memory_int_458|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_172|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_160|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_158|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_139|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_39|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_166|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, thread2Thread1of1ForFork0_~i~1#1, ULTIMATE.start_main_#t~nondet17#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] and [580] L67-5-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_31| (+ |v_thread2Thread1of1ForFork0_~i~1#1_32| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_32| 4294967296) (mod v_~A~0_35 4294967296)) (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_30| v_~B~0_29) |v_thread2Thread1of1ForFork0_~x~1#1_29|)) InVars {~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_32|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_30|} OutVars{~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_31|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_13|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] [2022-12-06 00:21:32,582 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:21:32,583 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 271 [2022-12-06 00:21:32,583 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 274 transitions, 4746 flow [2022-12-06 00:21:32,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 22 states have internal predecessors, (51), 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 00:21:32,583 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:32,583 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:21:32,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 00:21:32,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-06 00:21:32,788 INFO L420 AbstractCegarLoop]: === Iteration 39 === 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 00:21:32,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:32,789 INFO L85 PathProgramCache]: Analyzing trace with hash -4401964, now seen corresponding path program 1 times [2022-12-06 00:21:32,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:32,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556038713] [2022-12-06 00:21:32,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:32,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:35,433 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 00:21:35,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:35,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556038713] [2022-12-06 00:21:35,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556038713] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:35,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:35,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 00:21:35,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559621251] [2022-12-06 00:21:35,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:35,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 00:21:35,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:35,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 00:21:35,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-12-06 00:21:35,435 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 00:21:35,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 274 transitions, 4746 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:35,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:35,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 00:21:35,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:36,579 INFO L130 PetriNetUnfolder]: 1749/3191 cut-off events. [2022-12-06 00:21:36,580 INFO L131 PetriNetUnfolder]: For 55239/55239 co-relation queries the response was YES. [2022-12-06 00:21:36,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22926 conditions, 3191 events. 1749/3191 cut-off events. For 55239/55239 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 20009 event pairs, 464 based on Foata normal form. 1/3192 useless extension candidates. Maximal degree in co-relation 22808. Up to 2546 conditions per place. [2022-12-06 00:21:36,601 INFO L137 encePairwiseOnDemand]: 26/42 looper letters, 254 selfloop transitions, 68 changer transitions 13/335 dead transitions. [2022-12-06 00:21:36,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 335 transitions, 6005 flow [2022-12-06 00:21:36,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:21:36,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:21:36,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2022-12-06 00:21:36,602 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28273809523809523 [2022-12-06 00:21:36,602 INFO L175 Difference]: Start difference. First operand has 165 places, 274 transitions, 4746 flow. Second operand 8 states and 95 transitions. [2022-12-06 00:21:36,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 335 transitions, 6005 flow [2022-12-06 00:21:36,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 335 transitions, 5802 flow, removed 13 selfloop flow, removed 12 redundant places. [2022-12-06 00:21:36,715 INFO L231 Difference]: Finished difference. Result has 166 places, 292 transitions, 5072 flow [2022-12-06 00:21:36,715 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4559, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5072, PETRI_PLACES=166, PETRI_TRANSITIONS=292} [2022-12-06 00:21:36,715 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 137 predicate places. [2022-12-06 00:21:36,715 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:36,715 INFO L89 Accepts]: Start accepts. Operand has 166 places, 292 transitions, 5072 flow [2022-12-06 00:21:36,716 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:36,717 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:36,717 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 292 transitions, 5072 flow [2022-12-06 00:21:36,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 292 transitions, 5072 flow [2022-12-06 00:21:36,836 INFO L130 PetriNetUnfolder]: 363/1267 cut-off events. [2022-12-06 00:21:36,837 INFO L131 PetriNetUnfolder]: For 16144/16201 co-relation queries the response was YES. [2022-12-06 00:21:36,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7587 conditions, 1267 events. 363/1267 cut-off events. For 16144/16201 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 10893 event pairs, 22 based on Foata normal form. 7/1240 useless extension candidates. Maximal degree in co-relation 7487. Up to 224 conditions per place. [2022-12-06 00:21:36,852 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 165 places, 292 transitions, 5072 flow [2022-12-06 00:21:36,852 INFO L188 LiptonReduction]: Number of co-enabled transitions 1478 [2022-12-06 00:21:37,011 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [581] $Ultimate##0-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_35| 0) (= |v_thread2Thread1of1ForFork0_~x~1#1_33| 0)) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_35|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_~x~1#1] and [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] [2022-12-06 00:21:37,125 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [581] $Ultimate##0-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_35| 0) (= |v_thread2Thread1of1ForFork0_~x~1#1_33| 0)) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_35|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_~x~1#1] and [600] L51-5-->L51-5: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_~i~0#1_28| 1) |v_thread1Thread1of1ForFork2_~i~0#1_27|) (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_28| 4294967296) (mod v_~A~0_57 4294967296)) (= |v_thread1Thread1of1ForFork2_~x~0#1_31| (+ |v_thread1Thread1of1ForFork2_~x~0#1_32| v_~B~0_47))) InVars {~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_32|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_28|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_15|, ~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_31|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] [2022-12-06 00:21:37,157 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:21:37,290 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:21:37,291 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 576 [2022-12-06 00:21:37,291 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 291 transitions, 5108 flow [2022-12-06 00:21:37,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:37,291 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:37,291 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:21:37,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-06 00:21:37,291 INFO L420 AbstractCegarLoop]: === Iteration 40 === 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 00:21:37,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:37,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1282979069, now seen corresponding path program 1 times [2022-12-06 00:21:37,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:37,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522250156] [2022-12-06 00:21:37,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:37,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:37,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:37,353 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 00:21:37,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:37,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522250156] [2022-12-06 00:21:37,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522250156] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:37,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:37,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:21:37,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741449624] [2022-12-06 00:21:37,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:37,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:21:37,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:37,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:21:37,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:21:37,354 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 00:21:37,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 291 transitions, 5108 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:37,355 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:37,355 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 00:21:37,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:37,988 INFO L130 PetriNetUnfolder]: 1744/3204 cut-off events. [2022-12-06 00:21:37,988 INFO L131 PetriNetUnfolder]: For 57659/57659 co-relation queries the response was YES. [2022-12-06 00:21:38,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23119 conditions, 3204 events. 1744/3204 cut-off events. For 57659/57659 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 20193 event pairs, 463 based on Foata normal form. 12/3216 useless extension candidates. Maximal degree in co-relation 22994. Up to 1998 conditions per place. [2022-12-06 00:21:38,016 INFO L137 encePairwiseOnDemand]: 27/47 looper letters, 271 selfloop transitions, 80 changer transitions 10/361 dead transitions. [2022-12-06 00:21:38,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 361 transitions, 6455 flow [2022-12-06 00:21:38,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:21:38,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:21:38,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2022-12-06 00:21:38,018 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31560283687943264 [2022-12-06 00:21:38,018 INFO L175 Difference]: Start difference. First operand has 164 places, 291 transitions, 5108 flow. Second operand 6 states and 89 transitions. [2022-12-06 00:21:38,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 361 transitions, 6455 flow [2022-12-06 00:21:38,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 361 transitions, 6334 flow, removed 59 selfloop flow, removed 3 redundant places. [2022-12-06 00:21:38,156 INFO L231 Difference]: Finished difference. Result has 168 places, 282 transitions, 4994 flow [2022-12-06 00:21:38,157 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=4920, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4994, PETRI_PLACES=168, PETRI_TRANSITIONS=282} [2022-12-06 00:21:38,157 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 139 predicate places. [2022-12-06 00:21:38,157 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:38,157 INFO L89 Accepts]: Start accepts. Operand has 168 places, 282 transitions, 4994 flow [2022-12-06 00:21:38,158 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:38,158 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:38,158 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 282 transitions, 4994 flow [2022-12-06 00:21:38,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 282 transitions, 4994 flow [2022-12-06 00:21:38,290 INFO L130 PetriNetUnfolder]: 353/1245 cut-off events. [2022-12-06 00:21:38,290 INFO L131 PetriNetUnfolder]: For 17257/17324 co-relation queries the response was YES. [2022-12-06 00:21:38,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7482 conditions, 1245 events. 353/1245 cut-off events. For 17257/17324 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 10661 event pairs, 21 based on Foata normal form. 11/1221 useless extension candidates. Maximal degree in co-relation 7285. Up to 219 conditions per place. [2022-12-06 00:21:38,307 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 165 places, 282 transitions, 4994 flow [2022-12-06 00:21:38,307 INFO L188 LiptonReduction]: Number of co-enabled transitions 1428 [2022-12-06 00:21:38,337 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:21:38,338 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 00:21:38,338 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 281 transitions, 4978 flow [2022-12-06 00:21:38,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:38,338 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:38,338 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:21:38,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-06 00:21:38,339 INFO L420 AbstractCegarLoop]: === Iteration 41 === 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 00:21:38,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:38,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1598092600, now seen corresponding path program 1 times [2022-12-06 00:21:38,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:38,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146766765] [2022-12-06 00:21:38,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:38,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:38,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:41,094 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 00:21:41,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:41,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146766765] [2022-12-06 00:21:41,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146766765] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:41,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:41,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:21:41,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016219112] [2022-12-06 00:21:41,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:41,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:21:41,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:41,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:21:41,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:21:41,120 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 00:21:41,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 281 transitions, 4978 flow. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:41,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:41,120 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 00:21:41,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:42,117 INFO L130 PetriNetUnfolder]: 1733/3192 cut-off events. [2022-12-06 00:21:42,117 INFO L131 PetriNetUnfolder]: For 58127/58127 co-relation queries the response was YES. [2022-12-06 00:21:42,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23141 conditions, 3192 events. 1733/3192 cut-off events. For 58127/58127 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 20186 event pairs, 448 based on Foata normal form. 1/3193 useless extension candidates. Maximal degree in co-relation 22567. Up to 2534 conditions per place. [2022-12-06 00:21:42,139 INFO L137 encePairwiseOnDemand]: 26/44 looper letters, 245 selfloop transitions, 64 changer transitions 16/325 dead transitions. [2022-12-06 00:21:42,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 325 transitions, 5997 flow [2022-12-06 00:21:42,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:21:42,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:21:42,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 88 transitions. [2022-12-06 00:21:42,140 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2857142857142857 [2022-12-06 00:21:42,140 INFO L175 Difference]: Start difference. First operand has 164 places, 281 transitions, 4978 flow. Second operand 7 states and 88 transitions. [2022-12-06 00:21:42,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 325 transitions, 5997 flow [2022-12-06 00:21:42,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 325 transitions, 5915 flow, removed 16 selfloop flow, removed 5 redundant places. [2022-12-06 00:21:42,266 INFO L231 Difference]: Finished difference. Result has 168 places, 282 transitions, 5063 flow [2022-12-06 00:21:42,266 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=4904, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5063, PETRI_PLACES=168, PETRI_TRANSITIONS=282} [2022-12-06 00:21:42,267 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 139 predicate places. [2022-12-06 00:21:42,267 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:42,267 INFO L89 Accepts]: Start accepts. Operand has 168 places, 282 transitions, 5063 flow [2022-12-06 00:21:42,268 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:42,268 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:42,268 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 282 transitions, 5063 flow [2022-12-06 00:21:42,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 282 transitions, 5063 flow [2022-12-06 00:21:42,388 INFO L130 PetriNetUnfolder]: 352/1262 cut-off events. [2022-12-06 00:21:42,388 INFO L131 PetriNetUnfolder]: For 18261/18328 co-relation queries the response was YES. [2022-12-06 00:21:42,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7596 conditions, 1262 events. 352/1262 cut-off events. For 18261/18328 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 10951 event pairs, 21 based on Foata normal form. 11/1238 useless extension candidates. Maximal degree in co-relation 7495. Up to 220 conditions per place. [2022-12-06 00:21:42,402 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 166 places, 282 transitions, 5063 flow [2022-12-06 00:21:42,402 INFO L188 LiptonReduction]: Number of co-enabled transitions 1430 [2022-12-06 00:21:42,403 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:21:42,403 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-06 00:21:42,403 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 282 transitions, 5063 flow [2022-12-06 00:21:42,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:42,404 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:42,404 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:21:42,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-06 00:21:42,404 INFO L420 AbstractCegarLoop]: === Iteration 42 === 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 00:21:42,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:42,404 INFO L85 PathProgramCache]: Analyzing trace with hash -925610045, now seen corresponding path program 1 times [2022-12-06 00:21:42,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:42,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104771682] [2022-12-06 00:21:42,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:42,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:42,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:43,861 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 00:21:43,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:43,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104771682] [2022-12-06 00:21:43,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104771682] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:43,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:43,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:21:43,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078072721] [2022-12-06 00:21:43,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:43,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:21:43,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:43,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:21:43,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:21:43,862 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 00:21:43,862 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 282 transitions, 5063 flow. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:43,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:43,862 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 00:21:43,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:44,799 INFO L130 PetriNetUnfolder]: 1717/3162 cut-off events. [2022-12-06 00:21:44,799 INFO L131 PetriNetUnfolder]: For 59029/59029 co-relation queries the response was YES. [2022-12-06 00:21:44,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23037 conditions, 3162 events. 1717/3162 cut-off events. For 59029/59029 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 19988 event pairs, 451 based on Foata normal form. 1/3163 useless extension candidates. Maximal degree in co-relation 22913. Up to 2534 conditions per place. [2022-12-06 00:21:44,825 INFO L137 encePairwiseOnDemand]: 26/43 looper letters, 243 selfloop transitions, 63 changer transitions 15/321 dead transitions. [2022-12-06 00:21:44,825 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 321 transitions, 5998 flow [2022-12-06 00:21:44,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:21:44,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:21:44,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2022-12-06 00:21:44,826 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27906976744186046 [2022-12-06 00:21:44,826 INFO L175 Difference]: Start difference. First operand has 166 places, 282 transitions, 5063 flow. Second operand 7 states and 84 transitions. [2022-12-06 00:21:44,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 321 transitions, 5998 flow [2022-12-06 00:21:44,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 321 transitions, 5851 flow, removed 9 selfloop flow, removed 6 redundant places. [2022-12-06 00:21:44,952 INFO L231 Difference]: Finished difference. Result has 168 places, 283 transitions, 5057 flow [2022-12-06 00:21:44,953 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=4916, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5057, PETRI_PLACES=168, PETRI_TRANSITIONS=283} [2022-12-06 00:21:44,953 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 139 predicate places. [2022-12-06 00:21:44,953 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:44,953 INFO L89 Accepts]: Start accepts. Operand has 168 places, 283 transitions, 5057 flow [2022-12-06 00:21:44,954 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:44,954 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:44,954 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 283 transitions, 5057 flow [2022-12-06 00:21:44,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 283 transitions, 5057 flow [2022-12-06 00:21:45,074 INFO L130 PetriNetUnfolder]: 351/1261 cut-off events. [2022-12-06 00:21:45,075 INFO L131 PetriNetUnfolder]: For 17917/17975 co-relation queries the response was YES. [2022-12-06 00:21:45,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7599 conditions, 1261 events. 351/1261 cut-off events. For 17917/17975 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 10972 event pairs, 22 based on Foata normal form. 8/1234 useless extension candidates. Maximal degree in co-relation 7499. Up to 225 conditions per place. [2022-12-06 00:21:45,089 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 167 places, 283 transitions, 5057 flow [2022-12-06 00:21:45,089 INFO L188 LiptonReduction]: Number of co-enabled transitions 1430 [2022-12-06 00:21:45,091 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:21:45,250 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [690] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_131|) (= (ite (= (mod (select (select |v_#memory_int_516| v_~queue~0.base_290) (+ v_~queue~0.offset_290 (* v_~end~0_545 4))) 4294967296) (mod |v_thread2Thread1of1ForFork0_~x~1#1_252| 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_131|) (= |v_thread2Thread1of1ForFork0_#res#1.base_121| 0) (= |v_thread2Thread1of1ForFork0_~i~1#1_241| 0) (= v_~end~0_544 (+ v_~end~0_545 1)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_121| 0) (not (= (ite (and (< v_~end~0_545 v_~n~0_296) (<= 0 v_~end~0_545)) 1 0) 0)) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_241| 4294967296) (mod v_~A~0_282 4294967296))) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| 0)) (= |v_thread2Thread1of1ForFork0_~x~1#1_252| 0)) InVars {~queue~0.offset=v_~queue~0.offset_290, ~A~0=v_~A~0_282, #memory_int=|v_#memory_int_516|, ~end~0=v_~end~0_545, ~queue~0.base=v_~queue~0.base_290, ~n~0=v_~n~0_296} OutVars{~queue~0.offset=v_~queue~0.offset_290, ~A~0=v_~A~0_282, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_121|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_241|, ~queue~0.base=v_~queue~0.base_290, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_121|, #memory_int=|v_#memory_int_516|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_131|, ~end~0=v_~end~0_544, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_252|, ~n~0=v_~n~0_296, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_131|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_~x~1#1, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:21:45,351 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [690] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_131|) (= (ite (= (mod (select (select |v_#memory_int_516| v_~queue~0.base_290) (+ v_~queue~0.offset_290 (* v_~end~0_545 4))) 4294967296) (mod |v_thread2Thread1of1ForFork0_~x~1#1_252| 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_131|) (= |v_thread2Thread1of1ForFork0_#res#1.base_121| 0) (= |v_thread2Thread1of1ForFork0_~i~1#1_241| 0) (= v_~end~0_544 (+ v_~end~0_545 1)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_121| 0) (not (= (ite (and (< v_~end~0_545 v_~n~0_296) (<= 0 v_~end~0_545)) 1 0) 0)) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_241| 4294967296) (mod v_~A~0_282 4294967296))) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| 0)) (= |v_thread2Thread1of1ForFork0_~x~1#1_252| 0)) InVars {~queue~0.offset=v_~queue~0.offset_290, ~A~0=v_~A~0_282, #memory_int=|v_#memory_int_516|, ~end~0=v_~end~0_545, ~queue~0.base=v_~queue~0.base_290, ~n~0=v_~n~0_296} OutVars{~queue~0.offset=v_~queue~0.offset_290, ~A~0=v_~A~0_282, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_121|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_241|, ~queue~0.base=v_~queue~0.base_290, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_121|, #memory_int=|v_#memory_int_516|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_131|, ~end~0=v_~end~0_544, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_252|, ~n~0=v_~n~0_296, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_131|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_~x~1#1, thread2Thread1of1ForFork0_#t~post6#1] and [695] L51-5-->L104-3: Formula: (and (= (ite (= (mod (select (select |v_#memory_int_525| v_~queue~0.base_296) (+ (* v_~end~0_557 4) v_~queue~0.offset_296)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_214| 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_89|) (not (= (ite (and (<= 0 v_~end~0_557) (< v_~end~0_557 v_~n~0_302)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_89| 0)) (= (store |v_#memory_int_525| |v_ULTIMATE.start_main_~#t3~0#1.base_190| (store (select |v_#memory_int_525| |v_ULTIMATE.start_main_~#t3~0#1.base_190|) |v_ULTIMATE.start_main_~#t3~0#1.offset_172| |v_ULTIMATE.start_main_#t~pre18#1_176|)) |v_#memory_int_524|) (= |v_ULTIMATE.start_main_#t~pre18#1_176| |v_#pthreadsForks_339|) (= |v_thread1Thread1of1ForFork2_#res#1.base_87| 0) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_209| 4294967296) (mod v_~A~0_292 4294967296))) (= v_~end~0_556 (+ v_~end~0_557 1)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_87| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_89| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_89|) (= (+ |v_#pthreadsForks_339| 1) |v_#pthreadsForks_338|)) InVars {~queue~0.offset=v_~queue~0.offset_296, ~A~0=v_~A~0_292, #pthreadsForks=|v_#pthreadsForks_339|, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_214|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_209|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_172|, #memory_int=|v_#memory_int_525|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_190|, ~end~0=v_~end~0_557, ~queue~0.base=v_~queue~0.base_296, ~n~0=v_~n~0_302} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_176|, ~queue~0.offset=v_~queue~0.offset_296, ~A~0=v_~A~0_292, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_214|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_172|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_89|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_190|, ~queue~0.base=v_~queue~0.base_296, #pthreadsForks=|v_#pthreadsForks_338|, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_89|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_209|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_89|, #memory_int=|v_#memory_int_524|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_186|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_87|, ~end~0=v_~end~0_556, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_160|, ~n~0=v_~n~0_302, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_87|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_89|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, ULTIMATE.start_main_#t~nondet17#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] [2022-12-06 00:21:45,658 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [691] $Ultimate##0-->thread1EXIT: Formula: (and (= v_~end~0_548 (+ v_~end~0_549 1)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_87| 0)) (= |v_thread2Thread1of1ForFork0_~i~1#1_243| 0) (not (= (ite (and (< v_~end~0_549 v_~n~0_298) (<= 0 v_~end~0_549)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~x~1#1_254| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_87| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_87|) (= |v_thread1Thread1of1ForFork2_#res#1.offset_85| 0) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_203| 4294967296) (mod v_~A~0_284 4294967296))) (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_208| 4294967296) (mod (select (select |v_#memory_int_518| v_~queue~0.base_292) (+ (* v_~end~0_549 4) v_~queue~0.offset_292)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_87|) (= |v_thread1Thread1of1ForFork2_#res#1.base_85| 0)) InVars {~queue~0.offset=v_~queue~0.offset_292, ~A~0=v_~A~0_284, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_208|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_203|, #memory_int=|v_#memory_int_518|, ~end~0=v_~end~0_549, ~queue~0.base=v_~queue~0.base_292, ~n~0=v_~n~0_298} OutVars{~queue~0.offset=v_~queue~0.offset_292, ~A~0=v_~A~0_284, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_208|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_87|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_243|, ~queue~0.base=v_~queue~0.base_292, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_87|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_203|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_87|, #memory_int=|v_#memory_int_518|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_85|, ~end~0=v_~end~0_548, ~n~0=v_~n~0_298, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_254|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_85|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_87|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread2Thread1of1ForFork0_~x~1#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:21:45,760 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [691] $Ultimate##0-->thread1EXIT: Formula: (and (= v_~end~0_548 (+ v_~end~0_549 1)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_87| 0)) (= |v_thread2Thread1of1ForFork0_~i~1#1_243| 0) (not (= (ite (and (< v_~end~0_549 v_~n~0_298) (<= 0 v_~end~0_549)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~x~1#1_254| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_87| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_87|) (= |v_thread1Thread1of1ForFork2_#res#1.offset_85| 0) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_203| 4294967296) (mod v_~A~0_284 4294967296))) (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_208| 4294967296) (mod (select (select |v_#memory_int_518| v_~queue~0.base_292) (+ (* v_~end~0_549 4) v_~queue~0.offset_292)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_87|) (= |v_thread1Thread1of1ForFork2_#res#1.base_85| 0)) InVars {~queue~0.offset=v_~queue~0.offset_292, ~A~0=v_~A~0_284, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_208|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_203|, #memory_int=|v_#memory_int_518|, ~end~0=v_~end~0_549, ~queue~0.base=v_~queue~0.base_292, ~n~0=v_~n~0_298} OutVars{~queue~0.offset=v_~queue~0.offset_292, ~A~0=v_~A~0_284, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_208|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_87|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_243|, ~queue~0.base=v_~queue~0.base_292, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_87|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_203|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_87|, #memory_int=|v_#memory_int_518|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_85|, ~end~0=v_~end~0_548, ~n~0=v_~n~0_298, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_254|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_85|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_87|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread2Thread1of1ForFork0_~x~1#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [580] L67-5-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_31| (+ |v_thread2Thread1of1ForFork0_~i~1#1_32| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_32| 4294967296) (mod v_~A~0_35 4294967296)) (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_30| v_~B~0_29) |v_thread2Thread1of1ForFork0_~x~1#1_29|)) InVars {~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_32|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_30|} OutVars{~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_31|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_13|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] [2022-12-06 00:21:45,857 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:21:45,858 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 905 [2022-12-06 00:21:45,858 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 280 transitions, 5069 flow [2022-12-06 00:21:45,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:45,858 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:45,858 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:21:45,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-06 00:21:45,858 INFO L420 AbstractCegarLoop]: === Iteration 43 === 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 00:21:45,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:45,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1279041597, now seen corresponding path program 1 times [2022-12-06 00:21:45,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:45,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028421985] [2022-12-06 00:21:45,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:45,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:45,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:46,466 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 00:21:46,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:46,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028421985] [2022-12-06 00:21:46,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028421985] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:46,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:46,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:21:46,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977050920] [2022-12-06 00:21:46,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:46,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:21:46,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:46,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:21:46,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:21:46,469 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 00:21:46,469 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 280 transitions, 5069 flow. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:46,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:46,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 00:21:46,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:47,145 INFO L130 PetriNetUnfolder]: 1703/3130 cut-off events. [2022-12-06 00:21:47,145 INFO L131 PetriNetUnfolder]: For 58011/58011 co-relation queries the response was YES. [2022-12-06 00:21:47,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22836 conditions, 3130 events. 1703/3130 cut-off events. For 58011/58011 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 19651 event pairs, 460 based on Foata normal form. 1/3131 useless extension candidates. Maximal degree in co-relation 22713. Up to 2511 conditions per place. [2022-12-06 00:21:47,167 INFO L137 encePairwiseOnDemand]: 27/45 looper letters, 241 selfloop transitions, 61 changer transitions 14/316 dead transitions. [2022-12-06 00:21:47,168 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 316 transitions, 5985 flow [2022-12-06 00:21:47,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:21:47,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:21:47,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2022-12-06 00:21:47,170 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-06 00:21:47,170 INFO L175 Difference]: Start difference. First operand has 164 places, 280 transitions, 5069 flow. Second operand 6 states and 81 transitions. [2022-12-06 00:21:47,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 316 transitions, 5985 flow [2022-12-06 00:21:47,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 316 transitions, 5833 flow, removed 14 selfloop flow, removed 5 redundant places. [2022-12-06 00:21:47,287 INFO L231 Difference]: Finished difference. Result has 166 places, 279 transitions, 5015 flow [2022-12-06 00:21:47,287 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=4917, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5015, PETRI_PLACES=166, PETRI_TRANSITIONS=279} [2022-12-06 00:21:47,287 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 137 predicate places. [2022-12-06 00:21:47,287 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:47,288 INFO L89 Accepts]: Start accepts. Operand has 166 places, 279 transitions, 5015 flow [2022-12-06 00:21:47,288 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:47,289 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:47,289 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 279 transitions, 5015 flow [2022-12-06 00:21:47,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 279 transitions, 5015 flow [2022-12-06 00:21:47,406 INFO L130 PetriNetUnfolder]: 353/1240 cut-off events. [2022-12-06 00:21:47,407 INFO L131 PetriNetUnfolder]: For 18087/18158 co-relation queries the response was YES. [2022-12-06 00:21:47,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7521 conditions, 1240 events. 353/1240 cut-off events. For 18087/18158 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 10623 event pairs, 21 based on Foata normal form. 11/1216 useless extension candidates. Maximal degree in co-relation 7447. Up to 215 conditions per place. [2022-12-06 00:21:47,420 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 164 places, 279 transitions, 5015 flow [2022-12-06 00:21:47,420 INFO L188 LiptonReduction]: Number of co-enabled transitions 1414 [2022-12-06 00:21:47,422 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:21:47,422 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-06 00:21:47,422 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 279 transitions, 5015 flow [2022-12-06 00:21:47,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:47,422 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:47,422 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:21:47,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-06 00:21:47,422 INFO L420 AbstractCegarLoop]: === Iteration 44 === 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 00:21:47,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:47,423 INFO L85 PathProgramCache]: Analyzing trace with hash -39158078, now seen corresponding path program 1 times [2022-12-06 00:21:47,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:47,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062933477] [2022-12-06 00:21:47,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:47,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:47,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:48,850 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 00:21:48,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:48,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062933477] [2022-12-06 00:21:48,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062933477] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:48,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:48,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:21:48,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274791413] [2022-12-06 00:21:48,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:48,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:21:48,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:48,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:21:48,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:21:48,851 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 00:21:48,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 279 transitions, 5015 flow. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:48,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:48,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 00:21:48,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:49,919 INFO L130 PetriNetUnfolder]: 1718/3141 cut-off events. [2022-12-06 00:21:49,919 INFO L131 PetriNetUnfolder]: For 58680/58680 co-relation queries the response was YES. [2022-12-06 00:21:49,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22925 conditions, 3141 events. 1718/3141 cut-off events. For 58680/58680 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 19686 event pairs, 524 based on Foata normal form. 1/3142 useless extension candidates. Maximal degree in co-relation 22805. Up to 2892 conditions per place. [2022-12-06 00:21:49,946 INFO L137 encePairwiseOnDemand]: 29/44 looper letters, 289 selfloop transitions, 23 changer transitions 15/327 dead transitions. [2022-12-06 00:21:49,947 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 327 transitions, 6075 flow [2022-12-06 00:21:49,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:21:49,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:21:49,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2022-12-06 00:21:49,948 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29545454545454547 [2022-12-06 00:21:49,948 INFO L175 Difference]: Start difference. First operand has 164 places, 279 transitions, 5015 flow. Second operand 7 states and 91 transitions. [2022-12-06 00:21:49,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 327 transitions, 6075 flow [2022-12-06 00:21:50,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 327 transitions, 5949 flow, removed 2 selfloop flow, removed 5 redundant places. [2022-12-06 00:21:50,095 INFO L231 Difference]: Finished difference. Result has 168 places, 281 transitions, 4985 flow [2022-12-06 00:21:50,095 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=4889, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4985, PETRI_PLACES=168, PETRI_TRANSITIONS=281} [2022-12-06 00:21:50,096 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 139 predicate places. [2022-12-06 00:21:50,096 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:50,096 INFO L89 Accepts]: Start accepts. Operand has 168 places, 281 transitions, 4985 flow [2022-12-06 00:21:50,097 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:50,097 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:50,097 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 281 transitions, 4985 flow [2022-12-06 00:21:50,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 281 transitions, 4985 flow [2022-12-06 00:21:50,226 INFO L130 PetriNetUnfolder]: 354/1239 cut-off events. [2022-12-06 00:21:50,227 INFO L131 PetriNetUnfolder]: For 16724/16784 co-relation queries the response was YES. [2022-12-06 00:21:50,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7465 conditions, 1239 events. 354/1239 cut-off events. For 16724/16784 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 10619 event pairs, 22 based on Foata normal form. 8/1212 useless extension candidates. Maximal degree in co-relation 7396. Up to 221 conditions per place. [2022-12-06 00:21:50,242 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 165 places, 281 transitions, 4985 flow [2022-12-06 00:21:50,242 INFO L188 LiptonReduction]: Number of co-enabled transitions 1428 [2022-12-06 00:21:50,253 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] $Ultimate##0-->L104-3: Formula: (and (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_93| 0)) (not (= (ite (and (< v_~end~0_571 v_~n~0_308) (<= 0 v_~end~0_571)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~i~1#1_257| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_93| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_93|) (= (+ |v_#pthreadsForks_351| 1) |v_#pthreadsForks_350|) (= |v_#memory_int_536| (store |v_#memory_int_537| |v_ULTIMATE.start_main_~#t3~0#1.base_196| (store (select |v_#memory_int_537| |v_ULTIMATE.start_main_~#t3~0#1.base_196|) |v_ULTIMATE.start_main_~#t3~0#1.offset_178| |v_ULTIMATE.start_main_#t~pre18#1_182|))) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_213| 4294967296) (mod v_~A~0_298 4294967296))) (= |v_thread2Thread1of1ForFork0_~x~1#1_268| 0) (= |v_ULTIMATE.start_main_#t~pre18#1_182| |v_#pthreadsForks_351|) (= |v_thread1Thread1of1ForFork2_#res#1.base_91| 0) (= |v_thread1Thread1of1ForFork2_#res#1.offset_91| 0) (= v_~end~0_570 (+ v_~end~0_571 1)) (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_218| 4294967296) (mod (select (select |v_#memory_int_537| v_~queue~0.base_302) (+ (* v_~end~0_571 4) v_~queue~0.offset_302)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_93|)) InVars {~queue~0.offset=v_~queue~0.offset_302, ~A~0=v_~A~0_298, #pthreadsForks=|v_#pthreadsForks_351|, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_218|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_213|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_178|, #memory_int=|v_#memory_int_537|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_196|, ~end~0=v_~end~0_571, ~queue~0.base=v_~queue~0.base_302, ~n~0=v_~n~0_308} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_182|, ~queue~0.offset=v_~queue~0.offset_302, ~A~0=v_~A~0_298, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_218|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_178|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_93|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_196|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_257|, ~queue~0.base=v_~queue~0.base_302, #pthreadsForks=|v_#pthreadsForks_350|, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_93|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_213|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_93|, #memory_int=|v_#memory_int_536|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_192|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_91|, ~end~0=v_~end~0_570, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_166|, ~n~0=v_~n~0_308, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_268|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_91|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_93|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread1Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork0_~i~1#1, #pthreadsForks, thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, ULTIMATE.start_main_#t~nondet17#1, thread2Thread1of1ForFork0_~x~1#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [580] L67-5-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_31| (+ |v_thread2Thread1of1ForFork0_~i~1#1_32| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_32| 4294967296) (mod v_~A~0_35 4294967296)) (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_30| v_~B~0_29) |v_thread2Thread1of1ForFork0_~x~1#1_29|)) InVars {~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_32|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_30|} OutVars{~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_31|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_13|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] [2022-12-06 00:21:50,384 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:21:50,385 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 289 [2022-12-06 00:21:50,385 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 280 transitions, 4977 flow [2022-12-06 00:21:50,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:50,385 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:50,385 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:21:50,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-06 00:21:50,385 INFO L420 AbstractCegarLoop]: === Iteration 45 === 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 00:21:50,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:50,386 INFO L85 PathProgramCache]: Analyzing trace with hash -830601072, now seen corresponding path program 1 times [2022-12-06 00:21:50,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:50,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796101965] [2022-12-06 00:21:50,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:50,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:50,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:50,438 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 00:21:50,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:50,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796101965] [2022-12-06 00:21:50,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796101965] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:50,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:50,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:21:50,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284042348] [2022-12-06 00:21:50,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:50,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:21:50,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:50,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:21:50,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:21:50,440 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 00:21:50,440 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 280 transitions, 4977 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:50,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:50,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 00:21:50,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:50,959 INFO L130 PetriNetUnfolder]: 1783/3263 cut-off events. [2022-12-06 00:21:50,959 INFO L131 PetriNetUnfolder]: For 58264/58264 co-relation queries the response was YES. [2022-12-06 00:21:50,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23477 conditions, 3263 events. 1783/3263 cut-off events. For 58264/58264 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 20559 event pairs, 533 based on Foata normal form. 5/3268 useless extension candidates. Maximal degree in co-relation 23353. Up to 2769 conditions per place. [2022-12-06 00:21:50,985 INFO L137 encePairwiseOnDemand]: 38/43 looper letters, 305 selfloop transitions, 12 changer transitions 0/317 dead transitions. [2022-12-06 00:21:50,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 317 transitions, 6000 flow [2022-12-06 00:21:50,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:21:50,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:21:50,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-12-06 00:21:50,986 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46511627906976744 [2022-12-06 00:21:50,986 INFO L175 Difference]: Start difference. First operand has 164 places, 280 transitions, 4977 flow. Second operand 3 states and 60 transitions. [2022-12-06 00:21:50,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 317 transitions, 6000 flow [2022-12-06 00:21:51,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 317 transitions, 5879 flow, removed 22 selfloop flow, removed 6 redundant places. [2022-12-06 00:21:51,107 INFO L231 Difference]: Finished difference. Result has 161 places, 280 transitions, 4869 flow [2022-12-06 00:21:51,107 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=4774, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=4869, PETRI_PLACES=161, PETRI_TRANSITIONS=280} [2022-12-06 00:21:51,107 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 132 predicate places. [2022-12-06 00:21:51,107 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:51,107 INFO L89 Accepts]: Start accepts. Operand has 161 places, 280 transitions, 4869 flow [2022-12-06 00:21:51,108 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:51,109 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:51,109 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 280 transitions, 4869 flow [2022-12-06 00:21:51,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 280 transitions, 4869 flow [2022-12-06 00:21:51,231 INFO L130 PetriNetUnfolder]: 363/1301 cut-off events. [2022-12-06 00:21:51,231 INFO L131 PetriNetUnfolder]: For 15902/15965 co-relation queries the response was YES. [2022-12-06 00:21:51,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7672 conditions, 1301 events. 363/1301 cut-off events. For 15902/15965 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 11352 event pairs, 24 based on Foata normal form. 10/1276 useless extension candidates. Maximal degree in co-relation 7479. Up to 234 conditions per place. [2022-12-06 00:21:51,244 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 280 transitions, 4869 flow [2022-12-06 00:21:51,244 INFO L188 LiptonReduction]: Number of co-enabled transitions 1422 [2022-12-06 00:21:51,245 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [601] L102-4-->L103-3: Formula: (and (= (store |v_#memory_int_149| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_149| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre16#1_29|)) |v_#memory_int_148|) (= |v_#pthreadsForks_52| (+ |v_#pthreadsForks_53| 1)) (= |v_ULTIMATE.start_main_#t~pre16#1_29| |v_#pthreadsForks_53|)) InVars {#pthreadsForks=|v_#pthreadsForks_53|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{#pthreadsForks=|v_#pthreadsForks_52|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_41|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #memory_int=|v_#memory_int_148|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_29|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_23|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~pre14#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet15#1] [2022-12-06 00:21:51,381 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:21:51,382 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 275 [2022-12-06 00:21:51,382 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 280 transitions, 4881 flow [2022-12-06 00:21:51,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:51,382 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:51,382 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:21:51,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-12-06 00:21:51,382 INFO L420 AbstractCegarLoop]: === Iteration 46 === 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 00:21:51,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:51,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1690872659, now seen corresponding path program 1 times [2022-12-06 00:21:51,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:51,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056457288] [2022-12-06 00:21:51,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:51,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:52,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:21:52,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:52,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056457288] [2022-12-06 00:21:52,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056457288] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:21:52,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617475908] [2022-12-06 00:21:52,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:52,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:21:52,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:21:52,711 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:21:52,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 00:21:52,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:52,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-06 00:21:52,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:21:53,014 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:21:53,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 56 [2022-12-06 00:21:53,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:21:53,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:21:53,235 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:21:53,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 134 treesize of output 101 [2022-12-06 00:21:53,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:21:53,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617475908] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:21:53,617 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:21:53,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 19 [2022-12-06 00:21:53,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65908710] [2022-12-06 00:21:53,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:21:53,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 00:21:53,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:53,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 00:21:53,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2022-12-06 00:21:53,618 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 00:21:53,618 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 280 transitions, 4881 flow. Second operand has 21 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 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 00:21:53,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:53,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 00:21:53,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:55,618 INFO L130 PetriNetUnfolder]: 2014/3653 cut-off events. [2022-12-06 00:21:55,619 INFO L131 PetriNetUnfolder]: For 62286/62286 co-relation queries the response was YES. [2022-12-06 00:21:55,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26626 conditions, 3653 events. 2014/3653 cut-off events. For 62286/62286 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 23421 event pairs, 320 based on Foata normal form. 4/3657 useless extension candidates. Maximal degree in co-relation 26049. Up to 2053 conditions per place. [2022-12-06 00:21:55,652 INFO L137 encePairwiseOnDemand]: 18/42 looper letters, 247 selfloop transitions, 165 changer transitions 14/426 dead transitions. [2022-12-06 00:21:55,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 426 transitions, 7658 flow [2022-12-06 00:21:55,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 00:21:55,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 00:21:55,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 135 transitions. [2022-12-06 00:21:55,655 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24725274725274726 [2022-12-06 00:21:55,655 INFO L175 Difference]: Start difference. First operand has 161 places, 280 transitions, 4881 flow. Second operand 13 states and 135 transitions. [2022-12-06 00:21:55,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 426 transitions, 7658 flow [2022-12-06 00:21:55,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 426 transitions, 7642 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-06 00:21:55,828 INFO L231 Difference]: Finished difference. Result has 182 places, 340 transitions, 6702 flow [2022-12-06 00:21:55,828 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4867, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=6702, PETRI_PLACES=182, PETRI_TRANSITIONS=340} [2022-12-06 00:21:55,828 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 153 predicate places. [2022-12-06 00:21:55,828 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:55,828 INFO L89 Accepts]: Start accepts. Operand has 182 places, 340 transitions, 6702 flow [2022-12-06 00:21:55,830 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:55,830 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:55,830 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 340 transitions, 6702 flow [2022-12-06 00:21:55,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 181 places, 340 transitions, 6702 flow [2022-12-06 00:21:55,999 INFO L130 PetriNetUnfolder]: 441/1447 cut-off events. [2022-12-06 00:21:56,000 INFO L131 PetriNetUnfolder]: For 23627/23768 co-relation queries the response was YES. [2022-12-06 00:21:56,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9936 conditions, 1447 events. 441/1447 cut-off events. For 23627/23768 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 12505 event pairs, 21 based on Foata normal form. 21/1425 useless extension candidates. Maximal degree in co-relation 9827. Up to 264 conditions per place. [2022-12-06 00:21:56,017 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 181 places, 340 transitions, 6702 flow [2022-12-06 00:21:56,017 INFO L188 LiptonReduction]: Number of co-enabled transitions 1660 [2022-12-06 00:21:56,036 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:21:56,038 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 210 [2022-12-06 00:21:56,038 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 340 transitions, 6702 flow [2022-12-06 00:21:56,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 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 00:21:56,038 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:56,038 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:21:56,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-06 00:21:56,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-12-06 00:21:56,239 INFO L420 AbstractCegarLoop]: === Iteration 47 === 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 00:21:56,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:56,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1025969354, now seen corresponding path program 1 times [2022-12-06 00:21:56,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:56,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626912943] [2022-12-06 00:21:56,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:56,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:58,357 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 00:21:58,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:58,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626912943] [2022-12-06 00:21:58,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626912943] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:58,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:58,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:21:58,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505484764] [2022-12-06 00:21:58,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:58,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:21:58,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:58,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:21:58,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:21:58,358 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 00:21:58,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 340 transitions, 6702 flow. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:58,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:58,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 00:21:58,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:59,577 INFO L130 PetriNetUnfolder]: 2018/3655 cut-off events. [2022-12-06 00:21:59,578 INFO L131 PetriNetUnfolder]: For 76192/76192 co-relation queries the response was YES. [2022-12-06 00:21:59,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29094 conditions, 3655 events. 2018/3655 cut-off events. For 76192/76192 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 23455 event pairs, 498 based on Foata normal form. 1/3656 useless extension candidates. Maximal degree in co-relation 28962. Up to 2826 conditions per place. [2022-12-06 00:21:59,606 INFO L137 encePairwiseOnDemand]: 24/42 looper letters, 293 selfloop transitions, 89 changer transitions 13/395 dead transitions. [2022-12-06 00:21:59,606 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 395 transitions, 7987 flow [2022-12-06 00:21:59,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:21:59,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:21:59,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2022-12-06 00:21:59,607 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28273809523809523 [2022-12-06 00:21:59,607 INFO L175 Difference]: Start difference. First operand has 181 places, 340 transitions, 6702 flow. Second operand 8 states and 95 transitions. [2022-12-06 00:21:59,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 395 transitions, 7987 flow [2022-12-06 00:21:59,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 395 transitions, 7415 flow, removed 69 selfloop flow, removed 8 redundant places. [2022-12-06 00:21:59,801 INFO L231 Difference]: Finished difference. Result has 184 places, 346 transitions, 6446 flow [2022-12-06 00:21:59,802 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6132, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6446, PETRI_PLACES=184, PETRI_TRANSITIONS=346} [2022-12-06 00:21:59,802 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 155 predicate places. [2022-12-06 00:21:59,802 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:59,802 INFO L89 Accepts]: Start accepts. Operand has 184 places, 346 transitions, 6446 flow [2022-12-06 00:21:59,803 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:59,803 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:59,803 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 184 places, 346 transitions, 6446 flow [2022-12-06 00:21:59,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 183 places, 346 transitions, 6446 flow [2022-12-06 00:21:59,952 INFO L130 PetriNetUnfolder]: 443/1444 cut-off events. [2022-12-06 00:21:59,952 INFO L131 PetriNetUnfolder]: For 20461/20601 co-relation queries the response was YES. [2022-12-06 00:21:59,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9643 conditions, 1444 events. 443/1444 cut-off events. For 20461/20601 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 12486 event pairs, 19 based on Foata normal form. 20/1422 useless extension candidates. Maximal degree in co-relation 9532. Up to 265 conditions per place. [2022-12-06 00:21:59,971 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 183 places, 346 transitions, 6446 flow [2022-12-06 00:21:59,971 INFO L188 LiptonReduction]: Number of co-enabled transitions 1704 [2022-12-06 00:22:00,224 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [702] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_141| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_141|) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_282| 4294967296) (mod (select (select |v_#memory_int_552| v_~queue~0.base_310) (+ v_~queue~0.offset_310 (* v_~end~0_590 4))) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_141|) (= |v_thread2Thread1of1ForFork0_~x~1#1_282| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_131| 0) (= v_~end~0_589 (+ v_~end~0_590 1)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_141| 0)) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_270| 4294967296) (mod v_~A~0_306 4294967296))) (= |v_thread2Thread1of1ForFork0_#res#1.base_131| 0) (not (= (ite (and (< v_~end~0_590 v_~n~0_316) (<= 0 v_~end~0_590)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~i~1#1_270| 0)) InVars {~queue~0.offset=v_~queue~0.offset_310, ~A~0=v_~A~0_306, #memory_int=|v_#memory_int_552|, ~end~0=v_~end~0_590, ~queue~0.base=v_~queue~0.base_310, ~n~0=v_~n~0_316} OutVars{~queue~0.offset=v_~queue~0.offset_310, ~A~0=v_~A~0_306, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_131|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_141|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_270|, ~queue~0.base=v_~queue~0.base_310, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_141|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_131|, #memory_int=|v_#memory_int_552|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_141|, ~end~0=v_~end~0_589, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_282|, ~n~0=v_~n~0_316, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_141|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_~x~1#1, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:22:00,318 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [703] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_~x~1#1_284| 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_143| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_143|) (not (= (ite (and (<= 0 v_~end~0_594) (< v_~end~0_594 v_~n~0_318)) 1 0) 0)) (= v_~end~0_593 (+ v_~end~0_594 1)) (= |v_thread2Thread1of1ForFork0_#res#1.base_133| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_133| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_272| 4294967296) (mod v_~A~0_308 4294967296))) (= |v_thread2Thread1of1ForFork0_~i~1#1_272| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_143| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_143| (ite (= (mod (select (select |v_#memory_int_554| v_~queue~0.base_312) (+ (* v_~end~0_594 4) v_~queue~0.offset_312)) 4294967296) (mod |v_thread2Thread1of1ForFork0_~x~1#1_284| 4294967296)) 1 0))) InVars {~queue~0.offset=v_~queue~0.offset_312, ~A~0=v_~A~0_308, #memory_int=|v_#memory_int_554|, ~end~0=v_~end~0_594, ~queue~0.base=v_~queue~0.base_312, ~n~0=v_~n~0_318} OutVars{~queue~0.offset=v_~queue~0.offset_312, ~A~0=v_~A~0_308, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_133|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_143|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_272|, ~queue~0.base=v_~queue~0.base_312, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_143|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_133|, #memory_int=|v_#memory_int_554|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_143|, ~end~0=v_~end~0_593, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_284|, ~n~0=v_~n~0_318, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_143|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_~x~1#1, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:22:00,508 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [706] $Ultimate##0-->L104-3: Formula: (and (not (= (ite (and (< v_~end~0_602 v_~n~0_322) (<= 0 v_~end~0_602)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~i~1#1_280| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_280| 4294967296) (mod v_~A~0_314 4294967296))) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_147| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_137| 0) (= |v_#memory_int_560| (store |v_#memory_int_561| |v_ULTIMATE.start_main_~#t3~0#1.base_202| (store (select |v_#memory_int_561| |v_ULTIMATE.start_main_~#t3~0#1.base_202|) |v_ULTIMATE.start_main_~#t3~0#1.offset_184| |v_ULTIMATE.start_main_#t~pre18#1_190|))) (= |v_thread2Thread1of1ForFork0_#res#1.offset_137| 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_147| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_147|) (= |v_ULTIMATE.start_main_#t~pre18#1_190| |v_#pthreadsForks_369|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_147| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_292| 4294967296) (mod (select (select |v_#memory_int_561| v_~queue~0.base_316) (+ (* v_~end~0_602 4) v_~queue~0.offset_316)) 4294967296)) 1 0)) (= (+ |v_#pthreadsForks_369| 1) |v_#pthreadsForks_368|) (= |v_thread2Thread1of1ForFork0_~x~1#1_292| 0) (= v_~end~0_601 (+ v_~end~0_602 1))) InVars {~queue~0.offset=v_~queue~0.offset_316, ~A~0=v_~A~0_314, #pthreadsForks=|v_#pthreadsForks_369|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_184|, #memory_int=|v_#memory_int_561|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_202|, ~end~0=v_~end~0_602, ~queue~0.base=v_~queue~0.base_316, ~n~0=v_~n~0_322} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_190|, ~queue~0.offset=v_~queue~0.offset_316, ~A~0=v_~A~0_314, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_184|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_137|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_147|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_202|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_280|, ~queue~0.base=v_~queue~0.base_316, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_147|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_137|, #pthreadsForks=|v_#pthreadsForks_368|, #memory_int=|v_#memory_int_560|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_202|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_147|, ~end~0=v_~end~0_601, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_173|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_292|, ~n~0=v_~n~0_322, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_147|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, ULTIMATE.start_main_#t~nondet17#1, thread2Thread1of1ForFork0_~x~1#1, thread2Thread1of1ForFork0_#t~post6#1] [2022-12-06 00:22:00,799 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 00:22:00,801 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 999 [2022-12-06 00:22:00,801 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 345 transitions, 6497 flow [2022-12-06 00:22:00,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:22:00,801 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:22:00,801 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:22:00,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-12-06 00:22:00,802 INFO L420 AbstractCegarLoop]: === Iteration 48 === 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 00:22:00,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:22:00,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1935149669, now seen corresponding path program 1 times [2022-12-06 00:22:00,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:22:00,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272344413] [2022-12-06 00:22:00,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:22:00,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:22:00,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:22:02,307 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 00:22:02,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:22:02,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272344413] [2022-12-06 00:22:02,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272344413] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:22:02,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:22:02,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:22:02,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30761481] [2022-12-06 00:22:02,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:22:02,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:22:02,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:22:02,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:22:02,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:22:02,309 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 00:22:02,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 345 transitions, 6497 flow. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 00:22:02,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:22:02,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 00:22:02,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:22:03,191 INFO L130 PetriNetUnfolder]: 2025/3676 cut-off events. [2022-12-06 00:22:03,192 INFO L131 PetriNetUnfolder]: For 69811/69811 co-relation queries the response was YES. [2022-12-06 00:22:03,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28623 conditions, 3676 events. 2025/3676 cut-off events. For 69811/69811 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 23561 event pairs, 666 based on Foata normal form. 1/3677 useless extension candidates. Maximal degree in co-relation 28489. Up to 3465 conditions per place. [2022-12-06 00:22:03,225 INFO L137 encePairwiseOnDemand]: 35/45 looper letters, 354 selfloop transitions, 14 changer transitions 16/384 dead transitions. [2022-12-06 00:22:03,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 384 transitions, 7626 flow [2022-12-06 00:22:03,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:22:03,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:22:03,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-12-06 00:22:03,226 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3037037037037037 [2022-12-06 00:22:03,226 INFO L175 Difference]: Start difference. First operand has 182 places, 345 transitions, 6497 flow. Second operand 6 states and 82 transitions. [2022-12-06 00:22:03,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 384 transitions, 7626 flow [2022-12-06 00:22:03,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 384 transitions, 7358 flow, removed 51 selfloop flow, removed 5 redundant places. [2022-12-06 00:22:03,422 INFO L231 Difference]: Finished difference. Result has 185 places, 344 transitions, 6275 flow [2022-12-06 00:22:03,422 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=6256, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6275, PETRI_PLACES=185, PETRI_TRANSITIONS=344} [2022-12-06 00:22:03,423 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 156 predicate places. [2022-12-06 00:22:03,423 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:22:03,423 INFO L89 Accepts]: Start accepts. Operand has 185 places, 344 transitions, 6275 flow [2022-12-06 00:22:03,424 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:22:03,424 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:22:03,424 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 185 places, 344 transitions, 6275 flow [2022-12-06 00:22:03,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 344 transitions, 6275 flow [2022-12-06 00:22:03,664 INFO L130 PetriNetUnfolder]: 445/1451 cut-off events. [2022-12-06 00:22:03,664 INFO L131 PetriNetUnfolder]: For 19017/19166 co-relation queries the response was YES. [2022-12-06 00:22:03,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9502 conditions, 1451 events. 445/1451 cut-off events. For 19017/19166 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 12452 event pairs, 21 based on Foata normal form. 16/1421 useless extension candidates. Maximal degree in co-relation 9395. Up to 271 conditions per place. [2022-12-06 00:22:03,681 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 182 places, 344 transitions, 6275 flow [2022-12-06 00:22:03,682 INFO L188 LiptonReduction]: Number of co-enabled transitions 1684 [2022-12-06 00:22:03,683 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:22:03,683 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 260 [2022-12-06 00:22:03,683 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 344 transitions, 6275 flow [2022-12-06 00:22:03,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 00:22:03,684 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:22:03,684 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:22:03,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-06 00:22:03,684 INFO L420 AbstractCegarLoop]: === Iteration 49 === 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 00:22:03,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:22:03,684 INFO L85 PathProgramCache]: Analyzing trace with hash -13227142, now seen corresponding path program 1 times [2022-12-06 00:22:03,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:22:03,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623353129] [2022-12-06 00:22:03,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:22:03,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:22:03,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:22:05,901 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 00:22:05,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:22:05,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623353129] [2022-12-06 00:22:05,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623353129] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:22:05,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:22:05,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:22:05,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294171768] [2022-12-06 00:22:05,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:22:05,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:22:05,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:22:05,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:22:05,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:22:05,902 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 00:22:05,902 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 344 transitions, 6275 flow. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:22:05,902 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:22:05,902 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 00:22:05,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:22:06,885 INFO L130 PetriNetUnfolder]: 2010/3644 cut-off events. [2022-12-06 00:22:06,885 INFO L131 PetriNetUnfolder]: For 64062/64062 co-relation queries the response was YES. [2022-12-06 00:22:06,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27924 conditions, 3644 events. 2010/3644 cut-off events. For 64062/64062 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 23384 event pairs, 525 based on Foata normal form. 1/3645 useless extension candidates. Maximal degree in co-relation 27789. Up to 2929 conditions per place. [2022-12-06 00:22:06,919 INFO L137 encePairwiseOnDemand]: 28/44 looper letters, 285 selfloop transitions, 80 changer transitions 14/379 dead transitions. [2022-12-06 00:22:06,919 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 379 transitions, 7335 flow [2022-12-06 00:22:06,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:22:06,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:22:06,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-12-06 00:22:06,920 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30303030303030304 [2022-12-06 00:22:06,920 INFO L175 Difference]: Start difference. First operand has 182 places, 344 transitions, 6275 flow. Second operand 6 states and 80 transitions. [2022-12-06 00:22:06,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 379 transitions, 7335 flow [2022-12-06 00:22:07,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 379 transitions, 7295 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-12-06 00:22:07,133 INFO L231 Difference]: Finished difference. Result has 184 places, 343 transitions, 6373 flow [2022-12-06 00:22:07,133 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=6241, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6373, PETRI_PLACES=184, PETRI_TRANSITIONS=343} [2022-12-06 00:22:07,134 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 155 predicate places. [2022-12-06 00:22:07,134 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:22:07,134 INFO L89 Accepts]: Start accepts. Operand has 184 places, 343 transitions, 6373 flow [2022-12-06 00:22:07,135 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:22:07,135 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:22:07,135 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 184 places, 343 transitions, 6373 flow [2022-12-06 00:22:07,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 343 transitions, 6373 flow [2022-12-06 00:22:07,289 INFO L130 PetriNetUnfolder]: 442/1439 cut-off events. [2022-12-06 00:22:07,289 INFO L131 PetriNetUnfolder]: For 20142/20280 co-relation queries the response was YES. [2022-12-06 00:22:07,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9557 conditions, 1439 events. 442/1439 cut-off events. For 20142/20280 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 12385 event pairs, 20 based on Foata normal form. 16/1412 useless extension candidates. Maximal degree in co-relation 9454. Up to 264 conditions per place. [2022-12-06 00:22:07,309 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 182 places, 343 transitions, 6373 flow [2022-12-06 00:22:07,309 INFO L188 LiptonReduction]: Number of co-enabled transitions 1684 [2022-12-06 00:22:07,310 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:22:07,311 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 00:22:07,311 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 343 transitions, 6373 flow [2022-12-06 00:22:07,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:22:07,311 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:22:07,311 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:22:07,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-12-06 00:22:07,311 INFO L420 AbstractCegarLoop]: === Iteration 50 === 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 00:22:07,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:22:07,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1782800063, now seen corresponding path program 1 times [2022-12-06 00:22:07,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:22:07,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803743920] [2022-12-06 00:22:07,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:22:07,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:22:07,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:22:07,355 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 00:22:07,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:22:07,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803743920] [2022-12-06 00:22:07,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803743920] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:22:07,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:22:07,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:22:07,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811027848] [2022-12-06 00:22:07,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:22:07,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:22:07,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:22:07,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:22:07,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:22:07,356 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 00:22:07,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 343 transitions, 6373 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:22:07,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:22:07,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 00:22:07,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:22:07,969 INFO L130 PetriNetUnfolder]: 1988/3602 cut-off events. [2022-12-06 00:22:07,969 INFO L131 PetriNetUnfolder]: For 65310/65310 co-relation queries the response was YES. [2022-12-06 00:22:07,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27900 conditions, 3602 events. 1988/3602 cut-off events. For 65310/65310 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 22926 event pairs, 674 based on Foata normal form. 6/3608 useless extension candidates. Maximal degree in co-relation 27766. Up to 3596 conditions per place. [2022-12-06 00:22:08,003 INFO L137 encePairwiseOnDemand]: 41/43 looper letters, 341 selfloop transitions, 0 changer transitions 7/348 dead transitions. [2022-12-06 00:22:08,004 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 348 transitions, 7081 flow [2022-12-06 00:22:08,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:22:08,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:22:08,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-12-06 00:22:08,004 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3875968992248062 [2022-12-06 00:22:08,004 INFO L175 Difference]: Start difference. First operand has 182 places, 343 transitions, 6373 flow. Second operand 3 states and 50 transitions. [2022-12-06 00:22:08,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 348 transitions, 7081 flow [2022-12-06 00:22:08,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 348 transitions, 6914 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-12-06 00:22:08,210 INFO L231 Difference]: Finished difference. Result has 179 places, 341 transitions, 6157 flow [2022-12-06 00:22:08,211 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=6187, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=6157, PETRI_PLACES=179, PETRI_TRANSITIONS=341} [2022-12-06 00:22:08,211 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 150 predicate places. [2022-12-06 00:22:08,211 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:22:08,211 INFO L89 Accepts]: Start accepts. Operand has 179 places, 341 transitions, 6157 flow [2022-12-06 00:22:08,212 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:22:08,212 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:22:08,212 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 341 transitions, 6157 flow [2022-12-06 00:22:08,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 341 transitions, 6157 flow [2022-12-06 00:22:08,399 INFO L130 PetriNetUnfolder]: 439/1439 cut-off events. [2022-12-06 00:22:08,400 INFO L131 PetriNetUnfolder]: For 18290/18433 co-relation queries the response was YES. [2022-12-06 00:22:08,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9336 conditions, 1439 events. 439/1439 cut-off events. For 18290/18433 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 12407 event pairs, 20 based on Foata normal form. 15/1409 useless extension candidates. Maximal degree in co-relation 9245. Up to 268 conditions per place. [2022-12-06 00:22:08,415 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 341 transitions, 6157 flow [2022-12-06 00:22:08,415 INFO L188 LiptonReduction]: Number of co-enabled transitions 1674 [2022-12-06 00:22:08,416 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:22:08,417 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 206 [2022-12-06 00:22:08,417 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 341 transitions, 6157 flow [2022-12-06 00:22:08,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:22:08,417 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:22:08,417 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:22:08,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-12-06 00:22:08,417 INFO L420 AbstractCegarLoop]: === Iteration 51 === 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 00:22:08,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:22:08,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1286010469, now seen corresponding path program 1 times [2022-12-06 00:22:08,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:22:08,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782659198] [2022-12-06 00:22:08,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:22:08,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:22:08,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:22:09,188 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 00:22:09,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:22:09,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782659198] [2022-12-06 00:22:09,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782659198] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:22:09,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:22:09,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 00:22:09,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480030973] [2022-12-06 00:22:09,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:22:09,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 00:22:09,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:22:09,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 00:22:09,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-06 00:22:09,190 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 00:22:09,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 341 transitions, 6157 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:22:09,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:22:09,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 00:22:09,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:22:11,099 INFO L130 PetriNetUnfolder]: 2003/3631 cut-off events. [2022-12-06 00:22:11,099 INFO L131 PetriNetUnfolder]: For 61641/61641 co-relation queries the response was YES. [2022-12-06 00:22:11,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27627 conditions, 3631 events. 2003/3631 cut-off events. For 61641/61641 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 23195 event pairs, 526 based on Foata normal form. 1/3632 useless extension candidates. Maximal degree in co-relation 27452. Up to 2396 conditions per place. [2022-12-06 00:22:11,132 INFO L137 encePairwiseOnDemand]: 31/42 looper letters, 334 selfloop transitions, 73 changer transitions 14/421 dead transitions. [2022-12-06 00:22:11,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 421 transitions, 7503 flow [2022-12-06 00:22:11,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 00:22:11,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 00:22:11,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 131 transitions. [2022-12-06 00:22:11,137 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28354978354978355 [2022-12-06 00:22:11,137 INFO L175 Difference]: Start difference. First operand has 176 places, 341 transitions, 6157 flow. Second operand 11 states and 131 transitions. [2022-12-06 00:22:11,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 421 transitions, 7503 flow [2022-12-06 00:22:11,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 421 transitions, 7495 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 00:22:11,350 INFO L231 Difference]: Finished difference. Result has 191 places, 352 transitions, 6558 flow [2022-12-06 00:22:11,350 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6149, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6558, PETRI_PLACES=191, PETRI_TRANSITIONS=352} [2022-12-06 00:22:11,351 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 162 predicate places. [2022-12-06 00:22:11,351 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:22:11,351 INFO L89 Accepts]: Start accepts. Operand has 191 places, 352 transitions, 6558 flow [2022-12-06 00:22:11,368 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:22:11,368 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:22:11,368 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 352 transitions, 6558 flow [2022-12-06 00:22:11,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 190 places, 352 transitions, 6558 flow [2022-12-06 00:22:11,680 INFO L130 PetriNetUnfolder]: 439/1432 cut-off events. [2022-12-06 00:22:11,681 INFO L131 PetriNetUnfolder]: For 19784/19931 co-relation queries the response was YES. [2022-12-06 00:22:11,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9587 conditions, 1432 events. 439/1432 cut-off events. For 19784/19931 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 12350 event pairs, 19 based on Foata normal form. 14/1400 useless extension candidates. Maximal degree in co-relation 9473. Up to 262 conditions per place. [2022-12-06 00:22:11,714 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 190 places, 352 transitions, 6558 flow [2022-12-06 00:22:11,715 INFO L188 LiptonReduction]: Number of co-enabled transitions 1732 [2022-12-06 00:22:11,716 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:22:11,882 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:22:12,019 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:22:12,020 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 669 [2022-12-06 00:22:12,020 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 351 transitions, 6567 flow [2022-12-06 00:22:12,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:22:12,020 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:22:12,020 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:22:12,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-12-06 00:22:12,020 INFO L420 AbstractCegarLoop]: === Iteration 52 === 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 00:22:12,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:22:12,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1095518954, now seen corresponding path program 2 times [2022-12-06 00:22:12,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:22:12,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168205522] [2022-12-06 00:22:12,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:22:12,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:22:12,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:22:19,397 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 00:22:19,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:22:19,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168205522] [2022-12-06 00:22:19,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168205522] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:22:19,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:22:19,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 00:22:19,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523695907] [2022-12-06 00:22:19,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:22:19,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 00:22:19,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:22:19,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 00:22:19,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-06 00:22:19,399 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 00:22:19,399 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 351 transitions, 6567 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:22:19,399 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:22:19,399 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 00:22:19,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:22:21,035 INFO L130 PetriNetUnfolder]: 1998/3625 cut-off events. [2022-12-06 00:22:21,035 INFO L131 PetriNetUnfolder]: For 68075/68075 co-relation queries the response was YES. [2022-12-06 00:22:21,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28388 conditions, 3625 events. 1998/3625 cut-off events. For 68075/68075 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 23206 event pairs, 607 based on Foata normal form. 1/3626 useless extension candidates. Maximal degree in co-relation 28251. Up to 3420 conditions per place. [2022-12-06 00:22:21,060 INFO L137 encePairwiseOnDemand]: 31/44 looper letters, 359 selfloop transitions, 29 changer transitions 13/401 dead transitions. [2022-12-06 00:22:21,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 401 transitions, 7840 flow [2022-12-06 00:22:21,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:22:21,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:22:21,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2022-12-06 00:22:21,061 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2727272727272727 [2022-12-06 00:22:21,061 INFO L175 Difference]: Start difference. First operand has 189 places, 351 transitions, 6567 flow. Second operand 8 states and 96 transitions. [2022-12-06 00:22:21,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 401 transitions, 7840 flow [2022-12-06 00:22:21,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 401 transitions, 7718 flow, removed 23 selfloop flow, removed 5 redundant places. [2022-12-06 00:22:21,237 INFO L231 Difference]: Finished difference. Result has 196 places, 366 transitions, 6803 flow [2022-12-06 00:22:21,237 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=6445, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6803, PETRI_PLACES=196, PETRI_TRANSITIONS=366} [2022-12-06 00:22:21,237 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 167 predicate places. [2022-12-06 00:22:21,237 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:22:21,238 INFO L89 Accepts]: Start accepts. Operand has 196 places, 366 transitions, 6803 flow [2022-12-06 00:22:21,239 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:22:21,239 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:22:21,239 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 196 places, 366 transitions, 6803 flow [2022-12-06 00:22:21,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 195 places, 366 transitions, 6803 flow [2022-12-06 00:22:21,400 INFO L130 PetriNetUnfolder]: 450/1456 cut-off events. [2022-12-06 00:22:21,400 INFO L131 PetriNetUnfolder]: For 20071/20216 co-relation queries the response was YES. [2022-12-06 00:22:21,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9827 conditions, 1456 events. 450/1456 cut-off events. For 20071/20216 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 12567 event pairs, 19 based on Foata normal form. 15/1425 useless extension candidates. Maximal degree in co-relation 9710. Up to 267 conditions per place. [2022-12-06 00:22:21,420 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 195 places, 366 transitions, 6803 flow [2022-12-06 00:22:21,420 INFO L188 LiptonReduction]: Number of co-enabled transitions 1792 [2022-12-06 00:22:21,421 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [556] $Ultimate##0-->L51-5: Formula: (and (= |v_thread1Thread1of1ForFork2_~x~0#1_19| 0) (= |v_thread1Thread1of1ForFork2_~i~0#1_23| 0)) InVars {} OutVars{thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_19|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_23|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] and [580] L67-5-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_31| (+ |v_thread2Thread1of1ForFork0_~i~1#1_32| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_32| 4294967296) (mod v_~A~0_35 4294967296)) (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_30| v_~B~0_29) |v_thread2Thread1of1ForFork0_~x~1#1_29|)) InVars {~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_32|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_30|} OutVars{~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_31|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_13|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] [2022-12-06 00:22:21,454 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:22:21,586 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:22:21,586 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 349 [2022-12-06 00:22:21,586 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 365 transitions, 6810 flow [2022-12-06 00:22:21,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:22:21,586 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:22:21,587 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:22:21,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-12-06 00:22:21,587 INFO L420 AbstractCegarLoop]: === Iteration 53 === 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 00:22:21,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:22:21,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1870733452, now seen corresponding path program 1 times [2022-12-06 00:22:21,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:22:21,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274674353] [2022-12-06 00:22:21,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:22:21,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:22:21,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:22:22,194 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 00:22:22,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:22:22,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274674353] [2022-12-06 00:22:22,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274674353] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:22:22,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:22:22,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:22:22,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075634735] [2022-12-06 00:22:22,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:22:22,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:22:22,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:22:22,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:22:22,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:22:22,196 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 00:22:22,196 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 365 transitions, 6810 flow. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:22:22,196 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:22:22,196 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 00:22:22,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:22:23,717 INFO L130 PetriNetUnfolder]: 1993/3619 cut-off events. [2022-12-06 00:22:23,717 INFO L131 PetriNetUnfolder]: For 68040/68040 co-relation queries the response was YES. [2022-12-06 00:22:23,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28648 conditions, 3619 events. 1993/3619 cut-off events. For 68040/68040 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 23146 event pairs, 539 based on Foata normal form. 1/3620 useless extension candidates. Maximal degree in co-relation 28508. Up to 2390 conditions per place. [2022-12-06 00:22:23,751 INFO L137 encePairwiseOnDemand]: 34/46 looper letters, 347 selfloop transitions, 61 changer transitions 14/422 dead transitions. [2022-12-06 00:22:23,752 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 422 transitions, 7977 flow [2022-12-06 00:22:23,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 00:22:23,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 00:22:23,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2022-12-06 00:22:23,752 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2565217391304348 [2022-12-06 00:22:23,753 INFO L175 Difference]: Start difference. First operand has 194 places, 365 transitions, 6810 flow. Second operand 10 states and 118 transitions. [2022-12-06 00:22:23,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 422 transitions, 7977 flow [2022-12-06 00:22:23,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 422 transitions, 7875 flow, removed 51 selfloop flow, removed 2 redundant places. [2022-12-06 00:22:23,970 INFO L231 Difference]: Finished difference. Result has 203 places, 364 transitions, 6814 flow [2022-12-06 00:22:23,970 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=6710, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6814, PETRI_PLACES=203, PETRI_TRANSITIONS=364} [2022-12-06 00:22:23,971 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 174 predicate places. [2022-12-06 00:22:23,971 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:22:23,971 INFO L89 Accepts]: Start accepts. Operand has 203 places, 364 transitions, 6814 flow [2022-12-06 00:22:23,972 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:22:23,972 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:22:23,972 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 203 places, 364 transitions, 6814 flow [2022-12-06 00:22:23,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 201 places, 364 transitions, 6814 flow [2022-12-06 00:22:24,142 INFO L130 PetriNetUnfolder]: 448/1441 cut-off events. [2022-12-06 00:22:24,142 INFO L131 PetriNetUnfolder]: For 20640/20801 co-relation queries the response was YES. [2022-12-06 00:22:24,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9808 conditions, 1441 events. 448/1441 cut-off events. For 20640/20801 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 12342 event pairs, 18 based on Foata normal form. 16/1410 useless extension candidates. Maximal degree in co-relation 9721. Up to 262 conditions per place. [2022-12-06 00:22:24,158 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 201 places, 364 transitions, 6814 flow [2022-12-06 00:22:24,158 INFO L188 LiptonReduction]: Number of co-enabled transitions 1782 [2022-12-06 00:22:24,172 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [580] L67-5-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_31| (+ |v_thread2Thread1of1ForFork0_~i~1#1_32| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_32| 4294967296) (mod v_~A~0_35 4294967296)) (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_30| v_~B~0_29) |v_thread2Thread1of1ForFork0_~x~1#1_29|)) InVars {~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_32|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_30|} OutVars{~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_31|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_13|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] [2022-12-06 00:22:24,387 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [580] L67-5-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_31| (+ |v_thread2Thread1of1ForFork0_~i~1#1_32| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_32| 4294967296) (mod v_~A~0_35 4294967296)) (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_30| v_~B~0_29) |v_thread2Thread1of1ForFork0_~x~1#1_29|)) InVars {~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_32|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_30|} OutVars{~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_31|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_13|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] [2022-12-06 00:22:24,522 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [580] L67-5-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_31| (+ |v_thread2Thread1of1ForFork0_~i~1#1_32| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_32| 4294967296) (mod v_~A~0_35 4294967296)) (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_30| v_~B~0_29) |v_thread2Thread1of1ForFork0_~x~1#1_29|)) InVars {~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_32|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_30|} OutVars{~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_31|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_13|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] [2022-12-06 00:22:24,653 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [580] L67-5-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_31| (+ |v_thread2Thread1of1ForFork0_~i~1#1_32| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_32| 4294967296) (mod v_~A~0_35 4294967296)) (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_30| v_~B~0_29) |v_thread2Thread1of1ForFork0_~x~1#1_29|)) InVars {~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_32|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_30|} OutVars{~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_31|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_13|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] [2022-12-06 00:22:24,794 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [709] L51-5-->L104-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre18#1_194| |v_#pthreadsForks_381|) (= v_~end~0_615 (+ v_~end~0_616 1)) (= (+ |v_#pthreadsForks_381| 1) |v_#pthreadsForks_380|) (= |v_thread1Thread1of1ForFork2_#res#1.offset_105| 0) (= |v_thread1Thread1of1ForFork2_#res#1.base_105| 0) (not (= (ite (and (<= 0 v_~end~0_616) (< v_~end~0_616 v_~n~0_328)) 1 0) 0)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_107| (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_232| 4294967296) (mod (select (select |v_#memory_int_573| v_~queue~0.base_322) (+ (* v_~end~0_616 4) v_~queue~0.offset_322)) 4294967296)) 1 0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_107| 0)) (= (store |v_#memory_int_573| |v_ULTIMATE.start_main_~#t3~0#1.base_206| (store (select |v_#memory_int_573| |v_ULTIMATE.start_main_~#t3~0#1.base_206|) |v_ULTIMATE.start_main_~#t3~0#1.offset_188| |v_ULTIMATE.start_main_#t~pre18#1_194|)) |v_#memory_int_572|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_107| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_107|) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_227| 4294967296) (mod v_~A~0_320 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_322, ~A~0=v_~A~0_320, #pthreadsForks=|v_#pthreadsForks_381|, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_232|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_227|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_188|, #memory_int=|v_#memory_int_573|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_206|, ~end~0=v_~end~0_616, ~queue~0.base=v_~queue~0.base_322, ~n~0=v_~n~0_328} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_194|, ~queue~0.offset=v_~queue~0.offset_322, ~A~0=v_~A~0_320, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_232|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_188|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_107|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_206|, ~queue~0.base=v_~queue~0.base_322, #pthreadsForks=|v_#pthreadsForks_380|, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_107|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_227|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_107|, #memory_int=|v_#memory_int_572|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_208|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_105|, ~end~0=v_~end~0_615, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_177|, ~n~0=v_~n~0_328, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_105|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_107|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, ULTIMATE.start_main_#t~nondet17#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [580] L67-5-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_31| (+ |v_thread2Thread1of1ForFork0_~i~1#1_32| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_32| 4294967296) (mod v_~A~0_35 4294967296)) (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_30| v_~B~0_29) |v_thread2Thread1of1ForFork0_~x~1#1_29|)) InVars {~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_32|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_30|} OutVars{~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_31|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_13|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] [2022-12-06 00:22:24,933 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [580] L67-5-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_31| (+ |v_thread2Thread1of1ForFork0_~i~1#1_32| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_32| 4294967296) (mod v_~A~0_35 4294967296)) (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_30| v_~B~0_29) |v_thread2Thread1of1ForFork0_~x~1#1_29|)) InVars {~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_32|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_30|} OutVars{~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_31|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_13|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] [2022-12-06 00:22:25,069 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [580] L67-5-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_31| (+ |v_thread2Thread1of1ForFork0_~i~1#1_32| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_32| 4294967296) (mod v_~A~0_35 4294967296)) (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_30| v_~B~0_29) |v_thread2Thread1of1ForFork0_~x~1#1_29|)) InVars {~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_32|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_30|} OutVars{~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_31|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_13|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] [2022-12-06 00:22:25,204 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [580] L67-5-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_31| (+ |v_thread2Thread1of1ForFork0_~i~1#1_32| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_32| 4294967296) (mod v_~A~0_35 4294967296)) (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_30| v_~B~0_29) |v_thread2Thread1of1ForFork0_~x~1#1_29|)) InVars {~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_32|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_30|} OutVars{~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_31|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_13|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] [2022-12-06 00:22:25,346 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:22:25,347 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1376 [2022-12-06 00:22:25,347 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 372 transitions, 7087 flow [2022-12-06 00:22:25,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:22:25,347 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:22:25,347 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:22:25,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-12-06 00:22:25,347 INFO L420 AbstractCegarLoop]: === Iteration 54 === 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 00:22:25,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:22:25,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1636317221, now seen corresponding path program 1 times [2022-12-06 00:22:25,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:22:25,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398061727] [2022-12-06 00:22:25,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:22:25,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:22:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:22:26,696 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 00:22:26,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:22:26,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398061727] [2022-12-06 00:22:26,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398061727] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:22:26,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:22:26,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:22:26,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150241462] [2022-12-06 00:22:26,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:22:26,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:22:26,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:22:26,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:22:26,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:22:26,698 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 00:22:26,698 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 372 transitions, 7087 flow. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:22:26,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:22:26,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 00:22:26,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:22:27,846 INFO L130 PetriNetUnfolder]: 1986/3614 cut-off events. [2022-12-06 00:22:27,846 INFO L131 PetriNetUnfolder]: For 69425/69425 co-relation queries the response was YES. [2022-12-06 00:22:27,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28703 conditions, 3614 events. 1986/3614 cut-off events. For 69425/69425 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 23256 event pairs, 466 based on Foata normal form. 1/3615 useless extension candidates. Maximal degree in co-relation 28559. Up to 2869 conditions per place. [2022-12-06 00:22:27,875 INFO L137 encePairwiseOnDemand]: 35/53 looper letters, 286 selfloop transitions, 104 changer transitions 16/406 dead transitions. [2022-12-06 00:22:27,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 406 transitions, 7932 flow [2022-12-06 00:22:27,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:22:27,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:22:27,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2022-12-06 00:22:27,876 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22169811320754718 [2022-12-06 00:22:27,876 INFO L175 Difference]: Start difference. First operand has 202 places, 372 transitions, 7087 flow. Second operand 8 states and 94 transitions. [2022-12-06 00:22:27,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 406 transitions, 7932 flow [2022-12-06 00:22:28,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 406 transitions, 7836 flow, removed 15 selfloop flow, removed 5 redundant places. [2022-12-06 00:22:28,096 INFO L231 Difference]: Finished difference. Result has 207 places, 362 transitions, 6908 flow [2022-12-06 00:22:28,096 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=6715, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6908, PETRI_PLACES=207, PETRI_TRANSITIONS=362} [2022-12-06 00:22:28,097 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 178 predicate places. [2022-12-06 00:22:28,097 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:22:28,097 INFO L89 Accepts]: Start accepts. Operand has 207 places, 362 transitions, 6908 flow [2022-12-06 00:22:28,098 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:22:28,098 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:22:28,098 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 207 places, 362 transitions, 6908 flow [2022-12-06 00:22:28,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 362 transitions, 6908 flow [2022-12-06 00:22:28,255 INFO L130 PetriNetUnfolder]: 445/1435 cut-off events. [2022-12-06 00:22:28,255 INFO L131 PetriNetUnfolder]: For 21414/21578 co-relation queries the response was YES. [2022-12-06 00:22:28,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9886 conditions, 1435 events. 445/1435 cut-off events. For 21414/21578 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 12328 event pairs, 19 based on Foata normal form. 16/1407 useless extension candidates. Maximal degree in co-relation 9765. Up to 262 conditions per place. [2022-12-06 00:22:28,274 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 205 places, 362 transitions, 6908 flow [2022-12-06 00:22:28,274 INFO L188 LiptonReduction]: Number of co-enabled transitions 1772 [2022-12-06 00:22:28,275 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [580] L67-5-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_31| (+ |v_thread2Thread1of1ForFork0_~i~1#1_32| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_32| 4294967296) (mod v_~A~0_35 4294967296)) (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_30| v_~B~0_29) |v_thread2Thread1of1ForFork0_~x~1#1_29|)) InVars {~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_32|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_30|} OutVars{~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_31|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_13|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] [2022-12-06 00:22:28,422 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:22:28,423 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 326 [2022-12-06 00:22:28,423 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 362 transitions, 6933 flow [2022-12-06 00:22:28,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:22:28,423 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:22:28,423 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:22:28,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-12-06 00:22:28,423 INFO L420 AbstractCegarLoop]: === Iteration 55 === 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 00:22:28,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:22:28,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1816797922, now seen corresponding path program 1 times [2022-12-06 00:22:28,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:22:28,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260610840] [2022-12-06 00:22:28,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:22:28,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:22:28,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:22:28,469 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 00:22:28,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:22:28,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260610840] [2022-12-06 00:22:28,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260610840] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:22:28,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:22:28,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:22:28,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565492011] [2022-12-06 00:22:28,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:22:28,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:22:28,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:22:28,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:22:28,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:22:28,471 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 00:22:28,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 362 transitions, 6933 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:22:28,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:22:28,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 00:22:28,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:22:29,184 INFO L130 PetriNetUnfolder]: 1928/3512 cut-off events. [2022-12-06 00:22:29,185 INFO L131 PetriNetUnfolder]: For 70660/70660 co-relation queries the response was YES. [2022-12-06 00:22:29,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28154 conditions, 3512 events. 1928/3512 cut-off events. For 70660/70660 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 22427 event pairs, 571 based on Foata normal form. 26/3538 useless extension candidates. Maximal degree in co-relation 28009. Up to 3072 conditions per place. [2022-12-06 00:22:29,215 INFO L137 encePairwiseOnDemand]: 36/45 looper letters, 396 selfloop transitions, 18 changer transitions 0/414 dead transitions. [2022-12-06 00:22:29,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 414 transitions, 8286 flow [2022-12-06 00:22:29,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:22:29,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:22:29,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-12-06 00:22:29,216 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2022-12-06 00:22:29,216 INFO L175 Difference]: Start difference. First operand has 205 places, 362 transitions, 6933 flow. Second operand 4 states and 76 transitions. [2022-12-06 00:22:29,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 414 transitions, 8286 flow [2022-12-06 00:22:29,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 414 transitions, 8045 flow, removed 10 selfloop flow, removed 7 redundant places. [2022-12-06 00:22:29,414 INFO L231 Difference]: Finished difference. Result has 203 places, 362 transitions, 6751 flow [2022-12-06 00:22:29,414 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=6661, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=6751, PETRI_PLACES=203, PETRI_TRANSITIONS=362} [2022-12-06 00:22:29,415 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 174 predicate places. [2022-12-06 00:22:29,415 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:22:29,415 INFO L89 Accepts]: Start accepts. Operand has 203 places, 362 transitions, 6751 flow [2022-12-06 00:22:29,416 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:22:29,416 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:22:29,416 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 203 places, 362 transitions, 6751 flow [2022-12-06 00:22:29,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 203 places, 362 transitions, 6751 flow [2022-12-06 00:22:29,574 INFO L130 PetriNetUnfolder]: 445/1419 cut-off events. [2022-12-06 00:22:29,574 INFO L131 PetriNetUnfolder]: For 20418/20610 co-relation queries the response was YES. [2022-12-06 00:22:29,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9732 conditions, 1419 events. 445/1419 cut-off events. For 20418/20610 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 12045 event pairs, 21 based on Foata normal form. 16/1392 useless extension candidates. Maximal degree in co-relation 9541. Up to 255 conditions per place. [2022-12-06 00:22:29,593 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 203 places, 362 transitions, 6751 flow [2022-12-06 00:22:29,594 INFO L188 LiptonReduction]: Number of co-enabled transitions 1766 [2022-12-06 00:22:29,595 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:22:29,596 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 00:22:29,596 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 362 transitions, 6751 flow [2022-12-06 00:22:29,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:22:29,596 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:22:29,596 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:22:29,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-12-06 00:22:29,596 INFO L420 AbstractCegarLoop]: === Iteration 56 === 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 00:22:29,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:22:29,596 INFO L85 PathProgramCache]: Analyzing trace with hash -700498293, now seen corresponding path program 1 times [2022-12-06 00:22:29,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:22:29,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082933327] [2022-12-06 00:22:29,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:22:29,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:22:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:22:29,634 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 00:22:29,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:22:29,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082933327] [2022-12-06 00:22:29,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082933327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:22:29,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:22:29,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:22:29,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336936537] [2022-12-06 00:22:29,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:22:29,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:22:29,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:22:29,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:22:29,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:22:29,636 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 00:22:29,636 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 362 transitions, 6751 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:22:29,636 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:22:29,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 00:22:29,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:22:30,370 INFO L130 PetriNetUnfolder]: 1844/3374 cut-off events. [2022-12-06 00:22:30,372 INFO L131 PetriNetUnfolder]: For 65177/65177 co-relation queries the response was YES. [2022-12-06 00:22:30,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26875 conditions, 3374 events. 1844/3374 cut-off events. For 65177/65177 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 21465 event pairs, 562 based on Foata normal form. 28/3402 useless extension candidates. Maximal degree in co-relation 26511. Up to 3072 conditions per place. [2022-12-06 00:22:30,404 INFO L137 encePairwiseOnDemand]: 37/44 looper letters, 373 selfloop transitions, 21 changer transitions 4/398 dead transitions. [2022-12-06 00:22:30,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 398 transitions, 7907 flow [2022-12-06 00:22:30,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:22:30,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:22:30,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:22:30,405 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39204545454545453 [2022-12-06 00:22:30,405 INFO L175 Difference]: Start difference. First operand has 203 places, 362 transitions, 6751 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:22:30,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 398 transitions, 7907 flow [2022-12-06 00:22:30,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 398 transitions, 7839 flow, removed 20 selfloop flow, removed 3 redundant places. [2022-12-06 00:22:30,612 INFO L231 Difference]: Finished difference. Result has 205 places, 360 transitions, 6718 flow [2022-12-06 00:22:30,612 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=6610, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=6718, PETRI_PLACES=205, PETRI_TRANSITIONS=360} [2022-12-06 00:22:30,613 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 176 predicate places. [2022-12-06 00:22:30,613 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:22:30,613 INFO L89 Accepts]: Start accepts. Operand has 205 places, 360 transitions, 6718 flow [2022-12-06 00:22:30,614 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:22:30,614 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:22:30,614 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 205 places, 360 transitions, 6718 flow [2022-12-06 00:22:30,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 202 places, 360 transitions, 6718 flow [2022-12-06 00:22:30,783 INFO L130 PetriNetUnfolder]: 429/1356 cut-off events. [2022-12-06 00:22:30,783 INFO L131 PetriNetUnfolder]: For 19655/19839 co-relation queries the response was YES. [2022-12-06 00:22:30,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9339 conditions, 1356 events. 429/1356 cut-off events. For 19655/19839 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 11317 event pairs, 19 based on Foata normal form. 20/1335 useless extension candidates. Maximal degree in co-relation 9160. Up to 246 conditions per place. [2022-12-06 00:22:30,799 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 202 places, 360 transitions, 6718 flow [2022-12-06 00:22:30,799 INFO L188 LiptonReduction]: Number of co-enabled transitions 1738 [2022-12-06 00:22:30,800 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:22:30,801 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 00:22:30,801 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 360 transitions, 6718 flow [2022-12-06 00:22:30,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:22:30,801 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:22:30,801 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:22:30,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-12-06 00:22:30,802 INFO L420 AbstractCegarLoop]: === Iteration 57 === 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 00:22:30,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:22:30,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1611419292, now seen corresponding path program 3 times [2022-12-06 00:22:30,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:22:30,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122500189] [2022-12-06 00:22:30,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:22:30,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:22:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:22:31,619 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 00:22:31,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:22:31,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122500189] [2022-12-06 00:22:31,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122500189] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:22:31,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:22:31,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:22:31,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958444689] [2022-12-06 00:22:31,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:22:31,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:22:31,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:22:31,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:22:31,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:22:31,620 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 00:22:31,620 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 360 transitions, 6718 flow. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:22:31,620 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:22:31,620 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 00:22:31,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:22:32,506 INFO L130 PetriNetUnfolder]: 1846/3371 cut-off events. [2022-12-06 00:22:32,507 INFO L131 PetriNetUnfolder]: For 63693/63693 co-relation queries the response was YES. [2022-12-06 00:22:32,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26808 conditions, 3371 events. 1846/3371 cut-off events. For 63693/63693 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 21385 event pairs, 441 based on Foata normal form. 1/3372 useless extension candidates. Maximal degree in co-relation 26477. Up to 2635 conditions per place. [2022-12-06 00:22:32,542 INFO L137 encePairwiseOnDemand]: 26/43 looper letters, 283 selfloop transitions, 104 changer transitions 15/402 dead transitions. [2022-12-06 00:22:32,543 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 402 transitions, 7833 flow [2022-12-06 00:22:32,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:22:32,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:22:32,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2022-12-06 00:22:32,544 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25872093023255816 [2022-12-06 00:22:32,544 INFO L175 Difference]: Start difference. First operand has 202 places, 360 transitions, 6718 flow. Second operand 8 states and 89 transitions. [2022-12-06 00:22:32,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 402 transitions, 7833 flow [2022-12-06 00:22:32,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 402 transitions, 7772 flow, removed 23 selfloop flow, removed 4 redundant places. [2022-12-06 00:22:32,770 INFO L231 Difference]: Finished difference. Result has 208 places, 364 transitions, 6936 flow [2022-12-06 00:22:32,771 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=6660, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6936, PETRI_PLACES=208, PETRI_TRANSITIONS=364} [2022-12-06 00:22:32,771 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 179 predicate places. [2022-12-06 00:22:32,771 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:22:32,771 INFO L89 Accepts]: Start accepts. Operand has 208 places, 364 transitions, 6936 flow [2022-12-06 00:22:32,773 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:22:32,773 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:22:32,773 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 208 places, 364 transitions, 6936 flow [2022-12-06 00:22:32,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 207 places, 364 transitions, 6936 flow [2022-12-06 00:22:32,920 INFO L130 PetriNetUnfolder]: 429/1364 cut-off events. [2022-12-06 00:22:32,920 INFO L131 PetriNetUnfolder]: For 20865/21046 co-relation queries the response was YES. [2022-12-06 00:22:32,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9578 conditions, 1364 events. 429/1364 cut-off events. For 20865/21046 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 11420 event pairs, 19 based on Foata normal form. 21/1344 useless extension candidates. Maximal degree in co-relation 9459. Up to 250 conditions per place. [2022-12-06 00:22:32,938 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 207 places, 364 transitions, 6936 flow [2022-12-06 00:22:32,938 INFO L188 LiptonReduction]: Number of co-enabled transitions 1746 [2022-12-06 00:22:32,940 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:22:33,056 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [556] $Ultimate##0-->L51-5: Formula: (and (= |v_thread1Thread1of1ForFork2_~x~0#1_19| 0) (= |v_thread1Thread1of1ForFork2_~i~0#1_23| 0)) InVars {} OutVars{thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_19|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_23|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:22:33,174 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:22:33,175 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 404 [2022-12-06 00:22:33,175 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 362 transitions, 6940 flow [2022-12-06 00:22:33,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:22:33,176 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:22:33,176 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:22:33,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-12-06 00:22:33,177 INFO L420 AbstractCegarLoop]: === Iteration 58 === 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 00:22:33,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:22:33,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1190152250, now seen corresponding path program 1 times [2022-12-06 00:22:33,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:22:33,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956752839] [2022-12-06 00:22:33,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:22:33,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:22:33,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:22:34,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:22:34,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:22:34,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956752839] [2022-12-06 00:22:34,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956752839] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:22:34,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752072869] [2022-12-06 00:22:34,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:22:34,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:22:34,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:22:34,154 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:22:34,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 00:22:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:22:34,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-06 00:22:34,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:22:34,406 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:22:34,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 56 [2022-12-06 00:22:34,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:22:34,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:22:34,665 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:22:34,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 134 treesize of output 101 [2022-12-06 00:22:35,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:22:35,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752072869] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:22:35,112 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:22:35,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2022-12-06 00:22:35,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622906350] [2022-12-06 00:22:35,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:22:35,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 00:22:35,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:22:35,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 00:22:35,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-12-06 00:22:35,112 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 00:22:35,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 362 transitions, 6940 flow. Second operand has 18 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 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 00:22:35,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:22:35,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 00:22:35,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:22:36,483 INFO L130 PetriNetUnfolder]: 1978/3543 cut-off events. [2022-12-06 00:22:36,484 INFO L131 PetriNetUnfolder]: For 69333/69333 co-relation queries the response was YES. [2022-12-06 00:22:36,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28851 conditions, 3543 events. 1978/3543 cut-off events. For 69333/69333 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 22353 event pairs, 345 based on Foata normal form. 1/3544 useless extension candidates. Maximal degree in co-relation 28709. Up to 2193 conditions per place. [2022-12-06 00:22:36,513 INFO L137 encePairwiseOnDemand]: 24/45 looper letters, 280 selfloop transitions, 178 changer transitions 13/471 dead transitions. [2022-12-06 00:22:36,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 471 transitions, 9206 flow [2022-12-06 00:22:36,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 00:22:36,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 00:22:36,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 137 transitions. [2022-12-06 00:22:36,514 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2767676767676768 [2022-12-06 00:22:36,514 INFO L175 Difference]: Start difference. First operand has 205 places, 362 transitions, 6940 flow. Second operand 11 states and 137 transitions. [2022-12-06 00:22:36,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 471 transitions, 9206 flow [2022-12-06 00:22:36,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 471 transitions, 8956 flow, removed 16 selfloop flow, removed 6 redundant places. [2022-12-06 00:22:36,731 INFO L231 Difference]: Finished difference. Result has 216 places, 389 transitions, 7749 flow [2022-12-06 00:22:36,731 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=6704, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=151, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7749, PETRI_PLACES=216, PETRI_TRANSITIONS=389} [2022-12-06 00:22:36,731 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 187 predicate places. [2022-12-06 00:22:36,732 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:22:36,732 INFO L89 Accepts]: Start accepts. Operand has 216 places, 389 transitions, 7749 flow [2022-12-06 00:22:36,733 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:22:36,733 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:22:36,733 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 216 places, 389 transitions, 7749 flow [2022-12-06 00:22:36,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 215 places, 389 transitions, 7749 flow [2022-12-06 00:22:36,895 INFO L130 PetriNetUnfolder]: 491/1456 cut-off events. [2022-12-06 00:22:36,895 INFO L131 PetriNetUnfolder]: For 24460/24646 co-relation queries the response was YES. [2022-12-06 00:22:36,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10954 conditions, 1456 events. 491/1456 cut-off events. For 24460/24646 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 11988 event pairs, 21 based on Foata normal form. 16/1425 useless extension candidates. Maximal degree in co-relation 10830. Up to 274 conditions per place. [2022-12-06 00:22:36,915 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 215 places, 389 transitions, 7749 flow [2022-12-06 00:22:36,915 INFO L188 LiptonReduction]: Number of co-enabled transitions 1860 [2022-12-06 00:22:36,917 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:22:37,049 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:22:37,050 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 318 [2022-12-06 00:22:37,050 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 388 transitions, 7743 flow [2022-12-06 00:22:37,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 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 00:22:37,050 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:22:37,050 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:22:37,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 00:22:37,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:22:37,251 INFO L420 AbstractCegarLoop]: === Iteration 59 === 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 00:22:37,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:22:37,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1535869740, now seen corresponding path program 1 times [2022-12-06 00:22:37,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:22:37,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362053719] [2022-12-06 00:22:37,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:22:37,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:22:37,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:22:38,681 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 00:22:38,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:22:38,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362053719] [2022-12-06 00:22:38,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362053719] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:22:38,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:22:38,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:22:38,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043922396] [2022-12-06 00:22:38,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:22:38,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:22:38,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:22:38,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:22:38,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:22:38,683 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 00:22:38,683 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 388 transitions, 7743 flow. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:22:38,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:22:38,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 00:22:38,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:22:39,910 INFO L130 PetriNetUnfolder]: 1973/3537 cut-off events. [2022-12-06 00:22:39,910 INFO L131 PetriNetUnfolder]: For 77697/77697 co-relation queries the response was YES. [2022-12-06 00:22:39,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30283 conditions, 3537 events. 1973/3537 cut-off events. For 77697/77697 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 22174 event pairs, 549 based on Foata normal form. 1/3538 useless extension candidates. Maximal degree in co-relation 30136. Up to 2969 conditions per place. [2022-12-06 00:22:39,940 INFO L137 encePairwiseOnDemand]: 32/46 looper letters, 331 selfloop transitions, 78 changer transitions 14/423 dead transitions. [2022-12-06 00:22:39,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 423 transitions, 8822 flow [2022-12-06 00:22:39,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:22:39,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:22:39,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2022-12-06 00:22:39,941 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2670807453416149 [2022-12-06 00:22:39,941 INFO L175 Difference]: Start difference. First operand has 214 places, 388 transitions, 7743 flow. Second operand 7 states and 86 transitions. [2022-12-06 00:22:39,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 423 transitions, 8822 flow [2022-12-06 00:22:40,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 423 transitions, 8496 flow, removed 54 selfloop flow, removed 7 redundant places. [2022-12-06 00:22:40,194 INFO L231 Difference]: Finished difference. Result has 215 places, 387 transitions, 7556 flow [2022-12-06 00:22:40,194 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=7417, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7556, PETRI_PLACES=215, PETRI_TRANSITIONS=387} [2022-12-06 00:22:40,194 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 186 predicate places. [2022-12-06 00:22:40,194 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:22:40,194 INFO L89 Accepts]: Start accepts. Operand has 215 places, 387 transitions, 7556 flow [2022-12-06 00:22:40,196 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:22:40,196 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:22:40,196 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 215 places, 387 transitions, 7556 flow [2022-12-06 00:22:40,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 213 places, 387 transitions, 7556 flow [2022-12-06 00:22:40,370 INFO L130 PetriNetUnfolder]: 489/1441 cut-off events. [2022-12-06 00:22:40,370 INFO L131 PetriNetUnfolder]: For 24596/24772 co-relation queries the response was YES. [2022-12-06 00:22:40,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10488 conditions, 1441 events. 489/1441 cut-off events. For 24596/24772 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 11759 event pairs, 20 based on Foata normal form. 16/1402 useless extension candidates. Maximal degree in co-relation 10390. Up to 270 conditions per place. [2022-12-06 00:22:40,388 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 213 places, 387 transitions, 7556 flow [2022-12-06 00:22:40,388 INFO L188 LiptonReduction]: Number of co-enabled transitions 1852 [2022-12-06 00:22:40,389 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:22:40,389 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 195 [2022-12-06 00:22:40,389 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 387 transitions, 7556 flow [2022-12-06 00:22:40,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:22:40,390 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:22:40,390 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:22:40,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-12-06 00:22:40,390 INFO L420 AbstractCegarLoop]: === Iteration 60 === 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 00:22:40,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:22:40,390 INFO L85 PathProgramCache]: Analyzing trace with hash -39074545, now seen corresponding path program 1 times [2022-12-06 00:22:40,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:22:40,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921430356] [2022-12-06 00:22:40,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:22:40,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:22:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:22:41,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:22:41,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:22:41,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921430356] [2022-12-06 00:22:41,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921430356] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:22:41,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078645969] [2022-12-06 00:22:41,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:22:41,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:22:41,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:22:41,341 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:22:41,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 00:22:41,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:22:41,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-06 00:22:41,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:22:41,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:22:41,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-12-06 00:22:41,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:22:41,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:22:41,703 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:22:41,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 87 treesize of output 105 [2022-12-06 00:22:41,708 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:22:41,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 7 [2022-12-06 00:22:41,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:22:41,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078645969] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:22:41,864 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:22:41,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-06 00:22:41,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125322236] [2022-12-06 00:22:41,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:22:41,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 00:22:41,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:22:41,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 00:22:41,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2022-12-06 00:22:41,865 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 00:22:41,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 387 transitions, 7556 flow. Second operand has 19 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 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 00:22:41,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:22:41,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 00:22:41,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:22:43,348 INFO L130 PetriNetUnfolder]: 1986/3562 cut-off events. [2022-12-06 00:22:43,348 INFO L131 PetriNetUnfolder]: For 76373/76373 co-relation queries the response was YES. [2022-12-06 00:22:43,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29598 conditions, 3562 events. 1986/3562 cut-off events. For 76373/76373 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 22304 event pairs, 397 based on Foata normal form. 1/3563 useless extension candidates. Maximal degree in co-relation 29454. Up to 2354 conditions per place. [2022-12-06 00:22:43,385 INFO L137 encePairwiseOnDemand]: 25/45 looper letters, 291 selfloop transitions, 148 changer transitions 16/455 dead transitions. [2022-12-06 00:22:43,385 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 455 transitions, 9128 flow [2022-12-06 00:22:43,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:22:43,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:22:43,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2022-12-06 00:22:43,386 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2641975308641975 [2022-12-06 00:22:43,386 INFO L175 Difference]: Start difference. First operand has 213 places, 387 transitions, 7556 flow. Second operand 9 states and 107 transitions. [2022-12-06 00:22:43,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 455 transitions, 9128 flow [2022-12-06 00:22:43,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 455 transitions, 9032 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-12-06 00:22:43,665 INFO L231 Difference]: Finished difference. Result has 220 places, 387 transitions, 7840 flow [2022-12-06 00:22:43,665 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=7462, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=147, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7840, PETRI_PLACES=220, PETRI_TRANSITIONS=387} [2022-12-06 00:22:43,666 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 191 predicate places. [2022-12-06 00:22:43,666 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:22:43,666 INFO L89 Accepts]: Start accepts. Operand has 220 places, 387 transitions, 7840 flow [2022-12-06 00:22:43,667 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:22:43,667 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:22:43,668 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 220 places, 387 transitions, 7840 flow [2022-12-06 00:22:43,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 218 places, 387 transitions, 7840 flow [2022-12-06 00:22:43,851 INFO L130 PetriNetUnfolder]: 495/1463 cut-off events. [2022-12-06 00:22:43,852 INFO L131 PetriNetUnfolder]: For 27520/27717 co-relation queries the response was YES. [2022-12-06 00:22:43,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10868 conditions, 1463 events. 495/1463 cut-off events. For 27520/27717 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 11920 event pairs, 22 based on Foata normal form. 18/1428 useless extension candidates. Maximal degree in co-relation 10768. Up to 278 conditions per place. [2022-12-06 00:22:43,869 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 218 places, 387 transitions, 7840 flow [2022-12-06 00:22:43,869 INFO L188 LiptonReduction]: Number of co-enabled transitions 1860 [2022-12-06 00:22:43,870 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:22:43,871 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 205 [2022-12-06 00:22:43,871 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 387 transitions, 7840 flow [2022-12-06 00:22:43,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 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 00:22:43,871 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:22:43,871 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:22:43,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-06 00:22:44,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:22:44,078 INFO L420 AbstractCegarLoop]: === Iteration 61 === 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 00:22:44,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:22:44,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1636657641, now seen corresponding path program 1 times [2022-12-06 00:22:44,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:22:44,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694560723] [2022-12-06 00:22:44,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:22:44,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:22:44,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:22:48,349 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 00:22:48,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:22:48,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694560723] [2022-12-06 00:22:48,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694560723] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:22:48,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:22:48,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:22:48,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657960321] [2022-12-06 00:22:48,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:22:48,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:22:48,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:22:48,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:22:48,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:22:48,350 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 00:22:48,351 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 387 transitions, 7840 flow. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:22:48,351 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:22:48,351 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 00:22:48,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:22:49,900 INFO L130 PetriNetUnfolder]: 1977/3549 cut-off events. [2022-12-06 00:22:49,900 INFO L131 PetriNetUnfolder]: For 84030/84030 co-relation queries the response was YES. [2022-12-06 00:22:49,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30194 conditions, 3549 events. 1977/3549 cut-off events. For 84030/84030 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 22240 event pairs, 463 based on Foata normal form. 1/3550 useless extension candidates. Maximal degree in co-relation 30050. Up to 2739 conditions per place. [2022-12-06 00:22:49,938 INFO L137 encePairwiseOnDemand]: 27/44 looper letters, 300 selfloop transitions, 106 changer transitions 21/427 dead transitions. [2022-12-06 00:22:49,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 427 transitions, 8988 flow [2022-12-06 00:22:49,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:22:49,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:22:49,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-12-06 00:22:49,945 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25 [2022-12-06 00:22:49,946 INFO L175 Difference]: Start difference. First operand has 218 places, 387 transitions, 7840 flow. Second operand 8 states and 88 transitions. [2022-12-06 00:22:49,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 427 transitions, 8988 flow [2022-12-06 00:22:50,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 427 transitions, 8806 flow, removed 6 selfloop flow, removed 6 redundant places. [2022-12-06 00:22:50,252 INFO L231 Difference]: Finished difference. Result has 221 places, 383 transitions, 7790 flow [2022-12-06 00:22:50,252 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=7659, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7790, PETRI_PLACES=221, PETRI_TRANSITIONS=383} [2022-12-06 00:22:50,252 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 192 predicate places. [2022-12-06 00:22:50,252 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:22:50,252 INFO L89 Accepts]: Start accepts. Operand has 221 places, 383 transitions, 7790 flow [2022-12-06 00:22:50,254 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:22:50,254 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:22:50,254 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 221 places, 383 transitions, 7790 flow [2022-12-06 00:22:50,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 218 places, 383 transitions, 7790 flow [2022-12-06 00:22:50,412 INFO L130 PetriNetUnfolder]: 492/1442 cut-off events. [2022-12-06 00:22:50,412 INFO L131 PetriNetUnfolder]: For 27933/28147 co-relation queries the response was YES. [2022-12-06 00:22:50,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10801 conditions, 1442 events. 492/1442 cut-off events. For 27933/28147 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 11686 event pairs, 22 based on Foata normal form. 18/1405 useless extension candidates. Maximal degree in co-relation 10703. Up to 275 conditions per place. [2022-12-06 00:22:50,430 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 218 places, 383 transitions, 7790 flow [2022-12-06 00:22:50,431 INFO L188 LiptonReduction]: Number of co-enabled transitions 1848 [2022-12-06 00:22:50,432 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] [2022-12-06 00:22:50,667 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:22:50,806 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [728] L67-5-->L104-3: Formula: (and (not (= (ite (and (< v_~end~0_688 v_~n~0_360) (<= 0 v_~end~0_688)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_153| 0) (= |v_thread2Thread1of1ForFork0_#res#1.base_153| 0) (= (+ |v_#pthreadsForks_417| 1) |v_#pthreadsForks_416|) (= |v_ULTIMATE.start_main_#t~pre18#1_214| |v_#pthreadsForks_417|) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_342| 4294967296) (mod v_~A~0_356 4294967296))) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_163| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_163| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_163|) (= (ite (= (mod (select (select |v_#memory_int_628| v_~queue~0.base_354) (+ (* v_~end~0_688 4) v_~queue~0.offset_354)) 4294967296) (mod |v_thread2Thread1of1ForFork0_~x~1#1_356| 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_163|) (= (store |v_#memory_int_628| |v_ULTIMATE.start_main_~#t3~0#1.base_222| (store (select |v_#memory_int_628| |v_ULTIMATE.start_main_~#t3~0#1.base_222|) |v_ULTIMATE.start_main_~#t3~0#1.offset_204| |v_ULTIMATE.start_main_#t~pre18#1_214|)) |v_#memory_int_627|) (= v_~end~0_687 (+ v_~end~0_688 1))) InVars {~queue~0.offset=v_~queue~0.offset_354, ~A~0=v_~A~0_356, #pthreadsForks=|v_#pthreadsForks_417|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_204|, #memory_int=|v_#memory_int_628|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_222|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_342|, ~end~0=v_~end~0_688, ~queue~0.base=v_~queue~0.base_354, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_356|, ~n~0=v_~n~0_360} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_214|, ~queue~0.offset=v_~queue~0.offset_354, ~A~0=v_~A~0_356, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_204|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_153|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_163|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_222|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_342|, ~queue~0.base=v_~queue~0.base_354, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_163|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_153|, #pthreadsForks=|v_#pthreadsForks_416|, #memory_int=|v_#memory_int_627|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_228|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_163|, ~end~0=v_~end~0_687, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_195|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_356|, ~n~0=v_~n~0_360, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_163|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, #pthreadsForks, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, ULTIMATE.start_main_#t~nondet17#1, thread2Thread1of1ForFork0_#t~post6#1] and [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] [2022-12-06 00:22:51,115 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:22:51,116 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 864 [2022-12-06 00:22:51,116 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 382 transitions, 7818 flow [2022-12-06 00:22:51,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:22:51,116 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:22:51,116 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:22:51,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-12-06 00:22:51,116 INFO L420 AbstractCegarLoop]: === Iteration 62 === 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 00:22:51,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:22:51,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1533538133, now seen corresponding path program 1 times [2022-12-06 00:22:51,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:22:51,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192292137] [2022-12-06 00:22:51,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:22:51,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:22:51,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:22:52,360 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 00:22:52,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:22:52,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192292137] [2022-12-06 00:22:52,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192292137] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:22:52,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:22:52,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 00:22:52,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267100668] [2022-12-06 00:22:52,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:22:52,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 00:22:52,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:22:52,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 00:22:52,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-06 00:22:52,361 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 00:22:52,361 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 382 transitions, 7818 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:22:52,361 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:22:52,361 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 00:22:52,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:22:53,503 INFO L130 PetriNetUnfolder]: 1965/3518 cut-off events. [2022-12-06 00:22:53,503 INFO L131 PetriNetUnfolder]: For 83471/83471 co-relation queries the response was YES. [2022-12-06 00:22:53,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30021 conditions, 3518 events. 1965/3518 cut-off events. For 83471/83471 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 22102 event pairs, 376 based on Foata normal form. 1/3519 useless extension candidates. Maximal degree in co-relation 29877. Up to 2261 conditions per place. [2022-12-06 00:22:53,541 INFO L137 encePairwiseOnDemand]: 24/46 looper letters, 301 selfloop transitions, 142 changer transitions 14/457 dead transitions. [2022-12-06 00:22:53,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 457 transitions, 9502 flow [2022-12-06 00:22:53,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:22:53,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:22:53,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2022-12-06 00:22:53,546 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.296195652173913 [2022-12-06 00:22:53,546 INFO L175 Difference]: Start difference. First operand has 217 places, 382 transitions, 7818 flow. Second operand 8 states and 109 transitions. [2022-12-06 00:22:53,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 457 transitions, 9502 flow [2022-12-06 00:22:53,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 457 transitions, 9249 flow, removed 21 selfloop flow, removed 7 redundant places. [2022-12-06 00:22:53,850 INFO L231 Difference]: Finished difference. Result has 220 places, 386 transitions, 7973 flow [2022-12-06 00:22:53,850 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=7567, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7973, PETRI_PLACES=220, PETRI_TRANSITIONS=386} [2022-12-06 00:22:53,850 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 191 predicate places. [2022-12-06 00:22:53,851 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:22:53,851 INFO L89 Accepts]: Start accepts. Operand has 220 places, 386 transitions, 7973 flow [2022-12-06 00:22:53,852 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:22:53,852 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:22:53,852 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 220 places, 386 transitions, 7973 flow [2022-12-06 00:22:53,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 217 places, 386 transitions, 7973 flow [2022-12-06 00:22:54,010 INFO L130 PetriNetUnfolder]: 480/1419 cut-off events. [2022-12-06 00:22:54,010 INFO L131 PetriNetUnfolder]: For 28224/28412 co-relation queries the response was YES. [2022-12-06 00:22:54,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10729 conditions, 1419 events. 480/1419 cut-off events. For 28224/28412 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 11596 event pairs, 19 based on Foata normal form. 19/1395 useless extension candidates. Maximal degree in co-relation 10609. Up to 260 conditions per place. [2022-12-06 00:22:54,027 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 217 places, 386 transitions, 7973 flow [2022-12-06 00:22:54,027 INFO L188 LiptonReduction]: Number of co-enabled transitions 1848 [2022-12-06 00:22:54,037 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:22:54,148 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [556] $Ultimate##0-->L51-5: Formula: (and (= |v_thread1Thread1of1ForFork2_~x~0#1_19| 0) (= |v_thread1Thread1of1ForFork2_~i~0#1_23| 0)) InVars {} OutVars{thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_19|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_23|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] and [729] L67-5-->thread1EXIT: Formula: (let ((.cse0 (mod v_~A~0_358 4294967296))) (and (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_261| 4294967296) .cse0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_155| 0) (= |v_thread2Thread1of1ForFork0_#res#1.base_155| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_137| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_137|) (= |v_#pthreadsForks_420| (+ |v_#pthreadsForks_421| 1)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_135| 0) (= |v_ULTIMATE.start_main_#t~pre18#1_216| |v_#pthreadsForks_421|) (= |v_thread1Thread1of1ForFork2_#res#1.base_135| 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_165| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_165|) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_344| 4294967296) .cse0)) (not (= (ite (and (<= 1 v_~end~0_691) (< v_~end~0_691 (+ v_~n~0_362 1))) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_165| 0)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_137| (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_266| 4294967296) (mod (select (select |v_#memory_int_631| v_~queue~0.base_356) (+ (- 4) v_~queue~0.offset_356 (* v_~end~0_691 4))) 4294967296)) 1 0)) (= v_~end~0_691 (+ v_~end~0_693 2)) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_358| 4294967296) (mod (select (select |v_#memory_int_632| v_~queue~0.base_356) (+ (* v_~end~0_693 4) v_~queue~0.offset_356)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_165|) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_137| 0)) (= |v_#memory_int_631| (store |v_#memory_int_632| |v_ULTIMATE.start_main_~#t3~0#1.base_224| (store (select |v_#memory_int_632| |v_ULTIMATE.start_main_~#t3~0#1.base_224|) |v_ULTIMATE.start_main_~#t3~0#1.offset_206| |v_ULTIMATE.start_main_#t~pre18#1_216|))) (not (= (ite (and (< v_~end~0_693 v_~n~0_362) (<= 0 v_~end~0_693)) 1 0) 0)))) InVars {~queue~0.offset=v_~queue~0.offset_356, ~A~0=v_~A~0_358, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_266|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_206|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_224|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_344|, ~queue~0.base=v_~queue~0.base_356, #pthreadsForks=|v_#pthreadsForks_421|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_261|, #memory_int=|v_#memory_int_632|, ~end~0=v_~end~0_693, ~n~0=v_~n~0_362, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_358|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_216|, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_266|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_206|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_155|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_137|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_165|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_224|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_344|, #pthreadsForks=|v_#pthreadsForks_420|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_135|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_230|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_165|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_197|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_135|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_137|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_165|, ~queue~0.offset=v_~queue~0.offset_356, ~A~0=v_~A~0_358, ~queue~0.base=v_~queue~0.base_356, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_165|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_155|, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_137|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_261|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_137|, #memory_int=|v_#memory_int_631|, ~end~0=v_~end~0_691, ~n~0=v_~n~0_362, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_358|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread2Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, #pthreadsForks, thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, #memory_int, thread1Thread1of1ForFork2_#res#1.offset, ULTIMATE.start_main_#t~pre16#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, ULTIMATE.start_main_#t~nondet17#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post6#1] [2022-12-06 00:22:54,422 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:22:54,423 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 572 [2022-12-06 00:22:54,424 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 385 transitions, 7973 flow [2022-12-06 00:22:54,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:22:54,424 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:22:54,424 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:22:54,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-12-06 00:22:54,424 INFO L420 AbstractCegarLoop]: === Iteration 63 === 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 00:22:54,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:22:54,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1135747298, now seen corresponding path program 1 times [2022-12-06 00:22:54,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:22:54,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215429487] [2022-12-06 00:22:54,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:22:54,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:22:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:22:58,512 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 00:22:58,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:22:58,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215429487] [2022-12-06 00:22:58,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215429487] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:22:58,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:22:58,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:22:58,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70401703] [2022-12-06 00:22:58,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:22:58,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:22:58,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:22:58,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:22:58,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:22:58,513 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 00:22:58,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 385 transitions, 7973 flow. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:22:58,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:22:58,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 00:22:58,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:22:59,735 INFO L130 PetriNetUnfolder]: 1957/3499 cut-off events. [2022-12-06 00:22:59,735 INFO L131 PetriNetUnfolder]: For 87666/87666 co-relation queries the response was YES. [2022-12-06 00:22:59,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30153 conditions, 3499 events. 1957/3499 cut-off events. For 87666/87666 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 21698 event pairs, 466 based on Foata normal form. 1/3500 useless extension candidates. Maximal degree in co-relation 30010. Up to 2732 conditions per place. [2022-12-06 00:22:59,765 INFO L137 encePairwiseOnDemand]: 29/46 looper letters, 301 selfloop transitions, 104 changer transitions 14/419 dead transitions. [2022-12-06 00:22:59,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 419 transitions, 9061 flow [2022-12-06 00:22:59,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:22:59,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:22:59,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2022-12-06 00:22:59,767 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29347826086956524 [2022-12-06 00:22:59,767 INFO L175 Difference]: Start difference. First operand has 216 places, 385 transitions, 7973 flow. Second operand 6 states and 81 transitions. [2022-12-06 00:22:59,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 419 transitions, 9061 flow [2022-12-06 00:23:00,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 419 transitions, 8885 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-06 00:23:00,019 INFO L231 Difference]: Finished difference. Result has 218 places, 384 transitions, 7977 flow [2022-12-06 00:23:00,020 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=7797, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7977, PETRI_PLACES=218, PETRI_TRANSITIONS=384} [2022-12-06 00:23:00,020 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 189 predicate places. [2022-12-06 00:23:00,020 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:23:00,020 INFO L89 Accepts]: Start accepts. Operand has 218 places, 384 transitions, 7977 flow [2022-12-06 00:23:00,021 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:23:00,021 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:23:00,022 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 218 places, 384 transitions, 7977 flow [2022-12-06 00:23:00,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 216 places, 384 transitions, 7977 flow [2022-12-06 00:23:00,180 INFO L130 PetriNetUnfolder]: 486/1431 cut-off events. [2022-12-06 00:23:00,180 INFO L131 PetriNetUnfolder]: For 29715/29916 co-relation queries the response was YES. [2022-12-06 00:23:00,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10864 conditions, 1431 events. 486/1431 cut-off events. For 29715/29916 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 11569 event pairs, 20 based on Foata normal form. 18/1396 useless extension candidates. Maximal degree in co-relation 10780. Up to 267 conditions per place. [2022-12-06 00:23:00,199 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 216 places, 384 transitions, 7977 flow [2022-12-06 00:23:00,199 INFO L188 LiptonReduction]: Number of co-enabled transitions 1844 [2022-12-06 00:23:00,200 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:23:00,201 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 00:23:00,201 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 384 transitions, 7977 flow [2022-12-06 00:23:00,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:23:00,201 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:23:00,201 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:23:00,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-12-06 00:23:00,201 INFO L420 AbstractCegarLoop]: === Iteration 64 === 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 00:23:00,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:23:00,201 INFO L85 PathProgramCache]: Analyzing trace with hash -245444503, now seen corresponding path program 1 times [2022-12-06 00:23:00,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:23:00,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448247542] [2022-12-06 00:23:00,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:23:00,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:23:00,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:23:01,763 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 00:23:01,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:23:01,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448247542] [2022-12-06 00:23:01,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448247542] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:23:01,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:23:01,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:23:01,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447422648] [2022-12-06 00:23:01,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:23:01,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:23:01,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:23:01,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:23:01,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:23:01,765 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 00:23:01,766 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 384 transitions, 7977 flow. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:23:01,766 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:23:01,766 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 00:23:01,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:23:02,885 INFO L130 PetriNetUnfolder]: 1951/3486 cut-off events. [2022-12-06 00:23:02,885 INFO L131 PetriNetUnfolder]: For 89588/89588 co-relation queries the response was YES. [2022-12-06 00:23:02,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30185 conditions, 3486 events. 1951/3486 cut-off events. For 89588/89588 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 21540 event pairs, 469 based on Foata normal form. 1/3487 useless extension candidates. Maximal degree in co-relation 30048. Up to 2716 conditions per place. [2022-12-06 00:23:02,912 INFO L137 encePairwiseOnDemand]: 26/45 looper letters, 302 selfloop transitions, 107 changer transitions 13/422 dead transitions. [2022-12-06 00:23:02,912 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 422 transitions, 9104 flow [2022-12-06 00:23:02,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:23:02,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:23:02,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 85 transitions. [2022-12-06 00:23:02,913 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2698412698412698 [2022-12-06 00:23:02,913 INFO L175 Difference]: Start difference. First operand has 216 places, 384 transitions, 7977 flow. Second operand 7 states and 85 transitions. [2022-12-06 00:23:02,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 422 transitions, 9104 flow [2022-12-06 00:23:03,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 422 transitions, 8892 flow, removed 2 selfloop flow, removed 5 redundant places. [2022-12-06 00:23:03,178 INFO L231 Difference]: Finished difference. Result has 219 places, 385 transitions, 7996 flow [2022-12-06 00:23:03,178 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=7765, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7996, PETRI_PLACES=219, PETRI_TRANSITIONS=385} [2022-12-06 00:23:03,189 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 190 predicate places. [2022-12-06 00:23:03,189 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:23:03,189 INFO L89 Accepts]: Start accepts. Operand has 219 places, 385 transitions, 7996 flow [2022-12-06 00:23:03,191 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:23:03,191 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:23:03,191 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 219 places, 385 transitions, 7996 flow [2022-12-06 00:23:03,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 218 places, 385 transitions, 7996 flow [2022-12-06 00:23:03,347 INFO L130 PetriNetUnfolder]: 486/1424 cut-off events. [2022-12-06 00:23:03,347 INFO L131 PetriNetUnfolder]: For 29790/29992 co-relation queries the response was YES. [2022-12-06 00:23:03,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10862 conditions, 1424 events. 486/1424 cut-off events. For 29790/29992 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 11431 event pairs, 20 based on Foata normal form. 17/1387 useless extension candidates. Maximal degree in co-relation 10742. Up to 266 conditions per place. [2022-12-06 00:23:03,363 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 218 places, 385 transitions, 7996 flow [2022-12-06 00:23:03,364 INFO L188 LiptonReduction]: Number of co-enabled transitions 1844 [2022-12-06 00:23:03,388 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [727] L67-5-->thread1EXIT: Formula: (let ((.cse0 (select |v_#memory_int_625| v_~queue~0.base_352)) (.cse1 (mod v_~A~0_354 4294967296))) (and (not (= (ite (and (< v_~end~0_681 (+ v_~n~0_358 1)) (<= 1 v_~end~0_681)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_135| 0)) (= (ite (= (mod (select .cse0 (+ (* v_~end~0_683 4) v_~queue~0.offset_352)) 4294967296) (mod |v_thread2Thread1of1ForFork0_~x~1#1_354| 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_161|) (= v_~end~0_681 (+ v_~end~0_683 2)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_135| (ite (= (mod (select .cse0 (+ (- 4) (* v_~end~0_681 4) v_~queue~0.offset_352)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_264| 4294967296)) 1 0)) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_340| 4294967296) .cse1)) (= |v_thread2Thread1of1ForFork0_#res#1.base_151| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_151| 0) (not (= (ite (and (< v_~end~0_683 v_~n~0_358) (<= 0 v_~end~0_683)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_161| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.base_133| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_135| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_135|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_161| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_161|) (= |v_thread1Thread1of1ForFork2_#res#1.offset_133| 0) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_259| 4294967296) .cse1)))) InVars {~queue~0.offset=v_~queue~0.offset_352, ~A~0=v_~A~0_354, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_264|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_259|, #memory_int=|v_#memory_int_625|, ~end~0=v_~end~0_683, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_340|, ~queue~0.base=v_~queue~0.base_352, ~n~0=v_~n~0_358, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_354|} OutVars{~queue~0.offset=v_~queue~0.offset_352, ~A~0=v_~A~0_354, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_264|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_151|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_135|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_161|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_340|, ~queue~0.base=v_~queue~0.base_352, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_161|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_151|, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_135|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_259|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_135|, #memory_int=|v_#memory_int_625|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_133|, ~end~0=v_~end~0_681, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_161|, ~n~0=v_~n~0_358, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_354|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_133|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_135|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_161|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread2Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:23:03,609 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:23:03,609 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 420 [2022-12-06 00:23:03,609 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 384 transitions, 7990 flow [2022-12-06 00:23:03,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:23:03,610 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:23:03,610 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:23:03,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-12-06 00:23:03,610 INFO L420 AbstractCegarLoop]: === Iteration 65 === 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 00:23:03,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:23:03,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1672887372, now seen corresponding path program 1 times [2022-12-06 00:23:03,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:23:03,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329299300] [2022-12-06 00:23:03,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:23:03,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:23:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:23:05,045 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 00:23:05,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:23:05,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329299300] [2022-12-06 00:23:05,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329299300] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:23:05,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:23:05,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:23:05,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208481708] [2022-12-06 00:23:05,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:23:05,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:23:05,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:23:05,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:23:05,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:23:05,046 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 00:23:05,046 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 384 transitions, 7990 flow. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:23:05,046 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:23:05,046 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 00:23:05,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:23:06,197 INFO L130 PetriNetUnfolder]: 1975/3534 cut-off events. [2022-12-06 00:23:06,197 INFO L131 PetriNetUnfolder]: For 89599/89599 co-relation queries the response was YES. [2022-12-06 00:23:06,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30515 conditions, 3534 events. 1975/3534 cut-off events. For 89599/89599 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 22025 event pairs, 386 based on Foata normal form. 1/3535 useless extension candidates. Maximal degree in co-relation 30372. Up to 1978 conditions per place. [2022-12-06 00:23:06,230 INFO L137 encePairwiseOnDemand]: 25/45 looper letters, 300 selfloop transitions, 139 changer transitions 16/455 dead transitions. [2022-12-06 00:23:06,230 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 455 transitions, 9636 flow [2022-12-06 00:23:06,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:23:06,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:23:06,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2022-12-06 00:23:06,231 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2972222222222222 [2022-12-06 00:23:06,231 INFO L175 Difference]: Start difference. First operand has 217 places, 384 transitions, 7990 flow. Second operand 8 states and 107 transitions. [2022-12-06 00:23:06,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 455 transitions, 9636 flow [2022-12-06 00:23:06,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 455 transitions, 9414 flow, removed 5 selfloop flow, removed 6 redundant places. [2022-12-06 00:23:06,503 INFO L231 Difference]: Finished difference. Result has 221 places, 385 transitions, 8142 flow [2022-12-06 00:23:06,503 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=7768, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8142, PETRI_PLACES=221, PETRI_TRANSITIONS=385} [2022-12-06 00:23:06,503 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 192 predicate places. [2022-12-06 00:23:06,503 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:23:06,504 INFO L89 Accepts]: Start accepts. Operand has 221 places, 385 transitions, 8142 flow [2022-12-06 00:23:06,505 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:23:06,505 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:23:06,505 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 221 places, 385 transitions, 8142 flow [2022-12-06 00:23:06,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 219 places, 385 transitions, 8142 flow [2022-12-06 00:23:06,662 INFO L130 PetriNetUnfolder]: 482/1422 cut-off events. [2022-12-06 00:23:06,662 INFO L131 PetriNetUnfolder]: For 31037/31242 co-relation queries the response was YES. [2022-12-06 00:23:06,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10927 conditions, 1422 events. 482/1422 cut-off events. For 31037/31242 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 11521 event pairs, 20 based on Foata normal form. 19/1389 useless extension candidates. Maximal degree in co-relation 10821. Up to 264 conditions per place. [2022-12-06 00:23:06,679 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 219 places, 385 transitions, 8142 flow [2022-12-06 00:23:06,679 INFO L188 LiptonReduction]: Number of co-enabled transitions 1852 [2022-12-06 00:23:06,681 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [556] $Ultimate##0-->L51-5: Formula: (and (= |v_thread1Thread1of1ForFork2_~x~0#1_19| 0) (= |v_thread1Thread1of1ForFork2_~i~0#1_23| 0)) InVars {} OutVars{thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_19|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_23|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] and [732] L67-5-->L104-3: Formula: (let ((.cse1 (mod v_~A~0_364 4294967296)) (.cse0 (select |v_#memory_int_644| v_~queue~0.base_362))) (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_169| (ite (= (mod (select .cse0 (+ (* v_~end~0_706 4) v_~queue~0.offset_362)) 4294967296) (mod |v_thread2Thread1of1ForFork0_~x~1#1_362| 4294967296)) 1 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_141| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_169| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_169| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_169|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_143| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_143|) (= (+ |v_#pthreadsForks_433| 1) |v_#pthreadsForks_432|) (= |v_ULTIMATE.start_main_#t~pre18#1_222| |v_#pthreadsForks_433|) (= (+ v_~end~0_706 2) v_~end~0_705) (not (= (ite (and (< v_~end~0_706 v_~n~0_368) (<= 0 v_~end~0_706)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_159| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_159| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_143| 0)) (= (store |v_#memory_int_644| |v_ULTIMATE.start_main_~#t3~0#1.base_230| (store (select |v_#memory_int_644| |v_ULTIMATE.start_main_~#t3~0#1.base_230|) |v_ULTIMATE.start_main_~#t3~0#1.offset_212| |v_ULTIMATE.start_main_#t~pre18#1_222|)) |v_#memory_int_643|) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_348| 4294967296) .cse1)) (not (= (ite (and (< v_~end~0_705 (+ v_~n~0_368 1)) (<= 1 v_~end~0_705)) 1 0) 0)) (= |v_thread1Thread1of1ForFork2_#res#1.base_141| 0) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_267| 4294967296) .cse1)) (= (ite (= (mod (select .cse0 (+ (- 4) v_~queue~0.offset_362 (* v_~end~0_705 4))) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_272| 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_143|))) InVars {~queue~0.offset=v_~queue~0.offset_362, ~A~0=v_~A~0_364, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_272|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_212|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_230|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_348|, ~queue~0.base=v_~queue~0.base_362, #pthreadsForks=|v_#pthreadsForks_433|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_267|, #memory_int=|v_#memory_int_644|, ~end~0=v_~end~0_706, ~n~0=v_~n~0_368, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_362|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_222|, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_272|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_212|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_159|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_143|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_169|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_230|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_348|, #pthreadsForks=|v_#pthreadsForks_432|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_236|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_141|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_169|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_203|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_141|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_143|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_169|, ~queue~0.offset=v_~queue~0.offset_362, ~A~0=v_~A~0_364, ~queue~0.base=v_~queue~0.base_362, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_169|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_159|, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_143|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_267|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_143|, #memory_int=|v_#memory_int_643|, ~end~0=v_~end~0_705, ~n~0=v_~n~0_368, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_362|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread2Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, #pthreadsForks, thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, thread1Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, ULTIMATE.start_main_#t~nondet17#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post6#1] [2022-12-06 00:23:06,956 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:23:06,956 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 453 [2022-12-06 00:23:06,957 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 385 transitions, 8150 flow [2022-12-06 00:23:06,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:23:06,957 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:23:06,957 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:23:06,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-12-06 00:23:06,957 INFO L420 AbstractCegarLoop]: === Iteration 66 === 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 00:23:06,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:23:06,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1115365228, now seen corresponding path program 1 times [2022-12-06 00:23:06,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:23:06,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704598262] [2022-12-06 00:23:06,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:23:06,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:23:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:23:07,511 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 00:23:07,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:23:07,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704598262] [2022-12-06 00:23:07,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704598262] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:23:07,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:23:07,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:23:07,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386341009] [2022-12-06 00:23:07,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:23:07,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:23:07,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:23:07,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:23:07,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:23:07,512 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 00:23:07,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 385 transitions, 8150 flow. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:23:07,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:23:07,512 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 00:23:07,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:23:08,312 INFO L130 PetriNetUnfolder]: 1961/3506 cut-off events. [2022-12-06 00:23:08,312 INFO L131 PetriNetUnfolder]: For 94687/94687 co-relation queries the response was YES. [2022-12-06 00:23:08,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30707 conditions, 3506 events. 1961/3506 cut-off events. For 94687/94687 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 21902 event pairs, 470 based on Foata normal form. 1/3507 useless extension candidates. Maximal degree in co-relation 30563. Up to 2739 conditions per place. [2022-12-06 00:23:08,345 INFO L137 encePairwiseOnDemand]: 28/44 looper letters, 302 selfloop transitions, 103 changer transitions 14/419 dead transitions. [2022-12-06 00:23:08,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 419 transitions, 9244 flow [2022-12-06 00:23:08,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:23:08,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:23:08,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2022-12-06 00:23:08,346 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29924242424242425 [2022-12-06 00:23:08,346 INFO L175 Difference]: Start difference. First operand has 219 places, 385 transitions, 8150 flow. Second operand 6 states and 79 transitions. [2022-12-06 00:23:08,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 419 transitions, 9244 flow [2022-12-06 00:23:08,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 419 transitions, 9029 flow, removed 6 selfloop flow, removed 6 redundant places. [2022-12-06 00:23:08,675 INFO L231 Difference]: Finished difference. Result has 220 places, 384 transitions, 8113 flow [2022-12-06 00:23:08,675 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=7937, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8113, PETRI_PLACES=220, PETRI_TRANSITIONS=384} [2022-12-06 00:23:08,675 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 191 predicate places. [2022-12-06 00:23:08,676 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:23:08,676 INFO L89 Accepts]: Start accepts. Operand has 220 places, 384 transitions, 8113 flow [2022-12-06 00:23:08,677 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:23:08,677 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:23:08,677 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 220 places, 384 transitions, 8113 flow [2022-12-06 00:23:08,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 218 places, 384 transitions, 8113 flow [2022-12-06 00:23:08,851 INFO L130 PetriNetUnfolder]: 475/1403 cut-off events. [2022-12-06 00:23:08,851 INFO L131 PetriNetUnfolder]: For 30618/30798 co-relation queries the response was YES. [2022-12-06 00:23:08,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10853 conditions, 1403 events. 475/1403 cut-off events. For 30618/30798 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 11431 event pairs, 19 based on Foata normal form. 19/1377 useless extension candidates. Maximal degree in co-relation 10764. Up to 256 conditions per place. [2022-12-06 00:23:08,870 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 218 places, 384 transitions, 8113 flow [2022-12-06 00:23:08,871 INFO L188 LiptonReduction]: Number of co-enabled transitions 1852 [2022-12-06 00:23:08,872 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:23:08,872 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 196 [2022-12-06 00:23:08,872 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 384 transitions, 8113 flow [2022-12-06 00:23:08,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:23:08,872 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:23:08,872 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:23:08,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-12-06 00:23:08,873 INFO L420 AbstractCegarLoop]: === Iteration 67 === 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 00:23:08,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:23:08,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1332687482, now seen corresponding path program 1 times [2022-12-06 00:23:08,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:23:08,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807414737] [2022-12-06 00:23:08,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:23:08,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:23:08,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:23:08,944 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 00:23:08,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:23:08,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807414737] [2022-12-06 00:23:08,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807414737] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:23:08,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:23:08,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:23:08,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902465791] [2022-12-06 00:23:08,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:23:08,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:23:08,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:23:08,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:23:08,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:23:08,946 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 00:23:08,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 384 transitions, 8113 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:23:08,946 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:23:08,946 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 00:23:08,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:23:09,932 INFO L130 PetriNetUnfolder]: 2555/4827 cut-off events. [2022-12-06 00:23:09,932 INFO L131 PetriNetUnfolder]: For 112176/112176 co-relation queries the response was YES. [2022-12-06 00:23:09,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39468 conditions, 4827 events. 2555/4827 cut-off events. For 112176/112176 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 33788 event pairs, 534 based on Foata normal form. 21/4848 useless extension candidates. Maximal degree in co-relation 39261. Up to 2266 conditions per place. [2022-12-06 00:23:09,983 INFO L137 encePairwiseOnDemand]: 33/43 looper letters, 535 selfloop transitions, 53 changer transitions 6/594 dead transitions. [2022-12-06 00:23:09,983 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 594 transitions, 12330 flow [2022-12-06 00:23:09,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:23:09,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:23:09,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2022-12-06 00:23:09,984 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4186046511627907 [2022-12-06 00:23:09,984 INFO L175 Difference]: Start difference. First operand has 218 places, 384 transitions, 8113 flow. Second operand 6 states and 108 transitions. [2022-12-06 00:23:09,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 594 transitions, 12330 flow [2022-12-06 00:23:10,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 594 transitions, 12106 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-06 00:23:10,422 INFO L231 Difference]: Finished difference. Result has 219 places, 374 transitions, 7778 flow [2022-12-06 00:23:10,422 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=7802, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7778, PETRI_PLACES=219, PETRI_TRANSITIONS=374} [2022-12-06 00:23:10,423 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 190 predicate places. [2022-12-06 00:23:10,423 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:23:10,423 INFO L89 Accepts]: Start accepts. Operand has 219 places, 374 transitions, 7778 flow [2022-12-06 00:23:10,424 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:23:10,425 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:23:10,425 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 219 places, 374 transitions, 7778 flow [2022-12-06 00:23:10,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 219 places, 374 transitions, 7778 flow [2022-12-06 00:23:10,665 INFO L130 PetriNetUnfolder]: 548/1928 cut-off events. [2022-12-06 00:23:10,666 INFO L131 PetriNetUnfolder]: For 34094/34314 co-relation queries the response was YES. [2022-12-06 00:23:10,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13234 conditions, 1928 events. 548/1928 cut-off events. For 34094/34314 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 18178 event pairs, 24 based on Foata normal form. 19/1890 useless extension candidates. Maximal degree in co-relation 12899. Up to 331 conditions per place. [2022-12-06 00:23:10,687 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 219 places, 374 transitions, 7778 flow [2022-12-06 00:23:10,687 INFO L188 LiptonReduction]: Number of co-enabled transitions 1854 [2022-12-06 00:23:10,688 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:23:10,688 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 265 [2022-12-06 00:23:10,688 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 374 transitions, 7778 flow [2022-12-06 00:23:10,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:23:10,688 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:23:10,688 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:23:10,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-12-06 00:23:10,688 INFO L420 AbstractCegarLoop]: === Iteration 68 === 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 00:23:10,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:23:10,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1273808541, now seen corresponding path program 2 times [2022-12-06 00:23:10,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:23:10,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312429516] [2022-12-06 00:23:10,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:23:10,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:23:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:23:11,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:23:11,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:23:11,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312429516] [2022-12-06 00:23:11,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312429516] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:23:11,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582199664] [2022-12-06 00:23:11,602 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 00:23:11,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:23:11,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:23:11,605 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:23:11,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 00:23:11,815 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 00:23:11,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 00:23:11,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-06 00:23:11,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:23:11,937 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:23:11,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 56 [2022-12-06 00:23:12,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:23:12,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:23:12,121 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:23:12,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 134 treesize of output 101 [2022-12-06 00:23:12,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:23:12,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582199664] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:23:12,367 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:23:12,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 19 [2022-12-06 00:23:12,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303667965] [2022-12-06 00:23:12,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:23:12,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 00:23:12,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:23:12,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 00:23:12,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2022-12-06 00:23:12,368 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 00:23:12,368 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 374 transitions, 7778 flow. Second operand has 21 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:23:12,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:23:12,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 00:23:12,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:23:14,325 INFO L130 PetriNetUnfolder]: 2611/4947 cut-off events. [2022-12-06 00:23:14,326 INFO L131 PetriNetUnfolder]: For 117828/117828 co-relation queries the response was YES. [2022-12-06 00:23:14,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40639 conditions, 4947 events. 2611/4947 cut-off events. For 117828/117828 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 34867 event pairs, 593 based on Foata normal form. 4/4951 useless extension candidates. Maximal degree in co-relation 39660. Up to 3422 conditions per place. [2022-12-06 00:23:14,381 INFO L137 encePairwiseOnDemand]: 20/43 looper letters, 266 selfloop transitions, 182 changer transitions 16/464 dead transitions. [2022-12-06 00:23:14,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 464 transitions, 9659 flow [2022-12-06 00:23:14,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 00:23:14,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 00:23:14,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 137 transitions. [2022-12-06 00:23:14,382 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24508050089445438 [2022-12-06 00:23:14,382 INFO L175 Difference]: Start difference. First operand has 219 places, 374 transitions, 7778 flow. Second operand 13 states and 137 transitions. [2022-12-06 00:23:14,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 464 transitions, 9659 flow [2022-12-06 00:23:14,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 464 transitions, 9413 flow, removed 86 selfloop flow, removed 2 redundant places. [2022-12-06 00:23:14,899 INFO L231 Difference]: Finished difference. Result has 232 places, 392 transitions, 8400 flow [2022-12-06 00:23:14,899 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=7564, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=164, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=8400, PETRI_PLACES=232, PETRI_TRANSITIONS=392} [2022-12-06 00:23:14,899 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 203 predicate places. [2022-12-06 00:23:14,899 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:23:14,899 INFO L89 Accepts]: Start accepts. Operand has 232 places, 392 transitions, 8400 flow [2022-12-06 00:23:14,901 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:23:14,901 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:23:14,901 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 232 places, 392 transitions, 8400 flow [2022-12-06 00:23:14,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 231 places, 392 transitions, 8400 flow [2022-12-06 00:23:15,172 INFO L130 PetriNetUnfolder]: 564/1970 cut-off events. [2022-12-06 00:23:15,172 INFO L131 PetriNetUnfolder]: For 36235/36447 co-relation queries the response was YES. [2022-12-06 00:23:15,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13893 conditions, 1970 events. 564/1970 cut-off events. For 36235/36447 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 18575 event pairs, 23 based on Foata normal form. 21/1932 useless extension candidates. Maximal degree in co-relation 13728. Up to 325 conditions per place. [2022-12-06 00:23:15,196 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 231 places, 392 transitions, 8400 flow [2022-12-06 00:23:15,196 INFO L188 LiptonReduction]: Number of co-enabled transitions 1890 [2022-12-06 00:23:15,197 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:23:15,198 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 299 [2022-12-06 00:23:15,198 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 392 transitions, 8400 flow [2022-12-06 00:23:15,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:23:15,198 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:23:15,198 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:23:15,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 00:23:15,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2022-12-06 00:23:15,403 INFO L420 AbstractCegarLoop]: === Iteration 69 === 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 00:23:15,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:23:15,403 INFO L85 PathProgramCache]: Analyzing trace with hash 505928229, now seen corresponding path program 3 times [2022-12-06 00:23:15,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:23:15,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672761586] [2022-12-06 00:23:15,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:23:15,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:23:15,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:23:20,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:23:20,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:23:20,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672761586] [2022-12-06 00:23:20,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672761586] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:23:20,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638658815] [2022-12-06 00:23:20,245 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 00:23:20,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:23:20,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:23:20,246 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:23:20,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 00:23:20,454 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 00:23:20,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 00:23:20,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-06 00:23:20,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:23:20,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:23:20,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:23:20,909 INFO L321 Elim1Store]: treesize reduction 23, result has 14.8 percent of original size [2022-12-06 00:23:20,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 30 [2022-12-06 00:23:21,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:23:21,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638658815] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:23:21,117 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:23:21,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 22 [2022-12-06 00:23:21,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012743533] [2022-12-06 00:23:21,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:23:21,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 00:23:21,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:23:21,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 00:23:21,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2022-12-06 00:23:21,118 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 00:23:21,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 392 transitions, 8400 flow. Second operand has 23 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 23 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:23:21,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:23:21,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 00:23:21,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:23:24,879 INFO L130 PetriNetUnfolder]: 3042/5736 cut-off events. [2022-12-06 00:23:24,879 INFO L131 PetriNetUnfolder]: For 138313/138313 co-relation queries the response was YES. [2022-12-06 00:23:24,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47483 conditions, 5736 events. 3042/5736 cut-off events. For 138313/138313 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 41679 event pairs, 234 based on Foata normal form. 2/5738 useless extension candidates. Maximal degree in co-relation 47274. Up to 1188 conditions per place. [2022-12-06 00:23:24,928 INFO L137 encePairwiseOnDemand]: 17/43 looper letters, 204 selfloop transitions, 357 changer transitions 14/575 dead transitions. [2022-12-06 00:23:24,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 575 transitions, 11693 flow [2022-12-06 00:23:24,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 00:23:24,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 00:23:24,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 187 transitions. [2022-12-06 00:23:24,931 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21744186046511627 [2022-12-06 00:23:24,931 INFO L175 Difference]: Start difference. First operand has 231 places, 392 transitions, 8400 flow. Second operand 20 states and 187 transitions. [2022-12-06 00:23:24,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 575 transitions, 11693 flow [2022-12-06 00:23:25,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 575 transitions, 11365 flow, removed 45 selfloop flow, removed 8 redundant places. [2022-12-06 00:23:25,449 INFO L231 Difference]: Finished difference. Result has 250 places, 468 transitions, 10653 flow [2022-12-06 00:23:25,449 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=8080, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=285, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=10653, PETRI_PLACES=250, PETRI_TRANSITIONS=468} [2022-12-06 00:23:25,450 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 221 predicate places. [2022-12-06 00:23:25,450 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:23:25,450 INFO L89 Accepts]: Start accepts. Operand has 250 places, 468 transitions, 10653 flow [2022-12-06 00:23:25,452 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:23:25,452 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:23:25,452 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 250 places, 468 transitions, 10653 flow [2022-12-06 00:23:25,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 249 places, 468 transitions, 10653 flow [2022-12-06 00:23:25,739 INFO L130 PetriNetUnfolder]: 664/2369 cut-off events. [2022-12-06 00:23:25,740 INFO L131 PetriNetUnfolder]: For 48913/49107 co-relation queries the response was YES. [2022-12-06 00:23:25,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17418 conditions, 2369 events. 664/2369 cut-off events. For 48913/49107 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 23319 event pairs, 20 based on Foata normal form. 21/2339 useless extension candidates. Maximal degree in co-relation 17247. Up to 366 conditions per place. [2022-12-06 00:23:25,773 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 249 places, 468 transitions, 10653 flow [2022-12-06 00:23:25,773 INFO L188 LiptonReduction]: Number of co-enabled transitions 2194 [2022-12-06 00:23:25,774 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:23:25,775 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 325 [2022-12-06 00:23:25,775 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 468 transitions, 10653 flow [2022-12-06 00:23:25,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 23 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:23:25,775 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:23:25,775 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:23:25,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 00:23:25,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2022-12-06 00:23:25,980 INFO L420 AbstractCegarLoop]: === Iteration 70 === 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 00:23:25,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:23:25,981 INFO L85 PathProgramCache]: Analyzing trace with hash 307714863, now seen corresponding path program 4 times [2022-12-06 00:23:25,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:23:25,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750329052] [2022-12-06 00:23:25,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:23:25,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:23:26,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:23:27,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:23:27,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:23:27,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750329052] [2022-12-06 00:23:27,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750329052] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:23:27,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696499539] [2022-12-06 00:23:27,450 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 00:23:27,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:23:27,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:23:27,451 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:23:27,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 00:23:27,616 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 00:23:27,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 00:23:27,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-06 00:23:27,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:23:27,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:23:27,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2022-12-06 00:23:27,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:23:27,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:23:28,002 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2247 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2247) c_~queue~0.base))) (or (not (= (mod (+ |c_thread2Thread1of1ForFork0_~x~1#1| c_~B~0) 4294967296) (mod (select .cse0 (+ (* c_~end~0 4) c_~queue~0.offset)) 4294967296))) (let ((.cse1 (* c_~start~0 4))) (= (mod (select .cse0 (+ .cse1 c_~queue~0.offset)) 4294967296) (mod (select .cse0 (+ .cse1 c_~queue~0.offset 4)) 4294967296)))))) is different from false [2022-12-06 00:23:28,053 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:23:28,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 116 treesize of output 134 [2022-12-06 00:23:28,070 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:23:28,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 68 [2022-12-06 00:23:28,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:23:28,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696499539] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:23:28,575 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:23:28,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-12-06 00:23:28,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783840735] [2022-12-06 00:23:28,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:23:28,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 00:23:28,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:23:28,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 00:23:28,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=482, Unknown=1, NotChecked=44, Total=600 [2022-12-06 00:23:28,577 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 00:23:28,577 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 468 transitions, 10653 flow. Second operand has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:23:28,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:23:28,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 00:23:28,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:23:31,197 INFO L130 PetriNetUnfolder]: 3040/5748 cut-off events. [2022-12-06 00:23:31,197 INFO L131 PetriNetUnfolder]: For 168727/168727 co-relation queries the response was YES. [2022-12-06 00:23:31,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51508 conditions, 5748 events. 3040/5748 cut-off events. For 168727/168727 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 41652 event pairs, 730 based on Foata normal form. 2/5750 useless extension candidates. Maximal degree in co-relation 51293. Up to 4535 conditions per place. [2022-12-06 00:23:31,250 INFO L137 encePairwiseOnDemand]: 19/43 looper letters, 386 selfloop transitions, 142 changer transitions 16/544 dead transitions. [2022-12-06 00:23:31,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 544 transitions, 12470 flow [2022-12-06 00:23:31,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 00:23:31,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 00:23:31,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 128 transitions. [2022-12-06 00:23:31,251 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24806201550387597 [2022-12-06 00:23:31,251 INFO L175 Difference]: Start difference. First operand has 249 places, 468 transitions, 10653 flow. Second operand 12 states and 128 transitions. [2022-12-06 00:23:31,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 544 transitions, 12470 flow [2022-12-06 00:23:32,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 544 transitions, 11555 flow, removed 206 selfloop flow, removed 16 redundant places. [2022-12-06 00:23:32,028 INFO L231 Difference]: Finished difference. Result has 248 places, 471 transitions, 10193 flow [2022-12-06 00:23:32,028 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=9767, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=10193, PETRI_PLACES=248, PETRI_TRANSITIONS=471} [2022-12-06 00:23:32,028 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 219 predicate places. [2022-12-06 00:23:32,028 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:23:32,028 INFO L89 Accepts]: Start accepts. Operand has 248 places, 471 transitions, 10193 flow [2022-12-06 00:23:32,031 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:23:32,031 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:23:32,031 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 248 places, 471 transitions, 10193 flow [2022-12-06 00:23:32,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 247 places, 471 transitions, 10193 flow [2022-12-06 00:23:32,308 INFO L130 PetriNetUnfolder]: 662/2355 cut-off events. [2022-12-06 00:23:32,308 INFO L131 PetriNetUnfolder]: For 43540/43756 co-relation queries the response was YES. [2022-12-06 00:23:32,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16291 conditions, 2355 events. 662/2355 cut-off events. For 43540/43756 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 23102 event pairs, 20 based on Foata normal form. 27/2326 useless extension candidates. Maximal degree in co-relation 16126. Up to 362 conditions per place. [2022-12-06 00:23:32,340 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 247 places, 471 transitions, 10193 flow [2022-12-06 00:23:32,340 INFO L188 LiptonReduction]: Number of co-enabled transitions 2218 [2022-12-06 00:23:32,341 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:23:32,342 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 314 [2022-12-06 00:23:32,342 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 471 transitions, 10193 flow [2022-12-06 00:23:32,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:23:32,342 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:23:32,342 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:23:32,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 00:23:32,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2022-12-06 00:23:32,547 INFO L420 AbstractCegarLoop]: === Iteration 71 === 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 00:23:32,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:23:32,547 INFO L85 PathProgramCache]: Analyzing trace with hash 243654579, now seen corresponding path program 5 times [2022-12-06 00:23:32,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:23:32,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040902652] [2022-12-06 00:23:32,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:23:32,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:23:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:23:33,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:23:33,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:23:33,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040902652] [2022-12-06 00:23:33,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040902652] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:23:33,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235619023] [2022-12-06 00:23:33,583 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 00:23:33,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:23:33,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:23:33,585 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:23:33,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 00:23:33,736 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 00:23:33,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 00:23:33,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-06 00:23:33,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:23:33,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:23:33,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2022-12-06 00:23:33,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:23:33,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:23:34,132 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-06 00:23:34,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 86 [2022-12-06 00:23:34,147 INFO L321 Elim1Store]: treesize reduction 23, result has 14.8 percent of original size [2022-12-06 00:23:34,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 42 [2022-12-06 00:23:34,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:23:34,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235619023] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:23:34,272 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:23:34,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-12-06 00:23:34,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515672616] [2022-12-06 00:23:34,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:23:34,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-06 00:23:34,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:23:34,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-06 00:23:34,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=537, Unknown=1, NotChecked=0, Total=650 [2022-12-06 00:23:34,273 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 00:23:34,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 471 transitions, 10193 flow. Second operand has 26 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:23:34,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:23:34,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 00:23:34,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:23:43,961 INFO L130 PetriNetUnfolder]: 3153/6022 cut-off events. [2022-12-06 00:23:43,961 INFO L131 PetriNetUnfolder]: For 148321/148321 co-relation queries the response was YES. [2022-12-06 00:23:44,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49639 conditions, 6022 events. 3153/6022 cut-off events. For 148321/148321 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 44937 event pairs, 358 based on Foata normal form. 4/6026 useless extension candidates. Maximal degree in co-relation 49430. Up to 1508 conditions per place. [2022-12-06 00:23:44,024 INFO L137 encePairwiseOnDemand]: 16/43 looper letters, 343 selfloop transitions, 321 changer transitions 18/682 dead transitions. [2022-12-06 00:23:44,025 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 682 transitions, 14097 flow [2022-12-06 00:23:44,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-06 00:23:44,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-06 00:23:44,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 228 transitions. [2022-12-06 00:23:44,026 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1893687707641196 [2022-12-06 00:23:44,026 INFO L175 Difference]: Start difference. First operand has 247 places, 471 transitions, 10193 flow. Second operand 28 states and 228 transitions. [2022-12-06 00:23:44,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 682 transitions, 14097 flow [2022-12-06 00:23:44,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 682 transitions, 13811 flow, removed 12 selfloop flow, removed 9 redundant places. [2022-12-06 00:23:44,780 INFO L231 Difference]: Finished difference. Result has 276 places, 514 transitions, 11626 flow [2022-12-06 00:23:44,781 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=9913, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=284, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=11626, PETRI_PLACES=276, PETRI_TRANSITIONS=514} [2022-12-06 00:23:44,781 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 247 predicate places. [2022-12-06 00:23:44,781 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:23:44,781 INFO L89 Accepts]: Start accepts. Operand has 276 places, 514 transitions, 11626 flow [2022-12-06 00:23:44,783 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:23:44,784 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:23:44,784 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 276 places, 514 transitions, 11626 flow [2022-12-06 00:23:44,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 275 places, 514 transitions, 11626 flow [2022-12-06 00:23:45,102 INFO L130 PetriNetUnfolder]: 672/2487 cut-off events. [2022-12-06 00:23:45,102 INFO L131 PetriNetUnfolder]: For 48796/48978 co-relation queries the response was YES. [2022-12-06 00:23:45,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17530 conditions, 2487 events. 672/2487 cut-off events. For 48796/48978 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 25119 event pairs, 19 based on Foata normal form. 26/2465 useless extension candidates. Maximal degree in co-relation 17356. Up to 371 conditions per place. [2022-12-06 00:23:45,138 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 275 places, 514 transitions, 11626 flow [2022-12-06 00:23:45,139 INFO L188 LiptonReduction]: Number of co-enabled transitions 2388 [2022-12-06 00:23:45,140 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:23:45,140 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 359 [2022-12-06 00:23:45,141 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 514 transitions, 11626 flow [2022-12-06 00:23:45,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:23:45,141 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:23:45,141 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:23:45,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 00:23:45,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:23:45,350 INFO L420 AbstractCegarLoop]: === Iteration 72 === 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 00:23:45,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:23:45,351 INFO L85 PathProgramCache]: Analyzing trace with hash -2064700453, now seen corresponding path program 6 times [2022-12-06 00:23:45,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:23:45,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197760448] [2022-12-06 00:23:45,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:23:45,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:23:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:23:46,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:23:46,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:23:46,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197760448] [2022-12-06 00:23:46,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197760448] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:23:46,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340350463] [2022-12-06 00:23:46,496 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 00:23:46,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:23:46,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:23:46,497 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:23:46,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 00:23:46,694 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-06 00:23:46,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 00:23:46,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-06 00:23:46,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:23:46,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:23:46,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2022-12-06 00:23:46,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:23:46,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:23:47,111 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:23:47,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 130 [2022-12-06 00:23:47,132 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:23:47,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 64 [2022-12-06 00:23:47,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:23:47,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340350463] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:23:47,391 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:23:47,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-12-06 00:23:47,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775590836] [2022-12-06 00:23:47,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:23:47,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 00:23:47,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:23:47,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 00:23:47,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=519, Unknown=3, NotChecked=0, Total=600 [2022-12-06 00:23:47,392 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 00:23:47,393 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 514 transitions, 11626 flow. Second operand has 25 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:23:47,393 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:23:47,393 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 00:23:47,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:23:50,170 INFO L130 PetriNetUnfolder]: 3193/6142 cut-off events. [2022-12-06 00:23:50,170 INFO L131 PetriNetUnfolder]: For 169109/169109 co-relation queries the response was YES. [2022-12-06 00:23:50,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52705 conditions, 6142 events. 3193/6142 cut-off events. For 169109/169109 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 46391 event pairs, 701 based on Foata normal form. 4/6146 useless extension candidates. Maximal degree in co-relation 52475. Up to 4548 conditions per place. [2022-12-06 00:23:50,233 INFO L137 encePairwiseOnDemand]: 19/43 looper letters, 439 selfloop transitions, 163 changer transitions 20/622 dead transitions. [2022-12-06 00:23:50,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 622 transitions, 14036 flow [2022-12-06 00:23:50,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 00:23:50,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 00:23:50,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 151 transitions. [2022-12-06 00:23:50,234 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23410852713178296 [2022-12-06 00:23:50,234 INFO L175 Difference]: Start difference. First operand has 275 places, 514 transitions, 11626 flow. Second operand 15 states and 151 transitions. [2022-12-06 00:23:50,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 622 transitions, 14036 flow [2022-12-06 00:23:50,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 622 transitions, 13236 flow, removed 112 selfloop flow, removed 18 redundant places. [2022-12-06 00:23:51,001 INFO L231 Difference]: Finished difference. Result has 274 places, 518 transitions, 11324 flow [2022-12-06 00:23:51,002 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=10844, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=514, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=159, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=11324, PETRI_PLACES=274, PETRI_TRANSITIONS=518} [2022-12-06 00:23:51,002 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 245 predicate places. [2022-12-06 00:23:51,002 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:23:51,002 INFO L89 Accepts]: Start accepts. Operand has 274 places, 518 transitions, 11324 flow [2022-12-06 00:23:51,005 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:23:51,005 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:23:51,005 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 274 places, 518 transitions, 11324 flow [2022-12-06 00:23:51,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 273 places, 518 transitions, 11324 flow [2022-12-06 00:23:51,443 INFO L130 PetriNetUnfolder]: 674/2566 cut-off events. [2022-12-06 00:23:51,443 INFO L131 PetriNetUnfolder]: For 44584/44792 co-relation queries the response was YES. [2022-12-06 00:23:51,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17450 conditions, 2566 events. 674/2566 cut-off events. For 44584/44792 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 26442 event pairs, 18 based on Foata normal form. 27/2531 useless extension candidates. Maximal degree in co-relation 17270. Up to 378 conditions per place. [2022-12-06 00:23:51,484 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 273 places, 518 transitions, 11324 flow [2022-12-06 00:23:51,485 INFO L188 LiptonReduction]: Number of co-enabled transitions 2420 [2022-12-06 00:23:51,486 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:23:51,486 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 484 [2022-12-06 00:23:51,486 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 518 transitions, 11324 flow [2022-12-06 00:23:51,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:23:51,487 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:23:51,487 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:23:51,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-06 00:23:51,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:23:51,690 INFO L420 AbstractCegarLoop]: === Iteration 73 === 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 00:23:51,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:23:51,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1854349095, now seen corresponding path program 7 times [2022-12-06 00:23:51,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:23:51,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819622070] [2022-12-06 00:23:51,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:23:51,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:23:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:23:52,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:23:52,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:23:52,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819622070] [2022-12-06 00:23:52,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819622070] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:23:52,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84334385] [2022-12-06 00:23:52,871 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 00:23:52,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:23:52,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:23:52,873 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:23:52,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-06 00:23:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:23:53,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-06 00:23:53,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:23:53,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:23:53,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 32 [2022-12-06 00:23:53,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:23:53,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:23:53,465 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-06 00:23:53,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 89 treesize of output 63 [2022-12-06 00:23:53,475 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:23:53,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 7 [2022-12-06 00:23:53,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:23:53,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84334385] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:23:53,555 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:23:53,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-12-06 00:23:53,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887001783] [2022-12-06 00:23:53,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:23:53,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-06 00:23:53,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:23:53,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-06 00:23:53,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=537, Unknown=1, NotChecked=0, Total=650 [2022-12-06 00:23:53,556 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 00:23:53,556 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 518 transitions, 11324 flow. Second operand has 26 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:23:53,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:23:53,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 00:23:53,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:23:56,538 INFO L130 PetriNetUnfolder]: 3182/6120 cut-off events. [2022-12-06 00:23:56,538 INFO L131 PetriNetUnfolder]: For 154273/154273 co-relation queries the response was YES. [2022-12-06 00:23:56,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51491 conditions, 6120 events. 3182/6120 cut-off events. For 154273/154273 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 46265 event pairs, 408 based on Foata normal form. 3/6123 useless extension candidates. Maximal degree in co-relation 51263. Up to 1423 conditions per place. [2022-12-06 00:23:56,608 INFO L137 encePairwiseOnDemand]: 17/43 looper letters, 326 selfloop transitions, 311 changer transitions 23/660 dead transitions. [2022-12-06 00:23:56,609 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 660 transitions, 14077 flow [2022-12-06 00:23:56,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 00:23:56,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 00:23:56,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 197 transitions. [2022-12-06 00:23:56,610 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21816168327796234 [2022-12-06 00:23:56,610 INFO L175 Difference]: Start difference. First operand has 273 places, 518 transitions, 11324 flow. Second operand 21 states and 197 transitions. [2022-12-06 00:23:56,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 660 transitions, 14077 flow [2022-12-06 00:23:57,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 660 transitions, 13796 flow, removed 10 selfloop flow, removed 13 redundant places. [2022-12-06 00:23:57,497 INFO L231 Difference]: Finished difference. Result has 285 places, 526 transitions, 12024 flow [2022-12-06 00:23:57,498 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=11043, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=295, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=12024, PETRI_PLACES=285, PETRI_TRANSITIONS=526} [2022-12-06 00:23:57,498 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 256 predicate places. [2022-12-06 00:23:57,498 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:23:57,498 INFO L89 Accepts]: Start accepts. Operand has 285 places, 526 transitions, 12024 flow [2022-12-06 00:23:57,501 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:23:57,501 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:23:57,501 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 285 places, 526 transitions, 12024 flow [2022-12-06 00:23:57,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 282 places, 526 transitions, 12024 flow [2022-12-06 00:23:57,826 INFO L130 PetriNetUnfolder]: 664/2528 cut-off events. [2022-12-06 00:23:57,826 INFO L131 PetriNetUnfolder]: For 48010/48186 co-relation queries the response was YES. [2022-12-06 00:23:57,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17987 conditions, 2528 events. 664/2528 cut-off events. For 48010/48186 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 25833 event pairs, 19 based on Foata normal form. 26/2507 useless extension candidates. Maximal degree in co-relation 17803. Up to 370 conditions per place. [2022-12-06 00:23:57,860 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 282 places, 526 transitions, 12024 flow [2022-12-06 00:23:57,860 INFO L188 LiptonReduction]: Number of co-enabled transitions 2488 [2022-12-06 00:23:57,861 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:23:57,862 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 364 [2022-12-06 00:23:57,862 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 526 transitions, 12024 flow [2022-12-06 00:23:57,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:23:57,862 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:23:57,862 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:23:57,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-06 00:23:58,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable72 [2022-12-06 00:23:58,065 INFO L420 AbstractCegarLoop]: === Iteration 74 === 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 00:23:58,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:23:58,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1589529119, now seen corresponding path program 8 times [2022-12-06 00:23:58,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:23:58,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804141029] [2022-12-06 00:23:58,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:23:58,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:23:58,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:23:58,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:23:58,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:23:58,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804141029] [2022-12-06 00:23:58,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804141029] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:23:58,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580056667] [2022-12-06 00:23:58,835 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 00:23:58,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:23:58,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:23:58,837 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:23:58,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-06 00:23:59,043 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 00:23:59,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 00:23:59,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-06 00:23:59,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:23:59,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:23:59,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-12-06 00:23:59,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:23:59,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:23:59,391 INFO L321 Elim1Store]: treesize reduction 23, result has 14.8 percent of original size [2022-12-06 00:23:59,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 57 [2022-12-06 00:23:59,395 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:23:59,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 7 [2022-12-06 00:23:59,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:23:59,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580056667] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:23:59,496 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:23:59,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-12-06 00:23:59,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461113996] [2022-12-06 00:23:59,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:23:59,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-06 00:23:59,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:23:59,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-06 00:23:59,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=544, Unknown=1, NotChecked=0, Total=650 [2022-12-06 00:23:59,497 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 00:23:59,497 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 526 transitions, 12024 flow. Second operand has 26 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:23:59,497 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:23:59,497 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 00:23:59,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:24:03,262 INFO L130 PetriNetUnfolder]: 3261/6204 cut-off events. [2022-12-06 00:24:03,262 INFO L131 PetriNetUnfolder]: For 176893/176893 co-relation queries the response was YES. [2022-12-06 00:24:03,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55236 conditions, 6204 events. 3261/6204 cut-off events. For 176893/176893 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 46469 event pairs, 470 based on Foata normal form. 4/6208 useless extension candidates. Maximal degree in co-relation 55016. Up to 1371 conditions per place. [2022-12-06 00:24:03,322 INFO L137 encePairwiseOnDemand]: 17/43 looper letters, 366 selfloop transitions, 316 changer transitions 28/710 dead transitions. [2022-12-06 00:24:03,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 710 transitions, 15654 flow [2022-12-06 00:24:03,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-06 00:24:03,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-06 00:24:03,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 235 transitions. [2022-12-06 00:24:03,324 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1884522854851644 [2022-12-06 00:24:03,324 INFO L175 Difference]: Start difference. First operand has 282 places, 526 transitions, 12024 flow. Second operand 29 states and 235 transitions. [2022-12-06 00:24:03,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 710 transitions, 15654 flow [2022-12-06 00:24:04,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 710 transitions, 15372 flow, removed 30 selfloop flow, removed 11 redundant places. [2022-12-06 00:24:04,113 INFO L231 Difference]: Finished difference. Result has 304 places, 548 transitions, 12968 flow [2022-12-06 00:24:04,113 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=11758, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=285, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=12968, PETRI_PLACES=304, PETRI_TRANSITIONS=548} [2022-12-06 00:24:04,113 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 275 predicate places. [2022-12-06 00:24:04,113 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:24:04,113 INFO L89 Accepts]: Start accepts. Operand has 304 places, 548 transitions, 12968 flow [2022-12-06 00:24:04,116 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:24:04,116 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:24:04,116 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 304 places, 548 transitions, 12968 flow [2022-12-06 00:24:04,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 300 places, 548 transitions, 12968 flow [2022-12-06 00:24:04,437 INFO L130 PetriNetUnfolder]: 694/2514 cut-off events. [2022-12-06 00:24:04,438 INFO L131 PetriNetUnfolder]: For 50634/50838 co-relation queries the response was YES. [2022-12-06 00:24:04,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18882 conditions, 2514 events. 694/2514 cut-off events. For 50634/50838 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 25297 event pairs, 18 based on Foata normal form. 28/2485 useless extension candidates. Maximal degree in co-relation 18701. Up to 379 conditions per place. [2022-12-06 00:24:04,474 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 300 places, 548 transitions, 12968 flow [2022-12-06 00:24:04,474 INFO L188 LiptonReduction]: Number of co-enabled transitions 2562 [2022-12-06 00:24:04,476 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:24:04,476 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 363 [2022-12-06 00:24:04,476 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 548 transitions, 12968 flow [2022-12-06 00:24:04,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:24:04,476 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:24:04,476 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:24:04,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-06 00:24:04,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:24:04,682 INFO L420 AbstractCegarLoop]: === Iteration 75 === 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 00:24:04,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:24:04,682 INFO L85 PathProgramCache]: Analyzing trace with hash -711455537, now seen corresponding path program 9 times [2022-12-06 00:24:04,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:24:04,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543980924] [2022-12-06 00:24:04,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:24:04,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:24:04,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:24:05,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:24:05,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:24:05,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543980924] [2022-12-06 00:24:05,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543980924] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:24:05,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397327937] [2022-12-06 00:24:05,640 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 00:24:05,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:24:05,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:24:05,641 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:24:05,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-06 00:24:05,866 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 00:24:05,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 00:24:05,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-06 00:24:05,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:24:06,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:24:06,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-12-06 00:24:06,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:24:06,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:24:06,232 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-06 00:24:06,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 87 treesize of output 61 [2022-12-06 00:24:06,238 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:24:06,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 7 [2022-12-06 00:24:06,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:24:06,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397327937] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:24:06,357 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:24:06,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-12-06 00:24:06,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133048011] [2022-12-06 00:24:06,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:24:06,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-06 00:24:06,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:24:06,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-06 00:24:06,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=534, Unknown=1, NotChecked=0, Total=650 [2022-12-06 00:24:06,358 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 00:24:06,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 548 transitions, 12968 flow. Second operand has 26 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:24:06,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:24:06,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 00:24:06,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:24:09,928 INFO L130 PetriNetUnfolder]: 3219/6092 cut-off events. [2022-12-06 00:24:09,928 INFO L131 PetriNetUnfolder]: For 180564/180564 co-relation queries the response was YES. [2022-12-06 00:24:09,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55656 conditions, 6092 events. 3219/6092 cut-off events. For 180564/180564 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 45240 event pairs, 462 based on Foata normal form. 4/6096 useless extension candidates. Maximal degree in co-relation 55431. Up to 1469 conditions per place. [2022-12-06 00:24:09,994 INFO L137 encePairwiseOnDemand]: 16/43 looper letters, 364 selfloop transitions, 283 changer transitions 20/667 dead transitions. [2022-12-06 00:24:09,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 667 transitions, 15322 flow [2022-12-06 00:24:09,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-06 00:24:09,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-06 00:24:09,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 206 transitions. [2022-12-06 00:24:09,995 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.18425760286225404 [2022-12-06 00:24:09,995 INFO L175 Difference]: Start difference. First operand has 300 places, 548 transitions, 12968 flow. Second operand 26 states and 206 transitions. [2022-12-06 00:24:09,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 667 transitions, 15322 flow [2022-12-06 00:24:10,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 667 transitions, 14780 flow, removed 47 selfloop flow, removed 20 redundant places. [2022-12-06 00:24:10,869 INFO L231 Difference]: Finished difference. Result has 306 places, 540 transitions, 12767 flow [2022-12-06 00:24:10,870 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=12426, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=283, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=12767, PETRI_PLACES=306, PETRI_TRANSITIONS=540} [2022-12-06 00:24:10,870 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 277 predicate places. [2022-12-06 00:24:10,870 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:24:10,870 INFO L89 Accepts]: Start accepts. Operand has 306 places, 540 transitions, 12767 flow [2022-12-06 00:24:10,872 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:24:10,872 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:24:10,872 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 306 places, 540 transitions, 12767 flow [2022-12-06 00:24:10,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 303 places, 540 transitions, 12767 flow [2022-12-06 00:24:11,215 INFO L130 PetriNetUnfolder]: 688/2472 cut-off events. [2022-12-06 00:24:11,215 INFO L131 PetriNetUnfolder]: For 50766/50970 co-relation queries the response was YES. [2022-12-06 00:24:11,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18627 conditions, 2472 events. 688/2472 cut-off events. For 50766/50970 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 24689 event pairs, 18 based on Foata normal form. 25/2439 useless extension candidates. Maximal degree in co-relation 18448. Up to 373 conditions per place. [2022-12-06 00:24:11,339 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 303 places, 540 transitions, 12767 flow [2022-12-06 00:24:11,340 INFO L188 LiptonReduction]: Number of co-enabled transitions 2526 [2022-12-06 00:24:11,341 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:24:11,341 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 471 [2022-12-06 00:24:11,341 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 540 transitions, 12767 flow [2022-12-06 00:24:11,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:24:11,342 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:24:11,342 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:24:11,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-06 00:24:11,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:24:11,548 INFO L420 AbstractCegarLoop]: === Iteration 76 === 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 00:24:11,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:24:11,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1850300833, now seen corresponding path program 1 times [2022-12-06 00:24:11,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:24:11,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112302837] [2022-12-06 00:24:11,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:24:11,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:24:11,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:24:11,594 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 00:24:11,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:24:11,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112302837] [2022-12-06 00:24:11,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112302837] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:24:11,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:24:11,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:24:11,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124272451] [2022-12-06 00:24:11,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:24:11,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:24:11,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:24:11,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:24:11,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:24:11,596 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 00:24:11,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 540 transitions, 12767 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:24:11,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:24:11,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 00:24:11,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:24:12,959 INFO L130 PetriNetUnfolder]: 3166/5914 cut-off events. [2022-12-06 00:24:12,959 INFO L131 PetriNetUnfolder]: For 182799/182799 co-relation queries the response was YES. [2022-12-06 00:24:13,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54289 conditions, 5914 events. 3166/5914 cut-off events. For 182799/182799 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 42664 event pairs, 818 based on Foata normal form. 6/5920 useless extension candidates. Maximal degree in co-relation 54072. Up to 3649 conditions per place. [2022-12-06 00:24:13,148 INFO L137 encePairwiseOnDemand]: 29/43 looper letters, 500 selfloop transitions, 93 changer transitions 5/598 dead transitions. [2022-12-06 00:24:13,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 598 transitions, 14871 flow [2022-12-06 00:24:13,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:24:13,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:24:13,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-12-06 00:24:13,149 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38953488372093026 [2022-12-06 00:24:13,149 INFO L175 Difference]: Start difference. First operand has 303 places, 540 transitions, 12767 flow. Second operand 4 states and 67 transitions. [2022-12-06 00:24:13,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 598 transitions, 14871 flow [2022-12-06 00:24:13,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 598 transitions, 14193 flow, removed 6 selfloop flow, removed 24 redundant places. [2022-12-06 00:24:13,904 INFO L231 Difference]: Finished difference. Result has 282 places, 532 transitions, 12141 flow [2022-12-06 00:24:13,904 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=12001, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=534, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=12141, PETRI_PLACES=282, PETRI_TRANSITIONS=532} [2022-12-06 00:24:13,904 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 253 predicate places. [2022-12-06 00:24:13,904 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:24:13,904 INFO L89 Accepts]: Start accepts. Operand has 282 places, 532 transitions, 12141 flow [2022-12-06 00:24:13,907 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:24:13,907 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:24:13,907 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 282 places, 532 transitions, 12141 flow [2022-12-06 00:24:13,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 282 places, 532 transitions, 12141 flow [2022-12-06 00:24:14,224 INFO L130 PetriNetUnfolder]: 684/2448 cut-off events. [2022-12-06 00:24:14,224 INFO L131 PetriNetUnfolder]: For 47734/47919 co-relation queries the response was YES. [2022-12-06 00:24:14,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17942 conditions, 2448 events. 684/2448 cut-off events. For 47734/47919 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 24317 event pairs, 21 based on Foata normal form. 24/2423 useless extension candidates. Maximal degree in co-relation 17654. Up to 372 conditions per place. [2022-12-06 00:24:14,263 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 282 places, 532 transitions, 12141 flow [2022-12-06 00:24:14,263 INFO L188 LiptonReduction]: Number of co-enabled transitions 2486 [2022-12-06 00:24:14,264 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:24:14,265 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 361 [2022-12-06 00:24:14,265 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 532 transitions, 12141 flow [2022-12-06 00:24:14,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:24:14,265 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:24:14,265 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 00:24:14,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2022-12-06 00:24:14,265 INFO L420 AbstractCegarLoop]: === Iteration 77 === 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 00:24:14,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:24:14,265 INFO L85 PathProgramCache]: Analyzing trace with hash 590301037, now seen corresponding path program 1 times [2022-12-06 00:24:14,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:24:14,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823035760] [2022-12-06 00:24:14,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:24:14,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:24:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:24:15,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:24:15,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:24:15,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823035760] [2022-12-06 00:24:15,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823035760] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:24:15,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930825166] [2022-12-06 00:24:15,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:24:15,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:24:15,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:24:15,721 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:24:15,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-06 00:24:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:24:15,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-06 00:24:15,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:24:16,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:24:16,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:24:16,255 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-06 00:24:16,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 34 [2022-12-06 00:24:16,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:24:16,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930825166] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:24:16,320 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:24:16,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 23 [2022-12-06 00:24:16,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718824010] [2022-12-06 00:24:16,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:24:16,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 00:24:16,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:24:16,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 00:24:16,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2022-12-06 00:24:16,321 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 00:24:16,321 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 532 transitions, 12141 flow. Second operand has 24 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 24 states have internal predecessors, (57), 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 00:24:16,321 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:24:16,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 00:24:16,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:24:18,704 INFO L130 PetriNetUnfolder]: 3360/6285 cut-off events. [2022-12-06 00:24:18,705 INFO L131 PetriNetUnfolder]: For 174083/174083 co-relation queries the response was YES. [2022-12-06 00:24:18,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56010 conditions, 6285 events. 3360/6285 cut-off events. For 174083/174083 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 46513 event pairs, 254 based on Foata normal form. 1/6286 useless extension candidates. Maximal degree in co-relation 55229. Up to 1211 conditions per place. [2022-12-06 00:24:18,779 INFO L137 encePairwiseOnDemand]: 18/42 looper letters, 253 selfloop transitions, 412 changer transitions 13/678 dead transitions. [2022-12-06 00:24:18,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 678 transitions, 15349 flow [2022-12-06 00:24:18,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 00:24:18,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 00:24:18,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 182 transitions. [2022-12-06 00:24:18,781 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22807017543859648 [2022-12-06 00:24:18,781 INFO L175 Difference]: Start difference. First operand has 282 places, 532 transitions, 12141 flow. Second operand 19 states and 182 transitions. [2022-12-06 00:24:18,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 678 transitions, 15349 flow [2022-12-06 00:24:19,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 678 transitions, 15104 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 00:24:19,697 INFO L231 Difference]: Finished difference. Result has 304 places, 584 transitions, 14388 flow [2022-12-06 00:24:19,697 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=11904, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=360, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=14388, PETRI_PLACES=304, PETRI_TRANSITIONS=584} [2022-12-06 00:24:19,697 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 275 predicate places. [2022-12-06 00:24:19,697 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:24:19,697 INFO L89 Accepts]: Start accepts. Operand has 304 places, 584 transitions, 14388 flow [2022-12-06 00:24:19,707 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:24:19,707 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:24:19,707 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 304 places, 584 transitions, 14388 flow [2022-12-06 00:24:19,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 303 places, 584 transitions, 14388 flow [2022-12-06 00:24:20,060 INFO L130 PetriNetUnfolder]: 728/2606 cut-off events. [2022-12-06 00:24:20,060 INFO L131 PetriNetUnfolder]: For 58272/58451 co-relation queries the response was YES. [2022-12-06 00:24:20,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20808 conditions, 2606 events. 728/2606 cut-off events. For 58272/58451 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 26353 event pairs, 19 based on Foata normal form. 14/2562 useless extension candidates. Maximal degree in co-relation 20630. Up to 412 conditions per place. [2022-12-06 00:24:20,102 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 303 places, 584 transitions, 14388 flow [2022-12-06 00:24:20,102 INFO L188 LiptonReduction]: Number of co-enabled transitions 2762 [2022-12-06 00:24:20,211 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:24:20,333 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [580] L67-5-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_31| (+ |v_thread2Thread1of1ForFork0_~i~1#1_32| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_32| 4294967296) (mod v_~A~0_35 4294967296)) (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_30| v_~B~0_29) |v_thread2Thread1of1ForFork0_~x~1#1_29|)) InVars {~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_32|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_30|} OutVars{~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_31|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_13|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] [2022-12-06 00:24:20,448 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:24:20,576 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:24:20,588 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 891 [2022-12-06 00:24:20,588 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 582 transitions, 14395 flow [2022-12-06 00:24:20,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 24 states have internal predecessors, (57), 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 00:24:20,588 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:24:20,588 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 00:24:20,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-06 00:24:20,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable76 [2022-12-06 00:24:20,793 INFO L420 AbstractCegarLoop]: === Iteration 78 === 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 00:24:20,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:24:20,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1035103645, now seen corresponding path program 1 times [2022-12-06 00:24:20,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:24:20,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066959969] [2022-12-06 00:24:20,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:24:20,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:24:20,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:24:20,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:24:20,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:24:20,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066959969] [2022-12-06 00:24:20,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066959969] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:24:20,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041258093] [2022-12-06 00:24:20,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:24:20,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:24:20,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:24:20,879 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:24:20,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-06 00:24:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:24:21,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 00:24:21,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:24:21,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:24:21,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:24:21,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:24:21,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041258093] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:24:21,182 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:24:21,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2022-12-06 00:24:21,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817618708] [2022-12-06 00:24:21,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:24:21,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:24:21,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:24:21,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:24:21,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:24:21,182 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 00:24:21,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 582 transitions, 14395 flow. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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 00:24:21,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:24:21,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 00:24:21,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:24:23,615 INFO L130 PetriNetUnfolder]: 4205/7827 cut-off events. [2022-12-06 00:24:23,615 INFO L131 PetriNetUnfolder]: For 267648/267648 co-relation queries the response was YES. [2022-12-06 00:24:23,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76288 conditions, 7827 events. 4205/7827 cut-off events. For 267648/267648 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 59738 event pairs, 1122 based on Foata normal form. 117/7944 useless extension candidates. Maximal degree in co-relation 76056. Up to 6238 conditions per place. [2022-12-06 00:24:23,704 INFO L137 encePairwiseOnDemand]: 38/46 looper letters, 770 selfloop transitions, 74 changer transitions 0/844 dead transitions. [2022-12-06 00:24:23,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 844 transitions, 21523 flow [2022-12-06 00:24:23,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 00:24:23,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 00:24:23,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 140 transitions. [2022-12-06 00:24:23,709 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2766798418972332 [2022-12-06 00:24:23,709 INFO L175 Difference]: Start difference. First operand has 301 places, 582 transitions, 14395 flow. Second operand 11 states and 140 transitions. [2022-12-06 00:24:23,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 844 transitions, 21523 flow [2022-12-06 00:24:25,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 844 transitions, 20755 flow, removed 133 selfloop flow, removed 10 redundant places. [2022-12-06 00:24:25,270 INFO L231 Difference]: Finished difference. Result has 309 places, 650 transitions, 15642 flow [2022-12-06 00:24:25,271 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=13795, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=537, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=15642, PETRI_PLACES=309, PETRI_TRANSITIONS=650} [2022-12-06 00:24:25,271 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 280 predicate places. [2022-12-06 00:24:25,271 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:24:25,271 INFO L89 Accepts]: Start accepts. Operand has 309 places, 650 transitions, 15642 flow [2022-12-06 00:24:25,273 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:24:25,273 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:24:25,273 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 309 places, 650 transitions, 15642 flow [2022-12-06 00:24:25,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 309 places, 650 transitions, 15642 flow [2022-12-06 00:24:25,779 INFO L130 PetriNetUnfolder]: 919/3327 cut-off events. [2022-12-06 00:24:25,780 INFO L131 PetriNetUnfolder]: For 77793/78016 co-relation queries the response was YES. [2022-12-06 00:24:25,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25926 conditions, 3327 events. 919/3327 cut-off events. For 77793/78016 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 35602 event pairs, 28 based on Foata normal form. 15/3275 useless extension candidates. Maximal degree in co-relation 25617. Up to 567 conditions per place. [2022-12-06 00:24:25,830 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 309 places, 650 transitions, 15642 flow [2022-12-06 00:24:25,830 INFO L188 LiptonReduction]: Number of co-enabled transitions 3152 [2022-12-06 00:24:25,993 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:24:25,993 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 722 [2022-12-06 00:24:25,994 INFO L495 AbstractCegarLoop]: Abstraction has has 309 places, 650 transitions, 15667 flow [2022-12-06 00:24:25,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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 00:24:25,994 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:24:25,994 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:24:25,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-06 00:24:26,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:24:26,194 INFO L420 AbstractCegarLoop]: === Iteration 79 === 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 00:24:26,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:24:26,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1647187773, now seen corresponding path program 1 times [2022-12-06 00:24:26,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:24:26,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482032667] [2022-12-06 00:24:26,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:24:26,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:24:26,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:24:27,198 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 00:24:27,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:24:27,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482032667] [2022-12-06 00:24:27,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482032667] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:24:27,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:24:27,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:24:27,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474053508] [2022-12-06 00:24:27,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:24:27,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:24:27,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:24:27,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:24:27,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:24:27,199 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 00:24:27,199 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 650 transitions, 15667 flow. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:24:27,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:24:27,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 00:24:27,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:24:29,590 INFO L130 PetriNetUnfolder]: 4209/7845 cut-off events. [2022-12-06 00:24:29,591 INFO L131 PetriNetUnfolder]: For 271046/271046 co-relation queries the response was YES. [2022-12-06 00:24:29,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75107 conditions, 7845 events. 4209/7845 cut-off events. For 271046/271046 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 60105 event pairs, 938 based on Foata normal form. 1/7846 useless extension candidates. Maximal degree in co-relation 74281. Up to 6172 conditions per place. [2022-12-06 00:24:29,669 INFO L137 encePairwiseOnDemand]: 26/46 looper letters, 561 selfloop transitions, 116 changer transitions 16/693 dead transitions. [2022-12-06 00:24:29,669 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 693 transitions, 17496 flow [2022-12-06 00:24:29,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:24:29,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:24:29,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2022-12-06 00:24:29,693 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2608695652173913 [2022-12-06 00:24:29,693 INFO L175 Difference]: Start difference. First operand has 309 places, 650 transitions, 15667 flow. Second operand 8 states and 96 transitions. [2022-12-06 00:24:29,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 693 transitions, 17496 flow [2022-12-06 00:24:31,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 693 transitions, 17126 flow, removed 182 selfloop flow, removed 2 redundant places. [2022-12-06 00:24:31,383 INFO L231 Difference]: Finished difference. Result has 316 places, 647 transitions, 15487 flow [2022-12-06 00:24:31,383 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=15317, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=650, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=534, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=15487, PETRI_PLACES=316, PETRI_TRANSITIONS=647} [2022-12-06 00:24:31,384 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 287 predicate places. [2022-12-06 00:24:31,384 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:24:31,384 INFO L89 Accepts]: Start accepts. Operand has 316 places, 647 transitions, 15487 flow [2022-12-06 00:24:31,386 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:24:31,386 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:24:31,387 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 316 places, 647 transitions, 15487 flow [2022-12-06 00:24:31,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 314 places, 647 transitions, 15487 flow [2022-12-06 00:24:31,943 INFO L130 PetriNetUnfolder]: 929/3302 cut-off events. [2022-12-06 00:24:31,943 INFO L131 PetriNetUnfolder]: For 78933/79187 co-relation queries the response was YES. [2022-12-06 00:24:31,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25980 conditions, 3302 events. 929/3302 cut-off events. For 78933/79187 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 35245 event pairs, 29 based on Foata normal form. 12/3229 useless extension candidates. Maximal degree in co-relation 25814. Up to 578 conditions per place. [2022-12-06 00:24:31,990 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 314 places, 647 transitions, 15487 flow [2022-12-06 00:24:31,991 INFO L188 LiptonReduction]: Number of co-enabled transitions 3134 [2022-12-06 00:24:31,992 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:24:31,992 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 608 [2022-12-06 00:24:31,992 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 647 transitions, 15487 flow [2022-12-06 00:24:31,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:24:31,993 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:24:31,993 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:24:31,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2022-12-06 00:24:31,993 INFO L420 AbstractCegarLoop]: === Iteration 80 === 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 00:24:31,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:24:31,993 INFO L85 PathProgramCache]: Analyzing trace with hash -440173848, now seen corresponding path program 1 times [2022-12-06 00:24:31,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:24:31,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163088148] [2022-12-06 00:24:31,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:24:31,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:24:32,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:24:32,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:24:32,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:24:32,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163088148] [2022-12-06 00:24:32,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163088148] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:24:32,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709891618] [2022-12-06 00:24:32,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:24:32,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:24:32,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:24:32,950 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:24:32,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-06 00:24:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:24:33,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-06 00:24:33,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:24:33,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:24:33,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2022-12-06 00:24:33,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:24:33,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:24:33,461 INFO L321 Elim1Store]: treesize reduction 23, result has 14.8 percent of original size [2022-12-06 00:24:33,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 78 [2022-12-06 00:24:33,475 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:24:33,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 42 [2022-12-06 00:24:33,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:24:33,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709891618] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:24:33,553 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:24:33,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 19 [2022-12-06 00:24:33,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989090374] [2022-12-06 00:24:33,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:24:33,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 00:24:33,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:24:33,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 00:24:33,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2022-12-06 00:24:33,554 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 00:24:33,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 647 transitions, 15487 flow. Second operand has 21 states, 20 states have (on average 2.55) internal successors, (51), 20 states have internal predecessors, (51), 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 00:24:33,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:24:33,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 00:24:33,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:24:36,423 INFO L130 PetriNetUnfolder]: 4207/7841 cut-off events. [2022-12-06 00:24:36,423 INFO L131 PetriNetUnfolder]: For 267472/267472 co-relation queries the response was YES. [2022-12-06 00:24:36,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74752 conditions, 7841 events. 4207/7841 cut-off events. For 267472/267472 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 60185 event pairs, 605 based on Foata normal form. 1/7842 useless extension candidates. Maximal degree in co-relation 74516. Up to 1439 conditions per place. [2022-12-06 00:24:36,519 INFO L137 encePairwiseOnDemand]: 19/45 looper letters, 391 selfloop transitions, 323 changer transitions 14/728 dead transitions. [2022-12-06 00:24:36,519 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 728 transitions, 17741 flow [2022-12-06 00:24:36,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 00:24:36,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 00:24:36,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 149 transitions. [2022-12-06 00:24:36,520 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22074074074074074 [2022-12-06 00:24:36,520 INFO L175 Difference]: Start difference. First operand has 314 places, 647 transitions, 15487 flow. Second operand 15 states and 149 transitions. [2022-12-06 00:24:36,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 728 transitions, 17741 flow [2022-12-06 00:24:38,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 728 transitions, 17529 flow, removed 3 selfloop flow, removed 7 redundant places. [2022-12-06 00:24:38,213 INFO L231 Difference]: Finished difference. Result has 324 places, 650 transitions, 16198 flow [2022-12-06 00:24:38,213 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=15277, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=647, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=320, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=16198, PETRI_PLACES=324, PETRI_TRANSITIONS=650} [2022-12-06 00:24:38,213 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 295 predicate places. [2022-12-06 00:24:38,213 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:24:38,213 INFO L89 Accepts]: Start accepts. Operand has 324 places, 650 transitions, 16198 flow [2022-12-06 00:24:38,217 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:24:38,217 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:24:38,217 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 324 places, 650 transitions, 16198 flow [2022-12-06 00:24:38,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 322 places, 650 transitions, 16198 flow [2022-12-06 00:24:38,709 INFO L130 PetriNetUnfolder]: 924/3299 cut-off events. [2022-12-06 00:24:38,709 INFO L131 PetriNetUnfolder]: For 84731/84964 co-relation queries the response was YES. [2022-12-06 00:24:38,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26887 conditions, 3299 events. 924/3299 cut-off events. For 84731/84964 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 35263 event pairs, 29 based on Foata normal form. 10/3226 useless extension candidates. Maximal degree in co-relation 26696. Up to 575 conditions per place. [2022-12-06 00:24:38,764 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 322 places, 650 transitions, 16198 flow [2022-12-06 00:24:38,764 INFO L188 LiptonReduction]: Number of co-enabled transitions 3154 [2022-12-06 00:24:38,769 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [738] $Ultimate##0-->L104-3: Formula: (let ((.cse0 (mod v_~A~0_376 4294967296))) (and (= (store |v_#memory_int_690| |v_ULTIMATE.start_main_~#t3~0#1.base_238| (store (select |v_#memory_int_690| |v_ULTIMATE.start_main_~#t3~0#1.base_238|) |v_ULTIMATE.start_main_~#t3~0#1.offset_220| |v_ULTIMATE.start_main_#t~pre18#1_250|)) |v_#memory_int_689|) (= (+ v_~end~0_767 1) v_~end~0_766) (= |v_ULTIMATE.start_main_#t~pre18#1_250| |v_#pthreadsForks_469|) (= (+ |v_thread1Thread1of1ForFork2_~i~0#1_296| 1) |v_thread1Thread1of1ForFork2_~i~0#1_295|) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_170| 0)) (= |v_thread2Thread1of1ForFork0_~x~1#1_411| 0) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_295| 4294967296) .cse0)) (= |v_thread1Thread1of1ForFork2_#res#1.base_168| 0) (= (ite (= (mod (select (select |v_#memory_int_690| v_~queue~0.base_374) (+ (* v_~end~0_767 4) v_~queue~0.offset_374)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_301| 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_170|) (= (+ |v_#pthreadsForks_469| 1) |v_#pthreadsForks_468|) (= |v_thread1Thread1of1ForFork2_~x~0#1_301| (+ |v_thread1Thread1of1ForFork2_~x~0#1_302| v_~B~0_200)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_168| 0) (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_296| 4294967296) .cse0) (not (= (ite (and (< v_~end~0_767 v_~n~0_380) (<= 0 v_~end~0_767)) 1 0) 0)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_170| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_170|) (= |v_thread2Thread1of1ForFork0_~i~1#1_389| 0))) InVars {~queue~0.offset=v_~queue~0.offset_374, ~A~0=v_~A~0_376, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_302|, #pthreadsForks=|v_#pthreadsForks_469|, ~B~0=v_~B~0_200, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_296|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_220|, #memory_int=|v_#memory_int_690|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_238|, ~end~0=v_~end~0_767, ~queue~0.base=v_~queue~0.base_374, ~n~0=v_~n~0_380} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_250|, ~queue~0.offset=v_~queue~0.offset_374, ~A~0=v_~A~0_376, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_301|, ~B~0=v_~B~0_200, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_220|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_170|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_238|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_389|, ~queue~0.base=v_~queue~0.base_374, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_106|, #pthreadsForks=|v_#pthreadsForks_468|, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_170|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_295|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_170|, #memory_int=|v_#memory_int_689|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_264|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_168|, ~end~0=v_~end~0_766, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_221|, ~n~0=v_~n~0_380, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_411|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_168|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_170|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork2_#t~post1#1, #pthreadsForks, thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, ULTIMATE.start_main_#t~nondet17#1, thread2Thread1of1ForFork0_~x~1#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [580] L67-5-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_31| (+ |v_thread2Thread1of1ForFork0_~i~1#1_32| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_32| 4294967296) (mod v_~A~0_35 4294967296)) (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_30| v_~B~0_29) |v_thread2Thread1of1ForFork0_~x~1#1_29|)) InVars {~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_32|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_30|} OutVars{~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_31|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_13|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] [2022-12-06 00:24:39,173 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:24:39,174 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 961 [2022-12-06 00:24:39,174 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 649 transitions, 16184 flow [2022-12-06 00:24:39,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.55) internal successors, (51), 20 states have internal predecessors, (51), 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 00:24:39,174 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:24:39,174 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:24:39,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-06 00:24:39,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:24:39,380 INFO L420 AbstractCegarLoop]: === Iteration 81 === 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 00:24:39,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:24:39,380 INFO L85 PathProgramCache]: Analyzing trace with hash 2100281693, now seen corresponding path program 1 times [2022-12-06 00:24:39,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:24:39,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044027933] [2022-12-06 00:24:39,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:24:39,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:24:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:24:39,448 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 00:24:39,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:24:39,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044027933] [2022-12-06 00:24:39,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044027933] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:24:39,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:24:39,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:24:39,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495542798] [2022-12-06 00:24:39,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:24:39,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:24:39,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:24:39,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:24:39,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:24:39,449 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 00:24:39,449 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 649 transitions, 16184 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:24:39,450 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:24:39,450 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 00:24:39,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:24:41,541 INFO L130 PetriNetUnfolder]: 4180/7790 cut-off events. [2022-12-06 00:24:41,542 INFO L131 PetriNetUnfolder]: For 290550/290550 co-relation queries the response was YES. [2022-12-06 00:24:41,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76634 conditions, 7790 events. 4180/7790 cut-off events. For 290550/290550 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 59526 event pairs, 1258 based on Foata normal form. 5/7795 useless extension candidates. Maximal degree in co-relation 76397. Up to 7473 conditions per place. [2022-12-06 00:24:41,629 INFO L137 encePairwiseOnDemand]: 38/45 looper letters, 660 selfloop transitions, 17 changer transitions 5/682 dead transitions. [2022-12-06 00:24:41,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 682 transitions, 17900 flow [2022-12-06 00:24:41,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:24:41,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:24:41,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-12-06 00:24:41,630 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37222222222222223 [2022-12-06 00:24:41,630 INFO L175 Difference]: Start difference. First operand has 321 places, 649 transitions, 16184 flow. Second operand 4 states and 67 transitions. [2022-12-06 00:24:41,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 682 transitions, 17900 flow [2022-12-06 00:24:43,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 682 transitions, 17464 flow, removed 12 selfloop flow, removed 9 redundant places. [2022-12-06 00:24:43,502 INFO L231 Difference]: Finished difference. Result has 315 places, 646 transitions, 15690 flow [2022-12-06 00:24:43,503 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=15709, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=647, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=15690, PETRI_PLACES=315, PETRI_TRANSITIONS=646} [2022-12-06 00:24:43,503 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 286 predicate places. [2022-12-06 00:24:43,503 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:24:43,503 INFO L89 Accepts]: Start accepts. Operand has 315 places, 646 transitions, 15690 flow [2022-12-06 00:24:43,506 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:24:43,506 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:24:43,506 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 315 places, 646 transitions, 15690 flow [2022-12-06 00:24:43,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 314 places, 646 transitions, 15690 flow [2022-12-06 00:24:44,000 INFO L130 PetriNetUnfolder]: 905/3275 cut-off events. [2022-12-06 00:24:44,001 INFO L131 PetriNetUnfolder]: For 78783/78973 co-relation queries the response was YES. [2022-12-06 00:24:44,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25937 conditions, 3275 events. 905/3275 cut-off events. For 78783/78973 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 35012 event pairs, 27 based on Foata normal form. 11/3220 useless extension candidates. Maximal degree in co-relation 25619. Up to 558 conditions per place. [2022-12-06 00:24:44,053 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 314 places, 646 transitions, 15690 flow [2022-12-06 00:24:44,053 INFO L188 LiptonReduction]: Number of co-enabled transitions 3130 [2022-12-06 00:24:44,055 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:24:44,056 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 553 [2022-12-06 00:24:44,056 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 646 transitions, 15690 flow [2022-12-06 00:24:44,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:24:44,056 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:24:44,056 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 00:24:44,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2022-12-06 00:24:44,056 INFO L420 AbstractCegarLoop]: === Iteration 82 === 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 00:24:44,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:24:44,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1178954094, now seen corresponding path program 1 times [2022-12-06 00:24:44,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:24:44,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705345681] [2022-12-06 00:24:44,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:24:44,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:24:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:24:44,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:24:44,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:24:44,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705345681] [2022-12-06 00:24:44,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705345681] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:24:44,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584964396] [2022-12-06 00:24:44,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:24:44,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:24:44,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:24:44,130 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:24:44,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-06 00:24:44,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:24:44,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 00:24:44,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:24:44,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:24:44,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:24:44,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:24:44,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584964396] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:24:44,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:24:44,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-12-06 00:24:44,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457462823] [2022-12-06 00:24:44,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:24:44,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 00:24:44,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:24:44,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 00:24:44,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-12-06 00:24:44,395 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 00:24:44,395 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 646 transitions, 15690 flow. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 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 00:24:44,395 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:24:44,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 00:24:44,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:24:47,660 INFO L130 PetriNetUnfolder]: 5184/10104 cut-off events. [2022-12-06 00:24:47,660 INFO L131 PetriNetUnfolder]: For 339863/339863 co-relation queries the response was YES. [2022-12-06 00:24:47,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94337 conditions, 10104 events. 5184/10104 cut-off events. For 339863/339863 co-relation queries the response was YES. Maximal size of possible extension queue 615. Compared 84536 event pairs, 539 based on Foata normal form. 210/10314 useless extension candidates. Maximal degree in co-relation 93030. Up to 2781 conditions per place. [2022-12-06 00:24:47,945 INFO L137 encePairwiseOnDemand]: 20/44 looper letters, 580 selfloop transitions, 376 changer transitions 44/1000 dead transitions. [2022-12-06 00:24:47,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 1000 transitions, 24231 flow [2022-12-06 00:24:47,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 00:24:47,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 00:24:47,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 201 transitions. [2022-12-06 00:24:47,957 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2537878787878788 [2022-12-06 00:24:47,957 INFO L175 Difference]: Start difference. First operand has 314 places, 646 transitions, 15690 flow. Second operand 18 states and 201 transitions. [2022-12-06 00:24:47,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 1000 transitions, 24231 flow [2022-12-06 00:24:50,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 1000 transitions, 23701 flow, removed 13 selfloop flow, removed 7 redundant places. [2022-12-06 00:24:50,666 INFO L231 Difference]: Finished difference. Result has 331 places, 693 transitions, 17660 flow [2022-12-06 00:24:50,667 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=14440, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=276, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=17660, PETRI_PLACES=331, PETRI_TRANSITIONS=693} [2022-12-06 00:24:50,667 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 302 predicate places. [2022-12-06 00:24:50,667 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:24:50,667 INFO L89 Accepts]: Start accepts. Operand has 331 places, 693 transitions, 17660 flow [2022-12-06 00:24:50,670 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:24:50,671 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:24:50,671 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 331 places, 693 transitions, 17660 flow [2022-12-06 00:24:50,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 327 places, 693 transitions, 17660 flow [2022-12-06 00:24:51,330 INFO L130 PetriNetUnfolder]: 1036/4246 cut-off events. [2022-12-06 00:24:51,330 INFO L131 PetriNetUnfolder]: For 99604/99866 co-relation queries the response was YES. [2022-12-06 00:24:51,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32926 conditions, 4246 events. 1036/4246 cut-off events. For 99604/99866 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 49693 event pairs, 41 based on Foata normal form. 3/4150 useless extension candidates. Maximal degree in co-relation 32759. Up to 732 conditions per place. [2022-12-06 00:24:51,399 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 327 places, 693 transitions, 17660 flow [2022-12-06 00:24:51,399 INFO L188 LiptonReduction]: Number of co-enabled transitions 3494 [2022-12-06 00:24:51,401 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:24:51,401 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 734 [2022-12-06 00:24:51,402 INFO L495 AbstractCegarLoop]: Abstraction has has 327 places, 693 transitions, 17660 flow [2022-12-06 00:24:51,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 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 00:24:51,402 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:24:51,402 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 00:24:51,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-06 00:24:51,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:24:51,611 INFO L420 AbstractCegarLoop]: === Iteration 83 === 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 00:24:51,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:24:51,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1818362406, now seen corresponding path program 2 times [2022-12-06 00:24:51,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:24:51,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047653772] [2022-12-06 00:24:51,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:24:51,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:24:51,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:24:52,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:24:52,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:24:52,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047653772] [2022-12-06 00:24:52,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047653772] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:24:52,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441563725] [2022-12-06 00:24:52,580 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 00:24:52,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:24:52,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:24:52,581 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:24:52,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-06 00:24:53,088 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 00:24:53,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 00:24:53,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-06 00:24:53,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:24:53,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:24:53,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:24:53,516 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-06 00:24:53,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 34 [2022-12-06 00:24:53,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:24:53,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441563725] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:24:53,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:24:53,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 23 [2022-12-06 00:24:53,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817288893] [2022-12-06 00:24:53,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:24:53,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 00:24:53,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:24:53,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 00:24:53,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2022-12-06 00:24:53,591 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 00:24:53,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 693 transitions, 17660 flow. Second operand has 24 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 24 states have internal predecessors, (57), 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 00:24:53,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:24:53,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 00:24:53,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:24:58,701 INFO L130 PetriNetUnfolder]: 5154/9989 cut-off events. [2022-12-06 00:24:58,702 INFO L131 PetriNetUnfolder]: For 357851/357851 co-relation queries the response was YES. [2022-12-06 00:24:58,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96856 conditions, 9989 events. 5154/9989 cut-off events. For 357851/357851 co-relation queries the response was YES. Maximal size of possible extension queue 608. Compared 83178 event pairs, 827 based on Foata normal form. 4/9993 useless extension candidates. Maximal degree in co-relation 95732. Up to 4573 conditions per place. [2022-12-06 00:24:58,868 INFO L137 encePairwiseOnDemand]: 19/44 looper letters, 453 selfloop transitions, 356 changer transitions 31/840 dead transitions. [2022-12-06 00:24:58,868 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 840 transitions, 20714 flow [2022-12-06 00:24:58,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-06 00:24:58,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-06 00:24:58,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 209 transitions. [2022-12-06 00:24:58,869 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20652173913043478 [2022-12-06 00:24:58,869 INFO L175 Difference]: Start difference. First operand has 327 places, 693 transitions, 17660 flow. Second operand 23 states and 209 transitions. [2022-12-06 00:24:58,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 840 transitions, 20714 flow [2022-12-06 00:25:01,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 840 transitions, 19844 flow, removed 180 selfloop flow, removed 14 redundant places. [2022-12-06 00:25:01,856 INFO L231 Difference]: Finished difference. Result has 345 places, 712 transitions, 18494 flow [2022-12-06 00:25:01,856 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=16857, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=693, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=337, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=18494, PETRI_PLACES=345, PETRI_TRANSITIONS=712} [2022-12-06 00:25:01,857 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 316 predicate places. [2022-12-06 00:25:01,857 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:25:01,857 INFO L89 Accepts]: Start accepts. Operand has 345 places, 712 transitions, 18494 flow [2022-12-06 00:25:01,860 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:25:01,860 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:25:01,860 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 345 places, 712 transitions, 18494 flow [2022-12-06 00:25:01,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 342 places, 712 transitions, 18494 flow [2022-12-06 00:25:02,610 INFO L130 PetriNetUnfolder]: 1052/4251 cut-off events. [2022-12-06 00:25:02,610 INFO L131 PetriNetUnfolder]: For 104110/104386 co-relation queries the response was YES. [2022-12-06 00:25:02,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33855 conditions, 4251 events. 1052/4251 cut-off events. For 104110/104386 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 49492 event pairs, 43 based on Foata normal form. 1/4151 useless extension candidates. Maximal degree in co-relation 33517. Up to 739 conditions per place. [2022-12-06 00:25:02,691 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 342 places, 712 transitions, 18494 flow [2022-12-06 00:25:02,691 INFO L188 LiptonReduction]: Number of co-enabled transitions 3580 [2022-12-06 00:25:02,731 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [632] $Ultimate##0-->L51-5: Formula: (and (< (mod (+ |v_thread1Thread1of1ForFork2_~i~0#1_110| 4294967295) 4294967296) (mod v_~A~0_158 4294967296)) (= |v_thread1Thread1of1ForFork2_~x~0#1_115| v_~B~0_84) (= |v_thread1Thread1of1ForFork2_~i~0#1_110| 1)) InVars {~A~0=v_~A~0_158, ~B~0=v_~B~0_84} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_40|, ~A~0=v_~A~0_158, ~B~0=v_~B~0_84, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_115|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_110|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] and [580] L67-5-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_31| (+ |v_thread2Thread1of1ForFork0_~i~1#1_32| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_32| 4294967296) (mod v_~A~0_35 4294967296)) (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_30| v_~B~0_29) |v_thread2Thread1of1ForFork0_~x~1#1_29|)) InVars {~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_32|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_30|} OutVars{~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_31|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_13|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] [2022-12-06 00:25:02,877 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:25:02,988 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [580] L67-5-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_31| (+ |v_thread2Thread1of1ForFork0_~i~1#1_32| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_32| 4294967296) (mod v_~A~0_35 4294967296)) (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_30| v_~B~0_29) |v_thread2Thread1of1ForFork0_~x~1#1_29|)) InVars {~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_32|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_30|} OutVars{~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_31|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_13|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] [2022-12-06 00:25:03,105 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:25:03,105 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1248 [2022-12-06 00:25:03,105 INFO L495 AbstractCegarLoop]: Abstraction has has 341 places, 711 transitions, 18559 flow [2022-12-06 00:25:03,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 24 states have internal predecessors, (57), 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 00:25:03,106 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:25:03,106 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 00:25:03,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-06 00:25:03,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:25:03,312 INFO L420 AbstractCegarLoop]: === Iteration 84 === 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 00:25:03,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:25:03,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1722175800, now seen corresponding path program 3 times [2022-12-06 00:25:03,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:25:03,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234565906] [2022-12-06 00:25:03,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:25:03,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:25:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:25:04,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:25:04,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:25:04,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234565906] [2022-12-06 00:25:04,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234565906] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:25:04,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596384683] [2022-12-06 00:25:04,005 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 00:25:04,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:25:04,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:25:04,008 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:25:04,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-06 00:25:04,253 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 00:25:04,253 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 00:25:04,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-06 00:25:04,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:25:04,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-12-06 00:25:04,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 00:25:04,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 00:25:04,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 00:25:04,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:25:04,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:25:04,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:25:04,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596384683] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:25:04,849 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:25:04,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 7] total 24 [2022-12-06 00:25:04,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025912163] [2022-12-06 00:25:04,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:25:04,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 00:25:04,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:25:04,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 00:25:04,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2022-12-06 00:25:04,850 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 00:25:04,851 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 711 transitions, 18559 flow. Second operand has 25 states, 24 states have (on average 2.375) internal successors, (57), 25 states have internal predecessors, (57), 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 00:25:04,851 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:25:04,851 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 00:25:04,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:25:12,712 INFO L130 PetriNetUnfolder]: 5684/10878 cut-off events. [2022-12-06 00:25:12,712 INFO L131 PetriNetUnfolder]: For 424820/424820 co-relation queries the response was YES. [2022-12-06 00:25:12,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110669 conditions, 10878 events. 5684/10878 cut-off events. For 424820/424820 co-relation queries the response was YES. Maximal size of possible extension queue 624. Compared 90030 event pairs, 688 based on Foata normal form. 4/10882 useless extension candidates. Maximal degree in co-relation 110253. Up to 4367 conditions per place. [2022-12-06 00:25:12,861 INFO L137 encePairwiseOnDemand]: 17/49 looper letters, 501 selfloop transitions, 482 changer transitions 41/1024 dead transitions. [2022-12-06 00:25:12,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 1024 transitions, 25441 flow [2022-12-06 00:25:12,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-12-06 00:25:12,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2022-12-06 00:25:12,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 323 transitions. [2022-12-06 00:25:12,862 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17346938775510204 [2022-12-06 00:25:12,862 INFO L175 Difference]: Start difference. First operand has 341 places, 711 transitions, 18559 flow. Second operand 38 states and 323 transitions. [2022-12-06 00:25:12,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 1024 transitions, 25441 flow [2022-12-06 00:25:16,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 1024 transitions, 24906 flow, removed 134 selfloop flow, removed 7 redundant places. [2022-12-06 00:25:16,551 INFO L231 Difference]: Finished difference. Result has 387 places, 843 transitions, 23341 flow [2022-12-06 00:25:16,551 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=18173, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=711, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=354, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=23341, PETRI_PLACES=387, PETRI_TRANSITIONS=843} [2022-12-06 00:25:16,552 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 358 predicate places. [2022-12-06 00:25:16,552 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:25:16,552 INFO L89 Accepts]: Start accepts. Operand has 387 places, 843 transitions, 23341 flow [2022-12-06 00:25:16,555 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:25:16,555 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:25:16,555 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 387 places, 843 transitions, 23341 flow [2022-12-06 00:25:16,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 385 places, 843 transitions, 23341 flow [2022-12-06 00:25:17,374 INFO L130 PetriNetUnfolder]: 1202/4625 cut-off events. [2022-12-06 00:25:17,375 INFO L131 PetriNetUnfolder]: For 130377/130480 co-relation queries the response was YES. [2022-12-06 00:25:17,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39837 conditions, 4625 events. 1202/4625 cut-off events. For 130377/130480 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 53129 event pairs, 25 based on Foata normal form. 0/4596 useless extension candidates. Maximal degree in co-relation 39557. Up to 792 conditions per place. [2022-12-06 00:25:17,466 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 385 places, 843 transitions, 23341 flow [2022-12-06 00:25:17,466 INFO L188 LiptonReduction]: Number of co-enabled transitions 4118 [2022-12-06 00:25:17,468 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] $Ultimate##0-->L51-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_245| 0) (= |v_thread1Thread1of1ForFork2_~x~0#1_210| (+ |v_thread1Thread1of1ForFork2_~x~0#1_211| v_~B~0_166)) (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_206| 4294967296) (mod v_~A~0_286 4294967296)) (= |v_thread2Thread1of1ForFork0_~x~1#1_256| 0) (= |v_thread1Thread1of1ForFork2_~i~0#1_205| (+ |v_thread1Thread1of1ForFork2_~i~0#1_206| 1))) InVars {~A~0=v_~A~0_286, ~B~0=v_~B~0_166, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_211|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_206|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_81|, ~A~0=v_~A~0_286, ~B~0=v_~B~0_166, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_210|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_205|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_245|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_256|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_~x~1#1] and [580] L67-5-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_31| (+ |v_thread2Thread1of1ForFork0_~i~1#1_32| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_32| 4294967296) (mod v_~A~0_35 4294967296)) (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_30| v_~B~0_29) |v_thread2Thread1of1ForFork0_~x~1#1_29|)) InVars {~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_32|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_30|} OutVars{~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_31|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_13|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] [2022-12-06 00:25:17,851 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [741] $Ultimate##0-->L67-5: Formula: (and (= |v_thread1Thread1of1ForFork2_~i~0#1_313| 1) (= |v_thread1Thread1of1ForFork2_~x~0#1_320| v_~B~0_206) (= |v_thread2Thread1of1ForFork0_~x~1#1_427| (+ |v_thread2Thread1of1ForFork0_~x~1#1_428| v_~B~0_206)) (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_405| 1) |v_thread2Thread1of1ForFork0_~i~1#1_404|) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_405| 4294967296) (mod v_~A~0_382 4294967296))) InVars {~A~0=v_~A~0_382, ~B~0=v_~B~0_206, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_405|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_428|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_119|, ~A~0=v_~A~0_382, ~B~0=v_~B~0_206, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_320|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_313|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_404|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_154|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_427|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:25:17,905 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [741] $Ultimate##0-->L67-5: Formula: (and (= |v_thread1Thread1of1ForFork2_~i~0#1_313| 1) (= |v_thread1Thread1of1ForFork2_~x~0#1_320| v_~B~0_206) (= |v_thread2Thread1of1ForFork0_~x~1#1_427| (+ |v_thread2Thread1of1ForFork0_~x~1#1_428| v_~B~0_206)) (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_405| 1) |v_thread2Thread1of1ForFork0_~i~1#1_404|) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_405| 4294967296) (mod v_~A~0_382 4294967296))) InVars {~A~0=v_~A~0_382, ~B~0=v_~B~0_206, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_405|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_428|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_119|, ~A~0=v_~A~0_382, ~B~0=v_~B~0_206, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_320|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_313|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_404|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_154|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_427|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] and [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] [2022-12-06 00:25:18,099 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [741] $Ultimate##0-->L67-5: Formula: (and (= |v_thread1Thread1of1ForFork2_~i~0#1_313| 1) (= |v_thread1Thread1of1ForFork2_~x~0#1_320| v_~B~0_206) (= |v_thread2Thread1of1ForFork0_~x~1#1_427| (+ |v_thread2Thread1of1ForFork0_~x~1#1_428| v_~B~0_206)) (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_405| 1) |v_thread2Thread1of1ForFork0_~i~1#1_404|) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_405| 4294967296) (mod v_~A~0_382 4294967296))) InVars {~A~0=v_~A~0_382, ~B~0=v_~B~0_206, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_405|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_428|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_119|, ~A~0=v_~A~0_382, ~B~0=v_~B~0_206, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_320|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_313|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_404|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_154|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_427|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] and [600] L51-5-->L51-5: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_~i~0#1_28| 1) |v_thread1Thread1of1ForFork2_~i~0#1_27|) (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_28| 4294967296) (mod v_~A~0_57 4294967296)) (= |v_thread1Thread1of1ForFork2_~x~0#1_31| (+ |v_thread1Thread1of1ForFork2_~x~0#1_32| v_~B~0_47))) InVars {~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_32|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_28|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_15|, ~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_31|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] [2022-12-06 00:25:18,306 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] and [580] L67-5-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_31| (+ |v_thread2Thread1of1ForFork0_~i~1#1_32| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_32| 4294967296) (mod v_~A~0_35 4294967296)) (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_30| v_~B~0_29) |v_thread2Thread1of1ForFork0_~x~1#1_29|)) InVars {~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_32|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_30|} OutVars{~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_31|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_13|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] [2022-12-06 00:25:18,385 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [600] L51-5-->L51-5: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_~i~0#1_28| 1) |v_thread1Thread1of1ForFork2_~i~0#1_27|) (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_28| 4294967296) (mod v_~A~0_57 4294967296)) (= |v_thread1Thread1of1ForFork2_~x~0#1_31| (+ |v_thread1Thread1of1ForFork2_~x~0#1_32| v_~B~0_47))) InVars {~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_32|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_28|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_15|, ~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_31|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] [2022-12-06 00:25:18,625 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] [2022-12-06 00:25:18,915 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:25:19,080 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [580] L67-5-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_31| (+ |v_thread2Thread1of1ForFork0_~i~1#1_32| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_32| 4294967296) (mod v_~A~0_35 4294967296)) (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_30| v_~B~0_29) |v_thread2Thread1of1ForFork0_~x~1#1_29|)) InVars {~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_32|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_30|} OutVars{~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_31|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_13|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] and [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] [2022-12-06 00:25:19,729 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [580] L67-5-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_31| (+ |v_thread2Thread1of1ForFork0_~i~1#1_32| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_32| 4294967296) (mod v_~A~0_35 4294967296)) (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_30| v_~B~0_29) |v_thread2Thread1of1ForFork0_~x~1#1_29|)) InVars {~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_32|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_30|} OutVars{~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_31|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_13|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] and [600] L51-5-->L51-5: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_~i~0#1_28| 1) |v_thread1Thread1of1ForFork2_~i~0#1_27|) (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_28| 4294967296) (mod v_~A~0_57 4294967296)) (= |v_thread1Thread1of1ForFork2_~x~0#1_31| (+ |v_thread1Thread1of1ForFork2_~x~0#1_32| v_~B~0_47))) InVars {~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_32|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_28|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_15|, ~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_31|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] [2022-12-06 00:25:19,773 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:25:19,902 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [632] $Ultimate##0-->L51-5: Formula: (and (< (mod (+ |v_thread1Thread1of1ForFork2_~i~0#1_110| 4294967295) 4294967296) (mod v_~A~0_158 4294967296)) (= |v_thread1Thread1of1ForFork2_~x~0#1_115| v_~B~0_84) (= |v_thread1Thread1of1ForFork2_~i~0#1_110| 1)) InVars {~A~0=v_~A~0_158, ~B~0=v_~B~0_84} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_40|, ~A~0=v_~A~0_158, ~B~0=v_~B~0_84, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_115|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_110|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:25:19,940 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L51-5-->L104-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre18#1_269| |v_#pthreadsForks_500|) (= |v_thread1Thread1of1ForFork2_#res#1.offset_191| 0) (= |v_thread1Thread1of1ForFork2_#res#1.base_191| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_193| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_193|) (= |v_#memory_int_744| (store |v_#memory_int_745| |v_ULTIMATE.start_main_~#t3~0#1.base_252| (store (select |v_#memory_int_745| |v_ULTIMATE.start_main_~#t3~0#1.base_252|) |v_ULTIMATE.start_main_~#t3~0#1.offset_234| |v_ULTIMATE.start_main_#t~pre18#1_269|))) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_193| (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_365| 4294967296) (mod (select (select |v_#memory_int_745| v_~queue~0.base_404) (+ (* v_~end~0_843 4) v_~queue~0.offset_404)) 4294967296)) 1 0)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_358| 4294967296) (mod v_~A~0_426 4294967296))) (not (= (ite (and (< v_~end~0_843 v_~n~0_410) (<= 0 v_~end~0_843)) 1 0) 0)) (= (+ |v_#pthreadsForks_500| 1) |v_#pthreadsForks_499|) (= v_~end~0_842 (+ v_~end~0_843 1)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_193| 0))) InVars {~queue~0.offset=v_~queue~0.offset_404, ~A~0=v_~A~0_426, #pthreadsForks=|v_#pthreadsForks_500|, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_365|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_358|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_234|, #memory_int=|v_#memory_int_745|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_252|, ~end~0=v_~end~0_843, ~queue~0.base=v_~queue~0.base_404, ~n~0=v_~n~0_410} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_269|, ~queue~0.offset=v_~queue~0.offset_404, ~A~0=v_~A~0_426, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_365|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_234|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_193|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_252|, ~queue~0.base=v_~queue~0.base_404, #pthreadsForks=|v_#pthreadsForks_499|, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_193|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_358|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_193|, #memory_int=|v_#memory_int_744|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_281|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_191|, ~end~0=v_~end~0_842, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_237|, ~n~0=v_~n~0_410, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_191|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_193|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, ULTIMATE.start_main_#t~nondet17#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [580] L67-5-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_31| (+ |v_thread2Thread1of1ForFork0_~i~1#1_32| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_32| 4294967296) (mod v_~A~0_35 4294967296)) (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_30| v_~B~0_29) |v_thread2Thread1of1ForFork0_~x~1#1_29|)) InVars {~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_32|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_30|} OutVars{~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_31|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_13|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] [2022-12-06 00:25:20,165 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [764] $Ultimate##0-->L104-3: Formula: (and (= |v_#pthreadsForks_503| (+ |v_#pthreadsForks_504| 1)) (< (mod (+ |v_thread1Thread1of1ForFork2_~i~0#1_360| 4294967295) 4294967296) (mod v_~A~0_428 4294967296)) (= (store |v_#memory_int_749| |v_ULTIMATE.start_main_~#t3~0#1.base_254| (store (select |v_#memory_int_749| |v_ULTIMATE.start_main_~#t3~0#1.base_254|) |v_ULTIMATE.start_main_~#t3~0#1.offset_236| |v_ULTIMATE.start_main_#t~pre18#1_271|)) |v_#memory_int_748|) (= |v_thread1Thread1of1ForFork2_~x~0#1_367| v_~B~0_244) (= |v_ULTIMATE.start_main_#t~pre18#1_271| |v_#pthreadsForks_504|) (= |v_thread1Thread1of1ForFork2_~i~0#1_360| 1)) InVars {~A~0=v_~A~0_428, #pthreadsForks=|v_#pthreadsForks_504|, ~B~0=v_~B~0_244, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_236|, #memory_int=|v_#memory_int_749|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_254|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_271|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_146|, ~A~0=v_~A~0_428, #pthreadsForks=|v_#pthreadsForks_503|, ~B~0=v_~B~0_244, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_367|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_360|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_236|, #memory_int=|v_#memory_int_748|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_254|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_283|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_239|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread1Thread1of1ForFork2_#t~post1#1, #pthreadsForks, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] and [600] L51-5-->L51-5: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_~i~0#1_28| 1) |v_thread1Thread1of1ForFork2_~i~0#1_27|) (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_28| 4294967296) (mod v_~A~0_57 4294967296)) (= |v_thread1Thread1of1ForFork2_~x~0#1_31| (+ |v_thread1Thread1of1ForFork2_~x~0#1_32| v_~B~0_47))) InVars {~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_32|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_28|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_15|, ~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_31|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] [2022-12-06 00:25:20,230 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [764] $Ultimate##0-->L104-3: Formula: (and (= |v_#pthreadsForks_503| (+ |v_#pthreadsForks_504| 1)) (< (mod (+ |v_thread1Thread1of1ForFork2_~i~0#1_360| 4294967295) 4294967296) (mod v_~A~0_428 4294967296)) (= (store |v_#memory_int_749| |v_ULTIMATE.start_main_~#t3~0#1.base_254| (store (select |v_#memory_int_749| |v_ULTIMATE.start_main_~#t3~0#1.base_254|) |v_ULTIMATE.start_main_~#t3~0#1.offset_236| |v_ULTIMATE.start_main_#t~pre18#1_271|)) |v_#memory_int_748|) (= |v_thread1Thread1of1ForFork2_~x~0#1_367| v_~B~0_244) (= |v_ULTIMATE.start_main_#t~pre18#1_271| |v_#pthreadsForks_504|) (= |v_thread1Thread1of1ForFork2_~i~0#1_360| 1)) InVars {~A~0=v_~A~0_428, #pthreadsForks=|v_#pthreadsForks_504|, ~B~0=v_~B~0_244, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_236|, #memory_int=|v_#memory_int_749|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_254|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_271|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_146|, ~A~0=v_~A~0_428, #pthreadsForks=|v_#pthreadsForks_503|, ~B~0=v_~B~0_244, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_367|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_360|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_236|, #memory_int=|v_#memory_int_748|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_254|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_283|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_239|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread1Thread1of1ForFork2_#t~post1#1, #pthreadsForks, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] and [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] [2022-12-06 00:25:20,417 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [580] L67-5-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_31| (+ |v_thread2Thread1of1ForFork0_~i~1#1_32| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_32| 4294967296) (mod v_~A~0_35 4294967296)) (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_30| v_~B~0_29) |v_thread2Thread1of1ForFork0_~x~1#1_29|)) InVars {~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_32|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_30|} OutVars{~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_31|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_13|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] and [600] L51-5-->L51-5: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_~i~0#1_28| 1) |v_thread1Thread1of1ForFork2_~i~0#1_27|) (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_28| 4294967296) (mod v_~A~0_57 4294967296)) (= |v_thread1Thread1of1ForFork2_~x~0#1_31| (+ |v_thread1Thread1of1ForFork2_~x~0#1_32| v_~B~0_47))) InVars {~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_32|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_28|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_15|, ~A~0=v_~A~0_57, ~B~0=v_~B~0_47, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_31|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] [2022-12-06 00:25:20,589 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [580] L67-5-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_31| (+ |v_thread2Thread1of1ForFork0_~i~1#1_32| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_32| 4294967296) (mod v_~A~0_35 4294967296)) (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_30| v_~B~0_29) |v_thread2Thread1of1ForFork0_~x~1#1_29|)) InVars {~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_32|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_30|} OutVars{~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_31|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_13|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] and [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] [2022-12-06 00:25:20,761 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [768] L67-5-->L51-5: Formula: (let ((.cse0 (mod v_~A~0_436 4294967296))) (and (= |v_thread1Thread1of1ForFork2_~i~0#1_370| (+ |v_thread1Thread1of1ForFork2_~i~0#1_371| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_491| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork0_~x~1#1_514| (+ |v_thread2Thread1of1ForFork0_~x~1#1_515| v_~B~0_252)) (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_371| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork0_~i~1#1_490| (+ |v_thread2Thread1of1ForFork0_~i~1#1_491| 1)) (= |v_thread1Thread1of1ForFork2_~x~0#1_377| (+ |v_thread1Thread1of1ForFork2_~x~0#1_378| v_~B~0_252)))) InVars {~A~0=v_~A~0_436, ~B~0=v_~B~0_252, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_378|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_371|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_491|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_515|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_154|, ~A~0=v_~A~0_436, ~B~0=v_~B~0_252, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_377|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_370|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_490|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_195|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_514|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] and [757] L67-5-->thread1EXIT: Formula: (let ((.cse0 (mod v_~A~0_414 4294967296))) (and (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_346| 4294967296) .cse0)) (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_353| 4294967296) (mod (select (select |v_#memory_int_734| v_~queue~0.base_396) (+ (* v_~end~0_827 4) v_~queue~0.offset_396)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_189|) (= |v_thread1Thread1of1ForFork2_#res#1.offset_187| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_189| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_189|) (= |v_thread2Thread1of1ForFork0_~x~1#1_484| (+ |v_thread2Thread1of1ForFork0_~x~1#1_485| v_~B~0_232)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_189| 0)) (= |v_thread2Thread1of1ForFork0_~i~1#1_460| (+ |v_thread2Thread1of1ForFork0_~i~1#1_461| 1)) (= v_~end~0_826 (+ v_~end~0_827 1)) (= |v_thread1Thread1of1ForFork2_#res#1.base_187| 0) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_461| 4294967296) .cse0) (not (= (ite (and (<= 0 v_~end~0_827) (< v_~end~0_827 v_~n~0_402)) 1 0) 0)))) InVars {~queue~0.offset=v_~queue~0.offset_396, ~A~0=v_~A~0_414, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_353|, ~B~0=v_~B~0_232, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_346|, #memory_int=|v_#memory_int_734|, ~end~0=v_~end~0_827, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_461|, ~queue~0.base=v_~queue~0.base_396, ~n~0=v_~n~0_402, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_485|} OutVars{~queue~0.offset=v_~queue~0.offset_396, ~A~0=v_~A~0_414, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_353|, ~B~0=v_~B~0_232, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_189|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_460|, ~queue~0.base=v_~queue~0.base_396, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_189|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_346|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_189|, #memory_int=|v_#memory_int_734|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_187|, ~end~0=v_~end~0_826, ~n~0=v_~n~0_402, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_179|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_484|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_187|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_189|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] [2022-12-06 00:25:20,958 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [768] L67-5-->L51-5: Formula: (let ((.cse0 (mod v_~A~0_436 4294967296))) (and (= |v_thread1Thread1of1ForFork2_~i~0#1_370| (+ |v_thread1Thread1of1ForFork2_~i~0#1_371| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_491| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork0_~x~1#1_514| (+ |v_thread2Thread1of1ForFork0_~x~1#1_515| v_~B~0_252)) (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_371| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork0_~i~1#1_490| (+ |v_thread2Thread1of1ForFork0_~i~1#1_491| 1)) (= |v_thread1Thread1of1ForFork2_~x~0#1_377| (+ |v_thread1Thread1of1ForFork2_~x~0#1_378| v_~B~0_252)))) InVars {~A~0=v_~A~0_436, ~B~0=v_~B~0_252, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_378|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_371|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_491|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_515|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_154|, ~A~0=v_~A~0_436, ~B~0=v_~B~0_252, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_377|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_370|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_490|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_195|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_514|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] and [758] L67-5-->L51-5: Formula: (let ((.cse0 (mod v_~A~0_416 4294967296))) (and (not (= (ite (and (< v_~end~0_831 v_~n~0_404) (<= 0 v_~end~0_831)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_465| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork0_#res#1.base_201| 0) (= (ite (= (mod (select (select |v_#memory_int_736| v_~queue~0.base_398) (+ (* v_~end~0_831 4) v_~queue~0.offset_398)) 4294967296) (mod |v_thread2Thread1of1ForFork0_~x~1#1_488| 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_211|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_211| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_211|) (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_349| 4294967296) .cse0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_464| 4294967296) .cse0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_201| 0) (= |v_thread2Thread1of1ForFork0_~i~1#1_464| (+ |v_thread2Thread1of1ForFork0_~i~1#1_465| 1)) (= v_~end~0_830 (+ v_~end~0_831 1)) (= |v_thread2Thread1of1ForFork0_~x~1#1_488| (+ |v_thread2Thread1of1ForFork0_~x~1#1_489| v_~B~0_234)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_211| 0)) (= |v_thread1Thread1of1ForFork2_~x~0#1_355| (+ |v_thread1Thread1of1ForFork2_~x~0#1_356| v_~B~0_234)) (= |v_thread1Thread1of1ForFork2_~i~0#1_348| (+ |v_thread1Thread1of1ForFork2_~i~0#1_349| 1)))) InVars {~queue~0.offset=v_~queue~0.offset_398, ~A~0=v_~A~0_416, ~B~0=v_~B~0_234, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_356|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_349|, #memory_int=|v_#memory_int_736|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_465|, ~end~0=v_~end~0_831, ~queue~0.base=v_~queue~0.base_398, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_489|, ~n~0=v_~n~0_404} OutVars{~queue~0.offset=v_~queue~0.offset_398, ~A~0=v_~A~0_416, ~B~0=v_~B~0_234, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_355|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_201|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_211|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_464|, ~queue~0.base=v_~queue~0.base_398, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_211|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_142|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_201|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_348|, #memory_int=|v_#memory_int_736|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_211|, ~end~0=v_~end~0_830, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_488|, ~n~0=v_~n~0_404, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_181|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_211|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~x~0#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_#t~post1#1, thread2Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork2_~i~0#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_~x~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1] [2022-12-06 00:25:21,362 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [768] L67-5-->L51-5: Formula: (let ((.cse0 (mod v_~A~0_436 4294967296))) (and (= |v_thread1Thread1of1ForFork2_~i~0#1_370| (+ |v_thread1Thread1of1ForFork2_~i~0#1_371| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_491| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork0_~x~1#1_514| (+ |v_thread2Thread1of1ForFork0_~x~1#1_515| v_~B~0_252)) (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_371| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork0_~i~1#1_490| (+ |v_thread2Thread1of1ForFork0_~i~1#1_491| 1)) (= |v_thread1Thread1of1ForFork2_~x~0#1_377| (+ |v_thread1Thread1of1ForFork2_~x~0#1_378| v_~B~0_252)))) InVars {~A~0=v_~A~0_436, ~B~0=v_~B~0_252, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_378|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_371|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_491|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_515|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_154|, ~A~0=v_~A~0_436, ~B~0=v_~B~0_252, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_377|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_370|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_490|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_195|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_514|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] and [759] L67-5-->thread1EXIT: Formula: (let ((.cse0 (mod v_~A~0_418 4294967296)) (.cse1 (select |v_#memory_int_738| v_~queue~0.base_400)) (.cse2 (* v_~end~0_835 4))) (and (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_469| 4294967296) .cse0) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_352| 4294967296) .cse0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_203| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_191| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_191|) (not (= (ite (and (<= 0 v_~end~0_835) (< v_~end~0_835 v_~n~0_406)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_203| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_191| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_213| (ite (= (mod (select .cse1 (+ .cse2 v_~queue~0.offset_400)) 4294967296) (mod |v_thread2Thread1of1ForFork0_~x~1#1_492| 4294967296)) 1 0)) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_468| 4294967296) .cse0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_189| 0) (not (= (ite (let ((.cse3 (+ v_~end~0_835 1))) (and (<= 0 .cse3) (< .cse3 v_~n~0_406))) 1 0) 0)) (= (ite (= (mod (select .cse1 (+ .cse2 v_~queue~0.offset_400 4)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_359| 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_191|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_213| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_213|) (= v_~end~0_834 (+ v_~end~0_835 2)) (= |v_thread2Thread1of1ForFork0_~i~1#1_468| (+ |v_thread2Thread1of1ForFork0_~i~1#1_469| 1)) (= |v_thread1Thread1of1ForFork2_#res#1.base_189| 0) (= |v_thread2Thread1of1ForFork0_~x~1#1_492| (+ |v_thread2Thread1of1ForFork0_~x~1#1_493| v_~B~0_236)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_213| 0)))) InVars {~queue~0.offset=v_~queue~0.offset_400, ~A~0=v_~A~0_418, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_359|, ~B~0=v_~B~0_236, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_352|, #memory_int=|v_#memory_int_738|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_469|, ~end~0=v_~end~0_835, ~queue~0.base=v_~queue~0.base_400, ~n~0=v_~n~0_406, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_493|} OutVars{~queue~0.offset=v_~queue~0.offset_400, ~A~0=v_~A~0_418, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_359|, ~B~0=v_~B~0_236, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_203|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_191|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_213|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_468|, ~queue~0.base=v_~queue~0.base_400, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_213|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_203|, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_191|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_352|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_191|, #memory_int=|v_#memory_int_738|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_189|, ~end~0=v_~end~0_834, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_213|, ~n~0=v_~n~0_406, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_492|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_183|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_189|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_191|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_213|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_~x~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post6#1] [2022-12-06 00:25:21,711 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [768] L67-5-->L51-5: Formula: (let ((.cse0 (mod v_~A~0_436 4294967296))) (and (= |v_thread1Thread1of1ForFork2_~i~0#1_370| (+ |v_thread1Thread1of1ForFork2_~i~0#1_371| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_491| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork0_~x~1#1_514| (+ |v_thread2Thread1of1ForFork0_~x~1#1_515| v_~B~0_252)) (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_371| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork0_~i~1#1_490| (+ |v_thread2Thread1of1ForFork0_~i~1#1_491| 1)) (= |v_thread1Thread1of1ForFork2_~x~0#1_377| (+ |v_thread1Thread1of1ForFork2_~x~0#1_378| v_~B~0_252)))) InVars {~A~0=v_~A~0_436, ~B~0=v_~B~0_252, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_378|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_371|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_491|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_515|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_154|, ~A~0=v_~A~0_436, ~B~0=v_~B~0_252, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_377|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_370|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_490|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_195|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_514|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] and [760] L67-5-->L104-3: Formula: (let ((.cse0 (mod v_~A~0_420 4294967296))) (and (= (store |v_#memory_int_741| |v_ULTIMATE.start_main_~#t3~0#1.base_250| (store (select |v_#memory_int_741| |v_ULTIMATE.start_main_~#t3~0#1.base_250|) |v_ULTIMATE.start_main_~#t3~0#1.offset_232| |v_ULTIMATE.start_main_#t~pre18#1_267|)) |v_#memory_int_740|) (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_473| 1) |v_thread2Thread1of1ForFork0_~i~1#1_472|) (= |v_thread2Thread1of1ForFork0_~x~1#1_496| (+ |v_thread2Thread1of1ForFork0_~x~1#1_497| v_~B~0_238)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_215| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_215|) (= |v_ULTIMATE.start_main_#t~pre18#1_267| |v_#pthreadsForks_496|) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_473| 4294967296) .cse0) (= v_~end~0_838 (+ v_~end~0_839 1)) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_472| 4294967296) .cse0)) (= |v_#pthreadsForks_495| (+ |v_#pthreadsForks_496| 1)) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_496| 4294967296) (mod (select (select |v_#memory_int_741| v_~queue~0.base_402) (+ (* v_~end~0_839 4) v_~queue~0.offset_402)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_215|) (= |v_thread2Thread1of1ForFork0_#res#1.offset_205| 0) (not (= (ite (and (<= 0 v_~end~0_839) (< v_~end~0_839 v_~n~0_408)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_215| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_205| 0))) InVars {~queue~0.offset=v_~queue~0.offset_402, ~A~0=v_~A~0_420, #pthreadsForks=|v_#pthreadsForks_496|, ~B~0=v_~B~0_238, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_232|, #memory_int=|v_#memory_int_741|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_250|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_473|, ~end~0=v_~end~0_839, ~queue~0.base=v_~queue~0.base_402, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_497|, ~n~0=v_~n~0_408} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_267|, ~queue~0.offset=v_~queue~0.offset_402, ~A~0=v_~A~0_420, ~B~0=v_~B~0_238, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_232|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_205|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_215|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_250|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_472|, ~queue~0.base=v_~queue~0.base_402, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_215|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_205|, #pthreadsForks=|v_#pthreadsForks_495|, #memory_int=|v_#memory_int_740|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_279|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_215|, ~end~0=v_~end~0_838, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_235|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_496|, ~n~0=v_~n~0_408, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_185|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_215|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, ULTIMATE.start_main_#t~nondet17#1, thread2Thread1of1ForFork0_~x~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1] [2022-12-06 00:25:21,954 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [768] L67-5-->L51-5: Formula: (let ((.cse0 (mod v_~A~0_436 4294967296))) (and (= |v_thread1Thread1of1ForFork2_~i~0#1_370| (+ |v_thread1Thread1of1ForFork2_~i~0#1_371| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_491| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork0_~x~1#1_514| (+ |v_thread2Thread1of1ForFork0_~x~1#1_515| v_~B~0_252)) (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_371| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork0_~i~1#1_490| (+ |v_thread2Thread1of1ForFork0_~i~1#1_491| 1)) (= |v_thread1Thread1of1ForFork2_~x~0#1_377| (+ |v_thread1Thread1of1ForFork2_~x~0#1_378| v_~B~0_252)))) InVars {~A~0=v_~A~0_436, ~B~0=v_~B~0_252, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_378|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_371|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_491|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_515|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_154|, ~A~0=v_~A~0_436, ~B~0=v_~B~0_252, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_377|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_370|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_490|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_195|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_514|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] and [761] L67-5-->L67-5: Formula: (let ((.cse0 (mod v_~A~0_422 4294967296))) (and (< (mod (+ |v_thread2Thread1of1ForFork0_~i~1#1_478| 1) 4294967296) .cse0) (= |v_thread2Thread1of1ForFork0_~x~1#1_500| (+ |v_thread2Thread1of1ForFork0_~x~1#1_502| (* 2 v_~B~0_240))) (= |v_thread2Thread1of1ForFork0_~i~1#1_476| (+ 2 |v_thread2Thread1of1ForFork0_~i~1#1_478|)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_478| 4294967296) .cse0))) InVars {~A~0=v_~A~0_422, ~B~0=v_~B~0_240, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_478|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_502|} OutVars{~A~0=v_~A~0_422, ~B~0=v_~B~0_240, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_476|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_187|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_500|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] [2022-12-06 00:25:22,084 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [768] L67-5-->L51-5: Formula: (let ((.cse0 (mod v_~A~0_436 4294967296))) (and (= |v_thread1Thread1of1ForFork2_~i~0#1_370| (+ |v_thread1Thread1of1ForFork2_~i~0#1_371| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_491| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork0_~x~1#1_514| (+ |v_thread2Thread1of1ForFork0_~x~1#1_515| v_~B~0_252)) (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_371| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork0_~i~1#1_490| (+ |v_thread2Thread1of1ForFork0_~i~1#1_491| 1)) (= |v_thread1Thread1of1ForFork2_~x~0#1_377| (+ |v_thread1Thread1of1ForFork2_~x~0#1_378| v_~B~0_252)))) InVars {~A~0=v_~A~0_436, ~B~0=v_~B~0_252, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_378|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_371|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_491|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_515|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_154|, ~A~0=v_~A~0_436, ~B~0=v_~B~0_252, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_377|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_370|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_490|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_195|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_514|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] and [762] L67-5-->L51-5: Formula: (let ((.cse0 (mod v_~A~0_424 4294967296))) (and (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_483| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork0_~x~1#1_506| (+ |v_thread2Thread1of1ForFork0_~x~1#1_507| v_~B~0_242)) (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_355| 4294967296) .cse0) (= |v_thread1Thread1of1ForFork2_~x~0#1_361| (+ |v_thread1Thread1of1ForFork2_~x~0#1_362| v_~B~0_242)) (= |v_thread1Thread1of1ForFork2_~i~0#1_354| (+ |v_thread1Thread1of1ForFork2_~i~0#1_355| 1)) (= |v_thread2Thread1of1ForFork0_~i~1#1_482| (+ |v_thread2Thread1of1ForFork0_~i~1#1_483| 1)))) InVars {~A~0=v_~A~0_424, ~B~0=v_~B~0_242, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_362|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_355|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_483|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_507|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_144|, ~A~0=v_~A~0_424, ~B~0=v_~B~0_242, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_361|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_354|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_482|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_191|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_506|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] [2022-12-06 00:25:22,210 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:25:22,345 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [625] $Ultimate##0-->L51-5: Formula: (and (= |v_thread1Thread1of1ForFork2_~i~0#1_74| 1) (= |v_thread1Thread1of1ForFork2_~x~0#1_79| v_~B~0_67) (< (mod (+ |v_thread1Thread1of1ForFork2_~i~0#1_74| 4294967295) 4294967296) (mod v_~A~0_114 4294967296))) InVars {~A~0=v_~A~0_114, ~B~0=v_~B~0_67} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_23|, ~A~0=v_~A~0_114, ~B~0=v_~B~0_67, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_79|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_74|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:25:22,546 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [774] L67-5-->thread1EXIT: Formula: (let ((.cse0 (select |v_#memory_int_772| v_~queue~0.base_418)) (.cse1 (* v_~end~0_871 4)) (.cse2 (mod v_~A~0_448 4294967296))) (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_221| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_544| 4294967296) (mod (select .cse0 (+ .cse1 v_~queue~0.offset_418)) 4294967296)) 1 0)) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_520| 4294967296) .cse2)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_221| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_221|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_203| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_203|) (= |v_thread1Thread1of1ForFork2_#res#1.offset_201| 0) (= |v_thread1Thread1of1ForFork2_#res#1.base_201| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_211| 0) (= v_~end~0_870 (+ v_~end~0_871 2)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_221| 0)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_386| 4294967296) .cse2)) (= |v_thread1Thread1of1ForFork2_~i~0#1_386| (+ |v_thread1Thread1of1ForFork2_~i~0#1_387| 1)) (= (ite (= (mod (select .cse0 (+ .cse1 v_~queue~0.offset_418 4)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_393| 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_203|) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_203| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_211| 0) (not (= (ite (let ((.cse3 (+ v_~end~0_871 1))) (and (< .cse3 v_~n~0_424) (<= 0 .cse3))) 1 0) 0)) (< (mod (+ |v_thread2Thread1of1ForFork0_~i~1#1_522| 1) 4294967296) .cse2) (= |v_thread1Thread1of1ForFork2_~x~0#1_393| (+ |v_thread1Thread1of1ForFork2_~x~0#1_394| v_~B~0_264)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_522| 4294967296) .cse2) (not (= (ite (and (< v_~end~0_871 v_~n~0_424) (<= 0 v_~end~0_871)) 1 0) 0)) (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_387| 4294967296) .cse2) (= |v_thread2Thread1of1ForFork0_~x~1#1_544| (+ |v_thread2Thread1of1ForFork0_~x~1#1_546| (* 2 v_~B~0_264))) (= |v_thread2Thread1of1ForFork0_~i~1#1_520| (+ 2 |v_thread2Thread1of1ForFork0_~i~1#1_522|)))) InVars {~queue~0.offset=v_~queue~0.offset_418, ~A~0=v_~A~0_448, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_394|, ~B~0=v_~B~0_264, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_387|, #memory_int=|v_#memory_int_772|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_522|, ~end~0=v_~end~0_871, ~queue~0.base=v_~queue~0.base_418, ~n~0=v_~n~0_424, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_546|} OutVars{thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_393|, ~B~0=v_~B~0_264, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_211|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_203|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_221|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_520|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_162|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_201|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_221|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_201|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_203|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_221|, ~queue~0.offset=v_~queue~0.offset_418, ~A~0=v_~A~0_448, ~queue~0.base=v_~queue~0.base_418, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_221|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_211|, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_203|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_386|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_203|, #memory_int=|v_#memory_int_772|, ~end~0=v_~end~0_870, ~n~0=v_~n~0_424, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_544|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_213|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~x~0#1, thread2Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_#t~post1#1, thread2Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_~x~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:25:22,963 INFO L203 LiptonReduction]: Total number of compositions: 14 [2022-12-06 00:25:22,964 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6412 [2022-12-06 00:25:22,964 INFO L495 AbstractCegarLoop]: Abstraction has has 375 places, 833 transitions, 23735 flow [2022-12-06 00:25:22,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.375) internal successors, (57), 25 states have internal predecessors, (57), 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 00:25:22,964 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:25:22,964 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:25:22,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-06 00:25:23,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:25:23,181 INFO L420 AbstractCegarLoop]: === Iteration 85 === 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 00:25:23,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:25:23,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1553616613, now seen corresponding path program 1 times [2022-12-06 00:25:23,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:25:23,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302657359] [2022-12-06 00:25:23,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:25:23,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:25:23,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:25:24,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:25:24,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:25:24,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302657359] [2022-12-06 00:25:24,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302657359] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:25:24,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574703738] [2022-12-06 00:25:24,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:25:24,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:25:24,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:25:24,148 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:25:24,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-06 00:25:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:25:24,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-06 00:25:24,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:25:24,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:25:24,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-12-06 00:25:24,513 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:25:24,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 56 [2022-12-06 00:25:24,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:25:24,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:25:24,792 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:25:24,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 233 treesize of output 200 [2022-12-06 00:25:24,802 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:25:24,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 109 [2022-12-06 00:25:24,808 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:25:24,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 83 [2022-12-06 00:25:25,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:25:25,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574703738] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:25:25,068 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:25:25,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-12-06 00:25:25,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826148422] [2022-12-06 00:25:25,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:25:25,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 00:25:25,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:25:25,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 00:25:25,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-12-06 00:25:25,069 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 75 [2022-12-06 00:25:25,069 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 833 transitions, 23735 flow. Second operand has 19 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 states have internal predecessors, (39), 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 00:25:25,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:25:25,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 75 [2022-12-06 00:25:25,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:25:30,309 INFO L130 PetriNetUnfolder]: 5655/10789 cut-off events. [2022-12-06 00:25:30,309 INFO L131 PetriNetUnfolder]: For 487019/487019 co-relation queries the response was YES. [2022-12-06 00:25:30,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116482 conditions, 10789 events. 5655/10789 cut-off events. For 487019/487019 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 89119 event pairs, 1244 based on Foata normal form. 2/10791 useless extension candidates. Maximal degree in co-relation 116057. Up to 8638 conditions per place. [2022-12-06 00:25:30,439 INFO L137 encePairwiseOnDemand]: 30/75 looper letters, 680 selfloop transitions, 206 changer transitions 19/905 dead transitions. [2022-12-06 00:25:30,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 905 transitions, 26535 flow [2022-12-06 00:25:30,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 00:25:30,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 00:25:30,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 144 transitions. [2022-12-06 00:25:30,440 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.192 [2022-12-06 00:25:30,440 INFO L175 Difference]: Start difference. First operand has 375 places, 833 transitions, 23735 flow. Second operand 10 states and 144 transitions. [2022-12-06 00:25:30,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 905 transitions, 26535 flow [2022-12-06 00:25:34,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 905 transitions, 25339 flow, removed 387 selfloop flow, removed 12 redundant places. [2022-12-06 00:25:34,461 INFO L231 Difference]: Finished difference. Result has 375 places, 835 transitions, 23158 flow [2022-12-06 00:25:34,462 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=22600, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=833, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=201, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=627, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=23158, PETRI_PLACES=375, PETRI_TRANSITIONS=835} [2022-12-06 00:25:34,462 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 346 predicate places. [2022-12-06 00:25:34,462 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:25:34,462 INFO L89 Accepts]: Start accepts. Operand has 375 places, 835 transitions, 23158 flow [2022-12-06 00:25:34,465 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:25:34,465 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:25:34,465 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 375 places, 835 transitions, 23158 flow [2022-12-06 00:25:34,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 372 places, 835 transitions, 23158 flow [2022-12-06 00:25:35,261 INFO L130 PetriNetUnfolder]: 1202/4583 cut-off events. [2022-12-06 00:25:35,261 INFO L131 PetriNetUnfolder]: For 127714/127834 co-relation queries the response was YES. [2022-12-06 00:25:35,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39179 conditions, 4583 events. 1202/4583 cut-off events. For 127714/127834 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 52654 event pairs, 50 based on Foata normal form. 0/4543 useless extension candidates. Maximal degree in co-relation 38910. Up to 780 conditions per place. [2022-12-06 00:25:35,336 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 372 places, 835 transitions, 23158 flow [2022-12-06 00:25:35,336 INFO L188 LiptonReduction]: Number of co-enabled transitions 4084 [2022-12-06 00:25:35,339 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:25:35,465 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [614] $Ultimate##0-->L51-5: Formula: (and (= |v_thread1Thread1of1ForFork2_~x~0#1_37| v_~B~0_59) (< 0 (mod v_~A~0_71 4294967296)) (= |v_thread1Thread1of1ForFork2_~i~0#1_33| 1)) InVars {~A~0=v_~A~0_71, ~B~0=v_~B~0_59} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_17|, ~A~0=v_~A~0_71, ~B~0=v_~B~0_59, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_37|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_33|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] and [782] L67-5-->L104-3: Formula: (let ((.cse0 (select |v_#memory_int_789| v_~queue~0.base_426)) (.cse1 (* v_~end~0_887 4)) (.cse2 (mod v_~A~0_464 4294967296))) (and (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_209| (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_421| 4294967296) (mod (select .cse0 (+ .cse1 v_~queue~0.offset_426 4)) 4294967296)) 1 0)) (= |v_thread1Thread1of1ForFork2_~x~0#1_421| (+ |v_thread1Thread1of1ForFork2_~x~0#1_422| v_~B~0_278)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_414| 4294967296) .cse2)) (= (store |v_#memory_int_789| |v_ULTIMATE.start_main_~#t3~0#1.base_268| (store (select |v_#memory_int_789| |v_ULTIMATE.start_main_~#t3~0#1.base_268|) |v_ULTIMATE.start_main_~#t3~0#1.offset_250| |v_ULTIMATE.start_main_#t~pre18#1_285|)) |v_#memory_int_788|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_209| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_209|) (= (+ |v_#pthreadsForks_532| 1) |v_#pthreadsForks_531|) (= v_~end~0_886 (+ v_~end~0_887 2)) (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_415| 4294967296) .cse2) (= |v_thread2Thread1of1ForFork0_#res#1.offset_215| 0) (= |v_thread2Thread1of1ForFork0_#res#1.base_215| 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_225| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_225|) (not (= (ite (let ((.cse3 (+ v_~end~0_887 1))) (and (<= 0 .cse3) (< .cse3 v_~n~0_432))) 1 0) 0)) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_544| 4294967296) .cse2)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_209| 0)) (= |v_thread1Thread1of1ForFork2_~i~0#1_414| (+ |v_thread1Thread1of1ForFork2_~i~0#1_415| 1)) (not (= (ite (and (<= 0 v_~end~0_887) (< v_~end~0_887 v_~n~0_432)) 1 0) 0)) (= |v_ULTIMATE.start_main_#t~pre18#1_285| |v_#pthreadsForks_532|) (= |v_thread2Thread1of1ForFork0_~i~1#1_544| (+ 2 |v_thread2Thread1of1ForFork0_~i~1#1_545|)) (= |v_thread1Thread1of1ForFork2_#res#1.base_207| 0) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_568| 4294967296) (mod (select .cse0 (+ .cse1 v_~queue~0.offset_426)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_225|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_225| 0)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_545| 4294967296) .cse2) (= |v_thread1Thread1of1ForFork2_#res#1.offset_207| 0) (= |v_thread2Thread1of1ForFork0_~x~1#1_568| (+ |v_thread2Thread1of1ForFork0_~x~1#1_569| (* 2 v_~B~0_278))) (< (mod (+ |v_thread2Thread1of1ForFork0_~i~1#1_545| 1) 4294967296) .cse2))) InVars {~queue~0.offset=v_~queue~0.offset_426, ~A~0=v_~A~0_464, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_422|, ~B~0=v_~B~0_278, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_250|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_268|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_545|, ~queue~0.base=v_~queue~0.base_426, #pthreadsForks=|v_#pthreadsForks_532|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_415|, #memory_int=|v_#memory_int_789|, ~end~0=v_~end~0_887, ~n~0=v_~n~0_432, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_569|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_285|, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_421|, ~B~0=v_~B~0_278, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_250|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_215|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_209|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_225|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_268|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_544|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_180|, #pthreadsForks=|v_#pthreadsForks_531|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_297|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_207|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_225|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_253|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_207|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_209|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_225|, ~queue~0.offset=v_~queue~0.offset_426, ~A~0=v_~A~0_464, ~queue~0.base=v_~queue~0.base_426, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_225|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_215|, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_209|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_414|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_209|, #memory_int=|v_#memory_int_788|, ~end~0=v_~end~0_886, ~n~0=v_~n~0_432, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_568|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_229|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread1Thread1of1ForFork2_~x~0#1, thread2Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_#t~post1#1, thread2Thread1of1ForFork0_#res#1.base, #pthreadsForks, thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, thread1Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, ULTIMATE.start_main_#t~nondet17#1, thread2Thread1of1ForFork0_~x~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post6#1] [2022-12-06 00:25:36,176 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [614] $Ultimate##0-->L51-5: Formula: (and (= |v_thread1Thread1of1ForFork2_~x~0#1_37| v_~B~0_59) (< 0 (mod v_~A~0_71 4294967296)) (= |v_thread1Thread1of1ForFork2_~i~0#1_33| 1)) InVars {~A~0=v_~A~0_71, ~B~0=v_~B~0_59} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_17|, ~A~0=v_~A~0_71, ~B~0=v_~B~0_59, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_37|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_33|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] and [775] L67-5-->L104-3: Formula: (let ((.cse0 (mod v_~A~0_450 4294967296))) (and (= (store |v_#memory_int_775| |v_ULTIMATE.start_main_~#t3~0#1.base_262| (store (select |v_#memory_int_775| |v_ULTIMATE.start_main_~#t3~0#1.base_262|) |v_ULTIMATE.start_main_~#t3~0#1.offset_244| |v_ULTIMATE.start_main_#t~pre18#1_279|)) |v_#memory_int_774|) (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_391| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_223| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_550| 4294967296) (mod (select (select |v_#memory_int_775| v_~queue~0.base_420) (+ v_~queue~0.offset_420 (* v_~end~0_875 4))) 4294967296)) 1 0)) (= (+ |v_thread1Thread1of1ForFork2_~i~0#1_391| 1) |v_thread1Thread1of1ForFork2_~i~0#1_390|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_223| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_223|) (= |v_thread2Thread1of1ForFork0_#res#1.offset_213| 0) (= (+ 2 |v_thread2Thread1of1ForFork0_~i~1#1_528|) |v_thread2Thread1of1ForFork0_~i~1#1_526|) (= |v_ULTIMATE.start_main_#t~pre18#1_279| |v_#pthreadsForks_520|) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_528| 4294967296) .cse0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_526| 4294967296) .cse0)) (= |v_thread1Thread1of1ForFork2_~x~0#1_397| (+ |v_thread1Thread1of1ForFork2_~x~0#1_398| v_~B~0_266)) (= |v_#pthreadsForks_519| (+ |v_#pthreadsForks_520| 1)) (= |v_thread2Thread1of1ForFork0_~x~1#1_550| (+ |v_thread2Thread1of1ForFork0_~x~1#1_552| (* 2 v_~B~0_266))) (= |v_thread2Thread1of1ForFork0_#res#1.base_213| 0) (< (mod (+ |v_thread2Thread1of1ForFork0_~i~1#1_528| 1) 4294967296) .cse0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_223| 0)) (not (= (ite (and (< v_~end~0_875 v_~n~0_426) (<= 0 v_~end~0_875)) 1 0) 0)) (= v_~end~0_874 (+ v_~end~0_875 1)))) InVars {~queue~0.offset=v_~queue~0.offset_420, ~A~0=v_~A~0_450, ~B~0=v_~B~0_266, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_398|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_244|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_262|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_528|, ~queue~0.base=v_~queue~0.base_420, #pthreadsForks=|v_#pthreadsForks_520|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_391|, #memory_int=|v_#memory_int_775|, ~end~0=v_~end~0_875, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_552|, ~n~0=v_~n~0_426} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_279|, ~B~0=v_~B~0_266, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_397|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_244|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_213|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_223|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_262|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_526|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_164|, #pthreadsForks=|v_#pthreadsForks_519|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_291|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_223|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_247|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_223|, ~queue~0.offset=v_~queue~0.offset_420, ~A~0=v_~A~0_450, ~queue~0.base=v_~queue~0.base_420, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_223|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_213|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_390|, #memory_int=|v_#memory_int_774|, ~end~0=v_~end~0_874, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_550|, ~n~0=v_~n~0_426, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_217|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread1Thread1of1ForFork2_~x~0#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_#t~post1#1, thread2Thread1of1ForFork0_#res#1.base, #pthreadsForks, thread1Thread1of1ForFork2_~i~0#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, ULTIMATE.start_main_#t~nondet17#1, thread2Thread1of1ForFork0_~x~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1] [2022-12-06 00:25:36,468 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:25:36,469 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2007 [2022-12-06 00:25:36,469 INFO L495 AbstractCegarLoop]: Abstraction has has 371 places, 834 transitions, 23175 flow [2022-12-06 00:25:36,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 states have internal predecessors, (39), 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 00:25:36,470 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:25:36,470 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:25:36,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-06 00:25:36,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:25:36,670 INFO L420 AbstractCegarLoop]: === Iteration 86 === 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 00:25:36,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:25:36,670 INFO L85 PathProgramCache]: Analyzing trace with hash 331534479, now seen corresponding path program 1 times [2022-12-06 00:25:36,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:25:36,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989782975] [2022-12-06 00:25:36,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:25:36,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:25:36,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:25:37,187 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 00:25:37,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:25:37,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989782975] [2022-12-06 00:25:37,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989782975] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:25:37,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:25:37,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:25:37,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320786845] [2022-12-06 00:25:37,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:25:37,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:25:37,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:25:37,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:25:37,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:25:37,188 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 74 [2022-12-06 00:25:37,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 834 transitions, 23175 flow. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:25:37,189 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:25:37,189 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 74 [2022-12-06 00:25:37,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:25:41,078 INFO L130 PetriNetUnfolder]: 5627/10730 cut-off events. [2022-12-06 00:25:41,078 INFO L131 PetriNetUnfolder]: For 470484/470484 co-relation queries the response was YES. [2022-12-06 00:25:41,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113264 conditions, 10730 events. 5627/10730 cut-off events. For 470484/470484 co-relation queries the response was YES. Maximal size of possible extension queue 635. Compared 88366 event pairs, 1743 based on Foata normal form. 1/10727 useless extension candidates. Maximal degree in co-relation 112918. Up to 10426 conditions per place. [2022-12-06 00:25:41,230 INFO L137 encePairwiseOnDemand]: 54/74 looper letters, 800 selfloop transitions, 46 changer transitions 14/860 dead transitions. [2022-12-06 00:25:41,230 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 860 transitions, 25094 flow [2022-12-06 00:25:41,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:25:41,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:25:41,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2022-12-06 00:25:41,231 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23873873873873874 [2022-12-06 00:25:41,231 INFO L175 Difference]: Start difference. First operand has 371 places, 834 transitions, 23175 flow. Second operand 6 states and 106 transitions. [2022-12-06 00:25:41,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 860 transitions, 25094 flow [2022-12-06 00:25:45,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 860 transitions, 24683 flow, removed 47 selfloop flow, removed 8 redundant places. [2022-12-06 00:25:45,128 INFO L231 Difference]: Finished difference. Result has 370 places, 833 transitions, 22814 flow [2022-12-06 00:25:45,129 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=22764, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=834, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=788, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=22814, PETRI_PLACES=370, PETRI_TRANSITIONS=833} [2022-12-06 00:25:45,129 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 341 predicate places. [2022-12-06 00:25:45,129 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:25:45,129 INFO L89 Accepts]: Start accepts. Operand has 370 places, 833 transitions, 22814 flow [2022-12-06 00:25:45,132 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:25:45,132 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:25:45,132 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 370 places, 833 transitions, 22814 flow [2022-12-06 00:25:45,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 368 places, 833 transitions, 22814 flow [2022-12-06 00:25:45,975 INFO L130 PetriNetUnfolder]: 1206/4585 cut-off events. [2022-12-06 00:25:45,975 INFO L131 PetriNetUnfolder]: For 123058/123208 co-relation queries the response was YES. [2022-12-06 00:25:46,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38688 conditions, 4585 events. 1206/4585 cut-off events. For 123058/123208 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 52727 event pairs, 50 based on Foata normal form. 0/4537 useless extension candidates. Maximal degree in co-relation 38431. Up to 784 conditions per place. [2022-12-06 00:25:46,054 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 368 places, 833 transitions, 22814 flow [2022-12-06 00:25:46,054 INFO L188 LiptonReduction]: Number of co-enabled transitions 4076 [2022-12-06 00:25:46,055 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:25:46,056 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 927 [2022-12-06 00:25:46,057 INFO L495 AbstractCegarLoop]: Abstraction has has 368 places, 833 transitions, 22814 flow [2022-12-06 00:25:46,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:25:46,057 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:25:46,057 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:25:46,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2022-12-06 00:25:46,057 INFO L420 AbstractCegarLoop]: === Iteration 87 === 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 00:25:46,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:25:46,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1894601209, now seen corresponding path program 1 times [2022-12-06 00:25:46,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:25:46,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75468631] [2022-12-06 00:25:46,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:25:46,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:25:46,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:25:46,672 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 00:25:46,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:25:46,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75468631] [2022-12-06 00:25:46,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75468631] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:25:46,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:25:46,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:25:46,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682177223] [2022-12-06 00:25:46,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:25:46,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:25:46,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:25:46,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:25:46,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:25:46,673 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 73 [2022-12-06 00:25:46,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 833 transitions, 22814 flow. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:25:46,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:25:46,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 73 [2022-12-06 00:25:46,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:25:50,958 INFO L130 PetriNetUnfolder]: 5639/10758 cut-off events. [2022-12-06 00:25:50,959 INFO L131 PetriNetUnfolder]: For 442546/442546 co-relation queries the response was YES. [2022-12-06 00:25:51,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112129 conditions, 10758 events. 5639/10758 cut-off events. For 442546/442546 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 88691 event pairs, 1508 based on Foata normal form. 1/10755 useless extension candidates. Maximal degree in co-relation 111781. Up to 7836 conditions per place. [2022-12-06 00:25:51,110 INFO L137 encePairwiseOnDemand]: 49/73 looper letters, 727 selfloop transitions, 148 changer transitions 14/889 dead transitions. [2022-12-06 00:25:51,110 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 889 transitions, 25095 flow [2022-12-06 00:25:51,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:25:51,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:25:51,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2022-12-06 00:25:51,111 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24143835616438356 [2022-12-06 00:25:51,111 INFO L175 Difference]: Start difference. First operand has 368 places, 833 transitions, 22814 flow. Second operand 8 states and 141 transitions. [2022-12-06 00:25:51,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 889 transitions, 25095 flow [2022-12-06 00:25:54,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 889 transitions, 24995 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-12-06 00:25:54,925 INFO L231 Difference]: Finished difference. Result has 373 places, 835 transitions, 23154 flow [2022-12-06 00:25:54,925 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=22718, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=833, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=686, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=23154, PETRI_PLACES=373, PETRI_TRANSITIONS=835} [2022-12-06 00:25:54,926 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 344 predicate places. [2022-12-06 00:25:54,926 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:25:54,926 INFO L89 Accepts]: Start accepts. Operand has 373 places, 835 transitions, 23154 flow [2022-12-06 00:25:54,928 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:25:54,928 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:25:54,929 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 373 places, 835 transitions, 23154 flow [2022-12-06 00:25:54,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 371 places, 835 transitions, 23154 flow [2022-12-06 00:25:55,797 INFO L130 PetriNetUnfolder]: 1203/4584 cut-off events. [2022-12-06 00:25:55,797 INFO L131 PetriNetUnfolder]: For 124636/124758 co-relation queries the response was YES. [2022-12-06 00:25:55,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38975 conditions, 4584 events. 1203/4584 cut-off events. For 124636/124758 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 52644 event pairs, 50 based on Foata normal form. 0/4548 useless extension candidates. Maximal degree in co-relation 38738. Up to 780 conditions per place. [2022-12-06 00:25:55,864 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 371 places, 835 transitions, 23154 flow [2022-12-06 00:25:55,864 INFO L188 LiptonReduction]: Number of co-enabled transitions 4088 [2022-12-06 00:25:55,866 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:25:55,866 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 940 [2022-12-06 00:25:55,866 INFO L495 AbstractCegarLoop]: Abstraction has has 371 places, 835 transitions, 23154 flow [2022-12-06 00:25:55,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:25:55,867 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:25:55,867 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:25:55,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2022-12-06 00:25:55,867 INFO L420 AbstractCegarLoop]: === Iteration 88 === 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 00:25:55,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:25:55,867 INFO L85 PathProgramCache]: Analyzing trace with hash -330597556, now seen corresponding path program 1 times [2022-12-06 00:25:55,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:25:55,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700488739] [2022-12-06 00:25:55,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:25:55,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:25:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:25:56,628 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 00:25:56,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:25:56,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700488739] [2022-12-06 00:25:56,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700488739] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:25:56,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:25:56,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:25:56,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366733395] [2022-12-06 00:25:56,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:25:56,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:25:56,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:25:56,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:25:56,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:25:56,629 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 73 [2022-12-06 00:25:56,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 835 transitions, 23154 flow. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:25:56,629 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:25:56,629 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 73 [2022-12-06 00:25:56,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:26:00,612 INFO L130 PetriNetUnfolder]: 5636/10755 cut-off events. [2022-12-06 00:26:00,613 INFO L131 PetriNetUnfolder]: For 464396/464396 co-relation queries the response was YES. [2022-12-06 00:26:00,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112743 conditions, 10755 events. 5636/10755 cut-off events. For 464396/464396 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 88678 event pairs, 1538 based on Foata normal form. 1/10752 useless extension candidates. Maximal degree in co-relation 112394. Up to 9340 conditions per place. [2022-12-06 00:26:00,753 INFO L137 encePairwiseOnDemand]: 40/73 looper letters, 728 selfloop transitions, 143 changer transitions 14/885 dead transitions. [2022-12-06 00:26:00,754 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 885 transitions, 25528 flow [2022-12-06 00:26:00,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:26:00,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:26:00,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2022-12-06 00:26:00,754 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22309197651663404 [2022-12-06 00:26:00,754 INFO L175 Difference]: Start difference. First operand has 371 places, 835 transitions, 23154 flow. Second operand 7 states and 114 transitions. [2022-12-06 00:26:00,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 885 transitions, 25528 flow [2022-12-06 00:26:04,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 885 transitions, 25413 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-06 00:26:04,367 INFO L231 Difference]: Finished difference. Result has 375 places, 834 transitions, 23292 flow [2022-12-06 00:26:04,368 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=23039, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=835, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=692, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=23292, PETRI_PLACES=375, PETRI_TRANSITIONS=834} [2022-12-06 00:26:04,368 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 346 predicate places. [2022-12-06 00:26:04,368 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:26:04,368 INFO L89 Accepts]: Start accepts. Operand has 375 places, 834 transitions, 23292 flow [2022-12-06 00:26:04,372 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:26:04,372 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:26:04,372 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 375 places, 834 transitions, 23292 flow [2022-12-06 00:26:04,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 373 places, 834 transitions, 23292 flow [2022-12-06 00:26:05,239 INFO L130 PetriNetUnfolder]: 1202/4587 cut-off events. [2022-12-06 00:26:05,240 INFO L131 PetriNetUnfolder]: For 127278/127400 co-relation queries the response was YES. [2022-12-06 00:26:05,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39270 conditions, 4587 events. 1202/4587 cut-off events. For 127278/127400 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 52714 event pairs, 50 based on Foata normal form. 0/4549 useless extension candidates. Maximal degree in co-relation 39099. Up to 779 conditions per place. [2022-12-06 00:26:05,306 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 373 places, 834 transitions, 23292 flow [2022-12-06 00:26:05,306 INFO L188 LiptonReduction]: Number of co-enabled transitions 4088 [2022-12-06 00:26:05,308 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:26:05,308 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 940 [2022-12-06 00:26:05,308 INFO L495 AbstractCegarLoop]: Abstraction has has 373 places, 834 transitions, 23292 flow [2022-12-06 00:26:05,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:26:05,308 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:26:05,308 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:26:05,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2022-12-06 00:26:05,308 INFO L420 AbstractCegarLoop]: === Iteration 89 === 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 00:26:05,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:26:05,309 INFO L85 PathProgramCache]: Analyzing trace with hash 519290990, now seen corresponding path program 1 times [2022-12-06 00:26:05,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:26:05,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952506751] [2022-12-06 00:26:05,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:26:05,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:26:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:26:05,357 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 00:26:05,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:26:05,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952506751] [2022-12-06 00:26:05,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952506751] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:26:05,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:26:05,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:26:05,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26633132] [2022-12-06 00:26:05,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:26:05,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:26:05,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:26:05,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:26:05,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:26:05,358 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 72 [2022-12-06 00:26:05,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 834 transitions, 23292 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:26:05,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:26:05,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 72 [2022-12-06 00:26:05,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:26:08,913 INFO L130 PetriNetUnfolder]: 5597/10692 cut-off events. [2022-12-06 00:26:08,913 INFO L131 PetriNetUnfolder]: For 451894/451894 co-relation queries the response was YES. [2022-12-06 00:26:09,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112612 conditions, 10692 events. 5597/10692 cut-off events. For 451894/451894 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 88228 event pairs, 1099 based on Foata normal form. 16/10704 useless extension candidates. Maximal degree in co-relation 112263. Up to 5519 conditions per place. [2022-12-06 00:26:09,055 INFO L137 encePairwiseOnDemand]: 43/72 looper letters, 554 selfloop transitions, 307 changer transitions 3/864 dead transitions. [2022-12-06 00:26:09,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 864 transitions, 25324 flow [2022-12-06 00:26:09,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:26:09,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:26:09,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2022-12-06 00:26:09,056 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29444444444444445 [2022-12-06 00:26:09,056 INFO L175 Difference]: Start difference. First operand has 373 places, 834 transitions, 23292 flow. Second operand 5 states and 106 transitions. [2022-12-06 00:26:09,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 864 transitions, 25324 flow [2022-12-06 00:26:12,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 864 transitions, 25038 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-12-06 00:26:13,011 INFO L231 Difference]: Finished difference. Result has 372 places, 828 transitions, 23512 flow [2022-12-06 00:26:13,012 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=22867, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=829, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=306, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=522, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=23512, PETRI_PLACES=372, PETRI_TRANSITIONS=828} [2022-12-06 00:26:13,012 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 343 predicate places. [2022-12-06 00:26:13,012 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:26:13,012 INFO L89 Accepts]: Start accepts. Operand has 372 places, 828 transitions, 23512 flow [2022-12-06 00:26:13,015 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:26:13,015 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:26:13,015 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 372 places, 828 transitions, 23512 flow [2022-12-06 00:26:13,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 372 places, 828 transitions, 23512 flow [2022-12-06 00:26:13,767 INFO L130 PetriNetUnfolder]: 1196/4565 cut-off events. [2022-12-06 00:26:13,768 INFO L131 PetriNetUnfolder]: For 133739/133856 co-relation queries the response was YES. [2022-12-06 00:26:13,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39232 conditions, 4565 events. 1196/4565 cut-off events. For 133739/133856 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 52362 event pairs, 50 based on Foata normal form. 0/4528 useless extension candidates. Maximal degree in co-relation 38752. Up to 778 conditions per place. [2022-12-06 00:26:13,855 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 372 places, 828 transitions, 23512 flow [2022-12-06 00:26:13,855 INFO L188 LiptonReduction]: Number of co-enabled transitions 4044 [2022-12-06 00:26:13,857 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:26:13,865 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 853 [2022-12-06 00:26:13,865 INFO L495 AbstractCegarLoop]: Abstraction has has 372 places, 828 transitions, 23512 flow [2022-12-06 00:26:13,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:26:13,865 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:26:13,866 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:26:13,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2022-12-06 00:26:13,866 INFO L420 AbstractCegarLoop]: === Iteration 90 === 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 00:26:13,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:26:13,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1930299639, now seen corresponding path program 1 times [2022-12-06 00:26:13,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:26:13,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151320236] [2022-12-06 00:26:13,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:26:13,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:26:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:26:13,930 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 00:26:13,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:26:13,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151320236] [2022-12-06 00:26:13,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151320236] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:26:13,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:26:13,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:26:13,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475226409] [2022-12-06 00:26:13,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:26:13,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:26:13,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:26:13,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:26:13,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:26:13,931 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 70 [2022-12-06 00:26:13,931 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 828 transitions, 23512 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:26:13,931 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:26:13,931 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 70 [2022-12-06 00:26:13,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:26:17,165 INFO L130 PetriNetUnfolder]: 5592/10671 cut-off events. [2022-12-06 00:26:17,165 INFO L131 PetriNetUnfolder]: For 479649/479649 co-relation queries the response was YES. [2022-12-06 00:26:17,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113421 conditions, 10671 events. 5592/10671 cut-off events. For 479649/479649 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 87898 event pairs, 1576 based on Foata normal form. 3/10670 useless extension candidates. Maximal degree in co-relation 112216. Up to 9400 conditions per place. [2022-12-06 00:26:17,373 INFO L137 encePairwiseOnDemand]: 48/70 looper letters, 676 selfloop transitions, 173 changer transitions 3/852 dead transitions. [2022-12-06 00:26:17,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 852 transitions, 25519 flow [2022-12-06 00:26:17,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:26:17,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:26:17,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2022-12-06 00:26:17,374 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31785714285714284 [2022-12-06 00:26:17,374 INFO L175 Difference]: Start difference. First operand has 372 places, 828 transitions, 23512 flow. Second operand 4 states and 89 transitions. [2022-12-06 00:26:17,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 852 transitions, 25519 flow [2022-12-06 00:26:21,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 852 transitions, 25119 flow, removed 15 selfloop flow, removed 2 redundant places. [2022-12-06 00:26:21,524 INFO L231 Difference]: Finished difference. Result has 373 places, 826 transitions, 23365 flow [2022-12-06 00:26:21,524 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=23083, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=827, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=654, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=23365, PETRI_PLACES=373, PETRI_TRANSITIONS=826} [2022-12-06 00:26:21,525 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 344 predicate places. [2022-12-06 00:26:21,525 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:26:21,525 INFO L89 Accepts]: Start accepts. Operand has 373 places, 826 transitions, 23365 flow [2022-12-06 00:26:21,527 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:26:21,527 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:26:21,527 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 373 places, 826 transitions, 23365 flow [2022-12-06 00:26:21,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 372 places, 826 transitions, 23365 flow [2022-12-06 00:26:22,396 INFO L130 PetriNetUnfolder]: 1193/4561 cut-off events. [2022-12-06 00:26:22,397 INFO L131 PetriNetUnfolder]: For 132126/132246 co-relation queries the response was YES. [2022-12-06 00:26:22,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39007 conditions, 4561 events. 1193/4561 cut-off events. For 132126/132246 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 52431 event pairs, 50 based on Foata normal form. 0/4518 useless extension candidates. Maximal degree in co-relation 38527. Up to 778 conditions per place. [2022-12-06 00:26:22,477 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 372 places, 826 transitions, 23365 flow [2022-12-06 00:26:22,477 INFO L188 LiptonReduction]: Number of co-enabled transitions 4040 [2022-12-06 00:26:22,479 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:26:22,479 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 954 [2022-12-06 00:26:22,479 INFO L495 AbstractCegarLoop]: Abstraction has has 372 places, 826 transitions, 23365 flow [2022-12-06 00:26:22,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:26:22,479 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:26:22,479 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:26:22,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2022-12-06 00:26:22,479 INFO L420 AbstractCegarLoop]: === Iteration 91 === 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 00:26:22,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:26:22,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1996862512, now seen corresponding path program 1 times [2022-12-06 00:26:22,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:26:22,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546406100] [2022-12-06 00:26:22,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:26:22,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:26:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:26:23,004 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 00:26:23,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:26:23,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546406100] [2022-12-06 00:26:23,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546406100] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:26:23,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:26:23,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:26:23,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659381301] [2022-12-06 00:26:23,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:26:23,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:26:23,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:26:23,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:26:23,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:26:23,005 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 69 [2022-12-06 00:26:23,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 826 transitions, 23365 flow. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:26:23,005 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:26:23,005 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 69 [2022-12-06 00:26:23,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:26:26,973 INFO L130 PetriNetUnfolder]: 5592/10713 cut-off events. [2022-12-06 00:26:26,973 INFO L131 PetriNetUnfolder]: For 479635/479635 co-relation queries the response was YES. [2022-12-06 00:26:27,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113099 conditions, 10713 events. 5592/10713 cut-off events. For 479635/479635 co-relation queries the response was YES. Maximal size of possible extension queue 628. Compared 88597 event pairs, 1648 based on Foata normal form. 2/10711 useless extension candidates. Maximal degree in co-relation 111894. Up to 7811 conditions per place. [2022-12-06 00:26:27,120 INFO L137 encePairwiseOnDemand]: 47/69 looper letters, 793 selfloop transitions, 71 changer transitions 16/880 dead transitions. [2022-12-06 00:26:27,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 880 transitions, 25521 flow [2022-12-06 00:26:27,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:26:27,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:26:27,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 135 transitions. [2022-12-06 00:26:27,135 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21739130434782608 [2022-12-06 00:26:27,135 INFO L175 Difference]: Start difference. First operand has 372 places, 826 transitions, 23365 flow. Second operand 9 states and 135 transitions. [2022-12-06 00:26:27,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 880 transitions, 25521 flow [2022-12-06 00:26:31,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 880 transitions, 25103 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 00:26:31,406 INFO L231 Difference]: Finished difference. Result has 379 places, 823 transitions, 22968 flow [2022-12-06 00:26:31,406 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=22947, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=826, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=755, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=22968, PETRI_PLACES=379, PETRI_TRANSITIONS=823} [2022-12-06 00:26:31,406 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 350 predicate places. [2022-12-06 00:26:31,406 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:26:31,406 INFO L89 Accepts]: Start accepts. Operand has 379 places, 823 transitions, 22968 flow [2022-12-06 00:26:31,409 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:26:31,409 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:26:31,409 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 379 places, 823 transitions, 22968 flow [2022-12-06 00:26:31,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 377 places, 823 transitions, 22968 flow [2022-12-06 00:26:32,152 INFO L130 PetriNetUnfolder]: 1188/4554 cut-off events. [2022-12-06 00:26:32,152 INFO L131 PetriNetUnfolder]: For 129316/129436 co-relation queries the response was YES. [2022-12-06 00:26:32,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38802 conditions, 4554 events. 1188/4554 cut-off events. For 129316/129436 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 52318 event pairs, 50 based on Foata normal form. 0/4514 useless extension candidates. Maximal degree in co-relation 38565. Up to 778 conditions per place. [2022-12-06 00:26:32,239 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 377 places, 823 transitions, 22968 flow [2022-12-06 00:26:32,240 INFO L188 LiptonReduction]: Number of co-enabled transitions 4026 [2022-12-06 00:26:32,242 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:26:32,243 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 837 [2022-12-06 00:26:32,243 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 823 transitions, 22968 flow [2022-12-06 00:26:32,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:26:32,243 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:26:32,243 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:26:32,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2022-12-06 00:26:32,244 INFO L420 AbstractCegarLoop]: === Iteration 92 === 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 00:26:32,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:26:32,244 INFO L85 PathProgramCache]: Analyzing trace with hash 79796601, now seen corresponding path program 1 times [2022-12-06 00:26:32,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:26:32,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162883148] [2022-12-06 00:26:32,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:26:32,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:26:32,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:26:32,308 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 00:26:32,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:26:32,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162883148] [2022-12-06 00:26:32,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162883148] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:26:32,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:26:32,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:26:32,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257652041] [2022-12-06 00:26:32,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:26:32,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:26:32,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:26:32,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:26:32,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:26:32,309 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 68 [2022-12-06 00:26:32,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 823 transitions, 22968 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:26:32,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:26:32,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 68 [2022-12-06 00:26:32,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:26:35,776 INFO L130 PetriNetUnfolder]: 5576/10669 cut-off events. [2022-12-06 00:26:35,776 INFO L131 PetriNetUnfolder]: For 464881/464881 co-relation queries the response was YES. [2022-12-06 00:26:35,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112103 conditions, 10669 events. 5576/10669 cut-off events. For 464881/464881 co-relation queries the response was YES. Maximal size of possible extension queue 624. Compared 88082 event pairs, 1595 based on Foata normal form. 4/10669 useless extension candidates. Maximal degree in co-relation 111745. Up to 9401 conditions per place. [2022-12-06 00:26:35,912 INFO L137 encePairwiseOnDemand]: 44/68 looper letters, 673 selfloop transitions, 177 changer transitions 0/850 dead transitions. [2022-12-06 00:26:35,913 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 850 transitions, 24958 flow [2022-12-06 00:26:35,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:26:35,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:26:35,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-12-06 00:26:35,913 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33455882352941174 [2022-12-06 00:26:35,913 INFO L175 Difference]: Start difference. First operand has 377 places, 823 transitions, 22968 flow. Second operand 4 states and 91 transitions. [2022-12-06 00:26:35,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 850 transitions, 24958 flow [2022-12-06 00:26:39,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 850 transitions, 24912 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-12-06 00:26:39,955 INFO L231 Difference]: Finished difference. Result has 375 places, 822 transitions, 23221 flow [2022-12-06 00:26:39,956 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=22867, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=822, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=177, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=645, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=23221, PETRI_PLACES=375, PETRI_TRANSITIONS=822} [2022-12-06 00:26:39,956 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 346 predicate places. [2022-12-06 00:26:39,956 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:26:39,956 INFO L89 Accepts]: Start accepts. Operand has 375 places, 822 transitions, 23221 flow [2022-12-06 00:26:39,959 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:26:39,959 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:26:39,960 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 375 places, 822 transitions, 23221 flow [2022-12-06 00:26:39,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 375 places, 822 transitions, 23221 flow [2022-12-06 00:26:40,837 INFO L130 PetriNetUnfolder]: 1188/4552 cut-off events. [2022-12-06 00:26:40,838 INFO L131 PetriNetUnfolder]: For 131361/131473 co-relation queries the response was YES. [2022-12-06 00:26:40,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38947 conditions, 4552 events. 1188/4552 cut-off events. For 131361/131473 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 52219 event pairs, 50 based on Foata normal form. 0/4512 useless extension candidates. Maximal degree in co-relation 38469. Up to 778 conditions per place. [2022-12-06 00:26:40,915 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 375 places, 822 transitions, 23221 flow [2022-12-06 00:26:40,915 INFO L188 LiptonReduction]: Number of co-enabled transitions 4022 [2022-12-06 00:26:40,917 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:26:40,917 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 961 [2022-12-06 00:26:40,917 INFO L495 AbstractCegarLoop]: Abstraction has has 375 places, 822 transitions, 23221 flow [2022-12-06 00:26:40,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:26:40,917 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:26:40,917 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:26:40,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2022-12-06 00:26:40,918 INFO L420 AbstractCegarLoop]: === Iteration 93 === 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 00:26:40,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:26:40,918 INFO L85 PathProgramCache]: Analyzing trace with hash 887810600, now seen corresponding path program 1 times [2022-12-06 00:26:40,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:26:40,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157773202] [2022-12-06 00:26:40,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:26:40,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:26:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:26:42,763 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 00:26:42,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:26:42,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157773202] [2022-12-06 00:26:42,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157773202] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:26:42,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:26:42,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:26:42,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144095984] [2022-12-06 00:26:42,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:26:42,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:26:42,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:26:42,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:26:42,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:26:42,764 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 67 [2022-12-06 00:26:42,764 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 822 transitions, 23221 flow. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:26:42,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:26:42,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 67 [2022-12-06 00:26:42,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:26:47,014 INFO L130 PetriNetUnfolder]: 5607/10723 cut-off events. [2022-12-06 00:26:47,014 INFO L131 PetriNetUnfolder]: For 477018/477018 co-relation queries the response was YES. [2022-12-06 00:26:47,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113132 conditions, 10723 events. 5607/10723 cut-off events. For 477018/477018 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 88539 event pairs, 1499 based on Foata normal form. 1/10720 useless extension candidates. Maximal degree in co-relation 111929. Up to 8873 conditions per place. [2022-12-06 00:26:47,177 INFO L137 encePairwiseOnDemand]: 39/67 looper letters, 713 selfloop transitions, 163 changer transitions 14/890 dead transitions. [2022-12-06 00:26:47,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 890 transitions, 26177 flow [2022-12-06 00:26:47,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:26:47,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:26:47,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 118 transitions. [2022-12-06 00:26:47,179 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22014925373134328 [2022-12-06 00:26:47,179 INFO L175 Difference]: Start difference. First operand has 375 places, 822 transitions, 23221 flow. Second operand 8 states and 118 transitions. [2022-12-06 00:26:47,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 890 transitions, 26177 flow [2022-12-06 00:26:51,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 890 transitions, 25983 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 00:26:51,533 INFO L231 Difference]: Finished difference. Result has 384 places, 830 transitions, 23688 flow [2022-12-06 00:26:51,534 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=23034, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=822, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=155, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=663, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=23688, PETRI_PLACES=384, PETRI_TRANSITIONS=830} [2022-12-06 00:26:51,534 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 355 predicate places. [2022-12-06 00:26:51,534 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:26:51,534 INFO L89 Accepts]: Start accepts. Operand has 384 places, 830 transitions, 23688 flow [2022-12-06 00:26:51,538 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:26:51,538 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:26:51,538 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 384 places, 830 transitions, 23688 flow [2022-12-06 00:26:51,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 383 places, 830 transitions, 23688 flow [2022-12-06 00:26:52,316 INFO L130 PetriNetUnfolder]: 1196/4567 cut-off events. [2022-12-06 00:26:52,317 INFO L131 PetriNetUnfolder]: For 138956/139081 co-relation queries the response was YES. [2022-12-06 00:26:52,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39611 conditions, 4567 events. 1196/4567 cut-off events. For 138956/139081 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 52393 event pairs, 50 based on Foata normal form. 0/4522 useless extension candidates. Maximal degree in co-relation 39333. Up to 782 conditions per place. [2022-12-06 00:26:52,411 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 383 places, 830 transitions, 23688 flow [2022-12-06 00:26:52,411 INFO L188 LiptonReduction]: Number of co-enabled transitions 4052 [2022-12-06 00:26:52,414 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L51-5-->thread1EXIT: Formula: (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_22| v_~queue~0.base_In_5) (+ (* v_~end~0_In_3 4) v_~queue~0.offset_In_5)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_6| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4| 0)) (= v_~end~0_Out_24 (+ v_~end~0_In_3 1)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_In_2| 4294967296) (mod v_~A~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_6| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|) (not (= 0 (ite (and (< v_~end~0_In_3 v_~n~0_In_6) (<= 0 v_~end~0_In_3)) 1 0)))) InVars {~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, #memory_int=|v_#memory_int_In_22|, ~end~0=v_~end~0_In_3, ~queue~0.base=v_~queue~0.base_In_5, ~n~0=v_~n~0_In_6} OutVars{~queue~0.offset=v_~queue~0.offset_In_5, ~A~0=v_~A~0_In_1, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_In_3|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_5, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_Out_4|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_2|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_4|, #memory_int=|v_#memory_int_In_22|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_6|, ~end~0=v_~end~0_Out_24, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_6|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:26:52,549 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:26:52,550 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1016 [2022-12-06 00:26:52,550 INFO L495 AbstractCegarLoop]: Abstraction has has 382 places, 829 transitions, 23674 flow [2022-12-06 00:26:52,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:26:52,550 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:26:52,550 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:26:52,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2022-12-06 00:26:52,550 INFO L420 AbstractCegarLoop]: === Iteration 94 === 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 00:26:52,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:26:52,550 INFO L85 PathProgramCache]: Analyzing trace with hash -890966236, now seen corresponding path program 2 times [2022-12-06 00:26:52,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:26:52,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909363526] [2022-12-06 00:26:52,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:26:52,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:26:52,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:26:53,587 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 00:26:53,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:26:53,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909363526] [2022-12-06 00:26:53,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909363526] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:26:53,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:26:53,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:26:53,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895143407] [2022-12-06 00:26:53,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:26:53,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:26:53,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:26:53,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:26:53,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:26:53,589 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 68 [2022-12-06 00:26:53,589 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 829 transitions, 23674 flow. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:26:53,589 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:26:53,589 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 68 [2022-12-06 00:26:53,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:26:57,769 INFO L130 PetriNetUnfolder]: 5611/10724 cut-off events. [2022-12-06 00:26:57,769 INFO L131 PetriNetUnfolder]: For 488694/488694 co-relation queries the response was YES. [2022-12-06 00:26:57,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113943 conditions, 10724 events. 5611/10724 cut-off events. For 488694/488694 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 88425 event pairs, 1525 based on Foata normal form. 1/10721 useless extension candidates. Maximal degree in co-relation 113584. Up to 9494 conditions per place. [2022-12-06 00:26:57,898 INFO L137 encePairwiseOnDemand]: 37/68 looper letters, 724 selfloop transitions, 137 changer transitions 14/875 dead transitions. [2022-12-06 00:26:57,898 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 875 transitions, 25901 flow [2022-12-06 00:26:57,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:26:57,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:26:57,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2022-12-06 00:26:57,899 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21323529411764705 [2022-12-06 00:26:57,899 INFO L175 Difference]: Start difference. First operand has 382 places, 829 transitions, 23674 flow. Second operand 8 states and 116 transitions. [2022-12-06 00:26:57,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 875 transitions, 25901 flow [2022-12-06 00:27:02,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 875 transitions, 25736 flow, removed 14 selfloop flow, removed 5 redundant places. [2022-12-06 00:27:02,146 INFO L231 Difference]: Finished difference. Result has 387 places, 830 transitions, 23872 flow [2022-12-06 00:27:02,147 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=23510, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=829, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=692, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=23872, PETRI_PLACES=387, PETRI_TRANSITIONS=830} [2022-12-06 00:27:02,147 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 358 predicate places. [2022-12-06 00:27:02,147 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:27:02,147 INFO L89 Accepts]: Start accepts. Operand has 387 places, 830 transitions, 23872 flow [2022-12-06 00:27:02,150 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:27:02,150 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:27:02,150 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 387 places, 830 transitions, 23872 flow [2022-12-06 00:27:02,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 385 places, 830 transitions, 23872 flow [2022-12-06 00:27:02,997 INFO L130 PetriNetUnfolder]: 1197/4564 cut-off events. [2022-12-06 00:27:02,997 INFO L131 PetriNetUnfolder]: For 144010/144127 co-relation queries the response was YES. [2022-12-06 00:27:03,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39816 conditions, 4564 events. 1197/4564 cut-off events. For 144010/144127 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 52352 event pairs, 50 based on Foata normal form. 0/4525 useless extension candidates. Maximal degree in co-relation 39628. Up to 780 conditions per place. [2022-12-06 00:27:03,071 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 385 places, 830 transitions, 23872 flow [2022-12-06 00:27:03,072 INFO L188 LiptonReduction]: Number of co-enabled transitions 4056 [2022-12-06 00:27:03,073 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:27:03,074 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 927 [2022-12-06 00:27:03,074 INFO L495 AbstractCegarLoop]: Abstraction has has 385 places, 830 transitions, 23872 flow [2022-12-06 00:27:03,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:27:03,074 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:27:03,074 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:27:03,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2022-12-06 00:27:03,074 INFO L420 AbstractCegarLoop]: === Iteration 95 === 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 00:27:03,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:27:03,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1817716154, now seen corresponding path program 1 times [2022-12-06 00:27:03,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:27:03,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977273547] [2022-12-06 00:27:03,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:27:03,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:27:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:27:04,939 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 00:27:04,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:27:04,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977273547] [2022-12-06 00:27:04,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977273547] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:27:04,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:27:04,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:27:04,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561220333] [2022-12-06 00:27:04,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:27:04,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:27:04,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:27:04,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:27:04,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:27:04,940 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 68 [2022-12-06 00:27:04,941 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 830 transitions, 23872 flow. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:27:04,941 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:27:04,941 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 68 [2022-12-06 00:27:04,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:27:09,081 INFO L130 PetriNetUnfolder]: 5616/10739 cut-off events. [2022-12-06 00:27:09,081 INFO L131 PetriNetUnfolder]: For 500686/500686 co-relation queries the response was YES. [2022-12-06 00:27:09,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114377 conditions, 10739 events. 5616/10739 cut-off events. For 500686/500686 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 88481 event pairs, 1338 based on Foata normal form. 1/10736 useless extension candidates. Maximal degree in co-relation 114017. Up to 7910 conditions per place. [2022-12-06 00:27:09,259 INFO L137 encePairwiseOnDemand]: 40/68 looper letters, 734 selfloop transitions, 157 changer transitions 16/907 dead transitions. [2022-12-06 00:27:09,259 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 907 transitions, 27207 flow [2022-12-06 00:27:09,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:27:09,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:27:09,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2022-12-06 00:27:09,260 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23529411764705882 [2022-12-06 00:27:09,260 INFO L175 Difference]: Start difference. First operand has 385 places, 830 transitions, 23872 flow. Second operand 7 states and 112 transitions. [2022-12-06 00:27:09,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 907 transitions, 27207 flow [2022-12-06 00:27:13,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 907 transitions, 26984 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-12-06 00:27:13,825 INFO L231 Difference]: Finished difference. Result has 388 places, 830 transitions, 24036 flow [2022-12-06 00:27:13,826 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=23649, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=830, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=156, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=673, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=24036, PETRI_PLACES=388, PETRI_TRANSITIONS=830} [2022-12-06 00:27:13,826 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 359 predicate places. [2022-12-06 00:27:13,826 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:27:13,826 INFO L89 Accepts]: Start accepts. Operand has 388 places, 830 transitions, 24036 flow [2022-12-06 00:27:13,830 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:27:13,830 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:27:13,830 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 388 places, 830 transitions, 24036 flow [2022-12-06 00:27:13,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 386 places, 830 transitions, 24036 flow [2022-12-06 00:27:14,681 INFO L130 PetriNetUnfolder]: 1194/4572 cut-off events. [2022-12-06 00:27:14,681 INFO L131 PetriNetUnfolder]: For 148005/148110 co-relation queries the response was YES. [2022-12-06 00:27:14,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40009 conditions, 4572 events. 1194/4572 cut-off events. For 148005/148110 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 52423 event pairs, 49 based on Foata normal form. 0/4535 useless extension candidates. Maximal degree in co-relation 39729. Up to 780 conditions per place. [2022-12-06 00:27:14,775 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 386 places, 830 transitions, 24036 flow [2022-12-06 00:27:14,775 INFO L188 LiptonReduction]: Number of co-enabled transitions 4060 [2022-12-06 00:27:14,777 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:27:14,778 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 952 [2022-12-06 00:27:14,778 INFO L495 AbstractCegarLoop]: Abstraction has has 386 places, 830 transitions, 24036 flow [2022-12-06 00:27:14,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:27:14,778 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:27:14,778 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:27:14,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2022-12-06 00:27:14,778 INFO L420 AbstractCegarLoop]: === Iteration 96 === 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 00:27:14,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:27:14,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1225929041, now seen corresponding path program 1 times [2022-12-06 00:27:14,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:27:14,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589116079] [2022-12-06 00:27:14,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:27:14,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:27:14,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:27:15,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:27:15,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:27:15,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589116079] [2022-12-06 00:27:15,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589116079] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:27:15,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005361224] [2022-12-06 00:27:15,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:27:15,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:27:15,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:27:15,521 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:27:15,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-06 00:27:15,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:27:15,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-06 00:27:15,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:27:15,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:27:15,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:27:15,969 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-06 00:27:15,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 32 [2022-12-06 00:27:16,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:27:16,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005361224] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:27:16,031 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:27:16,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 20 [2022-12-06 00:27:16,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635240544] [2022-12-06 00:27:16,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:27:16,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 00:27:16,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:27:16,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 00:27:16,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2022-12-06 00:27:16,034 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 67 [2022-12-06 00:27:16,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 830 transitions, 24036 flow. Second operand has 21 states, 20 states have (on average 2.7) internal successors, (54), 21 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:27:16,034 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:27:16,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 67 [2022-12-06 00:27:16,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:27:22,310 INFO L130 PetriNetUnfolder]: 5746/11035 cut-off events. [2022-12-06 00:27:22,310 INFO L131 PetriNetUnfolder]: For 510074/510074 co-relation queries the response was YES. [2022-12-06 00:27:22,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117880 conditions, 11035 events. 5746/11035 cut-off events. For 510074/510074 co-relation queries the response was YES. Maximal size of possible extension queue 653. Compared 92624 event pairs, 473 based on Foata normal form. 2/11033 useless extension candidates. Maximal degree in co-relation 117519. Up to 2012 conditions per place. [2022-12-06 00:27:22,535 INFO L137 encePairwiseOnDemand]: 24/67 looper letters, 486 selfloop transitions, 634 changer transitions 16/1136 dead transitions. [2022-12-06 00:27:22,535 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 1136 transitions, 31579 flow [2022-12-06 00:27:22,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-06 00:27:22,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-06 00:27:22,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 300 transitions. [2022-12-06 00:27:22,536 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14443909484833894 [2022-12-06 00:27:22,536 INFO L175 Difference]: Start difference. First operand has 386 places, 830 transitions, 24036 flow. Second operand 31 states and 300 transitions. [2022-12-06 00:27:22,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 1136 transitions, 31579 flow [2022-12-06 00:27:27,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 1136 transitions, 31337 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-12-06 00:27:27,399 INFO L231 Difference]: Finished difference. Result has 418 places, 936 transitions, 28506 flow [2022-12-06 00:27:27,400 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=23804, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=830, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=533, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=28506, PETRI_PLACES=418, PETRI_TRANSITIONS=936} [2022-12-06 00:27:27,400 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 389 predicate places. [2022-12-06 00:27:27,400 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:27:27,400 INFO L89 Accepts]: Start accepts. Operand has 418 places, 936 transitions, 28506 flow [2022-12-06 00:27:27,404 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:27:27,404 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:27:27,405 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 418 places, 936 transitions, 28506 flow [2022-12-06 00:27:27,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 416 places, 936 transitions, 28506 flow [2022-12-06 00:27:28,253 INFO L130 PetriNetUnfolder]: 1207/4672 cut-off events. [2022-12-06 00:27:28,253 INFO L131 PetriNetUnfolder]: For 159866/159985 co-relation queries the response was YES. [2022-12-06 00:27:28,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42284 conditions, 4672 events. 1207/4672 cut-off events. For 159866/159985 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 54178 event pairs, 52 based on Foata normal form. 2/4636 useless extension candidates. Maximal degree in co-relation 42000. Up to 789 conditions per place. [2022-12-06 00:27:28,429 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 416 places, 936 transitions, 28506 flow [2022-12-06 00:27:28,430 INFO L188 LiptonReduction]: Number of co-enabled transitions 4600 [2022-12-06 00:27:28,431 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:27:28,433 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1033 [2022-12-06 00:27:28,433 INFO L495 AbstractCegarLoop]: Abstraction has has 416 places, 936 transitions, 28506 flow [2022-12-06 00:27:28,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.7) internal successors, (54), 21 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:27:28,433 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:27:28,433 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:27:28,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-06 00:27:28,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:27:28,638 INFO L420 AbstractCegarLoop]: === Iteration 97 === 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 00:27:28,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:27:28,638 INFO L85 PathProgramCache]: Analyzing trace with hash 589346688, now seen corresponding path program 1 times [2022-12-06 00:27:28,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:27:28,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349601982] [2022-12-06 00:27:28,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:27:28,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:27:28,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:27:29,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:27:29,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:27:29,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349601982] [2022-12-06 00:27:29,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349601982] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:27:29,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243075577] [2022-12-06 00:27:29,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:27:29,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:27:29,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:27:29,250 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:27:29,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-06 00:27:29,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:27:29,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-06 00:27:29,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:27:29,784 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:27:29,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 43 [2022-12-06 00:27:29,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:27:29,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:27:29,971 INFO L321 Elim1Store]: treesize reduction 23, result has 14.8 percent of original size [2022-12-06 00:27:29,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 34 [2022-12-06 00:27:30,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:27:30,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243075577] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:27:30,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:27:30,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 19 [2022-12-06 00:27:30,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644155189] [2022-12-06 00:27:30,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:27:30,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 00:27:30,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:27:30,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 00:27:30,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2022-12-06 00:27:30,153 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 67 [2022-12-06 00:27:30,153 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 936 transitions, 28506 flow. Second operand has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:27:30,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:27:30,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 67 [2022-12-06 00:27:30,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:27:38,701 INFO L130 PetriNetUnfolder]: 5835/11172 cut-off events. [2022-12-06 00:27:38,701 INFO L131 PetriNetUnfolder]: For 578997/578997 co-relation queries the response was YES. [2022-12-06 00:27:38,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124913 conditions, 11172 events. 5835/11172 cut-off events. For 578997/578997 co-relation queries the response was YES. Maximal size of possible extension queue 660. Compared 93711 event pairs, 843 based on Foata normal form. 2/11170 useless extension candidates. Maximal degree in co-relation 124548. Up to 4895 conditions per place. [2022-12-06 00:27:38,840 INFO L137 encePairwiseOnDemand]: 24/67 looper letters, 518 selfloop transitions, 541 changer transitions 26/1085 dead transitions. [2022-12-06 00:27:38,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 1085 transitions, 32233 flow [2022-12-06 00:27:38,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-06 00:27:38,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-06 00:27:38,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 265 transitions. [2022-12-06 00:27:38,841 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1363870303654143 [2022-12-06 00:27:38,841 INFO L175 Difference]: Start difference. First operand has 416 places, 936 transitions, 28506 flow. Second operand 29 states and 265 transitions. [2022-12-06 00:27:38,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 1085 transitions, 32233 flow [2022-12-06 00:27:44,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 1085 transitions, 31913 flow, removed 78 selfloop flow, removed 7 redundant places. [2022-12-06 00:27:44,283 INFO L231 Difference]: Finished difference. Result has 445 places, 959 transitions, 30296 flow [2022-12-06 00:27:44,284 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=28194, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=936, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=518, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=30296, PETRI_PLACES=445, PETRI_TRANSITIONS=959} [2022-12-06 00:27:44,284 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 416 predicate places. [2022-12-06 00:27:44,284 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:27:44,284 INFO L89 Accepts]: Start accepts. Operand has 445 places, 959 transitions, 30296 flow [2022-12-06 00:27:44,289 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:27:44,289 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:27:44,289 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 445 places, 959 transitions, 30296 flow [2022-12-06 00:27:44,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 443 places, 959 transitions, 30296 flow [2022-12-06 00:27:45,243 INFO L130 PetriNetUnfolder]: 1227/4732 cut-off events. [2022-12-06 00:27:45,243 INFO L131 PetriNetUnfolder]: For 176186/176309 co-relation queries the response was YES. [2022-12-06 00:27:45,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44643 conditions, 4732 events. 1227/4732 cut-off events. For 176186/176309 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 54999 event pairs, 53 based on Foata normal form. 2/4699 useless extension candidates. Maximal degree in co-relation 44378. Up to 789 conditions per place. [2022-12-06 00:27:45,332 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 443 places, 959 transitions, 30296 flow [2022-12-06 00:27:45,332 INFO L188 LiptonReduction]: Number of co-enabled transitions 4726 [2022-12-06 00:27:45,335 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [581] $Ultimate##0-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_35| 0) (= |v_thread2Thread1of1ForFork0_~x~1#1_33| 0)) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_35|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_~x~1#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:27:45,384 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:27:45,521 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [772] L67-5-->thread1EXIT: Formula: (let ((.cse0 (mod v_~A~0_444 4294967296))) (and (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_377| 4294967296) .cse0) (= (ite (= (mod (select (select |v_#memory_int_768| v_~queue~0.base_414) (+ (* v_~end~0_863 4) v_~queue~0.offset_414)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_383| 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_201|) (= |v_thread1Thread1of1ForFork2_#res#1.base_199| 0) (= |v_thread1Thread1of1ForFork2_~i~0#1_376| (+ |v_thread1Thread1of1ForFork2_~i~0#1_377| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_510| 4294967296) .cse0) (= |v_thread1Thread1of1ForFork2_#res#1.offset_199| 0) (= (+ v_~end~0_863 1) v_~end~0_862) (not (= (ite (and (< v_~end~0_863 v_~n~0_420) (<= 0 v_~end~0_863)) 1 0) 0)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_376| 4294967296) .cse0)) (= |v_thread2Thread1of1ForFork0_~i~1#1_508| (+ 2 |v_thread2Thread1of1ForFork0_~i~1#1_510|)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_201| 0)) (= |v_thread1Thread1of1ForFork2_~x~0#1_383| (+ |v_thread1Thread1of1ForFork2_~x~0#1_384| v_~B~0_260)) (= |v_thread2Thread1of1ForFork0_~x~1#1_532| (+ |v_thread2Thread1of1ForFork0_~x~1#1_534| (* 2 v_~B~0_260))) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_201| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_201|) (< (mod (+ |v_thread2Thread1of1ForFork0_~i~1#1_510| 1) 4294967296) .cse0))) InVars {~queue~0.offset=v_~queue~0.offset_414, ~A~0=v_~A~0_444, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_384|, ~B~0=v_~B~0_260, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_377|, #memory_int=|v_#memory_int_768|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_510|, ~end~0=v_~end~0_863, ~queue~0.base=v_~queue~0.base_414, ~n~0=v_~n~0_420, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_534|} OutVars{~queue~0.offset=v_~queue~0.offset_414, ~A~0=v_~A~0_444, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_383|, ~B~0=v_~B~0_260, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_201|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_508|, ~queue~0.base=v_~queue~0.base_414, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_156|, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_201|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_376|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_201|, #memory_int=|v_#memory_int_768|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_199|, ~end~0=v_~end~0_862, ~n~0=v_~n~0_420, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_205|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_532|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_199|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_201|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:27:45,752 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [772] L67-5-->thread1EXIT: Formula: (let ((.cse0 (mod v_~A~0_444 4294967296))) (and (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_377| 4294967296) .cse0) (= (ite (= (mod (select (select |v_#memory_int_768| v_~queue~0.base_414) (+ (* v_~end~0_863 4) v_~queue~0.offset_414)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_383| 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_201|) (= |v_thread1Thread1of1ForFork2_#res#1.base_199| 0) (= |v_thread1Thread1of1ForFork2_~i~0#1_376| (+ |v_thread1Thread1of1ForFork2_~i~0#1_377| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_510| 4294967296) .cse0) (= |v_thread1Thread1of1ForFork2_#res#1.offset_199| 0) (= (+ v_~end~0_863 1) v_~end~0_862) (not (= (ite (and (< v_~end~0_863 v_~n~0_420) (<= 0 v_~end~0_863)) 1 0) 0)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_376| 4294967296) .cse0)) (= |v_thread2Thread1of1ForFork0_~i~1#1_508| (+ 2 |v_thread2Thread1of1ForFork0_~i~1#1_510|)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_201| 0)) (= |v_thread1Thread1of1ForFork2_~x~0#1_383| (+ |v_thread1Thread1of1ForFork2_~x~0#1_384| v_~B~0_260)) (= |v_thread2Thread1of1ForFork0_~x~1#1_532| (+ |v_thread2Thread1of1ForFork0_~x~1#1_534| (* 2 v_~B~0_260))) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_201| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_201|) (< (mod (+ |v_thread2Thread1of1ForFork0_~i~1#1_510| 1) 4294967296) .cse0))) InVars {~queue~0.offset=v_~queue~0.offset_414, ~A~0=v_~A~0_444, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_384|, ~B~0=v_~B~0_260, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_377|, #memory_int=|v_#memory_int_768|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_510|, ~end~0=v_~end~0_863, ~queue~0.base=v_~queue~0.base_414, ~n~0=v_~n~0_420, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_534|} OutVars{~queue~0.offset=v_~queue~0.offset_414, ~A~0=v_~A~0_444, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_383|, ~B~0=v_~B~0_260, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_201|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_508|, ~queue~0.base=v_~queue~0.base_414, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_156|, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_201|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_376|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_201|, #memory_int=|v_#memory_int_768|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_199|, ~end~0=v_~end~0_862, ~n~0=v_~n~0_420, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_205|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_532|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_199|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_201|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [580] L67-5-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_31| (+ |v_thread2Thread1of1ForFork0_~i~1#1_32| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_32| 4294967296) (mod v_~A~0_35 4294967296)) (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_30| v_~B~0_29) |v_thread2Thread1of1ForFork0_~x~1#1_29|)) InVars {~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_32|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_30|} OutVars{~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_31|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_13|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] [2022-12-06 00:27:46,072 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [772] L67-5-->thread1EXIT: Formula: (let ((.cse0 (mod v_~A~0_444 4294967296))) (and (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_377| 4294967296) .cse0) (= (ite (= (mod (select (select |v_#memory_int_768| v_~queue~0.base_414) (+ (* v_~end~0_863 4) v_~queue~0.offset_414)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_383| 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_201|) (= |v_thread1Thread1of1ForFork2_#res#1.base_199| 0) (= |v_thread1Thread1of1ForFork2_~i~0#1_376| (+ |v_thread1Thread1of1ForFork2_~i~0#1_377| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_510| 4294967296) .cse0) (= |v_thread1Thread1of1ForFork2_#res#1.offset_199| 0) (= (+ v_~end~0_863 1) v_~end~0_862) (not (= (ite (and (< v_~end~0_863 v_~n~0_420) (<= 0 v_~end~0_863)) 1 0) 0)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_376| 4294967296) .cse0)) (= |v_thread2Thread1of1ForFork0_~i~1#1_508| (+ 2 |v_thread2Thread1of1ForFork0_~i~1#1_510|)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_201| 0)) (= |v_thread1Thread1of1ForFork2_~x~0#1_383| (+ |v_thread1Thread1of1ForFork2_~x~0#1_384| v_~B~0_260)) (= |v_thread2Thread1of1ForFork0_~x~1#1_532| (+ |v_thread2Thread1of1ForFork0_~x~1#1_534| (* 2 v_~B~0_260))) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_201| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_201|) (< (mod (+ |v_thread2Thread1of1ForFork0_~i~1#1_510| 1) 4294967296) .cse0))) InVars {~queue~0.offset=v_~queue~0.offset_414, ~A~0=v_~A~0_444, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_384|, ~B~0=v_~B~0_260, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_377|, #memory_int=|v_#memory_int_768|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_510|, ~end~0=v_~end~0_863, ~queue~0.base=v_~queue~0.base_414, ~n~0=v_~n~0_420, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_534|} OutVars{~queue~0.offset=v_~queue~0.offset_414, ~A~0=v_~A~0_444, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_383|, ~B~0=v_~B~0_260, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_201|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_508|, ~queue~0.base=v_~queue~0.base_414, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_156|, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_201|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_376|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_201|, #memory_int=|v_#memory_int_768|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_199|, ~end~0=v_~end~0_862, ~n~0=v_~n~0_420, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_205|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_532|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_199|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_201|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] [2022-12-06 00:27:46,528 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [793] L67-5-->thread2EXIT: Formula: (let ((.cse0 (select |v_#memory_int_829| v_~queue~0.base_444)) (.cse1 (* v_~end~0_935 4)) (.cse2 (mod v_~A~0_484 4294967296))) (and (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_451| 4294967296) (mod (select .cse0 (+ .cse1 v_~queue~0.offset_444)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_225|) (= |v_thread2Thread1of1ForFork0_#res#1.base_229| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_225| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_225|) (= |v_thread1Thread1of1ForFork2_#res#1.offset_223| 0) (= |v_thread1Thread1of1ForFork2_~i~0#1_443| (+ |v_thread1Thread1of1ForFork2_~i~0#1_444| 1)) (not (= (ite (and (<= 0 v_~end~0_935) (< v_~end~0_935 v_~n~0_450)) 1 0) 0)) (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_444| 4294967296) .cse2) (not (= (ite (let ((.cse3 (+ v_~end~0_935 1))) (and (< .cse3 v_~n~0_450) (<= 0 .cse3))) 1 0) 0)) (= |v_thread1Thread1of1ForFork2_~x~0#1_451| (+ |v_thread1Thread1of1ForFork2_~x~0#1_452| v_~B~0_292)) (< (mod (+ |v_thread2Thread1of1ForFork0_~i~1#1_588| 1) 4294967296) .cse2) (= v_~end~0_933 (+ v_~end~0_935 2)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_239| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_239|) (= |v_thread2Thread1of1ForFork0_#res#1.offset_229| 0) (= (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_614| 4294967296) (mod (select .cse0 (+ .cse1 v_~queue~0.offset_444 4)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_239|) (= |v_thread1Thread1of1ForFork2_#res#1.base_223| 0) (= (+ 2 |v_thread2Thread1of1ForFork0_~i~1#1_588|) |v_thread2Thread1of1ForFork0_~i~1#1_587|) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_443| 4294967296) .cse2)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_239| 0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_225| 0)) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_587| 4294967296) .cse2)) (= |v_thread2Thread1of1ForFork0_~x~1#1_614| (+ |v_thread2Thread1of1ForFork0_~x~1#1_615| (* 2 v_~B~0_292))) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_588| 4294967296) .cse2))) InVars {~queue~0.offset=v_~queue~0.offset_444, ~A~0=v_~A~0_484, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_452|, ~B~0=v_~B~0_292, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_444|, #memory_int=|v_#memory_int_829|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_588|, ~end~0=v_~end~0_935, ~queue~0.base=v_~queue~0.base_444, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_615|, ~n~0=v_~n~0_450} OutVars{thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_451|, ~B~0=v_~B~0_292, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_229|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_239|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_225|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_587|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_201|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_239|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_223|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_223|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_239|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_225|, ~queue~0.offset=v_~queue~0.offset_444, ~A~0=v_~A~0_484, ~queue~0.base=v_~queue~0.base_444, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_239|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_229|, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_225|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_443|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_225|, #memory_int=|v_#memory_int_829|, ~end~0=v_~end~0_933, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_614|, ~n~0=v_~n~0_450, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_249|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~x~0#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_#t~post1#1, thread2Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread2Thread1of1ForFork0_~x~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:27:46,952 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 00:27:46,953 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2669 [2022-12-06 00:27:46,953 INFO L495 AbstractCegarLoop]: Abstraction has has 439 places, 955 transitions, 30282 flow [2022-12-06 00:27:46,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:27:46,953 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:27:46,953 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:27:46,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-12-06 00:27:47,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:27:47,159 INFO L420 AbstractCegarLoop]: === Iteration 98 === 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 00:27:47,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:27:47,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1815318068, now seen corresponding path program 1 times [2022-12-06 00:27:47,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:27:47,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110658412] [2022-12-06 00:27:47,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:27:47,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:27:47,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:27:47,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:27:47,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:27:47,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110658412] [2022-12-06 00:27:47,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110658412] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:27:47,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736212050] [2022-12-06 00:27:47,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:27:47,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:27:47,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:27:47,891 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:27:47,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-06 00:27:48,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:27:48,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-06 00:27:48,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:27:48,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:27:48,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2022-12-06 00:27:48,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:27:48,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:27:48,633 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-06 00:27:48,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 86 [2022-12-06 00:27:48,647 INFO L321 Elim1Store]: treesize reduction 23, result has 14.8 percent of original size [2022-12-06 00:27:48,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 42 [2022-12-06 00:27:48,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:27:48,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736212050] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:27:48,788 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:27:48,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 23 [2022-12-06 00:27:48,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685200393] [2022-12-06 00:27:48,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:27:48,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 00:27:48,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:27:48,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 00:27:48,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2022-12-06 00:27:48,789 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 72 [2022-12-06 00:27:48,789 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 955 transitions, 30282 flow. Second operand has 25 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:27:48,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:27:48,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 72 [2022-12-06 00:27:48,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:27:56,457 INFO L130 PetriNetUnfolder]: 5820/11153 cut-off events. [2022-12-06 00:27:56,457 INFO L131 PetriNetUnfolder]: For 640574/640574 co-relation queries the response was YES. [2022-12-06 00:27:56,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129563 conditions, 11153 events. 5820/11153 cut-off events. For 640574/640574 co-relation queries the response was YES. Maximal size of possible extension queue 657. Compared 93331 event pairs, 767 based on Foata normal form. 1/11154 useless extension candidates. Maximal degree in co-relation 129104. Up to 3733 conditions per place. [2022-12-06 00:27:56,636 INFO L137 encePairwiseOnDemand]: 18/72 looper letters, 624 selfloop transitions, 495 changer transitions 16/1135 dead transitions. [2022-12-06 00:27:56,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 470 places, 1135 transitions, 34410 flow [2022-12-06 00:27:56,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-06 00:27:56,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-06 00:27:56,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 285 transitions. [2022-12-06 00:27:56,637 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12369791666666667 [2022-12-06 00:27:56,637 INFO L175 Difference]: Start difference. First operand has 439 places, 955 transitions, 30282 flow. Second operand 32 states and 285 transitions. [2022-12-06 00:27:56,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 470 places, 1135 transitions, 34410 flow [2022-12-06 00:28:02,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 455 places, 1135 transitions, 33632 flow, removed 127 selfloop flow, removed 15 redundant places. [2022-12-06 00:28:02,666 INFO L231 Difference]: Finished difference. Result has 460 places, 959 transitions, 30676 flow [2022-12-06 00:28:02,667 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=29540, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=955, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=489, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=30676, PETRI_PLACES=460, PETRI_TRANSITIONS=959} [2022-12-06 00:28:02,667 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 431 predicate places. [2022-12-06 00:28:02,667 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:02,667 INFO L89 Accepts]: Start accepts. Operand has 460 places, 959 transitions, 30676 flow [2022-12-06 00:28:02,670 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:02,670 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:02,670 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 460 places, 959 transitions, 30676 flow [2022-12-06 00:28:02,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 458 places, 959 transitions, 30676 flow [2022-12-06 00:28:03,805 INFO L130 PetriNetUnfolder]: 1225/4735 cut-off events. [2022-12-06 00:28:03,805 INFO L131 PetriNetUnfolder]: For 182699/182842 co-relation queries the response was YES. [2022-12-06 00:28:03,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45049 conditions, 4735 events. 1225/4735 cut-off events. For 182699/182842 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 54969 event pairs, 51 based on Foata normal form. 2/4697 useless extension candidates. Maximal degree in co-relation 44850. Up to 791 conditions per place. [2022-12-06 00:28:03,885 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 458 places, 959 transitions, 30676 flow [2022-12-06 00:28:03,886 INFO L188 LiptonReduction]: Number of co-enabled transitions 4700 [2022-12-06 00:28:03,887 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [614] $Ultimate##0-->L51-5: Formula: (and (= |v_thread1Thread1of1ForFork2_~x~0#1_37| v_~B~0_59) (< 0 (mod v_~A~0_71 4294967296)) (= |v_thread1Thread1of1ForFork2_~i~0#1_33| 1)) InVars {~A~0=v_~A~0_71, ~B~0=v_~B~0_59} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_17|, ~A~0=v_~A~0_71, ~B~0=v_~B~0_59, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_37|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_33|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] and [794] L67-5-->L104-3: Formula: (let ((.cse2 (select |v_#memory_int_832| v_~queue~0.base_446)) (.cse3 (* v_~end~0_940 4)) (.cse1 (mod v_~A~0_486 4294967296))) (and (= |v_thread1Thread1of1ForFork2_~x~0#1_455| (+ |v_thread1Thread1of1ForFork2_~x~0#1_456| v_~B~0_294)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_231| 0) (= (store |v_#memory_int_832| |v_ULTIMATE.start_main_~#t3~0#1.base_286| (store (select |v_#memory_int_832| |v_ULTIMATE.start_main_~#t3~0#1.base_286|) |v_ULTIMATE.start_main_~#t3~0#1.offset_268| |v_ULTIMATE.start_main_#t~pre18#1_306|)) |v_#memory_int_831|) (= |v_thread1Thread1of1ForFork2_~i~0#1_447| (+ |v_thread1Thread1of1ForFork2_~i~0#1_448| 1)) (not (= (ite (let ((.cse0 (+ v_~end~0_940 1))) (and (<= 0 .cse0) (< .cse0 v_~n~0_452))) 1 0) 0)) (= |v_thread1Thread1of1ForFork2_#res#1.base_225| 0) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_447| 4294967296) .cse1)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_241| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_241|) (= |v_thread2Thread1of1ForFork0_~i~1#1_591| (+ 2 |v_thread2Thread1of1ForFork0_~i~1#1_592|)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_592| 4294967296) .cse1) (= (+ |v_#pthreadsForks_570| 1) |v_#pthreadsForks_569|) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_591| 4294967296) .cse1)) (= |v_thread2Thread1of1ForFork0_~x~1#1_618| (+ |v_thread2Thread1of1ForFork0_~x~1#1_619| (* 2 v_~B~0_294))) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_227| (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_455| 4294967296) (mod (select .cse2 (+ .cse3 v_~queue~0.offset_446)) 4294967296)) 1 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_231| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_241| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_241| (ite (= (mod (select .cse2 (+ .cse3 v_~queue~0.offset_446 4)) 4294967296) (mod |v_thread2Thread1of1ForFork0_~x~1#1_618| 4294967296)) 1 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_225| 0) (< (mod (+ |v_thread2Thread1of1ForFork0_~i~1#1_592| 1) 4294967296) .cse1) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_227| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_227|) (= |v_ULTIMATE.start_main_#t~pre18#1_306| |v_#pthreadsForks_570|) (not (= (ite (and (<= 0 v_~end~0_940) (< v_~end~0_940 v_~n~0_452)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_227| 0)) (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_448| 4294967296) .cse1) (= v_~end~0_939 (+ v_~end~0_940 2)))) InVars {~queue~0.offset=v_~queue~0.offset_446, ~A~0=v_~A~0_486, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_456|, ~B~0=v_~B~0_294, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_268|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_286|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_592|, ~queue~0.base=v_~queue~0.base_446, #pthreadsForks=|v_#pthreadsForks_570|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_448|, #memory_int=|v_#memory_int_832|, ~end~0=v_~end~0_940, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_619|, ~n~0=v_~n~0_452} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_306|, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_455|, ~B~0=v_~B~0_294, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_268|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_231|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_241|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_227|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_286|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_591|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_203|, #pthreadsForks=|v_#pthreadsForks_569|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_317|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_241|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_225|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_272|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_225|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_241|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_227|, ~queue~0.offset=v_~queue~0.offset_446, ~A~0=v_~A~0_486, ~queue~0.base=v_~queue~0.base_446, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_241|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_231|, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_227|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_447|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_227|, #memory_int=|v_#memory_int_831|, ~end~0=v_~end~0_939, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_618|, ~n~0=v_~n~0_452, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_251|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread1Thread1of1ForFork2_~x~0#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_#t~post1#1, thread2Thread1of1ForFork0_#res#1.base, #pthreadsForks, thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, thread2Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, ULTIMATE.start_main_#t~nondet17#1, thread2Thread1of1ForFork0_~x~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] [2022-12-06 00:28:04,384 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [614] $Ultimate##0-->L51-5: Formula: (and (= |v_thread1Thread1of1ForFork2_~x~0#1_37| v_~B~0_59) (< 0 (mod v_~A~0_71 4294967296)) (= |v_thread1Thread1of1ForFork2_~i~0#1_33| 1)) InVars {~A~0=v_~A~0_71, ~B~0=v_~B~0_59} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_17|, ~A~0=v_~A~0_71, ~B~0=v_~B~0_59, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_37|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_33|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1] and [791] L67-5-->L104-3: Formula: (let ((.cse0 (mod v_~A~0_480 4294967296))) (and (= v_~end~0_925 (+ v_~end~0_926 1)) (= (+ |v_#pthreadsForks_566| 1) |v_#pthreadsForks_565|) (= |v_thread1Thread1of1ForFork2_#res#1.offset_219| 0) (= |v_thread1Thread1of1ForFork2_#res#1.base_219| 0) (= |v_thread2Thread1of1ForFork0_~i~1#1_577| (+ 2 |v_thread2Thread1of1ForFork0_~i~1#1_578|)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_221| 0)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_221| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_221|) (= |v_thread1Thread1of1ForFork2_~i~0#1_435| (+ |v_thread1Thread1of1ForFork2_~i~0#1_436| 1)) (= |v_thread1Thread1of1ForFork2_~x~0#1_443| (+ |v_thread1Thread1of1ForFork2_~x~0#1_444| v_~B~0_288)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_435| 4294967296) .cse0)) (< (mod (+ |v_thread2Thread1of1ForFork0_~i~1#1_578| 1) 4294967296) .cse0) (= |v_ULTIMATE.start_main_#t~pre18#1_304| |v_#pthreadsForks_566|) (not (= (ite (and (<= 0 v_~end~0_926) (< v_~end~0_926 v_~n~0_446)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_578| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork0_~x~1#1_604| (+ |v_thread2Thread1of1ForFork0_~x~1#1_605| (* 2 v_~B~0_288))) (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_436| 4294967296) .cse0) (= |v_#memory_int_823| (store |v_#memory_int_824| |v_ULTIMATE.start_main_~#t3~0#1.base_284| (store (select |v_#memory_int_824| |v_ULTIMATE.start_main_~#t3~0#1.base_284|) |v_ULTIMATE.start_main_~#t3~0#1.offset_266| |v_ULTIMATE.start_main_#t~pre18#1_304|))) (= (ite (= (mod |v_thread1Thread1of1ForFork2_~x~0#1_443| 4294967296) (mod (select (select |v_#memory_int_824| v_~queue~0.base_440) (+ (* v_~end~0_926 4) v_~queue~0.offset_440)) 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_221|))) InVars {~queue~0.offset=v_~queue~0.offset_440, ~A~0=v_~A~0_480, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_444|, ~B~0=v_~B~0_288, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_266|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_284|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_578|, ~queue~0.base=v_~queue~0.base_440, #pthreadsForks=|v_#pthreadsForks_566|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_436|, #memory_int=|v_#memory_int_824|, ~end~0=v_~end~0_926, ~n~0=v_~n~0_446, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_605|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_304|, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_443|, ~B~0=v_~B~0_288, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_266|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_221|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_284|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_577|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_197|, #pthreadsForks=|v_#pthreadsForks_565|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_315|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_219|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_270|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_219|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_221|, ~queue~0.offset=v_~queue~0.offset_440, ~A~0=v_~A~0_480, ~queue~0.base=v_~queue~0.base_440, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_221|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_435|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_221|, #memory_int=|v_#memory_int_823|, ~end~0=v_~end~0_925, ~n~0=v_~n~0_446, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_243|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_604|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork2_#t~post1#1, #pthreadsForks, thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, ULTIMATE.start_main_#t~nondet17#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] [2022-12-06 00:28:04,709 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [580] L67-5-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_31| (+ |v_thread2Thread1of1ForFork0_~i~1#1_32| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_32| 4294967296) (mod v_~A~0_35 4294967296)) (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_30| v_~B~0_29) |v_thread2Thread1of1ForFork0_~x~1#1_29|)) InVars {~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_32|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_30|} OutVars{~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_31|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_13|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:28:05,017 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [581] $Ultimate##0-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_35| 0) (= |v_thread2Thread1of1ForFork0_~x~1#1_33| 0)) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_35|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_~x~1#1] and [752] L103-4-->L67-5: Formula: (and (= |v_ULTIMATE.start_main_#t~pre18#1_263| |v_#pthreadsForks_488|) (= (+ |v_#pthreadsForks_488| 1) |v_#pthreadsForks_487|) (= (store |v_#memory_int_723| |v_ULTIMATE.start_main_~#t3~0#1.base_246| (store (select |v_#memory_int_723| |v_ULTIMATE.start_main_~#t3~0#1.base_246|) |v_ULTIMATE.start_main_~#t3~0#1.offset_228| |v_ULTIMATE.start_main_#t~pre18#1_263|)) |v_#memory_int_722|) (= |v_thread2Thread1of1ForFork0_~x~1#1_470| (+ |v_thread2Thread1of1ForFork0_~x~1#1_471| v_~B~0_226)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_447| 4294967296) (mod v_~A~0_404 4294967296)) (= |v_thread2Thread1of1ForFork0_~i~1#1_446| (+ |v_thread2Thread1of1ForFork0_~i~1#1_447| 1))) InVars {~A~0=v_~A~0_404, ~B~0=v_~B~0_226, #pthreadsForks=|v_#pthreadsForks_488|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_228|, #memory_int=|v_#memory_int_723|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_246|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_447|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_471|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_263|, ~A~0=v_~A~0_404, ~B~0=v_~B~0_226, #pthreadsForks=|v_#pthreadsForks_487|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_228|, #memory_int=|v_#memory_int_722|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_246|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_446|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_275|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_175|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_470|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_231|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, thread2Thread1of1ForFork0_~i~1#1, ULTIMATE.start_main_#t~pre16#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:28:05,054 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:28:05,054 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2387 [2022-12-06 00:28:05,054 INFO L495 AbstractCegarLoop]: Abstraction has has 457 places, 958 transitions, 30774 flow [2022-12-06 00:28:05,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:05,055 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:05,055 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:05,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-12-06 00:28:05,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable97 [2022-12-06 00:28:05,260 INFO L420 AbstractCegarLoop]: === Iteration 99 === 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 00:28:05,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:05,260 INFO L85 PathProgramCache]: Analyzing trace with hash 606767704, now seen corresponding path program 1 times [2022-12-06 00:28:05,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:05,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059181448] [2022-12-06 00:28:05,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:05,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:05,753 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 00:28:05,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:05,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059181448] [2022-12-06 00:28:05,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059181448] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:28:05,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:28:05,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:28:05,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264312875] [2022-12-06 00:28:05,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:28:05,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:28:05,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:05,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:28:05,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:28:05,754 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 75 [2022-12-06 00:28:05,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 958 transitions, 30774 flow. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:05,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:05,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 75 [2022-12-06 00:28:05,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:10,211 INFO L130 PetriNetUnfolder]: 5804/11122 cut-off events. [2022-12-06 00:28:10,211 INFO L131 PetriNetUnfolder]: For 663099/663099 co-relation queries the response was YES. [2022-12-06 00:28:10,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130416 conditions, 11122 events. 5804/11122 cut-off events. For 663099/663099 co-relation queries the response was YES. Maximal size of possible extension queue 673. Compared 92789 event pairs, 1771 based on Foata normal form. 1/11123 useless extension candidates. Maximal degree in co-relation 130038. Up to 10807 conditions per place. [2022-12-06 00:28:10,412 INFO L137 encePairwiseOnDemand]: 57/75 looper letters, 922 selfloop transitions, 46 changer transitions 15/983 dead transitions. [2022-12-06 00:28:10,412 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 462 places, 983 transitions, 32916 flow [2022-12-06 00:28:10,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:28:10,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:28:10,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2022-12-06 00:28:10,413 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23777777777777778 [2022-12-06 00:28:10,413 INFO L175 Difference]: Start difference. First operand has 457 places, 958 transitions, 30774 flow. Second operand 6 states and 107 transitions. [2022-12-06 00:28:10,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 462 places, 983 transitions, 32916 flow [2022-12-06 00:28:16,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 983 transitions, 32053 flow, removed 72 selfloop flow, removed 15 redundant places. [2022-12-06 00:28:16,542 INFO L231 Difference]: Finished difference. Result has 448 places, 955 transitions, 29886 flow [2022-12-06 00:28:16,543 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=29911, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=958, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=912, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=29886, PETRI_PLACES=448, PETRI_TRANSITIONS=955} [2022-12-06 00:28:16,543 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 419 predicate places. [2022-12-06 00:28:16,543 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:16,543 INFO L89 Accepts]: Start accepts. Operand has 448 places, 955 transitions, 29886 flow [2022-12-06 00:28:16,546 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:16,546 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:16,547 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 448 places, 955 transitions, 29886 flow [2022-12-06 00:28:16,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 444 places, 955 transitions, 29886 flow [2022-12-06 00:28:17,633 INFO L130 PetriNetUnfolder]: 1226/4715 cut-off events. [2022-12-06 00:28:17,633 INFO L131 PetriNetUnfolder]: For 173879/174027 co-relation queries the response was YES. [2022-12-06 00:28:17,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44590 conditions, 4715 events. 1226/4715 cut-off events. For 173879/174027 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 54705 event pairs, 51 based on Foata normal form. 2/4673 useless extension candidates. Maximal degree in co-relation 44295. Up to 790 conditions per place. [2022-12-06 00:28:17,721 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 444 places, 955 transitions, 29886 flow [2022-12-06 00:28:17,721 INFO L188 LiptonReduction]: Number of co-enabled transitions 4690 [2022-12-06 00:28:17,723 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:28:17,723 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1180 [2022-12-06 00:28:17,724 INFO L495 AbstractCegarLoop]: Abstraction has has 444 places, 955 transitions, 29886 flow [2022-12-06 00:28:17,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:17,724 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:17,724 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:17,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2022-12-06 00:28:17,724 INFO L420 AbstractCegarLoop]: === Iteration 100 === 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 00:28:17,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:17,724 INFO L85 PathProgramCache]: Analyzing trace with hash -735461043, now seen corresponding path program 1 times [2022-12-06 00:28:17,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:17,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255128093] [2022-12-06 00:28:17,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:17,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:17,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:18,373 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 00:28:18,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:18,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255128093] [2022-12-06 00:28:18,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255128093] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:28:18,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:28:18,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:28:18,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9395709] [2022-12-06 00:28:18,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:28:18,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:28:18,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:18,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:28:18,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:28:18,374 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 74 [2022-12-06 00:28:18,375 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 955 transitions, 29886 flow. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:18,375 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:18,375 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 74 [2022-12-06 00:28:18,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:23,376 INFO L130 PetriNetUnfolder]: 5803/11120 cut-off events. [2022-12-06 00:28:23,376 INFO L131 PetriNetUnfolder]: For 642308/642308 co-relation queries the response was YES. [2022-12-06 00:28:23,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129382 conditions, 11120 events. 5803/11120 cut-off events. For 642308/642308 co-relation queries the response was YES. Maximal size of possible extension queue 673. Compared 92820 event pairs, 1631 based on Foata normal form. 1/11120 useless extension candidates. Maximal degree in co-relation 129004. Up to 8097 conditions per place. [2022-12-06 00:28:23,570 INFO L137 encePairwiseOnDemand]: 56/74 looper letters, 861 selfloop transitions, 118 changer transitions 14/993 dead transitions. [2022-12-06 00:28:23,570 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 993 transitions, 32105 flow [2022-12-06 00:28:23,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:28:23,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:28:23,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2022-12-06 00:28:23,571 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2471042471042471 [2022-12-06 00:28:23,571 INFO L175 Difference]: Start difference. First operand has 444 places, 955 transitions, 29886 flow. Second operand 7 states and 128 transitions. [2022-12-06 00:28:23,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 993 transitions, 32105 flow [2022-12-06 00:28:29,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 993 transitions, 31990 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-12-06 00:28:29,252 INFO L231 Difference]: Finished difference. Result has 447 places, 954 transitions, 29965 flow [2022-12-06 00:28:29,256 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=29773, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=955, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=837, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=29965, PETRI_PLACES=447, PETRI_TRANSITIONS=954} [2022-12-06 00:28:29,256 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 418 predicate places. [2022-12-06 00:28:29,256 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:29,256 INFO L89 Accepts]: Start accepts. Operand has 447 places, 954 transitions, 29965 flow [2022-12-06 00:28:29,260 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:29,260 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:29,260 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 447 places, 954 transitions, 29965 flow [2022-12-06 00:28:29,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 445 places, 954 transitions, 29965 flow [2022-12-06 00:28:30,274 INFO L130 PetriNetUnfolder]: 1225/4713 cut-off events. [2022-12-06 00:28:30,275 INFO L131 PetriNetUnfolder]: For 174485/174633 co-relation queries the response was YES. [2022-12-06 00:28:30,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44675 conditions, 4713 events. 1225/4713 cut-off events. For 174485/174633 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 54713 event pairs, 51 based on Foata normal form. 2/4674 useless extension candidates. Maximal degree in co-relation 44425. Up to 786 conditions per place. [2022-12-06 00:28:30,363 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 445 places, 954 transitions, 29965 flow [2022-12-06 00:28:30,363 INFO L188 LiptonReduction]: Number of co-enabled transitions 4682 [2022-12-06 00:28:30,416 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [796] $Ultimate##0-->L104-3: Formula: (let ((.cse0 (* 2 v_~B~0_298)) (.cse1 (mod v_~A~0_490 4294967296))) (and (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_233| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_233|) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_233| 0)) (not (= (ite (and (< v_~end~0_952 v_~n~0_456) (<= 0 v_~end~0_952)) 1 0) 0)) (= |v_ULTIMATE.start_main_#t~pre18#1_312| |v_#pthreadsForks_580|) (= v_~end~0_951 (+ v_~end~0_952 1)) (= (store |v_#memory_int_843| |v_ULTIMATE.start_main_~#t3~0#1.base_290| (store (select |v_#memory_int_843| |v_ULTIMATE.start_main_~#t3~0#1.base_290|) |v_ULTIMATE.start_main_~#t3~0#1.offset_272| |v_ULTIMATE.start_main_#t~pre18#1_312|)) |v_#memory_int_842|) (= |v_thread1Thread1of1ForFork2_#res#1.base_231| 0) (= |v_thread2Thread1of1ForFork0_~x~1#1_630| (+ |v_thread2Thread1of1ForFork0_~x~1#1_631| .cse0)) (= (+ |v_#pthreadsForks_580| 1) |v_#pthreadsForks_579|) (< (mod (+ |v_thread2Thread1of1ForFork0_~i~1#1_603| 1) 4294967296) .cse1) (= |v_thread1Thread1of1ForFork2_~i~0#1_457| 2) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_603| 4294967296) .cse1) (= |v_thread1Thread1of1ForFork2_~x~0#1_465| .cse0) (= |v_thread2Thread1of1ForFork0_~i~1#1_602| (+ 2 |v_thread2Thread1of1ForFork0_~i~1#1_603|)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_231| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_233| (ite (= (mod (select (select |v_#memory_int_843| v_~queue~0.base_450) (+ v_~queue~0.offset_450 (* v_~end~0_952 4))) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_465| 4294967296)) 1 0)) (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_457| 4294967296) .cse1)))) InVars {~queue~0.offset=v_~queue~0.offset_450, ~A~0=v_~A~0_490, ~B~0=v_~B~0_298, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_272|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_290|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_603|, ~queue~0.base=v_~queue~0.base_450, #pthreadsForks=|v_#pthreadsForks_580|, #memory_int=|v_#memory_int_843|, ~end~0=v_~end~0_952, ~n~0=v_~n~0_456, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_631|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_312|, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_465|, ~B~0=v_~B~0_298, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_272|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_290|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_602|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_211|, #pthreadsForks=|v_#pthreadsForks_579|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_323|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_231|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_277|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_231|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_233|, ~queue~0.offset=v_~queue~0.offset_450, ~A~0=v_~A~0_490, ~queue~0.base=v_~queue~0.base_450, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_233|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_457|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_233|, #memory_int=|v_#memory_int_842|, ~end~0=v_~end~0_951, ~n~0=v_~n~0_456, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_257|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_630|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork2_#t~post1#1, #pthreadsForks, thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, ULTIMATE.start_main_#t~nondet17#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [580] L67-5-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_31| (+ |v_thread2Thread1of1ForFork0_~i~1#1_32| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_32| 4294967296) (mod v_~A~0_35 4294967296)) (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_30| v_~B~0_29) |v_thread2Thread1of1ForFork0_~x~1#1_29|)) InVars {~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_32|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_30|} OutVars{~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_31|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_13|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] [2022-12-06 00:28:30,441 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:28:30,441 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1185 [2022-12-06 00:28:30,441 INFO L495 AbstractCegarLoop]: Abstraction has has 445 places, 934 transitions, 28998 flow [2022-12-06 00:28:30,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:30,441 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:30,441 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:30,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2022-12-06 00:28:30,442 INFO L420 AbstractCegarLoop]: === Iteration 101 === 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 00:28:30,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:30,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1195098807, now seen corresponding path program 1 times [2022-12-06 00:28:30,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:30,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814033346] [2022-12-06 00:28:30,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:30,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:30,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:30,454 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 00:28:30,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:30,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814033346] [2022-12-06 00:28:30,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814033346] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:28:30,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:28:30,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 00:28:30,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847767288] [2022-12-06 00:28:30,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:28:30,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 00:28:30,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:30,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 00:28:30,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 00:28:30,455 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 74 [2022-12-06 00:28:30,455 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 934 transitions, 28998 flow. Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:30,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:30,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 74 [2022-12-06 00:28:30,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:34,498 INFO L130 PetriNetUnfolder]: 5667/10941 cut-off events. [2022-12-06 00:28:34,498 INFO L131 PetriNetUnfolder]: For 609384/609384 co-relation queries the response was YES. [2022-12-06 00:28:34,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126435 conditions, 10941 events. 5667/10941 cut-off events. For 609384/609384 co-relation queries the response was YES. Maximal size of possible extension queue 648. Compared 91444 event pairs, 1906 based on Foata normal form. 1/10941 useless extension candidates. Maximal degree in co-relation 126056. Up to 10942 conditions per place. [2022-12-06 00:28:34,653 INFO L137 encePairwiseOnDemand]: 73/74 looper letters, 901 selfloop transitions, 0 changer transitions 30/931 dead transitions. [2022-12-06 00:28:34,654 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 931 transitions, 30691 flow [2022-12-06 00:28:34,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 00:28:34,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 00:28:34,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 74 transitions. [2022-12-06 00:28:34,654 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 00:28:34,654 INFO L175 Difference]: Start difference. First operand has 445 places, 934 transitions, 28998 flow. Second operand 2 states and 74 transitions. [2022-12-06 00:28:34,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 931 transitions, 30691 flow [2022-12-06 00:28:40,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 931 transitions, 30546 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-06 00:28:40,065 INFO L231 Difference]: Finished difference. Result has 441 places, 901 transitions, 27655 flow [2022-12-06 00:28:40,066 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=28684, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=931, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=931, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=27655, PETRI_PLACES=441, PETRI_TRANSITIONS=901} [2022-12-06 00:28:40,066 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 412 predicate places. [2022-12-06 00:28:40,066 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:40,066 INFO L89 Accepts]: Start accepts. Operand has 441 places, 901 transitions, 27655 flow [2022-12-06 00:28:40,069 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:40,069 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:40,069 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 441 places, 901 transitions, 27655 flow [2022-12-06 00:28:40,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 440 places, 901 transitions, 27655 flow [2022-12-06 00:28:40,904 INFO L130 PetriNetUnfolder]: 1163/4587 cut-off events. [2022-12-06 00:28:40,904 INFO L131 PetriNetUnfolder]: For 164123/164264 co-relation queries the response was YES. [2022-12-06 00:28:40,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42710 conditions, 4587 events. 1163/4587 cut-off events. For 164123/164264 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 53379 event pairs, 51 based on Foata normal form. 2/4549 useless extension candidates. Maximal degree in co-relation 42391. Up to 786 conditions per place. [2022-12-06 00:28:40,999 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 440 places, 901 transitions, 27655 flow [2022-12-06 00:28:40,999 INFO L188 LiptonReduction]: Number of co-enabled transitions 4322 [2022-12-06 00:28:41,006 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [788] $Ultimate##0-->L104-3: Formula: (and (= |v_thread2Thread1of1ForFork0_~x~1#1_596| 0) (= |v_ULTIMATE.start_main_#t~pre18#1_300| |v_#pthreadsForks_558|) (= |v_thread2Thread1of1ForFork0_~i~1#1_569| 0) (= (+ |v_#pthreadsForks_558| 1) |v_#pthreadsForks_557|) (= (store |v_#memory_int_816| |v_ULTIMATE.start_main_~#t3~0#1.base_280| (store (select |v_#memory_int_816| |v_ULTIMATE.start_main_~#t3~0#1.base_280|) |v_ULTIMATE.start_main_~#t3~0#1.offset_262| |v_ULTIMATE.start_main_#t~pre18#1_300|)) |v_#memory_int_815|)) InVars {#pthreadsForks=|v_#pthreadsForks_558|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_262|, #memory_int=|v_#memory_int_816|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_280|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_300|, #pthreadsForks=|v_#pthreadsForks_557|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_262|, #memory_int=|v_#memory_int_815|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_280|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_311|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_569|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_266|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_596|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, thread2Thread1of1ForFork0_~i~1#1, ULTIMATE.start_main_#t~nondet17#1, thread2Thread1of1ForFork0_~x~1#1] and [580] L67-5-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_31| (+ |v_thread2Thread1of1ForFork0_~i~1#1_32| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_32| 4294967296) (mod v_~A~0_35 4294967296)) (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_30| v_~B~0_29) |v_thread2Thread1of1ForFork0_~x~1#1_29|)) InVars {~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_32|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_30|} OutVars{~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_31|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_13|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] [2022-12-06 00:28:41,233 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 00:28:41,234 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1168 [2022-12-06 00:28:41,234 INFO L495 AbstractCegarLoop]: Abstraction has has 435 places, 897 transitions, 27557 flow [2022-12-06 00:28:41,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:41,234 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:41,234 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:41,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2022-12-06 00:28:41,234 INFO L420 AbstractCegarLoop]: === Iteration 102 === 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 00:28:41,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:41,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1662201021, now seen corresponding path program 1 times [2022-12-06 00:28:41,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:41,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850784472] [2022-12-06 00:28:41,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:41,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:41,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:41,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:41,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850784472] [2022-12-06 00:28:41,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850784472] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:28:41,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887042138] [2022-12-06 00:28:41,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:41,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:28:41,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:28:41,753 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:28:41,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-06 00:28:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:41,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-06 00:28:41,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:28:42,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:28:42,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-12-06 00:28:42,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:42,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:28:42,307 INFO L321 Elim1Store]: treesize reduction 23, result has 14.8 percent of original size [2022-12-06 00:28:42,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 59 [2022-12-06 00:28:42,311 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:28:42,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 7 [2022-12-06 00:28:42,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:42,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887042138] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:28:42,405 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:28:42,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-06 00:28:42,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351463491] [2022-12-06 00:28:42,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:28:42,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 00:28:42,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:42,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 00:28:42,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-12-06 00:28:42,406 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 76 [2022-12-06 00:28:42,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 897 transitions, 27557 flow. Second operand has 19 states, 18 states have (on average 2.611111111111111) internal successors, (47), 18 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:42,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:42,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 76 [2022-12-06 00:28:42,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:48,024 INFO L130 PetriNetUnfolder]: 5537/10762 cut-off events. [2022-12-06 00:28:48,024 INFO L131 PetriNetUnfolder]: For 596294/596294 co-relation queries the response was YES. [2022-12-06 00:28:48,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123403 conditions, 10762 events. 5537/10762 cut-off events. For 596294/596294 co-relation queries the response was YES. Maximal size of possible extension queue 658. Compared 90895 event pairs, 1089 based on Foata normal form. 2/10763 useless extension candidates. Maximal degree in co-relation 122617. Up to 5607 conditions per place. [2022-12-06 00:28:48,161 INFO L137 encePairwiseOnDemand]: 29/76 looper letters, 689 selfloop transitions, 297 changer transitions 16/1002 dead transitions. [2022-12-06 00:28:48,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 1002 transitions, 30688 flow [2022-12-06 00:28:48,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 00:28:48,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 00:28:48,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 209 transitions. [2022-12-06 00:28:48,163 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13095238095238096 [2022-12-06 00:28:48,163 INFO L175 Difference]: Start difference. First operand has 435 places, 897 transitions, 27557 flow. Second operand 21 states and 209 transitions. [2022-12-06 00:28:48,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 1002 transitions, 30688 flow [2022-12-06 00:28:53,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 1002 transitions, 30573 flow, removed 55 selfloop flow, removed 1 redundant places. [2022-12-06 00:28:53,318 INFO L231 Difference]: Finished difference. Result has 457 places, 902 transitions, 28240 flow [2022-12-06 00:28:53,319 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=27446, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=897, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=291, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=603, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=28240, PETRI_PLACES=457, PETRI_TRANSITIONS=902} [2022-12-06 00:28:53,319 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 428 predicate places. [2022-12-06 00:28:53,320 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:53,320 INFO L89 Accepts]: Start accepts. Operand has 457 places, 902 transitions, 28240 flow [2022-12-06 00:28:53,323 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:53,324 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:53,324 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 457 places, 902 transitions, 28240 flow [2022-12-06 00:28:53,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 455 places, 902 transitions, 28240 flow [2022-12-06 00:28:54,412 INFO L130 PetriNetUnfolder]: 1166/4598 cut-off events. [2022-12-06 00:28:54,413 INFO L131 PetriNetUnfolder]: For 174377/174518 co-relation queries the response was YES. [2022-12-06 00:28:54,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43733 conditions, 4598 events. 1166/4598 cut-off events. For 174377/174518 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 53584 event pairs, 51 based on Foata normal form. 2/4562 useless extension candidates. Maximal degree in co-relation 43513. Up to 786 conditions per place. [2022-12-06 00:28:54,495 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 455 places, 902 transitions, 28240 flow [2022-12-06 00:28:54,495 INFO L188 LiptonReduction]: Number of co-enabled transitions 4338 [2022-12-06 00:28:54,497 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:28:54,497 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1177 [2022-12-06 00:28:54,497 INFO L495 AbstractCegarLoop]: Abstraction has has 455 places, 902 transitions, 28240 flow [2022-12-06 00:28:54,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.611111111111111) internal successors, (47), 18 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:54,497 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:54,497 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:54,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-12-06 00:28:54,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable101 [2022-12-06 00:28:54,707 INFO L420 AbstractCegarLoop]: === Iteration 103 === 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 00:28:54,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:54,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1099502824, now seen corresponding path program 1 times [2022-12-06 00:28:54,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:54,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929983244] [2022-12-06 00:28:54,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:54,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:54,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:54,765 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 00:28:54,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:54,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929983244] [2022-12-06 00:28:54,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929983244] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:28:54,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:28:54,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:28:54,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146299530] [2022-12-06 00:28:54,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:28:54,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:28:54,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:54,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:28:54,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:28:54,766 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 75 [2022-12-06 00:28:54,766 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 902 transitions, 28240 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:54,766 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:54,766 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 75 [2022-12-06 00:28:54,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:58,816 INFO L130 PetriNetUnfolder]: 5505/10681 cut-off events. [2022-12-06 00:28:58,816 INFO L131 PetriNetUnfolder]: For 628565/628565 co-relation queries the response was YES. [2022-12-06 00:28:58,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125146 conditions, 10681 events. 5505/10681 cut-off events. For 628565/628565 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 89653 event pairs, 1630 based on Foata normal form. 4/10684 useless extension candidates. Maximal degree in co-relation 124766. Up to 9426 conditions per place. [2022-12-06 00:28:58,980 INFO L137 encePairwiseOnDemand]: 53/75 looper letters, 767 selfloop transitions, 163 changer transitions 0/930 dead transitions. [2022-12-06 00:28:58,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 930 transitions, 30455 flow [2022-12-06 00:28:58,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:28:58,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:28:58,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2022-12-06 00:28:58,981 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32666666666666666 [2022-12-06 00:28:58,981 INFO L175 Difference]: Start difference. First operand has 455 places, 902 transitions, 28240 flow. Second operand 4 states and 98 transitions. [2022-12-06 00:28:58,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 930 transitions, 30455 flow [2022-12-06 00:29:04,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 930 transitions, 30266 flow, removed 21 selfloop flow, removed 11 redundant places. [2022-12-06 00:29:04,514 INFO L231 Difference]: Finished difference. Result has 447 places, 900 transitions, 28263 flow [2022-12-06 00:29:04,515 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=27937, PETRI_DIFFERENCE_MINUEND_PLACES=444, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=900, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=163, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=737, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=28263, PETRI_PLACES=447, PETRI_TRANSITIONS=900} [2022-12-06 00:29:04,515 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 418 predicate places. [2022-12-06 00:29:04,515 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:04,515 INFO L89 Accepts]: Start accepts. Operand has 447 places, 900 transitions, 28263 flow [2022-12-06 00:29:04,518 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:04,518 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:04,518 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 447 places, 900 transitions, 28263 flow [2022-12-06 00:29:04,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 447 places, 900 transitions, 28263 flow [2022-12-06 00:29:05,392 INFO L130 PetriNetUnfolder]: 1159/4577 cut-off events. [2022-12-06 00:29:05,393 INFO L131 PetriNetUnfolder]: For 172941/173070 co-relation queries the response was YES. [2022-12-06 00:29:05,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43425 conditions, 4577 events. 1159/4577 cut-off events. For 172941/173070 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 53228 event pairs, 53 based on Foata normal form. 2/4544 useless extension candidates. Maximal degree in co-relation 43158. Up to 781 conditions per place. [2022-12-06 00:29:05,478 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 447 places, 900 transitions, 28263 flow [2022-12-06 00:29:05,478 INFO L188 LiptonReduction]: Number of co-enabled transitions 4326 [2022-12-06 00:29:05,480 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:29:05,480 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 965 [2022-12-06 00:29:05,480 INFO L495 AbstractCegarLoop]: Abstraction has has 447 places, 900 transitions, 28263 flow [2022-12-06 00:29:05,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:05,480 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:05,481 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:05,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2022-12-06 00:29:05,481 INFO L420 AbstractCegarLoop]: === Iteration 104 === 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 00:29:05,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:05,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1439495495, now seen corresponding path program 1 times [2022-12-06 00:29:05,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:05,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854151939] [2022-12-06 00:29:05,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:05,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:05,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:05,540 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 00:29:05,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:05,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854151939] [2022-12-06 00:29:05,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854151939] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:29:05,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:29:05,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:29:05,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663488853] [2022-12-06 00:29:05,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:29:05,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:29:05,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:05,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:29:05,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:29:05,541 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 74 [2022-12-06 00:29:05,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 900 transitions, 28263 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:05,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:05,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 74 [2022-12-06 00:29:05,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:09,726 INFO L130 PetriNetUnfolder]: 5532/10790 cut-off events. [2022-12-06 00:29:09,727 INFO L131 PetriNetUnfolder]: For 627992/627992 co-relation queries the response was YES. [2022-12-06 00:29:09,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126033 conditions, 10790 events. 5532/10790 cut-off events. For 627992/627992 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 91230 event pairs, 1626 based on Foata normal form. 14/10803 useless extension candidates. Maximal degree in co-relation 125419. Up to 8874 conditions per place. [2022-12-06 00:29:09,889 INFO L137 encePairwiseOnDemand]: 51/74 looper letters, 779 selfloop transitions, 164 changer transitions 4/947 dead transitions. [2022-12-06 00:29:09,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 947 transitions, 30823 flow [2022-12-06 00:29:09,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:29:09,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:29:09,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2022-12-06 00:29:09,890 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2545045045045045 [2022-12-06 00:29:09,890 INFO L175 Difference]: Start difference. First operand has 447 places, 900 transitions, 28263 flow. Second operand 6 states and 113 transitions. [2022-12-06 00:29:09,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 947 transitions, 30823 flow [2022-12-06 00:29:15,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 947 transitions, 30407 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-12-06 00:29:15,452 INFO L231 Difference]: Finished difference. Result has 447 places, 887 transitions, 27701 flow [2022-12-06 00:29:15,452 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=27568, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=891, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=164, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=727, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=27701, PETRI_PLACES=447, PETRI_TRANSITIONS=887} [2022-12-06 00:29:15,452 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 418 predicate places. [2022-12-06 00:29:15,452 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:15,453 INFO L89 Accepts]: Start accepts. Operand has 447 places, 887 transitions, 27701 flow [2022-12-06 00:29:15,456 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:15,456 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:15,457 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 447 places, 887 transitions, 27701 flow [2022-12-06 00:29:15,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 447 places, 887 transitions, 27701 flow [2022-12-06 00:29:16,332 INFO L130 PetriNetUnfolder]: 1148/4602 cut-off events. [2022-12-06 00:29:16,332 INFO L131 PetriNetUnfolder]: For 171103/171232 co-relation queries the response was YES. [2022-12-06 00:29:16,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43183 conditions, 4602 events. 1148/4602 cut-off events. For 171103/171232 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 53879 event pairs, 53 based on Foata normal form. 2/4567 useless extension candidates. Maximal degree in co-relation 42901. Up to 779 conditions per place. [2022-12-06 00:29:16,428 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 447 places, 887 transitions, 27701 flow [2022-12-06 00:29:16,428 INFO L188 LiptonReduction]: Number of co-enabled transitions 4290 [2022-12-06 00:29:16,431 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:29:16,431 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 979 [2022-12-06 00:29:16,431 INFO L495 AbstractCegarLoop]: Abstraction has has 447 places, 887 transitions, 27701 flow [2022-12-06 00:29:16,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:16,431 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:16,431 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:16,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2022-12-06 00:29:16,432 INFO L420 AbstractCegarLoop]: === Iteration 105 === 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 00:29:16,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:16,432 INFO L85 PathProgramCache]: Analyzing trace with hash -948071986, now seen corresponding path program 1 times [2022-12-06 00:29:16,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:16,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735133220] [2022-12-06 00:29:16,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:16,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:16,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:16,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:16,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:16,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735133220] [2022-12-06 00:29:16,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735133220] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:29:16,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630313260] [2022-12-06 00:29:16,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:16,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:29:16,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:29:16,494 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:29:16,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-06 00:29:16,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:16,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 00:29:16,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:29:16,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:16,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:29:16,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:16,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630313260] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:29:16,993 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:29:16,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-12-06 00:29:16,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277915030] [2022-12-06 00:29:16,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:29:16,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:29:16,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:16,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:29:16,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:29:16,994 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 72 [2022-12-06 00:29:16,994 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 887 transitions, 27701 flow. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 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 00:29:16,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:16,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 72 [2022-12-06 00:29:16,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:21,052 INFO L130 PetriNetUnfolder]: 5446/10623 cut-off events. [2022-12-06 00:29:21,052 INFO L131 PetriNetUnfolder]: For 612886/612886 co-relation queries the response was YES. [2022-12-06 00:29:21,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123776 conditions, 10623 events. 5446/10623 cut-off events. For 612886/612886 co-relation queries the response was YES. Maximal size of possible extension queue 643. Compared 89768 event pairs, 1094 based on Foata normal form. 26/10648 useless extension candidates. Maximal degree in co-relation 122968. Up to 5498 conditions per place. [2022-12-06 00:29:21,223 INFO L137 encePairwiseOnDemand]: 38/72 looper letters, 727 selfloop transitions, 324 changer transitions 9/1060 dead transitions. [2022-12-06 00:29:21,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 1060 transitions, 33274 flow [2022-12-06 00:29:21,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:29:21,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:29:21,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions. [2022-12-06 00:29:21,224 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2708333333333333 [2022-12-06 00:29:21,224 INFO L175 Difference]: Start difference. First operand has 447 places, 887 transitions, 27701 flow. Second operand 8 states and 156 transitions. [2022-12-06 00:29:21,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 1060 transitions, 33274 flow [2022-12-06 00:29:26,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 1060 transitions, 32548 flow, removed 16 selfloop flow, removed 9 redundant places. [2022-12-06 00:29:26,533 INFO L231 Difference]: Finished difference. Result has 449 places, 896 transitions, 28571 flow [2022-12-06 00:29:26,534 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=26790, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=880, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=299, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=557, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=28571, PETRI_PLACES=449, PETRI_TRANSITIONS=896} [2022-12-06 00:29:26,534 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 420 predicate places. [2022-12-06 00:29:26,534 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:26,534 INFO L89 Accepts]: Start accepts. Operand has 449 places, 896 transitions, 28571 flow [2022-12-06 00:29:26,538 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:26,538 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:26,538 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 449 places, 896 transitions, 28571 flow [2022-12-06 00:29:26,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 446 places, 896 transitions, 28571 flow [2022-12-06 00:29:27,459 INFO L130 PetriNetUnfolder]: 1132/4523 cut-off events. [2022-12-06 00:29:27,460 INFO L131 PetriNetUnfolder]: For 170287/170418 co-relation queries the response was YES. [2022-12-06 00:29:27,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42967 conditions, 4523 events. 1132/4523 cut-off events. For 170287/170418 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 52785 event pairs, 53 based on Foata normal form. 4/4490 useless extension candidates. Maximal degree in co-relation 42644. Up to 774 conditions per place. [2022-12-06 00:29:27,536 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 446 places, 896 transitions, 28571 flow [2022-12-06 00:29:27,536 INFO L188 LiptonReduction]: Number of co-enabled transitions 4414 [2022-12-06 00:29:27,537 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [684] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (mod v_~A~0_270 4294967296))) (and (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_197| 4294967296) .cse0)) (= (ite (= (mod (select (select |v_#memory_int_505| v_~queue~0.base_286) (+ (* v_~end~0_533 4) v_~queue~0.offset_286)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_202| 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_83|) (= |v_thread1Thread1of1ForFork2_~i~0#1_197| 1) (< (mod (+ |v_thread1Thread1of1ForFork2_~i~0#1_197| 4294967295) 4294967296) .cse0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_83| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_83|) (not (= (ite (and (<= 0 v_~end~0_533) (< v_~end~0_533 v_~n~0_292)) 1 0) 0)) (= v_~end~0_532 (+ v_~end~0_533 1)) (= |v_thread1Thread1of1ForFork2_~x~0#1_202| v_~B~0_154) (= |v_thread1Thread1of1ForFork2_#res#1.base_81| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_83| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_81| 0))) InVars {~queue~0.offset=v_~queue~0.offset_286, ~A~0=v_~A~0_270, ~B~0=v_~B~0_154, #memory_int=|v_#memory_int_505|, ~end~0=v_~end~0_533, ~queue~0.base=v_~queue~0.base_286, ~n~0=v_~n~0_292} OutVars{~queue~0.offset=v_~queue~0.offset_286, ~A~0=v_~A~0_270, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_202|, ~B~0=v_~B~0_154, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_83|, ~queue~0.base=v_~queue~0.base_286, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_75|, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_83|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_197|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_83|, #memory_int=|v_#memory_int_505|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_81|, ~end~0=v_~end~0_532, ~n~0=v_~n~0_292, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_81|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_83|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [559] L103-4-->L104-3: Formula: (and (= (store |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_101| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre18#1_19|)) |v_#memory_int_100|) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_19| |v_#pthreadsForks_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_100|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] [2022-12-06 00:29:27,647 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [684] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (mod v_~A~0_270 4294967296))) (and (not (< (mod |v_thread1Thread1of1ForFork2_~i~0#1_197| 4294967296) .cse0)) (= (ite (= (mod (select (select |v_#memory_int_505| v_~queue~0.base_286) (+ (* v_~end~0_533 4) v_~queue~0.offset_286)) 4294967296) (mod |v_thread1Thread1of1ForFork2_~x~0#1_202| 4294967296)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_83|) (= |v_thread1Thread1of1ForFork2_~i~0#1_197| 1) (< (mod (+ |v_thread1Thread1of1ForFork2_~i~0#1_197| 4294967295) 4294967296) .cse0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_83| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_83|) (not (= (ite (and (<= 0 v_~end~0_533) (< v_~end~0_533 v_~n~0_292)) 1 0) 0)) (= v_~end~0_532 (+ v_~end~0_533 1)) (= |v_thread1Thread1of1ForFork2_~x~0#1_202| v_~B~0_154) (= |v_thread1Thread1of1ForFork2_#res#1.base_81| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_83| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_81| 0))) InVars {~queue~0.offset=v_~queue~0.offset_286, ~A~0=v_~A~0_270, ~B~0=v_~B~0_154, #memory_int=|v_#memory_int_505|, ~end~0=v_~end~0_533, ~queue~0.base=v_~queue~0.base_286, ~n~0=v_~n~0_292} OutVars{~queue~0.offset=v_~queue~0.offset_286, ~A~0=v_~A~0_270, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_202|, ~B~0=v_~B~0_154, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_83|, ~queue~0.base=v_~queue~0.base_286, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_75|, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_83|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_197|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_83|, #memory_int=|v_#memory_int_505|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_81|, ~end~0=v_~end~0_532, ~n~0=v_~n~0_292, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_81|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_83|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#res#1.offset, ~end~0, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [606] L67-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_In_3| 4294967296) (mod (select (select |v_#memory_int_In_24| v_~queue~0.base_In_7) (+ (* v_~end~0_In_5 4) v_~queue~0.offset_In_7)) 4294967296)) 1 0)) (= v_~end~0_Out_28 (+ v_~end~0_In_5 1)) (not (= (ite (and (< v_~end~0_In_5 v_~n~0_In_8) (<= 0 v_~end~0_In_5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_In_2| 4294967296) (mod v_~A~0_In_3 4294967296)))) InVars {~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, #memory_int=|v_#memory_int_In_24|, ~end~0=v_~end~0_In_5, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~queue~0.base=v_~queue~0.base_In_7, ~n~0=v_~n~0_In_8} OutVars{~queue~0.offset=v_~queue~0.offset_In_7, ~A~0=v_~A~0_In_3, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_2|, ~queue~0.base=v_~queue~0.base_In_7, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, #memory_int=|v_#memory_int_In_24|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_Out_4|, ~end~0=v_~end~0_Out_28, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_In_3|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, ~end~0, thread2Thread1of1ForFork0_#t~post6#1] [2022-12-06 00:29:27,866 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:29:27,867 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1333 [2022-12-06 00:29:27,867 INFO L495 AbstractCegarLoop]: Abstraction has has 446 places, 896 transitions, 28639 flow [2022-12-06 00:29:27,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 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 00:29:27,867 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:27,867 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:27,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-12-06 00:29:28,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:29:28,072 INFO L420 AbstractCegarLoop]: === Iteration 106 === 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 00:29:28,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:28,073 INFO L85 PathProgramCache]: Analyzing trace with hash -807296287, now seen corresponding path program 1 times [2022-12-06 00:29:28,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:28,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919663085] [2022-12-06 00:29:28,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:28,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:28,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:28,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:28,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:28,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919663085] [2022-12-06 00:29:28,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919663085] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:29:28,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940816648] [2022-12-06 00:29:28,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:28,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:29:28,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:29:28,133 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:29:28,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-06 00:29:28,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:28,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 00:29:28,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:29:28,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:28,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:29:28,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:28,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940816648] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:29:28,395 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:29:28,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-12-06 00:29:28,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778326903] [2022-12-06 00:29:28,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:29:28,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:29:28,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:28,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:29:28,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:29:28,396 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 72 [2022-12-06 00:29:28,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 896 transitions, 28639 flow. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 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 00:29:28,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:28,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 72 [2022-12-06 00:29:28,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:33,394 INFO L130 PetriNetUnfolder]: 6427/12406 cut-off events. [2022-12-06 00:29:33,394 INFO L131 PetriNetUnfolder]: For 733128/733128 co-relation queries the response was YES. [2022-12-06 00:29:33,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147345 conditions, 12406 events. 6427/12406 cut-off events. For 733128/733128 co-relation queries the response was YES. Maximal size of possible extension queue 741. Compared 106316 event pairs, 1197 based on Foata normal form. 41/12446 useless extension candidates. Maximal degree in co-relation 146738. Up to 6975 conditions per place. [2022-12-06 00:29:33,591 INFO L137 encePairwiseOnDemand]: 27/72 looper letters, 1040 selfloop transitions, 209 changer transitions 4/1253 dead transitions. [2022-12-06 00:29:33,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 1253 transitions, 40617 flow [2022-12-06 00:29:33,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:29:33,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:29:33,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2022-12-06 00:29:33,593 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23148148148148148 [2022-12-06 00:29:33,593 INFO L175 Difference]: Start difference. First operand has 446 places, 896 transitions, 28639 flow. Second operand 9 states and 150 transitions. [2022-12-06 00:29:33,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 1253 transitions, 40617 flow [2022-12-06 00:29:41,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 1253 transitions, 38394 flow, removed 158 selfloop flow, removed 8 redundant places. [2022-12-06 00:29:41,153 INFO L231 Difference]: Finished difference. Result has 450 places, 941 transitions, 29139 flow [2022-12-06 00:29:41,154 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=26654, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=887, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=153, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=683, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=29139, PETRI_PLACES=450, PETRI_TRANSITIONS=941} [2022-12-06 00:29:41,154 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 421 predicate places. [2022-12-06 00:29:41,154 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:41,154 INFO L89 Accepts]: Start accepts. Operand has 450 places, 941 transitions, 29139 flow [2022-12-06 00:29:41,158 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:41,158 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:41,159 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 450 places, 941 transitions, 29139 flow [2022-12-06 00:29:41,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 450 places, 941 transitions, 29139 flow [2022-12-06 00:29:42,279 INFO L130 PetriNetUnfolder]: 1352/5317 cut-off events. [2022-12-06 00:29:42,279 INFO L131 PetriNetUnfolder]: For 186120/186288 co-relation queries the response was YES. [2022-12-06 00:29:42,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49162 conditions, 5317 events. 1352/5317 cut-off events. For 186120/186288 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 63481 event pairs, 73 based on Foata normal form. 4/5279 useless extension candidates. Maximal degree in co-relation 48874. Up to 964 conditions per place. [2022-12-06 00:29:42,381 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 450 places, 941 transitions, 29139 flow [2022-12-06 00:29:42,381 INFO L188 LiptonReduction]: Number of co-enabled transitions 4656 [2022-12-06 00:29:42,428 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [801] $Ultimate##0-->L104-3: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_624| 1) (= |v_thread2Thread1of1ForFork0_~x~1#1_652| v_~B~0_308) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork0_~i~1#1_624|) 4294967296) (mod v_~A~0_500 4294967296)) (= |v_ULTIMATE.start_main_#t~pre18#1_316| |v_#pthreadsForks_588|) (= |v_#memory_int_852| (store |v_#memory_int_853| |v_ULTIMATE.start_main_~#t3~0#1.base_294| (store (select |v_#memory_int_853| |v_ULTIMATE.start_main_~#t3~0#1.base_294|) |v_ULTIMATE.start_main_~#t3~0#1.offset_276| |v_ULTIMATE.start_main_#t~pre18#1_316|))) (= (+ |v_#pthreadsForks_588| 1) |v_#pthreadsForks_587|)) InVars {~A~0=v_~A~0_500, #pthreadsForks=|v_#pthreadsForks_588|, ~B~0=v_~B~0_308, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_276|, #memory_int=|v_#memory_int_853|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_294|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_316|, ~A~0=v_~A~0_500, #pthreadsForks=|v_#pthreadsForks_587|, ~B~0=v_~B~0_308, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_276|, #memory_int=|v_#memory_int_852|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_294|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_327|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_624|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_281|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_269|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_652|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, thread2Thread1of1ForFork0_~i~1#1, ULTIMATE.start_main_#t~nondet17#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] and [580] L67-5-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_31| (+ |v_thread2Thread1of1ForFork0_~i~1#1_32| 1)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_32| 4294967296) (mod v_~A~0_35 4294967296)) (= (+ |v_thread2Thread1of1ForFork0_~x~1#1_30| v_~B~0_29) |v_thread2Thread1of1ForFork0_~x~1#1_29|)) InVars {~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_32|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_30|} OutVars{~A~0=v_~A~0_35, ~B~0=v_~B~0_29, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_31|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_13|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_~x~1#1] [2022-12-06 00:29:42,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-12-06 00:29:42,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:29:42,763 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IndexOutOfBoundsException: Index 18 out of bounds for length 18 at java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:64) at java.base/jdk.internal.util.Preconditions.outOfBoundsCheckIndex(Preconditions.java:70) at java.base/jdk.internal.util.Preconditions.checkIndex(Preconditions.java:248) at java.base/java.util.Objects.checkIndex(Objects.java:372) at java.base/java.util.ArrayList.get(ArrayList.java:459) at de.uni_freiburg.informatik.ultimate.automata.petrinet.PetriNetRun.getTransition(PetriNetRun.java:125) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ChoiceRule.adaptRun(ChoiceRule.java:163) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ChoiceRule.applyInternal(ChoiceRule.java:115) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:80) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.choiceRuleWrapper(LiptonReduction.java:239) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:200) 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 00:29:42,765 INFO L158 Benchmark]: Toolchain (without parser) took 587670.82ms. Allocated memory was 181.4MB in the beginning and 4.3GB in the end (delta: 4.1GB). Free memory was 158.4MB in the beginning and 2.2GB in the end (delta: -2.0GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2022-12-06 00:29:42,765 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 181.4MB. Free memory is still 157.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 00:29:42,765 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.12ms. Allocated memory is still 181.4MB. Free memory was 158.4MB in the beginning and 145.2MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 00:29:42,765 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.12ms. Allocated memory is still 181.4MB. Free memory was 145.2MB in the beginning and 143.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 00:29:42,766 INFO L158 Benchmark]: Boogie Preprocessor took 23.29ms. Allocated memory is still 181.4MB. Free memory was 143.1MB in the beginning and 141.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 00:29:42,766 INFO L158 Benchmark]: RCFGBuilder took 490.63ms. Allocated memory is still 181.4MB. Free memory was 141.6MB in the beginning and 115.9MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-06 00:29:42,766 INFO L158 Benchmark]: TraceAbstraction took 586841.74ms. Allocated memory was 181.4MB in the beginning and 4.3GB in the end (delta: 4.1GB). Free memory was 115.4MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2022-12-06 00:29:42,766 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.13ms. Allocated memory is still 181.4MB. Free memory is still 157.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 266.12ms. Allocated memory is still 181.4MB. Free memory was 158.4MB in the beginning and 145.2MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.12ms. Allocated memory is still 181.4MB. Free memory was 145.2MB in the beginning and 143.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.29ms. Allocated memory is still 181.4MB. Free memory was 143.1MB in the beginning and 141.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 490.63ms. Allocated memory is still 181.4MB. Free memory was 141.6MB in the beginning and 115.9MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * TraceAbstraction took 586841.74ms. Allocated memory was 181.4MB in the beginning and 4.3GB in the end (delta: 4.1GB). Free memory was 115.4MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 132 PlacesBefore, 29 PlacesAfterwards, 131 TransitionsBefore, 22 TransitionsAfterwards, 1464 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 68 TrivialYvCompositions, 35 ConcurrentYvCompositions, 6 ChoiceCompositions, 109 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 748, independent: 743, independent conditional: 743, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 748, independent: 743, independent conditional: 0, independent unconditional: 743, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 748, independent: 743, independent conditional: 0, independent unconditional: 743, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 748, independent: 743, independent conditional: 0, independent unconditional: 743, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 748, independent: 743, independent conditional: 0, independent unconditional: 743, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 748, independent: 741, independent conditional: 0, independent unconditional: 741, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 748, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 748, unknown conditional: 0, unknown unconditional: 748] , Statistics on independence cache: Total cache size (in pairs): 1213, Positive cache size: 1208, Positive conditional cache size: 0, Positive unconditional cache size: 1208, Negative cache size: 5, Negative conditional cache size: 0, 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: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 27 PlacesBefore, 26 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 94 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 28 PlacesBefore, 27 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 94 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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: 3.1s, 41 PlacesBefore, 39 PlacesAfterwards, 38 TransitionsBefore, 36 TransitionsAfterwards, 218 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, independent: 33, independent conditional: 33, 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: 33, independent: 33, independent conditional: 33, 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: 33, independent: 33, independent conditional: 11, independent unconditional: 22, 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: 33, independent: 33, independent conditional: 11, independent unconditional: 22, 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: 13, independent: 13, independent conditional: 5, independent unconditional: 8, 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: 13, independent: 13, independent conditional: 0, independent unconditional: 13, 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: 33, independent: 20, independent conditional: 6, independent unconditional: 14, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 13, unknown conditional: 5, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 14, Positive conditional cache size: 5, Positive unconditional cache size: 9, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 22, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 298 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): 14, Positive cache size: 14, Positive conditional cache size: 5, Positive unconditional cache size: 9, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 47 PlacesBefore, 47 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 276 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): 14, Positive cache size: 14, Positive conditional cache size: 5, Positive unconditional cache size: 9, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.5s, 46 PlacesBefore, 45 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 240 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 12, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 22, Positive cache size: 20, Positive conditional cache size: 11, Positive unconditional cache size: 9, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 52 PlacesBefore, 52 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 240 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, independent: 31, independent conditional: 31, 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: 33, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 44, independent: 31, independent conditional: 27, independent unconditional: 4, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 44, independent: 31, independent conditional: 27, independent unconditional: 4, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 35, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 35, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 40, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 44, independent: 5, independent conditional: 1, independent unconditional: 4, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 35, unknown conditional: 35, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 59, Positive cache size: 48, Positive conditional cache size: 39, Positive unconditional cache size: 9, Negative cache size: 11, Negative conditional cache size: 11, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 218 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): 59, Positive cache size: 48, Positive conditional cache size: 39, Positive unconditional cache size: 9, Negative cache size: 11, Negative conditional cache size: 11, Negative unconditional cache size: 0, 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, 43 PlacesBefore, 43 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 238 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): 59, Positive cache size: 48, Positive conditional cache size: 39, Positive unconditional cache size: 9, Negative cache size: 11, Negative conditional cache size: 11, Negative unconditional cache size: 0, 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, 48 PlacesBefore, 48 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 312 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): 59, Positive cache size: 48, Positive conditional cache size: 39, Positive unconditional cache size: 9, Negative cache size: 11, Negative conditional cache size: 11, Negative unconditional cache size: 0, 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, 53 PlacesBefore, 53 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 342 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): 59, Positive cache size: 48, Positive conditional cache size: 39, Positive unconditional cache size: 9, Negative cache size: 11, Negative conditional cache size: 11, Negative unconditional cache size: 0, 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, 63 PlacesBefore, 62 PlacesAfterwards, 68 TransitionsBefore, 67 TransitionsAfterwards, 408 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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): 59, Positive cache size: 48, Positive conditional cache size: 39, Positive unconditional cache size: 9, Negative cache size: 11, Negative conditional cache size: 11, Negative unconditional cache size: 0, 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: 0.0s, 67 PlacesBefore, 67 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 416 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): 59, Positive cache size: 48, Positive conditional cache size: 39, Positive unconditional cache size: 9, Negative cache size: 11, Negative conditional cache size: 11, Negative unconditional cache size: 0, 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: 3.4s, 76 PlacesBefore, 75 PlacesAfterwards, 84 TransitionsBefore, 83 TransitionsAfterwards, 536 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 54, independent: 54, independent conditional: 54, 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: 54, independent: 54, independent conditional: 54, 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: 54, independent: 54, independent conditional: 25, independent unconditional: 29, 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: 54, independent: 54, independent conditional: 25, independent unconditional: 29, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 54, independent: 50, independent conditional: 21, independent unconditional: 29, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 54, Positive conditional cache size: 44, Positive unconditional cache size: 10, Negative cache size: 11, Negative conditional cache size: 11, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 29, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 79 PlacesBefore, 78 PlacesAfterwards, 95 TransitionsBefore, 94 TransitionsAfterwards, 570 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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): 65, Positive cache size: 54, Positive conditional cache size: 44, Positive unconditional cache size: 10, Negative cache size: 11, Negative conditional cache size: 11, Negative unconditional cache size: 0, 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: 0.0s, 78 PlacesBefore, 78 PlacesAfterwards, 93 TransitionsBefore, 93 TransitionsAfterwards, 562 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): 65, Positive cache size: 54, Positive conditional cache size: 44, Positive unconditional cache size: 10, Negative cache size: 11, Negative conditional cache size: 11, Negative unconditional cache size: 0, 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, 80 PlacesBefore, 80 PlacesAfterwards, 94 TransitionsBefore, 94 TransitionsAfterwards, 574 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): 65, Positive cache size: 54, Positive conditional cache size: 44, Positive unconditional cache size: 10, Negative cache size: 11, Negative conditional cache size: 11, Negative unconditional cache size: 0, 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, 78 PlacesBefore, 78 PlacesAfterwards, 90 TransitionsBefore, 90 TransitionsAfterwards, 542 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 58, Positive conditional cache size: 48, Positive unconditional cache size: 10, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0, 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, 85 PlacesBefore, 84 PlacesAfterwards, 97 TransitionsBefore, 96 TransitionsAfterwards, 552 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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): 70, Positive cache size: 58, Positive conditional cache size: 48, Positive unconditional cache size: 10, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0, 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: 0.2s, 89 PlacesBefore, 87 PlacesAfterwards, 98 TransitionsBefore, 96 TransitionsAfterwards, 556 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 3, independent unconditional: 2, 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: 5, independent: 5, independent conditional: 3, independent unconditional: 2, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 61, Positive conditional cache size: 51, Positive unconditional cache size: 10, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 89 PlacesBefore, 89 PlacesAfterwards, 94 TransitionsBefore, 94 TransitionsAfterwards, 550 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): 73, Positive cache size: 61, Positive conditional cache size: 51, Positive unconditional cache size: 10, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0, 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.5s, 83 PlacesBefore, 81 PlacesAfterwards, 90 TransitionsBefore, 88 TransitionsAfterwards, 528 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 4, independent unconditional: 2, 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: 6, independent: 6, independent conditional: 4, independent unconditional: 2, 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: 4, independent: 4, independent conditional: 2, independent unconditional: 2, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 65, Positive conditional cache size: 53, Positive unconditional cache size: 12, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 82 PlacesBefore, 82 PlacesAfterwards, 88 TransitionsBefore, 88 TransitionsAfterwards, 528 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 2, independent unconditional: 3, 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: 5, independent: 5, independent conditional: 2, independent unconditional: 3, 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: 2, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 5, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 67, Positive conditional cache size: 54, Positive unconditional cache size: 13, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 88 PlacesBefore, 86 PlacesAfterwards, 93 TransitionsBefore, 91 TransitionsAfterwards, 532 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 15, 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: 16, independent: 15, independent conditional: 12, independent unconditional: 3, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 15, independent conditional: 12, independent unconditional: 3, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16, independent: 10, independent conditional: 7, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 72, Positive conditional cache size: 59, Positive unconditional cache size: 13, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 89 PlacesBefore, 88 PlacesAfterwards, 91 TransitionsBefore, 90 TransitionsAfterwards, 526 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 1, independent unconditional: 3, 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: 4, independent: 4, independent conditional: 1, independent unconditional: 3, 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: 4, independent: 4, independent conditional: 1, independent unconditional: 3, 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): 85, Positive cache size: 72, Positive conditional cache size: 59, Positive unconditional cache size: 13, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 81 PlacesBefore, 81 PlacesAfterwards, 89 TransitionsBefore, 89 TransitionsAfterwards, 522 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): 85, Positive cache size: 72, Positive conditional cache size: 59, Positive unconditional cache size: 13, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 80 PlacesBefore, 80 PlacesAfterwards, 85 TransitionsBefore, 85 TransitionsAfterwards, 516 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): 85, Positive cache size: 72, Positive conditional cache size: 59, Positive unconditional cache size: 13, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 87 PlacesBefore, 86 PlacesAfterwards, 95 TransitionsBefore, 94 TransitionsAfterwards, 560 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 74, Positive conditional cache size: 61, Positive unconditional cache size: 13, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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: 0.0s, 88 PlacesBefore, 88 PlacesAfterwards, 95 TransitionsBefore, 95 TransitionsAfterwards, 568 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): 87, Positive cache size: 74, Positive conditional cache size: 61, Positive unconditional cache size: 13, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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.1s, 122 PlacesBefore, 116 PlacesAfterwards, 203 TransitionsBefore, 197 TransitionsAfterwards, 998 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, independent: 48, independent conditional: 48, 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: 48, independent: 48, independent conditional: 48, 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: 48, independent: 48, independent conditional: 40, independent unconditional: 8, 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: 48, independent: 48, independent conditional: 40, independent unconditional: 8, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 0, independent unconditional: 18, 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: 48, independent: 30, independent conditional: 22, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 113, Positive conditional cache size: 93, Positive unconditional cache size: 20, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.3s, 122 PlacesBefore, 120 PlacesAfterwards, 207 TransitionsBefore, 205 TransitionsAfterwards, 1012 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29, independent: 29, independent conditional: 29, 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: 29, independent: 29, independent conditional: 29, 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: 29, independent: 29, independent conditional: 23, independent unconditional: 6, 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: 29, independent: 29, independent conditional: 23, independent unconditional: 6, 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: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 29, independent: 21, independent conditional: 15, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 148, Positive cache size: 135, Positive conditional cache size: 112, Positive unconditional cache size: 23, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 122 PlacesBefore, 122 PlacesAfterwards, 207 TransitionsBefore, 207 TransitionsAfterwards, 1004 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): 148, Positive cache size: 135, Positive conditional cache size: 112, Positive unconditional cache size: 23, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 122 PlacesBefore, 122 PlacesAfterwards, 206 TransitionsBefore, 206 TransitionsAfterwards, 1004 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): 148, Positive cache size: 135, Positive conditional cache size: 112, Positive unconditional cache size: 23, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 126 PlacesBefore, 126 PlacesAfterwards, 214 TransitionsBefore, 214 TransitionsAfterwards, 1064 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): 148, Positive cache size: 135, Positive conditional cache size: 112, Positive unconditional cache size: 23, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 133 PlacesBefore, 132 PlacesAfterwards, 215 TransitionsBefore, 214 TransitionsAfterwards, 1072 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 140, Positive conditional cache size: 116, Positive unconditional cache size: 24, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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: 0.0s, 128 PlacesBefore, 128 PlacesAfterwards, 216 TransitionsBefore, 216 TransitionsAfterwards, 1066 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): 153, Positive cache size: 140, Positive conditional cache size: 116, Positive unconditional cache size: 24, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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.5s, 155 PlacesBefore, 154 PlacesAfterwards, 268 TransitionsBefore, 267 TransitionsAfterwards, 1360 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 9, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 156, Positive cache size: 143, Positive conditional cache size: 116, Positive unconditional cache size: 27, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 167 PlacesBefore, 165 PlacesAfterwards, 275 TransitionsBefore, 274 TransitionsAfterwards, 1410 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 15, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 15, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 205, Positive cache size: 192, Positive conditional cache size: 160, Positive unconditional cache size: 32, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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: 0.4s, 165 PlacesBefore, 164 PlacesAfterwards, 292 TransitionsBefore, 291 TransitionsAfterwards, 1478 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 12, independent unconditional: 4, 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: 16, independent: 16, independent conditional: 12, independent unconditional: 4, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 16, independent: 10, independent conditional: 6, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 212, Positive cache size: 199, Positive conditional cache size: 166, Positive unconditional cache size: 33, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 165 PlacesBefore, 164 PlacesAfterwards, 282 TransitionsBefore, 281 TransitionsAfterwards, 1428 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 216, Positive cache size: 203, Positive conditional cache size: 166, Positive unconditional cache size: 37, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 166 PlacesBefore, 166 PlacesAfterwards, 282 TransitionsBefore, 282 TransitionsAfterwards, 1430 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): 216, Positive cache size: 203, Positive conditional cache size: 166, Positive unconditional cache size: 37, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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.8s, 167 PlacesBefore, 164 PlacesAfterwards, 283 TransitionsBefore, 280 TransitionsAfterwards, 1430 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 12, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 226, Positive cache size: 213, Positive conditional cache size: 176, Positive unconditional cache size: 37, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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: 0.0s, 164 PlacesBefore, 164 PlacesAfterwards, 279 TransitionsBefore, 279 TransitionsAfterwards, 1414 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): 226, Positive cache size: 213, Positive conditional cache size: 176, Positive unconditional cache size: 37, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 165 PlacesBefore, 164 PlacesAfterwards, 281 TransitionsBefore, 280 TransitionsAfterwards, 1428 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 230, Positive cache size: 217, Positive conditional cache size: 180, Positive unconditional cache size: 37, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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: 0.1s, 161 PlacesBefore, 161 PlacesAfterwards, 280 TransitionsBefore, 280 TransitionsAfterwards, 1422 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 235, Positive cache size: 222, Positive conditional cache size: 185, Positive unconditional cache size: 37, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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: 0.0s, 181 PlacesBefore, 181 PlacesAfterwards, 340 TransitionsBefore, 340 TransitionsAfterwards, 1660 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): 235, Positive cache size: 222, Positive conditional cache size: 185, Positive unconditional cache size: 37, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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.8s, 183 PlacesBefore, 182 PlacesAfterwards, 346 TransitionsBefore, 345 TransitionsAfterwards, 1704 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 34, independent conditional: 34, 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: 34, independent: 34, independent conditional: 34, 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: 34, independent: 34, independent conditional: 26, independent unconditional: 8, 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: 34, independent: 34, independent conditional: 26, independent unconditional: 8, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 34, independent: 22, independent conditional: 14, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 248, Positive cache size: 235, Positive conditional cache size: 197, Positive unconditional cache size: 38, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 182 PlacesBefore, 182 PlacesAfterwards, 344 TransitionsBefore, 344 TransitionsAfterwards, 1684 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): 248, Positive cache size: 235, Positive conditional cache size: 197, Positive unconditional cache size: 38, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 182 PlacesBefore, 182 PlacesAfterwards, 343 TransitionsBefore, 343 TransitionsAfterwards, 1684 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): 248, Positive cache size: 235, Positive conditional cache size: 197, Positive unconditional cache size: 38, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 176 PlacesBefore, 176 PlacesAfterwards, 341 TransitionsBefore, 341 TransitionsAfterwards, 1674 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): 248, Positive cache size: 235, Positive conditional cache size: 197, Positive unconditional cache size: 38, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 190 PlacesBefore, 189 PlacesAfterwards, 352 TransitionsBefore, 351 TransitionsAfterwards, 1732 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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): 248, Positive cache size: 235, Positive conditional cache size: 197, Positive unconditional cache size: 38, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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: 0.2s, 195 PlacesBefore, 194 PlacesAfterwards, 366 TransitionsBefore, 365 TransitionsAfterwards, 1792 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 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: 7, 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: 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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 253, Positive cache size: 240, Positive conditional cache size: 202, Positive unconditional cache size: 38, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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.2s, 201 PlacesBefore, 202 PlacesAfterwards, 364 TransitionsBefore, 372 TransitionsAfterwards, 1782 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 85, independent: 85, independent conditional: 85, 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: 85, independent: 85, independent conditional: 85, 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: 85, independent: 85, independent conditional: 85, 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: 85, independent: 85, independent conditional: 85, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 85, independent: 75, independent conditional: 75, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 264, Positive cache size: 251, Positive conditional cache size: 212, Positive unconditional cache size: 39, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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: 0.1s, 205 PlacesBefore, 205 PlacesAfterwards, 362 TransitionsBefore, 362 TransitionsAfterwards, 1772 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 268, Positive cache size: 255, Positive conditional cache size: 216, Positive unconditional cache size: 39, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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: 0.0s, 203 PlacesBefore, 203 PlacesAfterwards, 362 TransitionsBefore, 362 TransitionsAfterwards, 1766 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): 268, Positive cache size: 255, Positive conditional cache size: 216, Positive unconditional cache size: 39, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 202 PlacesBefore, 202 PlacesAfterwards, 360 TransitionsBefore, 360 TransitionsAfterwards, 1738 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): 268, Positive cache size: 255, Positive conditional cache size: 216, Positive unconditional cache size: 39, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 207 PlacesBefore, 205 PlacesAfterwards, 364 TransitionsBefore, 362 TransitionsAfterwards, 1746 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 4, independent unconditional: 2, 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: 6, independent: 6, independent conditional: 4, independent unconditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 6, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 271, Positive cache size: 258, Positive conditional cache size: 219, Positive unconditional cache size: 39, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 215 PlacesBefore, 214 PlacesAfterwards, 389 TransitionsBefore, 388 TransitionsAfterwards, 1860 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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): 271, Positive cache size: 258, Positive conditional cache size: 219, Positive unconditional cache size: 39, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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: 0.0s, 213 PlacesBefore, 213 PlacesAfterwards, 387 TransitionsBefore, 387 TransitionsAfterwards, 1852 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): 271, Positive cache size: 258, Positive conditional cache size: 219, Positive unconditional cache size: 39, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 218 PlacesBefore, 218 PlacesAfterwards, 387 TransitionsBefore, 387 TransitionsAfterwards, 1860 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): 271, Positive cache size: 258, Positive conditional cache size: 219, Positive unconditional cache size: 39, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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.7s, 218 PlacesBefore, 217 PlacesAfterwards, 383 TransitionsBefore, 382 TransitionsAfterwards, 1848 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 281, Positive cache size: 268, Positive conditional cache size: 229, Positive unconditional cache size: 39, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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: 0.4s, 217 PlacesBefore, 216 PlacesAfterwards, 386 TransitionsBefore, 385 TransitionsAfterwards, 1848 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 3, independent unconditional: 1, 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: 4, independent: 4, independent conditional: 3, independent unconditional: 1, 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: 4, independent: 4, independent conditional: 3, independent unconditional: 1, 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): 282, Positive cache size: 269, Positive conditional cache size: 230, Positive unconditional cache size: 39, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 216 PlacesBefore, 216 PlacesAfterwards, 384 TransitionsBefore, 384 TransitionsAfterwards, 1844 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): 282, Positive cache size: 269, Positive conditional cache size: 230, Positive unconditional cache size: 39, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 218 PlacesBefore, 217 PlacesAfterwards, 385 TransitionsBefore, 384 TransitionsAfterwards, 1844 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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): 282, Positive cache size: 269, Positive conditional cache size: 230, Positive unconditional cache size: 39, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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: 0.3s, 219 PlacesBefore, 219 PlacesAfterwards, 385 TransitionsBefore, 385 TransitionsAfterwards, 1852 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 1, independent unconditional: 1, 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: 2, independent: 2, independent conditional: 1, independent unconditional: 1, 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: 2, independent: 2, independent conditional: 1, independent unconditional: 1, 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): 282, Positive cache size: 269, Positive conditional cache size: 230, Positive unconditional cache size: 39, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 218 PlacesBefore, 218 PlacesAfterwards, 384 TransitionsBefore, 384 TransitionsAfterwards, 1852 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): 282, Positive cache size: 269, Positive conditional cache size: 230, Positive unconditional cache size: 39, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 219 PlacesBefore, 219 PlacesAfterwards, 374 TransitionsBefore, 374 TransitionsAfterwards, 1854 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): 282, Positive cache size: 269, Positive conditional cache size: 230, Positive unconditional cache size: 39, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 231 PlacesBefore, 231 PlacesAfterwards, 392 TransitionsBefore, 392 TransitionsAfterwards, 1890 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): 282, Positive cache size: 269, Positive conditional cache size: 230, Positive unconditional cache size: 39, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 249 PlacesBefore, 249 PlacesAfterwards, 468 TransitionsBefore, 468 TransitionsAfterwards, 2194 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): 282, Positive cache size: 269, Positive conditional cache size: 230, Positive unconditional cache size: 39, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 247 PlacesBefore, 247 PlacesAfterwards, 471 TransitionsBefore, 471 TransitionsAfterwards, 2218 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): 282, Positive cache size: 269, Positive conditional cache size: 230, Positive unconditional cache size: 39, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 275 PlacesBefore, 275 PlacesAfterwards, 514 TransitionsBefore, 514 TransitionsAfterwards, 2388 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): 282, Positive cache size: 269, Positive conditional cache size: 230, Positive unconditional cache size: 39, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 273 PlacesBefore, 273 PlacesAfterwards, 518 TransitionsBefore, 518 TransitionsAfterwards, 2420 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): 282, Positive cache size: 269, Positive conditional cache size: 230, Positive unconditional cache size: 39, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 282 PlacesBefore, 282 PlacesAfterwards, 526 TransitionsBefore, 526 TransitionsAfterwards, 2488 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): 282, Positive cache size: 269, Positive conditional cache size: 230, Positive unconditional cache size: 39, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 300 PlacesBefore, 300 PlacesAfterwards, 548 TransitionsBefore, 548 TransitionsAfterwards, 2562 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): 282, Positive cache size: 269, Positive conditional cache size: 230, Positive unconditional cache size: 39, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 303 PlacesBefore, 303 PlacesAfterwards, 540 TransitionsBefore, 540 TransitionsAfterwards, 2526 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): 282, Positive cache size: 269, Positive conditional cache size: 230, Positive unconditional cache size: 39, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 282 PlacesBefore, 282 PlacesAfterwards, 532 TransitionsBefore, 532 TransitionsAfterwards, 2486 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): 282, Positive cache size: 269, Positive conditional cache size: 230, Positive unconditional cache size: 39, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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.5s, 303 PlacesBefore, 301 PlacesAfterwards, 584 TransitionsBefore, 582 TransitionsAfterwards, 2762 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, 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: 14, independent: 14, independent conditional: 14, 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: 14, independent: 14, independent conditional: 10, independent unconditional: 4, 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: 14, independent: 14, independent conditional: 10, independent unconditional: 4, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 14, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 293, Positive cache size: 280, Positive conditional cache size: 241, Positive unconditional cache size: 39, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 309 PlacesBefore, 309 PlacesAfterwards, 650 TransitionsBefore, 650 TransitionsAfterwards, 3152 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 1, independent unconditional: 1, 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: 2, independent: 2, independent conditional: 1, independent unconditional: 1, 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: 2, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 295, Positive cache size: 282, Positive conditional cache size: 242, Positive unconditional cache size: 40, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 314 PlacesBefore, 314 PlacesAfterwards, 647 TransitionsBefore, 647 TransitionsAfterwards, 3134 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): 295, Positive cache size: 282, Positive conditional cache size: 242, Positive unconditional cache size: 40, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 322 PlacesBefore, 321 PlacesAfterwards, 650 TransitionsBefore, 649 TransitionsAfterwards, 3154 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 299, Positive cache size: 286, Positive conditional cache size: 246, Positive unconditional cache size: 40, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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: 0.0s, 314 PlacesBefore, 314 PlacesAfterwards, 646 TransitionsBefore, 646 TransitionsAfterwards, 3130 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): 299, Positive cache size: 286, Positive conditional cache size: 246, Positive unconditional cache size: 40, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 327 PlacesBefore, 327 PlacesAfterwards, 693 TransitionsBefore, 693 TransitionsAfterwards, 3494 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): 299, Positive cache size: 286, Positive conditional cache size: 246, Positive unconditional cache size: 40, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 342 PlacesBefore, 341 PlacesAfterwards, 712 TransitionsBefore, 711 TransitionsAfterwards, 3580 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 13, independent unconditional: 2, 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: 15, independent: 15, independent conditional: 13, independent unconditional: 2, 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: 9, independent: 9, independent conditional: 8, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 15, independent: 6, independent conditional: 5, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 8, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 308, Positive cache size: 295, Positive conditional cache size: 254, Positive unconditional cache size: 41, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.5s, 385 PlacesBefore, 375 PlacesAfterwards, 843 TransitionsBefore, 833 TransitionsAfterwards, 4118 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 0 ChoiceCompositions, 14 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 93, independent: 93, independent conditional: 93, 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: 93, independent: 93, independent conditional: 93, 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: 93, independent: 93, independent conditional: 86, 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: 93, independent: 93, independent conditional: 86, 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: 26, independent: 26, independent conditional: 26, 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: 26, independent: 26, independent conditional: 0, independent unconditional: 26, 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: 93, independent: 67, independent conditional: 60, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 26, unknown conditional: 26, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 485, Positive cache size: 472, Positive conditional cache size: 425, Positive unconditional cache size: 47, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 372 PlacesBefore, 371 PlacesAfterwards, 835 TransitionsBefore, 834 TransitionsAfterwards, 4084 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 4, independent unconditional: 6, 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: 10, independent: 10, independent conditional: 4, independent unconditional: 6, 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: 6, independent: 6, independent conditional: 4, independent unconditional: 2, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 10, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 4, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 491, Positive cache size: 478, Positive conditional cache size: 429, Positive unconditional cache size: 49, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 368 PlacesBefore, 368 PlacesAfterwards, 833 TransitionsBefore, 833 TransitionsAfterwards, 4076 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): 491, Positive cache size: 478, Positive conditional cache size: 429, Positive unconditional cache size: 49, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 371 PlacesBefore, 371 PlacesAfterwards, 835 TransitionsBefore, 835 TransitionsAfterwards, 4088 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): 491, Positive cache size: 478, Positive conditional cache size: 429, Positive unconditional cache size: 49, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 373 PlacesBefore, 373 PlacesAfterwards, 834 TransitionsBefore, 834 TransitionsAfterwards, 4088 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): 491, Positive cache size: 478, Positive conditional cache size: 429, Positive unconditional cache size: 49, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 372 PlacesBefore, 372 PlacesAfterwards, 828 TransitionsBefore, 828 TransitionsAfterwards, 4044 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): 491, Positive cache size: 478, Positive conditional cache size: 429, Positive unconditional cache size: 49, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 372 PlacesBefore, 372 PlacesAfterwards, 826 TransitionsBefore, 826 TransitionsAfterwards, 4040 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): 491, Positive cache size: 478, Positive conditional cache size: 429, Positive unconditional cache size: 49, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 377 PlacesBefore, 377 PlacesAfterwards, 823 TransitionsBefore, 823 TransitionsAfterwards, 4026 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): 491, Positive cache size: 478, Positive conditional cache size: 429, Positive unconditional cache size: 49, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 375 PlacesBefore, 375 PlacesAfterwards, 822 TransitionsBefore, 822 TransitionsAfterwards, 4022 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): 491, Positive cache size: 478, Positive conditional cache size: 429, Positive unconditional cache size: 49, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 383 PlacesBefore, 382 PlacesAfterwards, 830 TransitionsBefore, 829 TransitionsAfterwards, 4052 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 496, Positive cache size: 483, Positive conditional cache size: 434, Positive unconditional cache size: 49, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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: 0.0s, 385 PlacesBefore, 385 PlacesAfterwards, 830 TransitionsBefore, 830 TransitionsAfterwards, 4056 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): 496, Positive cache size: 483, Positive conditional cache size: 434, Positive unconditional cache size: 49, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 386 PlacesBefore, 386 PlacesAfterwards, 830 TransitionsBefore, 830 TransitionsAfterwards, 4060 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): 496, Positive cache size: 483, Positive conditional cache size: 434, Positive unconditional cache size: 49, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 416 PlacesBefore, 416 PlacesAfterwards, 936 TransitionsBefore, 936 TransitionsAfterwards, 4600 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): 496, Positive cache size: 483, Positive conditional cache size: 434, Positive unconditional cache size: 49, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 443 PlacesBefore, 439 PlacesAfterwards, 959 TransitionsBefore, 955 TransitionsAfterwards, 4726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 0, independent unconditional: 16, 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: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 514, Positive cache size: 501, Positive conditional cache size: 450, Positive unconditional cache size: 51, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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.2s, 458 PlacesBefore, 457 PlacesAfterwards, 959 TransitionsBefore, 958 TransitionsAfterwards, 4700 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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): 595, Positive cache size: 582, Positive conditional cache size: 525, Positive unconditional cache size: 57, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 444 PlacesBefore, 444 PlacesAfterwards, 955 TransitionsBefore, 955 TransitionsAfterwards, 4690 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): 595, Positive cache size: 582, Positive conditional cache size: 525, Positive unconditional cache size: 57, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 445 PlacesBefore, 445 PlacesAfterwards, 954 TransitionsBefore, 934 TransitionsAfterwards, 4682 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 212, independent: 212, independent conditional: 212, 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: 212, independent: 212, independent conditional: 212, 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: 212, independent: 212, independent conditional: 212, 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: 212, independent: 212, independent conditional: 212, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 212, independent: 200, independent conditional: 200, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 607, Positive cache size: 594, Positive conditional cache size: 537, Positive unconditional cache size: 57, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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: 0.2s, 440 PlacesBefore, 435 PlacesAfterwards, 901 TransitionsBefore, 897 TransitionsAfterwards, 4322 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 10, independent unconditional: 6, 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: 16, independent: 16, independent conditional: 10, independent unconditional: 6, 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: 16, independent: 16, independent conditional: 10, independent unconditional: 6, 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): 611, Positive cache size: 598, Positive conditional cache size: 537, Positive unconditional cache size: 61, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 455 PlacesBefore, 455 PlacesAfterwards, 902 TransitionsBefore, 902 TransitionsAfterwards, 4338 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): 611, Positive cache size: 598, Positive conditional cache size: 537, Positive unconditional cache size: 61, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 447 PlacesBefore, 447 PlacesAfterwards, 900 TransitionsBefore, 900 TransitionsAfterwards, 4326 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): 611, Positive cache size: 598, Positive conditional cache size: 537, Positive unconditional cache size: 61, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, 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, 447 PlacesBefore, 447 PlacesAfterwards, 887 TransitionsBefore, 887 TransitionsAfterwards, 4290 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): 611, Positive cache size: 598, Positive conditional cache size: 537, Positive unconditional cache size: 61, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 446 PlacesBefore, 446 PlacesAfterwards, 896 TransitionsBefore, 896 TransitionsAfterwards, 4414 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 617, Positive cache size: 604, Positive conditional cache size: 543, Positive unconditional cache size: 61, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - ExceptionOrErrorResult: IndexOutOfBoundsException: Index 18 out of bounds for length 18 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IndexOutOfBoundsException: Index 18 out of bounds for length 18: java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:64) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 00:29:42,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...