/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-RepeatedSemanticLbeWithDisjunctivePredicates.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 07:43:50,173 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:43:50,175 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:43:50,214 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:43:50,216 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:43:50,219 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:43:50,222 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:43:50,226 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:43:50,230 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:43:50,235 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:43:50,237 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:43:50,239 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:43:50,239 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:43:50,242 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:43:50,243 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:43:50,246 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:43:50,246 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:43:50,247 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:43:50,250 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:43:50,254 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:43:50,256 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:43:50,257 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:43:50,258 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:43:50,259 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:43:50,265 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:43:50,266 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:43:50,266 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:43:50,268 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:43:50,268 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:43:50,269 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:43:50,269 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:43:50,272 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:43:50,283 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:43:50,284 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:43:50,284 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:43:50,284 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:43:50,285 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:43:50,285 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:43:50,285 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:43:50,286 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:43:50,286 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:43:50,290 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 07:43:50,322 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:43:50,322 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:43:50,324 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:43:50,324 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:43:50,324 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:43:50,325 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:43:50,325 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:43:50,325 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:43:50,325 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:43:50,326 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:43:50,326 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:43:50,326 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:43:50,327 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:43:50,327 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:43:50,327 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:43:50,327 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:43:50,327 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:43:50,327 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:43:50,327 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:43:50,328 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:43:50,328 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:43:50,328 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:43:50,328 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:43:50,328 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:43:50,328 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:43:50,328 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:43:50,329 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:43:50,329 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:43:50,329 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 07:43:50,665 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:43:50,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:43:50,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:43:50,690 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:43:50,695 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:43:50,697 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 07:43:51,898 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:43:52,119 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:43:52,120 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-multiply-verify.wvr.c [2022-12-06 07:43:52,128 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1108c744c/e8ac0e7ca728431788684481e217d9ff/FLAG814eaa011 [2022-12-06 07:43:52,144 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1108c744c/e8ac0e7ca728431788684481e217d9ff [2022-12-06 07:43:52,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:43:52,147 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:43:52,149 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:43:52,149 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:43:52,151 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:43:52,152 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:43:52" (1/1) ... [2022-12-06 07:43:52,153 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@600afa61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:43:52, skipping insertion in model container [2022-12-06 07:43:52,153 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:43:52" (1/1) ... [2022-12-06 07:43:52,159 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:43:52,177 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:43:52,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:43:52,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:43:52,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:43:52,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:43:52,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:43:52,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:43:52,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:43:52,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:43:52,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:43:52,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:43:52,347 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 07:43:52,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:43:52,377 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:43:52,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:43:52,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:43:52,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:43:52,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:43:52,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:43:52,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:43:52,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:43:52,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:43:52,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:43:52,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:43:52,419 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 07:43:52,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:43:52,436 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:43:52,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:43:52 WrapperNode [2022-12-06 07:43:52,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:43:52,439 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:43:52,439 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:43:52,439 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:43:52,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:43:52" (1/1) ... [2022-12-06 07:43:52,466 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:43:52" (1/1) ... [2022-12-06 07:43:52,505 INFO L138 Inliner]: procedures = 26, calls = 50, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 179 [2022-12-06 07:43:52,505 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:43:52,507 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:43:52,507 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:43:52,509 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:43:52,516 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:43:52" (1/1) ... [2022-12-06 07:43:52,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:43:52" (1/1) ... [2022-12-06 07:43:52,530 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:43:52" (1/1) ... [2022-12-06 07:43:52,530 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:43:52" (1/1) ... [2022-12-06 07:43:52,536 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:43:52" (1/1) ... [2022-12-06 07:43:52,539 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:43:52" (1/1) ... [2022-12-06 07:43:52,541 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:43:52" (1/1) ... [2022-12-06 07:43:52,542 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:43:52" (1/1) ... [2022-12-06 07:43:52,545 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:43:52,545 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:43:52,546 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:43:52,546 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:43:52,546 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:43:52" (1/1) ... [2022-12-06 07:43:52,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:43:52,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:43:52,593 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 07:43:52,621 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 07:43:52,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:43:52,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:43:52,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:43:52,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:43:52,640 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 07:43:52,640 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 07:43:52,640 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 07:43:52,640 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 07:43:52,640 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 07:43:52,640 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 07:43:52,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:43:52,640 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 07:43:52,640 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 07:43:52,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 07:43:52,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:43:52,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:43:52,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:43:52,642 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 07:43:52,772 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:43:52,774 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:43:53,030 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:43:53,150 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:43:53,150 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 07:43:53,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:43:53 BoogieIcfgContainer [2022-12-06 07:43:53,153 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:43:53,155 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:43:53,155 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:43:53,158 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:43:53,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:43:52" (1/3) ... [2022-12-06 07:43:53,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb92110 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:43:53, skipping insertion in model container [2022-12-06 07:43:53,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:43:52" (2/3) ... [2022-12-06 07:43:53,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb92110 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:43:53, skipping insertion in model container [2022-12-06 07:43:53,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:43:53" (3/3) ... [2022-12-06 07:43:53,160 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-multiply-verify.wvr.c [2022-12-06 07:43:53,176 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:43:53,176 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:43:53,176 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:43:53,244 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 07:43:53,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 144 transitions, 312 flow [2022-12-06 07:43:53,351 INFO L130 PetriNetUnfolder]: 9/141 cut-off events. [2022-12-06 07:43:53,352 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:43:53,358 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 07:43:53,358 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 144 transitions, 312 flow [2022-12-06 07:43:53,363 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 131 transitions, 280 flow [2022-12-06 07:43:53,364 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:43:53,381 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 131 transitions, 280 flow [2022-12-06 07:43:53,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 131 transitions, 280 flow [2022-12-06 07:43:53,419 INFO L130 PetriNetUnfolder]: 9/131 cut-off events. [2022-12-06 07:43:53,420 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:43:53,421 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 07:43:53,427 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 131 transitions, 280 flow [2022-12-06 07:43:53,427 INFO L188 LiptonReduction]: Number of co-enabled transitions 1464 [2022-12-06 07:43:58,634 INFO L203 LiptonReduction]: Total number of compositions: 109 [2022-12-06 07:43:58,650 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:43:58,656 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;@1b9b21dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:43:58,657 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 07:43:58,663 INFO L130 PetriNetUnfolder]: 3/21 cut-off events. [2022-12-06 07:43:58,663 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:43:58,663 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:43:58,664 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 07:43:58,664 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 07:43:58,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:43:58,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1581976625, now seen corresponding path program 1 times [2022-12-06 07:43:58,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:43:58,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213478853] [2022-12-06 07:43:58,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:43:58,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:43:58,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:43:59,152 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 07:43:59,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:43:59,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213478853] [2022-12-06 07:43:59,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213478853] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:43:59,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:43:59,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:43:59,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310905759] [2022-12-06 07:43:59,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:43:59,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:43:59,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:43:59,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:43:59,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:43:59,188 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 07:43:59,190 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 07:43:59,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:43:59,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 07:43:59,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:43:59,321 INFO L130 PetriNetUnfolder]: 169/271 cut-off events. [2022-12-06 07:43:59,321 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-12-06 07:43:59,325 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 07:43:59,329 INFO L137 encePairwiseOnDemand]: 16/22 looper letters, 21 selfloop transitions, 2 changer transitions 11/34 dead transitions. [2022-12-06 07:43:59,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 34 transitions, 163 flow [2022-12-06 07:43:59,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:43:59,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:43:59,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-06 07:43:59,341 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42045454545454547 [2022-12-06 07:43:59,342 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 62 flow. Second operand 4 states and 37 transitions. [2022-12-06 07:43:59,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 34 transitions, 163 flow [2022-12-06 07:43:59,348 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 07:43:59,353 INFO L231 Difference]: Finished difference. Result has 28 places, 23 transitions, 68 flow [2022-12-06 07:43:59,355 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 07:43:59,358 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, -1 predicate places. [2022-12-06 07:43:59,358 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:43:59,359 INFO L89 Accepts]: Start accepts. Operand has 28 places, 23 transitions, 68 flow [2022-12-06 07:43:59,363 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:43:59,363 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:43:59,363 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 23 transitions, 68 flow [2022-12-06 07:43:59,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 23 transitions, 68 flow [2022-12-06 07:43:59,378 INFO L130 PetriNetUnfolder]: 8/38 cut-off events. [2022-12-06 07:43:59,379 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:43:59,380 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 07:43:59,383 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 23 transitions, 68 flow [2022-12-06 07:43:59,388 INFO L188 LiptonReduction]: Number of co-enabled transitions 94 [2022-12-06 07:44:00,432 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:44:00,434 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1076 [2022-12-06 07:44:00,434 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 22 transitions, 64 flow [2022-12-06 07:44:00,434 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 07:44:00,434 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:00,434 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 07:44:00,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:44:00,435 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 07:44:00,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:00,435 INFO L85 PathProgramCache]: Analyzing trace with hash 18405854, now seen corresponding path program 1 times [2022-12-06 07:44:00,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:00,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001412298] [2022-12-06 07:44:00,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:00,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:00,577 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 07:44:00,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:00,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001412298] [2022-12-06 07:44:00,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001412298] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:44:00,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:44:00,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:44:00,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892453363] [2022-12-06 07:44:00,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:44:00,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:44:00,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:00,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:44:00,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:44:00,581 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 07:44:00,581 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 07:44:00,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:00,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 07:44:00,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:00,703 INFO L130 PetriNetUnfolder]: 212/344 cut-off events. [2022-12-06 07:44:00,704 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2022-12-06 07:44:00,704 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 07:44:00,707 INFO L137 encePairwiseOnDemand]: 18/22 looper letters, 21 selfloop transitions, 2 changer transitions 17/40 dead transitions. [2022-12-06 07:44:00,707 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 40 transitions, 193 flow [2022-12-06 07:44:00,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:44:00,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:44:00,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-06 07:44:00,709 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4659090909090909 [2022-12-06 07:44:00,709 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 64 flow. Second operand 4 states and 41 transitions. [2022-12-06 07:44:00,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 40 transitions, 193 flow [2022-12-06 07:44:00,710 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 07:44:00,711 INFO L231 Difference]: Finished difference. Result has 29 places, 23 transitions, 70 flow [2022-12-06 07:44:00,711 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 07:44:00,712 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places. [2022-12-06 07:44:00,712 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:00,712 INFO L89 Accepts]: Start accepts. Operand has 29 places, 23 transitions, 70 flow [2022-12-06 07:44:00,714 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:00,714 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:00,714 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 23 transitions, 70 flow [2022-12-06 07:44:00,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 23 transitions, 70 flow [2022-12-06 07:44:00,721 INFO L130 PetriNetUnfolder]: 8/38 cut-off events. [2022-12-06 07:44:00,721 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 07:44:00,722 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 07:44:00,723 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 23 transitions, 70 flow [2022-12-06 07:44:00,723 INFO L188 LiptonReduction]: Number of co-enabled transitions 94 [2022-12-06 07:44:01,834 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:44:01,835 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1123 [2022-12-06 07:44:01,835 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 22 transitions, 66 flow [2022-12-06 07:44:01,836 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 07:44:01,836 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:01,836 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 07:44:01,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 07:44:01,836 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 07:44:01,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:01,837 INFO L85 PathProgramCache]: Analyzing trace with hash -826066017, now seen corresponding path program 1 times [2022-12-06 07:44:01,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:01,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497785365] [2022-12-06 07:44:01,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:01,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:01,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:03,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 07:44:03,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:03,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497785365] [2022-12-06 07:44:03,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497785365] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:44:03,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:44:03,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 07:44:03,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035712205] [2022-12-06 07:44:03,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:44:03,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:44:03,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:03,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:44:03,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:44:03,348 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 07:44:03,348 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 07:44:03,348 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:03,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 07:44:03,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:04,294 INFO L130 PetriNetUnfolder]: 386/662 cut-off events. [2022-12-06 07:44:04,294 INFO L131 PetriNetUnfolder]: For 282/282 co-relation queries the response was YES. [2022-12-06 07:44:04,295 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 07:44:04,298 INFO L137 encePairwiseOnDemand]: 10/22 looper letters, 94 selfloop transitions, 16 changer transitions 9/119 dead transitions. [2022-12-06 07:44:04,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 119 transitions, 571 flow [2022-12-06 07:44:04,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 07:44:04,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 07:44:04,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 122 transitions. [2022-12-06 07:44:04,303 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5041322314049587 [2022-12-06 07:44:04,303 INFO L175 Difference]: Start difference. First operand has 27 places, 22 transitions, 66 flow. Second operand 11 states and 122 transitions. [2022-12-06 07:44:04,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 119 transitions, 571 flow [2022-12-06 07:44:04,307 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 07:44:04,309 INFO L231 Difference]: Finished difference. Result has 42 places, 38 transitions, 194 flow [2022-12-06 07:44:04,309 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 07:44:04,310 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 13 predicate places. [2022-12-06 07:44:04,311 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:04,311 INFO L89 Accepts]: Start accepts. Operand has 42 places, 38 transitions, 194 flow [2022-12-06 07:44:04,313 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:04,313 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:04,313 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 38 transitions, 194 flow [2022-12-06 07:44:04,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 38 transitions, 194 flow [2022-12-06 07:44:04,329 INFO L130 PetriNetUnfolder]: 30/132 cut-off events. [2022-12-06 07:44:04,330 INFO L131 PetriNetUnfolder]: For 129/144 co-relation queries the response was YES. [2022-12-06 07:44:04,330 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 07:44:04,331 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 38 transitions, 194 flow [2022-12-06 07:44:04,331 INFO L188 LiptonReduction]: Number of co-enabled transitions 218 [2022-12-06 07:44:07,453 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 07:44:07,882 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:44:07,883 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3572 [2022-12-06 07:44:07,884 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 36 transitions, 193 flow [2022-12-06 07:44:07,884 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 07:44:07,884 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:07,884 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 07:44:07,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 07:44:07,884 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 07:44:07,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:07,885 INFO L85 PathProgramCache]: Analyzing trace with hash -925002003, now seen corresponding path program 1 times [2022-12-06 07:44:07,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:07,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070166921] [2022-12-06 07:44:07,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:07,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:07,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:09,519 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 07:44:09,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:09,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070166921] [2022-12-06 07:44:09,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070166921] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:44:09,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:44:09,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:44:09,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573160654] [2022-12-06 07:44:09,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:44:09,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:44:09,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:09,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:44:09,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:44:09,521 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 07:44:09,521 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 07:44:09,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:09,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 07:44:09,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:10,435 INFO L130 PetriNetUnfolder]: 567/978 cut-off events. [2022-12-06 07:44:10,435 INFO L131 PetriNetUnfolder]: For 2234/2234 co-relation queries the response was YES. [2022-12-06 07:44:10,438 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 07:44:10,443 INFO L137 encePairwiseOnDemand]: 16/28 looper letters, 74 selfloop transitions, 20 changer transitions 12/106 dead transitions. [2022-12-06 07:44:10,443 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 106 transitions, 717 flow [2022-12-06 07:44:10,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:44:10,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:44:10,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2022-12-06 07:44:10,445 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 07:44:10,445 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 193 flow. Second operand 7 states and 98 transitions. [2022-12-06 07:44:10,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 106 transitions, 717 flow [2022-12-06 07:44:10,453 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 07:44:10,455 INFO L231 Difference]: Finished difference. Result has 47 places, 50 transitions, 353 flow [2022-12-06 07:44:10,455 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 07:44:10,457 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 18 predicate places. [2022-12-06 07:44:10,457 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:10,457 INFO L89 Accepts]: Start accepts. Operand has 47 places, 50 transitions, 353 flow [2022-12-06 07:44:10,458 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:10,458 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:10,458 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 50 transitions, 353 flow [2022-12-06 07:44:10,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 50 transitions, 353 flow [2022-12-06 07:44:10,486 INFO L130 PetriNetUnfolder]: 62/237 cut-off events. [2022-12-06 07:44:10,486 INFO L131 PetriNetUnfolder]: For 556/593 co-relation queries the response was YES. [2022-12-06 07:44:10,487 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 07:44:10,489 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 50 transitions, 353 flow [2022-12-06 07:44:10,489 INFO L188 LiptonReduction]: Number of co-enabled transitions 298 [2022-12-06 07:44:10,491 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:44:10,497 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-06 07:44:10,497 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 50 transitions, 353 flow [2022-12-06 07:44:10,498 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 07:44:10,498 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:10,498 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:44:10,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 07:44:10,498 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 07:44:10,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:10,499 INFO L85 PathProgramCache]: Analyzing trace with hash 28389899, now seen corresponding path program 1 times [2022-12-06 07:44:10,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:10,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717291077] [2022-12-06 07:44:10,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:10,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:10,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:10,617 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 07:44:10,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:10,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717291077] [2022-12-06 07:44:10,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717291077] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:44:10,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:44:10,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:44:10,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829567904] [2022-12-06 07:44:10,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:44:10,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:44:10,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:10,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:44:10,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:44:10,621 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 07:44:10,621 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 07:44:10,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:10,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 07:44:10,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:10,804 INFO L130 PetriNetUnfolder]: 345/647 cut-off events. [2022-12-06 07:44:10,804 INFO L131 PetriNetUnfolder]: For 3209/3209 co-relation queries the response was YES. [2022-12-06 07:44:10,806 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 07:44:10,810 INFO L137 encePairwiseOnDemand]: 20/28 looper letters, 45 selfloop transitions, 20 changer transitions 2/67 dead transitions. [2022-12-06 07:44:10,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 67 transitions, 553 flow [2022-12-06 07:44:10,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:44:10,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:44:10,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-12-06 07:44:10,811 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4107142857142857 [2022-12-06 07:44:10,812 INFO L175 Difference]: Start difference. First operand has 45 places, 50 transitions, 353 flow. Second operand 4 states and 46 transitions. [2022-12-06 07:44:10,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 67 transitions, 553 flow [2022-12-06 07:44:10,821 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 07:44:10,823 INFO L231 Difference]: Finished difference. Result has 49 places, 49 transitions, 401 flow [2022-12-06 07:44:10,824 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 07:44:10,826 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 20 predicate places. [2022-12-06 07:44:10,826 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:10,826 INFO L89 Accepts]: Start accepts. Operand has 49 places, 49 transitions, 401 flow [2022-12-06 07:44:10,828 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:10,828 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:10,828 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 49 transitions, 401 flow [2022-12-06 07:44:10,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 49 transitions, 401 flow [2022-12-06 07:44:10,848 INFO L130 PetriNetUnfolder]: 25/141 cut-off events. [2022-12-06 07:44:10,849 INFO L131 PetriNetUnfolder]: For 441/486 co-relation queries the response was YES. [2022-12-06 07:44:10,849 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 07:44:10,851 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 49 transitions, 401 flow [2022-12-06 07:44:10,851 INFO L188 LiptonReduction]: Number of co-enabled transitions 276 [2022-12-06 07:44:10,852 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:44:10,854 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-06 07:44:10,855 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 49 transitions, 401 flow [2022-12-06 07:44:10,855 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 07:44:10,855 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:10,855 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 07:44:10,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 07:44:10,855 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 07:44:10,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:10,856 INFO L85 PathProgramCache]: Analyzing trace with hash 916594246, now seen corresponding path program 1 times [2022-12-06 07:44:10,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:10,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130981973] [2022-12-06 07:44:10,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:10,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:10,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:10,934 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 07:44:10,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:10,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130981973] [2022-12-06 07:44:10,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130981973] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:44:10,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:44:10,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:44:10,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274896664] [2022-12-06 07:44:10,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:44:10,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:44:10,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:10,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:44:10,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:44:10,939 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 07:44:10,939 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 07:44:10,939 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:10,939 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 07:44:10,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:11,063 INFO L130 PetriNetUnfolder]: 279/537 cut-off events. [2022-12-06 07:44:11,063 INFO L131 PetriNetUnfolder]: For 3139/3139 co-relation queries the response was YES. [2022-12-06 07:44:11,065 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 07:44:11,068 INFO L137 encePairwiseOnDemand]: 24/27 looper letters, 57 selfloop transitions, 1 changer transitions 1/59 dead transitions. [2022-12-06 07:44:11,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 59 transitions, 569 flow [2022-12-06 07:44:11,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:44:11,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:44:11,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-12-06 07:44:11,070 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2022-12-06 07:44:11,070 INFO L175 Difference]: Start difference. First operand has 47 places, 49 transitions, 401 flow. Second operand 3 states and 42 transitions. [2022-12-06 07:44:11,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 59 transitions, 569 flow [2022-12-06 07:44:11,077 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 07:44:11,079 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 330 flow [2022-12-06 07:44:11,079 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 07:44:11,081 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 17 predicate places. [2022-12-06 07:44:11,081 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:11,081 INFO L89 Accepts]: Start accepts. Operand has 46 places, 45 transitions, 330 flow [2022-12-06 07:44:11,083 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:11,083 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:11,083 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 45 transitions, 330 flow [2022-12-06 07:44:11,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 45 transitions, 330 flow [2022-12-06 07:44:11,096 INFO L130 PetriNetUnfolder]: 19/124 cut-off events. [2022-12-06 07:44:11,097 INFO L131 PetriNetUnfolder]: For 359/389 co-relation queries the response was YES. [2022-12-06 07:44:11,097 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 07:44:11,098 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 45 transitions, 330 flow [2022-12-06 07:44:11,098 INFO L188 LiptonReduction]: Number of co-enabled transitions 240 [2022-12-06 07:44:11,118 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 07:44:11,256 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 07:44:11,356 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 07:44:11,509 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:44:11,510 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 429 [2022-12-06 07:44:11,510 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 44 transitions, 332 flow [2022-12-06 07:44:11,510 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 07:44:11,510 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:11,511 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:44:11,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 07:44:11,511 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 07:44:11,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:11,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1821594130, now seen corresponding path program 1 times [2022-12-06 07:44:11,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:11,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807757512] [2022-12-06 07:44:11,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:11,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:11,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:12,726 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 07:44:12,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:12,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807757512] [2022-12-06 07:44:12,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807757512] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:44:12,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:44:12,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:44:12,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244592096] [2022-12-06 07:44:12,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:44:12,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:44:12,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:12,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:44:12,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:44:12,728 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 07:44:12,728 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 07:44:12,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:12,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 07:44:12,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:13,109 INFO L130 PetriNetUnfolder]: 252/466 cut-off events. [2022-12-06 07:44:13,110 INFO L131 PetriNetUnfolder]: For 1652/1652 co-relation queries the response was YES. [2022-12-06 07:44:13,111 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 07:44:13,113 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 45 selfloop transitions, 11 changer transitions 23/79 dead transitions. [2022-12-06 07:44:13,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 79 transitions, 604 flow [2022-12-06 07:44:13,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:44:13,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:44:13,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-12-06 07:44:13,116 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33163265306122447 [2022-12-06 07:44:13,116 INFO L175 Difference]: Start difference. First operand has 45 places, 44 transitions, 332 flow. Second operand 7 states and 65 transitions. [2022-12-06 07:44:13,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 79 transitions, 604 flow [2022-12-06 07:44:13,119 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 07:44:13,121 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 349 flow [2022-12-06 07:44:13,121 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 07:44:13,122 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 24 predicate places. [2022-12-06 07:44:13,122 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:13,122 INFO L89 Accepts]: Start accepts. Operand has 53 places, 45 transitions, 349 flow [2022-12-06 07:44:13,124 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:13,125 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:13,125 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 45 transitions, 349 flow [2022-12-06 07:44:13,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 45 transitions, 349 flow [2022-12-06 07:44:13,141 INFO L130 PetriNetUnfolder]: 18/103 cut-off events. [2022-12-06 07:44:13,141 INFO L131 PetriNetUnfolder]: For 298/313 co-relation queries the response was YES. [2022-12-06 07:44:13,141 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 07:44:13,142 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 45 transitions, 349 flow [2022-12-06 07:44:13,142 INFO L188 LiptonReduction]: Number of co-enabled transitions 240 [2022-12-06 07:44:13,145 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 07:44:13,462 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 07:44:13,571 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 07:44:13,600 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 07:44:14,037 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 07:44:14,294 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 07:44:14,295 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1173 [2022-12-06 07:44:14,295 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 392 flow [2022-12-06 07:44:14,295 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 07:44:14,295 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:14,296 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:44:14,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 07:44:14,296 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 07:44:14,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:14,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1281087246, now seen corresponding path program 1 times [2022-12-06 07:44:14,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:14,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978619284] [2022-12-06 07:44:14,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:14,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:15,148 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 07:44:15,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:15,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978619284] [2022-12-06 07:44:15,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978619284] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:44:15,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:44:15,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:44:15,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002699646] [2022-12-06 07:44:15,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:44:15,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:44:15,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:15,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:44:15,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:44:15,151 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 07:44:15,151 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 07:44:15,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:15,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 07:44:15,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:15,614 INFO L130 PetriNetUnfolder]: 242/440 cut-off events. [2022-12-06 07:44:15,614 INFO L131 PetriNetUnfolder]: For 1843/1843 co-relation queries the response was YES. [2022-12-06 07:44:15,615 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 07:44:15,618 INFO L137 encePairwiseOnDemand]: 24/31 looper letters, 59 selfloop transitions, 4 changer transitions 18/81 dead transitions. [2022-12-06 07:44:15,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 81 transitions, 660 flow [2022-12-06 07:44:15,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:44:15,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:44:15,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-12-06 07:44:15,619 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2022-12-06 07:44:15,619 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 392 flow. Second operand 6 states and 72 transitions. [2022-12-06 07:44:15,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 81 transitions, 660 flow [2022-12-06 07:44:15,624 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 07:44:15,625 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 270 flow [2022-12-06 07:44:15,625 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 07:44:15,626 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 25 predicate places. [2022-12-06 07:44:15,626 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:15,626 INFO L89 Accepts]: Start accepts. Operand has 54 places, 40 transitions, 270 flow [2022-12-06 07:44:15,627 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:15,627 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:15,627 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 40 transitions, 270 flow [2022-12-06 07:44:15,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 40 transitions, 270 flow [2022-12-06 07:44:15,640 INFO L130 PetriNetUnfolder]: 18/82 cut-off events. [2022-12-06 07:44:15,640 INFO L131 PetriNetUnfolder]: For 144/155 co-relation queries the response was YES. [2022-12-06 07:44:15,640 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 07:44:15,641 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 40 transitions, 270 flow [2022-12-06 07:44:15,641 INFO L188 LiptonReduction]: Number of co-enabled transitions 218 [2022-12-06 07:44:15,642 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:44:15,642 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 07:44:15,642 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 270 flow [2022-12-06 07:44:15,643 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 07:44:15,643 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:15,643 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:44:15,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 07:44:15,643 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 07:44:15,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:15,644 INFO L85 PathProgramCache]: Analyzing trace with hash -507445429, now seen corresponding path program 1 times [2022-12-06 07:44:15,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:15,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846825468] [2022-12-06 07:44:15,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:15,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:15,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:15,742 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 07:44:15,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:15,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846825468] [2022-12-06 07:44:15,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846825468] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:44:15,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:44:15,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:44:15,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250867625] [2022-12-06 07:44:15,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:44:15,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:44:15,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:15,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:44:15,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:44:15,745 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 07:44:15,745 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 07:44:15,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:15,745 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 07:44:15,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:15,850 INFO L130 PetriNetUnfolder]: 279/510 cut-off events. [2022-12-06 07:44:15,850 INFO L131 PetriNetUnfolder]: For 1495/1495 co-relation queries the response was YES. [2022-12-06 07:44:15,851 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 07:44:15,854 INFO L137 encePairwiseOnDemand]: 25/28 looper letters, 56 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2022-12-06 07:44:15,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 60 transitions, 496 flow [2022-12-06 07:44:15,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:44:15,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:44:15,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-12-06 07:44:15,855 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-06 07:44:15,855 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 270 flow. Second operand 3 states and 44 transitions. [2022-12-06 07:44:15,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 60 transitions, 496 flow [2022-12-06 07:44:15,858 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 07:44:15,859 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 267 flow [2022-12-06 07:44:15,860 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 07:44:15,860 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 14 predicate places. [2022-12-06 07:44:15,860 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:15,860 INFO L89 Accepts]: Start accepts. Operand has 43 places, 41 transitions, 267 flow [2022-12-06 07:44:15,861 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:15,861 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:15,861 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 41 transitions, 267 flow [2022-12-06 07:44:15,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 41 transitions, 267 flow [2022-12-06 07:44:15,873 INFO L130 PetriNetUnfolder]: 19/104 cut-off events. [2022-12-06 07:44:15,874 INFO L131 PetriNetUnfolder]: For 153/163 co-relation queries the response was YES. [2022-12-06 07:44:15,874 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 07:44:15,875 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 41 transitions, 267 flow [2022-12-06 07:44:15,875 INFO L188 LiptonReduction]: Number of co-enabled transitions 238 [2022-12-06 07:44:15,875 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:44:15,877 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 07:44:15,877 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 267 flow [2022-12-06 07:44:15,877 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 07:44:15,877 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:15,877 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 07:44:15,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 07:44:15,878 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 07:44:15,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:15,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1560257784, now seen corresponding path program 1 times [2022-12-06 07:44:15,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:15,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388211948] [2022-12-06 07:44:15,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:15,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:15,952 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 07:44:15,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:15,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388211948] [2022-12-06 07:44:15,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388211948] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:44:15,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:44:15,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:44:15,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896200681] [2022-12-06 07:44:15,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:44:15,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:44:15,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:15,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:44:15,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:44:15,954 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 07:44:15,955 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 07:44:15,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:15,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 07:44:15,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:16,106 INFO L130 PetriNetUnfolder]: 368/663 cut-off events. [2022-12-06 07:44:16,106 INFO L131 PetriNetUnfolder]: For 1700/1700 co-relation queries the response was YES. [2022-12-06 07:44:16,108 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 07:44:16,111 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 66 selfloop transitions, 8 changer transitions 0/74 dead transitions. [2022-12-06 07:44:16,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 74 transitions, 584 flow [2022-12-06 07:44:16,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:44:16,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:44:16,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-12-06 07:44:16,112 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2022-12-06 07:44:16,112 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 267 flow. Second operand 4 states and 56 transitions. [2022-12-06 07:44:16,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 74 transitions, 584 flow [2022-12-06 07:44:16,115 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 07:44:16,116 INFO L231 Difference]: Finished difference. Result has 48 places, 49 transitions, 367 flow [2022-12-06 07:44:16,117 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 07:44:16,117 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 19 predicate places. [2022-12-06 07:44:16,117 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:16,117 INFO L89 Accepts]: Start accepts. Operand has 48 places, 49 transitions, 367 flow [2022-12-06 07:44:16,118 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:16,118 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:16,118 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 49 transitions, 367 flow [2022-12-06 07:44:16,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 49 transitions, 367 flow [2022-12-06 07:44:16,134 INFO L130 PetriNetUnfolder]: 31/138 cut-off events. [2022-12-06 07:44:16,134 INFO L131 PetriNetUnfolder]: For 259/266 co-relation queries the response was YES. [2022-12-06 07:44:16,134 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 07:44:16,135 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 49 transitions, 367 flow [2022-12-06 07:44:16,136 INFO L188 LiptonReduction]: Number of co-enabled transitions 312 [2022-12-06 07:44:16,136 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:44:16,137 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-06 07:44:16,137 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 49 transitions, 367 flow [2022-12-06 07:44:16,137 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 07:44:16,137 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:16,137 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 07:44:16,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 07:44:16,137 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 07:44:16,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:16,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1839844062, now seen corresponding path program 2 times [2022-12-06 07:44:16,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:16,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203231414] [2022-12-06 07:44:16,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:16,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:16,206 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 07:44:16,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:16,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203231414] [2022-12-06 07:44:16,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203231414] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:44:16,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:44:16,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:44:16,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211220730] [2022-12-06 07:44:16,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:44:16,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:44:16,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:16,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:44:16,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:44:16,208 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 07:44:16,209 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 07:44:16,209 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:16,209 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 07:44:16,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:16,364 INFO L130 PetriNetUnfolder]: 372/655 cut-off events. [2022-12-06 07:44:16,364 INFO L131 PetriNetUnfolder]: For 2431/2431 co-relation queries the response was YES. [2022-12-06 07:44:16,366 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 07:44:16,369 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 67 selfloop transitions, 15 changer transitions 0/82 dead transitions. [2022-12-06 07:44:16,369 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 82 transitions, 700 flow [2022-12-06 07:44:16,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:44:16,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:44:16,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-12-06 07:44:16,370 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2022-12-06 07:44:16,371 INFO L175 Difference]: Start difference. First operand has 48 places, 49 transitions, 367 flow. Second operand 4 states and 57 transitions. [2022-12-06 07:44:16,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 82 transitions, 700 flow [2022-12-06 07:44:16,374 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 07:44:16,376 INFO L231 Difference]: Finished difference. Result has 53 places, 53 transitions, 450 flow [2022-12-06 07:44:16,376 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 07:44:16,376 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 24 predicate places. [2022-12-06 07:44:16,376 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:16,376 INFO L89 Accepts]: Start accepts. Operand has 53 places, 53 transitions, 450 flow [2022-12-06 07:44:16,377 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:16,377 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:16,377 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 53 transitions, 450 flow [2022-12-06 07:44:16,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 53 transitions, 450 flow [2022-12-06 07:44:16,392 INFO L130 PetriNetUnfolder]: 34/140 cut-off events. [2022-12-06 07:44:16,393 INFO L131 PetriNetUnfolder]: For 376/385 co-relation queries the response was YES. [2022-12-06 07:44:16,393 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 07:44:16,394 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 53 transitions, 450 flow [2022-12-06 07:44:16,394 INFO L188 LiptonReduction]: Number of co-enabled transitions 342 [2022-12-06 07:44:16,395 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:44:16,395 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 07:44:16,395 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 53 transitions, 450 flow [2022-12-06 07:44:16,396 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 07:44:16,396 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:16,396 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 07:44:16,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 07:44:16,396 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 07:44:16,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:16,396 INFO L85 PathProgramCache]: Analyzing trace with hash 2011828472, now seen corresponding path program 1 times [2022-12-06 07:44:16,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:16,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085779050] [2022-12-06 07:44:16,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:16,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:16,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:17,363 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 07:44:17,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:17,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085779050] [2022-12-06 07:44:17,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085779050] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:44:17,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:44:17,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:44:17,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573401711] [2022-12-06 07:44:17,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:44:17,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:44:17,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:17,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:44:17,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:44:17,365 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 07:44:17,365 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 07:44:17,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:17,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 07:44:17,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:17,872 INFO L130 PetriNetUnfolder]: 451/795 cut-off events. [2022-12-06 07:44:17,872 INFO L131 PetriNetUnfolder]: For 4066/4066 co-relation queries the response was YES. [2022-12-06 07:44:17,874 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 07:44:17,879 INFO L137 encePairwiseOnDemand]: 15/26 looper letters, 76 selfloop transitions, 22 changer transitions 13/111 dead transitions. [2022-12-06 07:44:17,879 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 111 transitions, 1035 flow [2022-12-06 07:44:17,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:44:17,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:44:17,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-12-06 07:44:17,881 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38461538461538464 [2022-12-06 07:44:17,881 INFO L175 Difference]: Start difference. First operand has 53 places, 53 transitions, 450 flow. Second operand 8 states and 80 transitions. [2022-12-06 07:44:17,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 111 transitions, 1035 flow [2022-12-06 07:44:17,885 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 07:44:17,889 INFO L231 Difference]: Finished difference. Result has 64 places, 68 transitions, 667 flow [2022-12-06 07:44:17,889 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 07:44:17,890 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 35 predicate places. [2022-12-06 07:44:17,890 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:17,891 INFO L89 Accepts]: Start accepts. Operand has 64 places, 68 transitions, 667 flow [2022-12-06 07:44:17,892 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:17,892 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:17,892 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 68 transitions, 667 flow [2022-12-06 07:44:17,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 68 transitions, 667 flow [2022-12-06 07:44:17,919 INFO L130 PetriNetUnfolder]: 96/273 cut-off events. [2022-12-06 07:44:17,920 INFO L131 PetriNetUnfolder]: For 968/986 co-relation queries the response was YES. [2022-12-06 07:44:17,921 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 07:44:17,923 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 68 transitions, 667 flow [2022-12-06 07:44:17,923 INFO L188 LiptonReduction]: Number of co-enabled transitions 408 [2022-12-06 07:44:17,926 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 07:44:18,069 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:44:18,070 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 07:44:18,070 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 67 transitions, 665 flow [2022-12-06 07:44:18,070 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 07:44:18,070 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:18,070 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 07:44:18,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 07:44:18,071 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 07:44:18,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:18,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1059145440, now seen corresponding path program 2 times [2022-12-06 07:44:18,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:18,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102361417] [2022-12-06 07:44:18,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:18,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:18,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:19,258 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 07:44:19,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:19,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102361417] [2022-12-06 07:44:19,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102361417] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:44:19,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:44:19,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 07:44:19,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504420598] [2022-12-06 07:44:19,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:44:19,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:44:19,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:19,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:44:19,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:44:19,259 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 07:44:19,260 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 07:44:19,260 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:19,260 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 07:44:19,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:19,839 INFO L130 PetriNetUnfolder]: 470/831 cut-off events. [2022-12-06 07:44:19,839 INFO L131 PetriNetUnfolder]: For 4896/4896 co-relation queries the response was YES. [2022-12-06 07:44:19,842 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 07:44:19,847 INFO L137 encePairwiseOnDemand]: 16/27 looper letters, 73 selfloop transitions, 22 changer transitions 15/110 dead transitions. [2022-12-06 07:44:19,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 110 transitions, 1125 flow [2022-12-06 07:44:19,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:44:19,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:44:19,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-12-06 07:44:19,849 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37037037037037035 [2022-12-06 07:44:19,849 INFO L175 Difference]: Start difference. First operand has 62 places, 67 transitions, 665 flow. Second operand 8 states and 80 transitions. [2022-12-06 07:44:19,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 110 transitions, 1125 flow [2022-12-06 07:44:19,857 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 07:44:19,859 INFO L231 Difference]: Finished difference. Result has 69 places, 68 transitions, 704 flow [2022-12-06 07:44:19,859 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 07:44:19,860 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 40 predicate places. [2022-12-06 07:44:19,860 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:19,860 INFO L89 Accepts]: Start accepts. Operand has 69 places, 68 transitions, 704 flow [2022-12-06 07:44:19,861 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:19,861 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:19,861 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 68 transitions, 704 flow [2022-12-06 07:44:19,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 68 transitions, 704 flow [2022-12-06 07:44:19,888 INFO L130 PetriNetUnfolder]: 94/277 cut-off events. [2022-12-06 07:44:19,889 INFO L131 PetriNetUnfolder]: For 1352/1373 co-relation queries the response was YES. [2022-12-06 07:44:19,890 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 07:44:19,896 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 68 transitions, 704 flow [2022-12-06 07:44:19,896 INFO L188 LiptonReduction]: Number of co-enabled transitions 416 [2022-12-06 07:44:19,897 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:44:19,898 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-06 07:44:19,898 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 68 transitions, 704 flow [2022-12-06 07:44:19,898 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 07:44:19,898 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:19,898 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 07:44:19,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 07:44:19,899 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 07:44:19,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:19,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1537088064, now seen corresponding path program 1 times [2022-12-06 07:44:19,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:19,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565327354] [2022-12-06 07:44:19,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:19,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:19,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:22,904 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 07:44:22,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:22,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565327354] [2022-12-06 07:44:22,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565327354] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:44:22,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:44:22,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 07:44:22,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944321366] [2022-12-06 07:44:22,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:44:22,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 07:44:22,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:22,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 07:44:22,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-06 07:44:22,906 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 07:44:22,906 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 07:44:22,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:22,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 07:44:22,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:24,240 INFO L130 PetriNetUnfolder]: 644/1084 cut-off events. [2022-12-06 07:44:24,241 INFO L131 PetriNetUnfolder]: For 7105/7105 co-relation queries the response was YES. [2022-12-06 07:44:24,244 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 07:44:24,251 INFO L137 encePairwiseOnDemand]: 11/26 looper letters, 104 selfloop transitions, 25 changer transitions 13/142 dead transitions. [2022-12-06 07:44:24,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 142 transitions, 1426 flow [2022-12-06 07:44:24,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 07:44:24,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 07:44:24,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 93 transitions. [2022-12-06 07:44:24,252 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3576923076923077 [2022-12-06 07:44:24,252 INFO L175 Difference]: Start difference. First operand has 67 places, 68 transitions, 704 flow. Second operand 10 states and 93 transitions. [2022-12-06 07:44:24,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 142 transitions, 1426 flow [2022-12-06 07:44:24,262 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 07:44:24,264 INFO L231 Difference]: Finished difference. Result has 77 places, 84 transitions, 903 flow [2022-12-06 07:44:24,265 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 07:44:24,265 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 48 predicate places. [2022-12-06 07:44:24,265 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:24,265 INFO L89 Accepts]: Start accepts. Operand has 77 places, 84 transitions, 903 flow [2022-12-06 07:44:24,266 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:24,266 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:24,266 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 84 transitions, 903 flow [2022-12-06 07:44:24,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 84 transitions, 903 flow [2022-12-06 07:44:24,304 INFO L130 PetriNetUnfolder]: 130/361 cut-off events. [2022-12-06 07:44:24,305 INFO L131 PetriNetUnfolder]: For 1972/2006 co-relation queries the response was YES. [2022-12-06 07:44:24,306 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 07:44:24,309 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 84 transitions, 903 flow [2022-12-06 07:44:24,310 INFO L188 LiptonReduction]: Number of co-enabled transitions 536 [2022-12-06 07:44:24,312 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 07:44:24,655 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 07:44:28,000 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 07:44:28,002 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3737 [2022-12-06 07:44:28,002 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 83 transitions, 933 flow [2022-12-06 07:44:28,002 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 07:44:28,002 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:28,002 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 07:44:28,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 07:44:28,002 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 07:44:28,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:28,003 INFO L85 PathProgramCache]: Analyzing trace with hash 599754994, now seen corresponding path program 1 times [2022-12-06 07:44:28,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:28,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017221183] [2022-12-06 07:44:28,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:28,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:28,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:31,550 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 07:44:31,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:31,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017221183] [2022-12-06 07:44:31,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017221183] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:44:31,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:44:31,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:44:31,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371182599] [2022-12-06 07:44:31,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:44:31,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:44:31,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:31,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:44:31,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:44:31,552 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 07:44:31,552 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 07:44:31,552 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:31,552 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 07:44:31,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:32,422 INFO L130 PetriNetUnfolder]: 665/1122 cut-off events. [2022-12-06 07:44:32,423 INFO L131 PetriNetUnfolder]: For 9232/9232 co-relation queries the response was YES. [2022-12-06 07:44:32,428 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 07:44:32,435 INFO L137 encePairwiseOnDemand]: 23/35 looper letters, 81 selfloop transitions, 34 changer transitions 17/132 dead transitions. [2022-12-06 07:44:32,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 132 transitions, 1548 flow [2022-12-06 07:44:32,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:44:32,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:44:32,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2022-12-06 07:44:32,436 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33877551020408164 [2022-12-06 07:44:32,436 INFO L175 Difference]: Start difference. First operand has 75 places, 83 transitions, 933 flow. Second operand 7 states and 83 transitions. [2022-12-06 07:44:32,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 132 transitions, 1548 flow [2022-12-06 07:44:32,452 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 07:44:32,455 INFO L231 Difference]: Finished difference. Result has 83 places, 95 transitions, 1118 flow [2022-12-06 07:44:32,455 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 07:44:32,455 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 54 predicate places. [2022-12-06 07:44:32,455 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:32,455 INFO L89 Accepts]: Start accepts. Operand has 83 places, 95 transitions, 1118 flow [2022-12-06 07:44:32,456 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:32,456 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:32,456 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 95 transitions, 1118 flow [2022-12-06 07:44:32,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 95 transitions, 1118 flow [2022-12-06 07:44:32,500 INFO L130 PetriNetUnfolder]: 161/414 cut-off events. [2022-12-06 07:44:32,500 INFO L131 PetriNetUnfolder]: For 2316/2353 co-relation queries the response was YES. [2022-12-06 07:44:32,502 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 07:44:32,506 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 95 transitions, 1118 flow [2022-12-06 07:44:32,506 INFO L188 LiptonReduction]: Number of co-enabled transitions 570 [2022-12-06 07:44:32,508 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 07:44:32,648 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:44:32,648 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 193 [2022-12-06 07:44:32,648 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 94 transitions, 1116 flow [2022-12-06 07:44:32,649 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 07:44:32,649 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:32,649 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:44:32,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 07:44:32,649 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 07:44:32,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:32,649 INFO L85 PathProgramCache]: Analyzing trace with hash -2043715631, now seen corresponding path program 1 times [2022-12-06 07:44:32,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:32,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236276672] [2022-12-06 07:44:32,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:32,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:32,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:34,326 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 07:44:34,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:34,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236276672] [2022-12-06 07:44:34,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236276672] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:44:34,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:44:34,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:44:34,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996325218] [2022-12-06 07:44:34,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:44:34,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:44:34,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:34,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:44:34,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:44:34,328 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 07:44:34,328 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 07:44:34,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:34,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 07:44:34,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:34,719 INFO L130 PetriNetUnfolder]: 632/1067 cut-off events. [2022-12-06 07:44:34,719 INFO L131 PetriNetUnfolder]: For 9199/9199 co-relation queries the response was YES. [2022-12-06 07:44:34,722 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 07:44:34,728 INFO L137 encePairwiseOnDemand]: 23/35 looper letters, 91 selfloop transitions, 20 changer transitions 14/125 dead transitions. [2022-12-06 07:44:34,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 125 transitions, 1522 flow [2022-12-06 07:44:34,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:44:34,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:44:34,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-12-06 07:44:34,730 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32857142857142857 [2022-12-06 07:44:34,730 INFO L175 Difference]: Start difference. First operand has 78 places, 94 transitions, 1116 flow. Second operand 6 states and 69 transitions. [2022-12-06 07:44:34,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 125 transitions, 1522 flow [2022-12-06 07:44:34,745 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 07:44:34,747 INFO L231 Difference]: Finished difference. Result has 80 places, 93 transitions, 1106 flow [2022-12-06 07:44:34,747 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 07:44:34,748 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 51 predicate places. [2022-12-06 07:44:34,748 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:34,748 INFO L89 Accepts]: Start accepts. Operand has 80 places, 93 transitions, 1106 flow [2022-12-06 07:44:34,749 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:34,749 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:34,749 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 93 transitions, 1106 flow [2022-12-06 07:44:34,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 93 transitions, 1106 flow [2022-12-06 07:44:34,789 INFO L130 PetriNetUnfolder]: 159/408 cut-off events. [2022-12-06 07:44:34,789 INFO L131 PetriNetUnfolder]: For 2441/2483 co-relation queries the response was YES. [2022-12-06 07:44:34,791 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 07:44:34,794 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 93 transitions, 1106 flow [2022-12-06 07:44:34,794 INFO L188 LiptonReduction]: Number of co-enabled transitions 562 [2022-12-06 07:44:34,795 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:44:34,795 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-06 07:44:34,795 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 93 transitions, 1106 flow [2022-12-06 07:44:34,795 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 07:44:34,796 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:34,796 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:44:34,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 07:44:34,796 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 07:44:34,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:34,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1698656871, now seen corresponding path program 1 times [2022-12-06 07:44:34,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:34,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893153715] [2022-12-06 07:44:34,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:34,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:34,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:35,613 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 07:44:35,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:35,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893153715] [2022-12-06 07:44:35,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893153715] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:44:35,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:44:35,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:44:35,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574442150] [2022-12-06 07:44:35,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:44:35,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:44:35,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:35,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:44:35,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:44:35,615 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 07:44:35,615 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 07:44:35,615 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:35,615 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 07:44:35,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:35,982 INFO L130 PetriNetUnfolder]: 643/1087 cut-off events. [2022-12-06 07:44:35,983 INFO L131 PetriNetUnfolder]: For 8920/8920 co-relation queries the response was YES. [2022-12-06 07:44:35,986 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 07:44:35,991 INFO L137 encePairwiseOnDemand]: 22/34 looper letters, 81 selfloop transitions, 33 changer transitions 15/129 dead transitions. [2022-12-06 07:44:35,991 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 129 transitions, 1558 flow [2022-12-06 07:44:35,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:44:35,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:44:35,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-12-06 07:44:35,993 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3319327731092437 [2022-12-06 07:44:35,993 INFO L175 Difference]: Start difference. First operand has 78 places, 93 transitions, 1106 flow. Second operand 7 states and 79 transitions. [2022-12-06 07:44:35,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 129 transitions, 1558 flow [2022-12-06 07:44:36,004 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 07:44:36,007 INFO L231 Difference]: Finished difference. Result has 82 places, 94 transitions, 1152 flow [2022-12-06 07:44:36,007 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 07:44:36,007 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 53 predicate places. [2022-12-06 07:44:36,007 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:36,007 INFO L89 Accepts]: Start accepts. Operand has 82 places, 94 transitions, 1152 flow [2022-12-06 07:44:36,008 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:36,008 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:36,009 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 94 transitions, 1152 flow [2022-12-06 07:44:36,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 94 transitions, 1152 flow [2022-12-06 07:44:36,049 INFO L130 PetriNetUnfolder]: 158/408 cut-off events. [2022-12-06 07:44:36,049 INFO L131 PetriNetUnfolder]: For 2473/2514 co-relation queries the response was YES. [2022-12-06 07:44:36,051 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 07:44:36,054 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 94 transitions, 1152 flow [2022-12-06 07:44:36,054 INFO L188 LiptonReduction]: Number of co-enabled transitions 574 [2022-12-06 07:44:36,055 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:44:36,056 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-06 07:44:36,056 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 94 transitions, 1152 flow [2022-12-06 07:44:36,056 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 07:44:36,056 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:36,056 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 07:44:36,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 07:44:36,056 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 07:44:36,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:36,057 INFO L85 PathProgramCache]: Analyzing trace with hash -213775677, now seen corresponding path program 1 times [2022-12-06 07:44:36,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:36,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709191574] [2022-12-06 07:44:36,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:36,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:36,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:36,110 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 07:44:36,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:36,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709191574] [2022-12-06 07:44:36,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709191574] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:44:36,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:44:36,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:44:36,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433222900] [2022-12-06 07:44:36,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:44:36,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:44:36,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:36,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:44:36,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:44:36,112 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 07:44:36,112 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 07:44:36,112 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:36,112 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 07:44:36,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:36,295 INFO L130 PetriNetUnfolder]: 628/1103 cut-off events. [2022-12-06 07:44:36,295 INFO L131 PetriNetUnfolder]: For 10156/10156 co-relation queries the response was YES. [2022-12-06 07:44:36,298 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 07:44:36,302 INFO L137 encePairwiseOnDemand]: 30/33 looper letters, 102 selfloop transitions, 1 changer transitions 2/105 dead transitions. [2022-12-06 07:44:36,302 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 105 transitions, 1400 flow [2022-12-06 07:44:36,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:44:36,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:44:36,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-12-06 07:44:36,303 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2022-12-06 07:44:36,303 INFO L175 Difference]: Start difference. First operand has 80 places, 94 transitions, 1152 flow. Second operand 3 states and 48 transitions. [2022-12-06 07:44:36,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 105 transitions, 1400 flow [2022-12-06 07:44:36,313 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 07:44:36,314 INFO L231 Difference]: Finished difference. Result has 78 places, 90 transitions, 1039 flow [2022-12-06 07:44:36,315 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 07:44:36,315 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 49 predicate places. [2022-12-06 07:44:36,315 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:36,315 INFO L89 Accepts]: Start accepts. Operand has 78 places, 90 transitions, 1039 flow [2022-12-06 07:44:36,316 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:36,316 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:36,316 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 90 transitions, 1039 flow [2022-12-06 07:44:36,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 90 transitions, 1039 flow [2022-12-06 07:44:36,349 INFO L130 PetriNetUnfolder]: 148/409 cut-off events. [2022-12-06 07:44:36,349 INFO L131 PetriNetUnfolder]: For 2193/2235 co-relation queries the response was YES. [2022-12-06 07:44:36,351 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 07:44:36,354 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 90 transitions, 1039 flow [2022-12-06 07:44:36,354 INFO L188 LiptonReduction]: Number of co-enabled transitions 542 [2022-12-06 07:44:36,373 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 07:44:36,501 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:44:36,502 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 07:44:36,502 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 90 transitions, 1053 flow [2022-12-06 07:44:36,502 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 07:44:36,502 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:36,502 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 07:44:36,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 07:44:36,502 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 07:44:36,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:36,503 INFO L85 PathProgramCache]: Analyzing trace with hash -669422823, now seen corresponding path program 1 times [2022-12-06 07:44:36,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:36,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208913481] [2022-12-06 07:44:36,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:36,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:36,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:37,509 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 07:44:37,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:37,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208913481] [2022-12-06 07:44:37,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208913481] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:44:37,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:44:37,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:44:37,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104373034] [2022-12-06 07:44:37,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:44:37,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:44:37,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:37,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:44:37,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:44:37,511 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 07:44:37,511 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 07:44:37,511 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:37,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 07:44:37,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:37,946 INFO L130 PetriNetUnfolder]: 640/1133 cut-off events. [2022-12-06 07:44:37,946 INFO L131 PetriNetUnfolder]: For 9007/9007 co-relation queries the response was YES. [2022-12-06 07:44:37,949 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 07:44:37,952 INFO L137 encePairwiseOnDemand]: 19/33 looper letters, 80 selfloop transitions, 36 changer transitions 13/129 dead transitions. [2022-12-06 07:44:37,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 129 transitions, 1528 flow [2022-12-06 07:44:37,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:44:37,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:44:37,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2022-12-06 07:44:37,954 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33766233766233766 [2022-12-06 07:44:37,954 INFO L175 Difference]: Start difference. First operand has 78 places, 90 transitions, 1053 flow. Second operand 7 states and 78 transitions. [2022-12-06 07:44:37,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 129 transitions, 1528 flow [2022-12-06 07:44:37,963 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 07:44:37,965 INFO L231 Difference]: Finished difference. Result has 86 places, 97 transitions, 1213 flow [2022-12-06 07:44:37,965 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 07:44:37,965 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 57 predicate places. [2022-12-06 07:44:37,965 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:37,965 INFO L89 Accepts]: Start accepts. Operand has 86 places, 97 transitions, 1213 flow [2022-12-06 07:44:37,966 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:37,966 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:37,966 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 97 transitions, 1213 flow [2022-12-06 07:44:37,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 97 transitions, 1213 flow [2022-12-06 07:44:37,998 INFO L130 PetriNetUnfolder]: 156/440 cut-off events. [2022-12-06 07:44:37,998 INFO L131 PetriNetUnfolder]: For 2870/2914 co-relation queries the response was YES. [2022-12-06 07:44:37,999 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 07:44:38,002 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 97 transitions, 1213 flow [2022-12-06 07:44:38,002 INFO L188 LiptonReduction]: Number of co-enabled transitions 552 [2022-12-06 07:44:38,005 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 07:44:38,148 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:44:38,149 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 07:44:38,149 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 96 transitions, 1209 flow [2022-12-06 07:44:38,149 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 07:44:38,149 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:38,149 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:44:38,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 07:44:38,150 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 07:44:38,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:38,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1411447523, now seen corresponding path program 1 times [2022-12-06 07:44:38,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:38,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383870063] [2022-12-06 07:44:38,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:38,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:38,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:40,323 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 07:44:40,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:40,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383870063] [2022-12-06 07:44:40,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383870063] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:44:40,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:44:40,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:44:40,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092729821] [2022-12-06 07:44:40,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:44:40,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:44:40,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:40,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:44:40,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:44:40,325 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 07:44:40,325 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 07:44:40,325 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:40,325 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 07:44:40,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:40,979 INFO L130 PetriNetUnfolder]: 637/1129 cut-off events. [2022-12-06 07:44:40,979 INFO L131 PetriNetUnfolder]: For 10599/10599 co-relation queries the response was YES. [2022-12-06 07:44:40,982 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 07:44:40,987 INFO L137 encePairwiseOnDemand]: 22/34 looper letters, 90 selfloop transitions, 22 changer transitions 19/131 dead transitions. [2022-12-06 07:44:40,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 131 transitions, 1649 flow [2022-12-06 07:44:40,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:44:40,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:44:40,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-12-06 07:44:40,988 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31092436974789917 [2022-12-06 07:44:40,988 INFO L175 Difference]: Start difference. First operand has 84 places, 96 transitions, 1209 flow. Second operand 7 states and 74 transitions. [2022-12-06 07:44:40,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 131 transitions, 1649 flow [2022-12-06 07:44:41,003 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 07:44:41,005 INFO L231 Difference]: Finished difference. Result has 90 places, 98 transitions, 1222 flow [2022-12-06 07:44:41,005 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 07:44:41,005 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 61 predicate places. [2022-12-06 07:44:41,006 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:41,006 INFO L89 Accepts]: Start accepts. Operand has 90 places, 98 transitions, 1222 flow [2022-12-06 07:44:41,006 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:41,006 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:41,007 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 98 transitions, 1222 flow [2022-12-06 07:44:41,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 98 transitions, 1222 flow [2022-12-06 07:44:41,043 INFO L130 PetriNetUnfolder]: 155/441 cut-off events. [2022-12-06 07:44:41,044 INFO L131 PetriNetUnfolder]: For 3041/3079 co-relation queries the response was YES. [2022-12-06 07:44:41,045 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 07:44:41,047 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 98 transitions, 1222 flow [2022-12-06 07:44:41,047 INFO L188 LiptonReduction]: Number of co-enabled transitions 556 [2022-12-06 07:44:41,049 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 07:44:41,297 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:44:41,298 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 292 [2022-12-06 07:44:41,298 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 96 transitions, 1214 flow [2022-12-06 07:44:41,298 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 07:44:41,298 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:41,299 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:44:41,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 07:44:41,299 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 07:44:41,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:41,299 INFO L85 PathProgramCache]: Analyzing trace with hash -491321498, now seen corresponding path program 1 times [2022-12-06 07:44:41,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:41,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503573849] [2022-12-06 07:44:41,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:41,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:43,018 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 07:44:43,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:43,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503573849] [2022-12-06 07:44:43,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503573849] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:44:43,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:44:43,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:44:43,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287864981] [2022-12-06 07:44:43,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:44:43,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:44:43,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:43,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:44:43,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:44:43,020 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 07:44:43,020 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 07:44:43,020 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:43,020 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 07:44:43,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:43,545 INFO L130 PetriNetUnfolder]: 632/1119 cut-off events. [2022-12-06 07:44:43,545 INFO L131 PetriNetUnfolder]: For 10638/10638 co-relation queries the response was YES. [2022-12-06 07:44:43,549 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 07:44:43,553 INFO L137 encePairwiseOnDemand]: 20/35 looper letters, 79 selfloop transitions, 32 changer transitions 18/129 dead transitions. [2022-12-06 07:44:43,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 129 transitions, 1643 flow [2022-12-06 07:44:43,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:44:43,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:44:43,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2022-12-06 07:44:43,555 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3183673469387755 [2022-12-06 07:44:43,555 INFO L175 Difference]: Start difference. First operand has 87 places, 96 transitions, 1214 flow. Second operand 7 states and 78 transitions. [2022-12-06 07:44:43,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 129 transitions, 1643 flow [2022-12-06 07:44:43,572 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 07:44:43,574 INFO L231 Difference]: Finished difference. Result has 91 places, 94 transitions, 1195 flow [2022-12-06 07:44:43,574 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 07:44:43,575 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 62 predicate places. [2022-12-06 07:44:43,575 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:43,576 INFO L89 Accepts]: Start accepts. Operand has 91 places, 94 transitions, 1195 flow [2022-12-06 07:44:43,577 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:43,577 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:43,577 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 94 transitions, 1195 flow [2022-12-06 07:44:43,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 94 transitions, 1195 flow [2022-12-06 07:44:43,617 INFO L130 PetriNetUnfolder]: 153/420 cut-off events. [2022-12-06 07:44:43,617 INFO L131 PetriNetUnfolder]: For 2979/3016 co-relation queries the response was YES. [2022-12-06 07:44:43,619 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 07:44:43,622 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 94 transitions, 1195 flow [2022-12-06 07:44:43,622 INFO L188 LiptonReduction]: Number of co-enabled transitions 550 [2022-12-06 07:44:43,623 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:44:43,624 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-06 07:44:43,625 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 94 transitions, 1195 flow [2022-12-06 07:44:43,625 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 07:44:43,625 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:43,625 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 07:44:43,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 07:44:43,625 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 07:44:43,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:43,625 INFO L85 PathProgramCache]: Analyzing trace with hash 747385120, now seen corresponding path program 1 times [2022-12-06 07:44:43,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:43,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437428093] [2022-12-06 07:44:43,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:43,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:43,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:43,690 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 07:44:43,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:43,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437428093] [2022-12-06 07:44:43,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437428093] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:44:43,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:44:43,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:44:43,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609886931] [2022-12-06 07:44:43,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:44:43,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:44:43,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:43,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:44:43,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:44:43,691 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 07:44:43,693 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 07:44:43,693 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:43,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 07:44:43,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:43,925 INFO L130 PetriNetUnfolder]: 602/1027 cut-off events. [2022-12-06 07:44:43,925 INFO L131 PetriNetUnfolder]: For 8685/8685 co-relation queries the response was YES. [2022-12-06 07:44:43,928 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 07:44:43,932 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 101 selfloop transitions, 30 changer transitions 2/133 dead transitions. [2022-12-06 07:44:43,932 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 133 transitions, 1690 flow [2022-12-06 07:44:43,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:44:43,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:44:43,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2022-12-06 07:44:43,940 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46875 [2022-12-06 07:44:43,941 INFO L175 Difference]: Start difference. First operand has 89 places, 94 transitions, 1195 flow. Second operand 5 states and 75 transitions. [2022-12-06 07:44:43,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 133 transitions, 1690 flow [2022-12-06 07:44:43,958 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 07:44:43,960 INFO L231 Difference]: Finished difference. Result has 87 places, 90 transitions, 1128 flow [2022-12-06 07:44:43,960 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 07:44:43,961 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 58 predicate places. [2022-12-06 07:44:43,961 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:43,961 INFO L89 Accepts]: Start accepts. Operand has 87 places, 90 transitions, 1128 flow [2022-12-06 07:44:43,962 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:43,962 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:43,962 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 90 transitions, 1128 flow [2022-12-06 07:44:43,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 90 transitions, 1128 flow [2022-12-06 07:44:43,998 INFO L130 PetriNetUnfolder]: 151/388 cut-off events. [2022-12-06 07:44:43,998 INFO L131 PetriNetUnfolder]: For 2630/2663 co-relation queries the response was YES. [2022-12-06 07:44:44,000 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 07:44:44,002 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 90 transitions, 1128 flow [2022-12-06 07:44:44,003 INFO L188 LiptonReduction]: Number of co-enabled transitions 528 [2022-12-06 07:44:44,005 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 07:44:44,120 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 07:44:44,224 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 07:44:44,343 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:44:44,343 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 382 [2022-12-06 07:44:44,343 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 88 transitions, 1136 flow [2022-12-06 07:44:44,344 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 07:44:44,344 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:44,344 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 07:44:44,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 07:44:44,344 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 07:44:44,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:44,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1025211, now seen corresponding path program 1 times [2022-12-06 07:44:44,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:44,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208907891] [2022-12-06 07:44:44,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:44,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:44,420 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 07:44:44,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:44,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208907891] [2022-12-06 07:44:44,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208907891] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:44:44,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:44:44,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:44:44,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463828148] [2022-12-06 07:44:44,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:44:44,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:44:44,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:44,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:44:44,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:44:44,422 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 07:44:44,422 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 07:44:44,422 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:44,422 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 07:44:44,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:44,676 INFO L130 PetriNetUnfolder]: 604/1017 cut-off events. [2022-12-06 07:44:44,676 INFO L131 PetriNetUnfolder]: For 8414/8414 co-relation queries the response was YES. [2022-12-06 07:44:44,679 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 07:44:44,683 INFO L137 encePairwiseOnDemand]: 22/33 looper letters, 102 selfloop transitions, 31 changer transitions 0/133 dead transitions. [2022-12-06 07:44:44,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 133 transitions, 1629 flow [2022-12-06 07:44:44,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:44:44,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:44:44,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2022-12-06 07:44:44,685 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2022-12-06 07:44:44,685 INFO L175 Difference]: Start difference. First operand has 81 places, 88 transitions, 1136 flow. Second operand 6 states and 81 transitions. [2022-12-06 07:44:44,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 133 transitions, 1629 flow [2022-12-06 07:44:44,698 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 07:44:44,700 INFO L231 Difference]: Finished difference. Result has 82 places, 88 transitions, 1083 flow [2022-12-06 07:44:44,700 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 07:44:44,701 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 53 predicate places. [2022-12-06 07:44:44,701 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:44,701 INFO L89 Accepts]: Start accepts. Operand has 82 places, 88 transitions, 1083 flow [2022-12-06 07:44:44,701 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:44,702 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:44,702 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 88 transitions, 1083 flow [2022-12-06 07:44:44,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 88 transitions, 1083 flow [2022-12-06 07:44:44,737 INFO L130 PetriNetUnfolder]: 152/384 cut-off events. [2022-12-06 07:44:44,737 INFO L131 PetriNetUnfolder]: For 2655/2681 co-relation queries the response was YES. [2022-12-06 07:44:44,739 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 07:44:44,741 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 88 transitions, 1083 flow [2022-12-06 07:44:44,742 INFO L188 LiptonReduction]: Number of co-enabled transitions 528 [2022-12-06 07:44:44,769 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:44:44,770 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 69 [2022-12-06 07:44:44,770 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 88 transitions, 1093 flow [2022-12-06 07:44:44,770 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 07:44:44,770 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:44,770 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 07:44:44,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-06 07:44:44,770 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 07:44:44,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:44,771 INFO L85 PathProgramCache]: Analyzing trace with hash 914593211, now seen corresponding path program 1 times [2022-12-06 07:44:44,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:44,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584025248] [2022-12-06 07:44:44,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:44,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:46,630 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 07:44:46,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:46,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584025248] [2022-12-06 07:44:46,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584025248] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:44:46,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:44:46,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 07:44:46,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856164025] [2022-12-06 07:44:46,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:44:46,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:44:46,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:46,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:44:46,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:44:46,632 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 07:44:46,632 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 07:44:46,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:46,632 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 07:44:46,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:47,609 INFO L130 PetriNetUnfolder]: 597/1021 cut-off events. [2022-12-06 07:44:47,610 INFO L131 PetriNetUnfolder]: For 9880/9880 co-relation queries the response was YES. [2022-12-06 07:44:47,613 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 07:44:47,617 INFO L137 encePairwiseOnDemand]: 19/32 looper letters, 78 selfloop transitions, 33 changer transitions 13/124 dead transitions. [2022-12-06 07:44:47,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 124 transitions, 1544 flow [2022-12-06 07:44:47,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:44:47,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:44:47,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2022-12-06 07:44:47,619 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30078125 [2022-12-06 07:44:47,619 INFO L175 Difference]: Start difference. First operand has 82 places, 88 transitions, 1093 flow. Second operand 8 states and 77 transitions. [2022-12-06 07:44:47,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 124 transitions, 1544 flow [2022-12-06 07:44:47,632 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 07:44:47,634 INFO L231 Difference]: Finished difference. Result has 89 places, 93 transitions, 1161 flow [2022-12-06 07:44:47,635 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 07:44:47,635 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 60 predicate places. [2022-12-06 07:44:47,635 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:47,635 INFO L89 Accepts]: Start accepts. Operand has 89 places, 93 transitions, 1161 flow [2022-12-06 07:44:47,636 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:47,636 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:47,636 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 93 transitions, 1161 flow [2022-12-06 07:44:47,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 93 transitions, 1161 flow [2022-12-06 07:44:47,674 INFO L130 PetriNetUnfolder]: 153/391 cut-off events. [2022-12-06 07:44:47,675 INFO L131 PetriNetUnfolder]: For 2845/2873 co-relation queries the response was YES. [2022-12-06 07:44:47,676 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 07:44:47,679 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 93 transitions, 1161 flow [2022-12-06 07:44:47,679 INFO L188 LiptonReduction]: Number of co-enabled transitions 532 [2022-12-06 07:44:47,693 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 07:44:47,827 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 07:44:47,979 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 07:44:48,222 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 07:44:48,360 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 07:44:48,564 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 07:44:48,565 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 930 [2022-12-06 07:44:48,565 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 91 transitions, 1215 flow [2022-12-06 07:44:48,565 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 07:44:48,565 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:48,565 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 07:44:48,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-06 07:44:48,566 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 07:44:48,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:48,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1906731295, now seen corresponding path program 2 times [2022-12-06 07:44:48,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:48,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180760579] [2022-12-06 07:44:48,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:48,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:51,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:44:51,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:51,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180760579] [2022-12-06 07:44:51,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180760579] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:44:51,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:44:51,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 07:44:51,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356916879] [2022-12-06 07:44:51,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:44:51,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:44:51,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:51,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:44:51,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:44:51,177 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 07:44:51,177 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 07:44:51,177 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:51,177 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 07:44:51,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:52,410 INFO L130 PetriNetUnfolder]: 596/1029 cut-off events. [2022-12-06 07:44:52,410 INFO L131 PetriNetUnfolder]: For 10436/10436 co-relation queries the response was YES. [2022-12-06 07:44:52,414 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 07:44:52,418 INFO L137 encePairwiseOnDemand]: 21/36 looper letters, 78 selfloop transitions, 31 changer transitions 29/138 dead transitions. [2022-12-06 07:44:52,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 138 transitions, 1726 flow [2022-12-06 07:44:52,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 07:44:52,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 07:44:52,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 93 transitions. [2022-12-06 07:44:52,420 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25833333333333336 [2022-12-06 07:44:52,420 INFO L175 Difference]: Start difference. First operand has 86 places, 91 transitions, 1215 flow. Second operand 10 states and 93 transitions. [2022-12-06 07:44:52,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 138 transitions, 1726 flow [2022-12-06 07:44:52,436 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 07:44:52,438 INFO L231 Difference]: Finished difference. Result has 94 places, 91 transitions, 1164 flow [2022-12-06 07:44:52,439 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 07:44:52,439 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 65 predicate places. [2022-12-06 07:44:52,439 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:52,439 INFO L89 Accepts]: Start accepts. Operand has 94 places, 91 transitions, 1164 flow [2022-12-06 07:44:52,440 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:52,440 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:52,440 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 91 transitions, 1164 flow [2022-12-06 07:44:52,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 91 transitions, 1164 flow [2022-12-06 07:44:52,477 INFO L130 PetriNetUnfolder]: 150/377 cut-off events. [2022-12-06 07:44:52,477 INFO L131 PetriNetUnfolder]: For 2939/2970 co-relation queries the response was YES. [2022-12-06 07:44:52,479 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 07:44:52,481 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 91 transitions, 1164 flow [2022-12-06 07:44:52,482 INFO L188 LiptonReduction]: Number of co-enabled transitions 526 [2022-12-06 07:44:52,485 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 07:44:52,666 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:44:52,667 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 228 [2022-12-06 07:44:52,667 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 90 transitions, 1165 flow [2022-12-06 07:44:52,667 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 07:44:52,667 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:52,668 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:44:52,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-06 07:44:52,668 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 07:44:52,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:52,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1624444292, now seen corresponding path program 1 times [2022-12-06 07:44:52,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:52,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995229358] [2022-12-06 07:44:52,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:52,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:52,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:52,723 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 07:44:52,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:52,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995229358] [2022-12-06 07:44:52,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995229358] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:44:52,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:44:52,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:44:52,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308560224] [2022-12-06 07:44:52,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:44:52,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:44:52,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:52,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:44:52,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:44:52,725 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 07:44:52,725 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 07:44:52,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:52,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 07:44:52,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:52,857 INFO L130 PetriNetUnfolder]: 578/976 cut-off events. [2022-12-06 07:44:52,857 INFO L131 PetriNetUnfolder]: For 9425/9425 co-relation queries the response was YES. [2022-12-06 07:44:52,859 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 07:44:52,862 INFO L137 encePairwiseOnDemand]: 32/35 looper letters, 84 selfloop transitions, 22 changer transitions 0/106 dead transitions. [2022-12-06 07:44:52,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 106 transitions, 1469 flow [2022-12-06 07:44:52,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:44:52,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:44:52,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-12-06 07:44:52,864 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2022-12-06 07:44:52,864 INFO L175 Difference]: Start difference. First operand has 88 places, 90 transitions, 1165 flow. Second operand 3 states and 51 transitions. [2022-12-06 07:44:52,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 106 transitions, 1469 flow [2022-12-06 07:44:52,875 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 07:44:52,876 INFO L231 Difference]: Finished difference. Result has 81 places, 89 transitions, 1098 flow [2022-12-06 07:44:52,877 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 07:44:52,877 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 52 predicate places. [2022-12-06 07:44:52,877 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:52,877 INFO L89 Accepts]: Start accepts. Operand has 81 places, 89 transitions, 1098 flow [2022-12-06 07:44:52,878 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:52,878 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:52,878 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 89 transitions, 1098 flow [2022-12-06 07:44:52,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 89 transitions, 1098 flow [2022-12-06 07:44:52,912 INFO L130 PetriNetUnfolder]: 149/377 cut-off events. [2022-12-06 07:44:52,912 INFO L131 PetriNetUnfolder]: For 2538/2560 co-relation queries the response was YES. [2022-12-06 07:44:52,913 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 07:44:52,915 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 89 transitions, 1098 flow [2022-12-06 07:44:52,915 INFO L188 LiptonReduction]: Number of co-enabled transitions 522 [2022-12-06 07:44:52,915 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:44:52,916 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-06 07:44:52,916 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 89 transitions, 1098 flow [2022-12-06 07:44:52,916 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 07:44:52,916 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:52,916 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 07:44:52,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-06 07:44:52,917 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 07:44:52,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:52,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1787957051, now seen corresponding path program 1 times [2022-12-06 07:44:52,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:52,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889062414] [2022-12-06 07:44:52,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:52,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:52,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:52,970 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 07:44:52,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:52,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889062414] [2022-12-06 07:44:52,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889062414] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:44:52,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:44:52,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:44:52,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606077871] [2022-12-06 07:44:52,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:44:52,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:44:52,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:52,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:44:52,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:44:52,971 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 07:44:52,972 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 07:44:52,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:52,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 07:44:52,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:53,119 INFO L130 PetriNetUnfolder]: 544/915 cut-off events. [2022-12-06 07:44:53,120 INFO L131 PetriNetUnfolder]: For 8558/8558 co-relation queries the response was YES. [2022-12-06 07:44:53,122 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 07:44:53,124 INFO L137 encePairwiseOnDemand]: 28/34 looper letters, 82 selfloop transitions, 24 changer transitions 2/108 dead transitions. [2022-12-06 07:44:53,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 108 transitions, 1410 flow [2022-12-06 07:44:53,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:44:53,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:44:53,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-12-06 07:44:53,125 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4264705882352941 [2022-12-06 07:44:53,125 INFO L175 Difference]: Start difference. First operand has 81 places, 89 transitions, 1098 flow. Second operand 4 states and 58 transitions. [2022-12-06 07:44:53,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 108 transitions, 1410 flow [2022-12-06 07:44:53,134 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 07:44:53,135 INFO L231 Difference]: Finished difference. Result has 82 places, 85 transitions, 1078 flow [2022-12-06 07:44:53,135 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 07:44:53,136 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 53 predicate places. [2022-12-06 07:44:53,136 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:53,136 INFO L89 Accepts]: Start accepts. Operand has 82 places, 85 transitions, 1078 flow [2022-12-06 07:44:53,137 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:53,137 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:53,137 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 85 transitions, 1078 flow [2022-12-06 07:44:53,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 85 transitions, 1078 flow [2022-12-06 07:44:53,161 INFO L130 PetriNetUnfolder]: 138/341 cut-off events. [2022-12-06 07:44:53,161 INFO L131 PetriNetUnfolder]: For 2530/2552 co-relation queries the response was YES. [2022-12-06 07:44:53,163 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 07:44:53,165 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 85 transitions, 1078 flow [2022-12-06 07:44:53,165 INFO L188 LiptonReduction]: Number of co-enabled transitions 516 [2022-12-06 07:44:53,166 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:44:53,166 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-06 07:44:53,166 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 85 transitions, 1078 flow [2022-12-06 07:44:53,166 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 07:44:53,167 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:53,167 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 07:44:53,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-06 07:44:53,167 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 07:44:53,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:53,167 INFO L85 PathProgramCache]: Analyzing trace with hash -351892918, now seen corresponding path program 1 times [2022-12-06 07:44:53,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:53,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232358147] [2022-12-06 07:44:53,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:53,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:54,797 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 07:44:54,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:54,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232358147] [2022-12-06 07:44:54,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232358147] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:44:54,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:44:54,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 07:44:54,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621582759] [2022-12-06 07:44:54,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:44:54,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:44:54,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:54,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:44:54,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:44:54,798 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 07:44:54,798 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 07:44:54,798 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:54,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 07:44:54,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:55,571 INFO L130 PetriNetUnfolder]: 614/1037 cut-off events. [2022-12-06 07:44:55,571 INFO L131 PetriNetUnfolder]: For 10431/10431 co-relation queries the response was YES. [2022-12-06 07:44:55,574 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 07:44:55,576 INFO L137 encePairwiseOnDemand]: 19/32 looper letters, 89 selfloop transitions, 41 changer transitions 13/143 dead transitions. [2022-12-06 07:44:55,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 143 transitions, 1809 flow [2022-12-06 07:44:55,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:44:55,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:44:55,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-12-06 07:44:55,577 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34375 [2022-12-06 07:44:55,578 INFO L175 Difference]: Start difference. First operand has 80 places, 85 transitions, 1078 flow. Second operand 8 states and 88 transitions. [2022-12-06 07:44:55,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 143 transitions, 1809 flow [2022-12-06 07:44:55,592 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 07:44:55,595 INFO L231 Difference]: Finished difference. Result has 88 places, 95 transitions, 1284 flow [2022-12-06 07:44:55,595 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 07:44:55,595 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 59 predicate places. [2022-12-06 07:44:55,595 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:55,595 INFO L89 Accepts]: Start accepts. Operand has 88 places, 95 transitions, 1284 flow [2022-12-06 07:44:55,596 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:55,596 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:55,596 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 95 transitions, 1284 flow [2022-12-06 07:44:55,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 95 transitions, 1284 flow [2022-12-06 07:44:55,636 INFO L130 PetriNetUnfolder]: 155/391 cut-off events. [2022-12-06 07:44:55,636 INFO L131 PetriNetUnfolder]: For 3502/3575 co-relation queries the response was YES. [2022-12-06 07:44:55,638 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 07:44:55,641 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 95 transitions, 1284 flow [2022-12-06 07:44:55,641 INFO L188 LiptonReduction]: Number of co-enabled transitions 560 [2022-12-06 07:44:55,643 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 07:44:55,769 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:44:55,769 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:44:55,769 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 94 transitions, 1280 flow [2022-12-06 07:44:55,770 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 07:44:55,770 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:55,770 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 07:44:55,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-06 07:44:55,770 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 07:44:55,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:55,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1418069074, now seen corresponding path program 2 times [2022-12-06 07:44:55,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:55,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408219695] [2022-12-06 07:44:55,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:55,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:57,220 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 07:44:57,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:57,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408219695] [2022-12-06 07:44:57,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408219695] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:44:57,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:44:57,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 07:44:57,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010238604] [2022-12-06 07:44:57,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:44:57,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:44:57,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:57,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:44:57,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:44:57,222 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 07:44:57,222 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 07:44:57,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:57,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 07:44:57,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:57,851 INFO L130 PetriNetUnfolder]: 641/1091 cut-off events. [2022-12-06 07:44:57,851 INFO L131 PetriNetUnfolder]: For 12276/12276 co-relation queries the response was YES. [2022-12-06 07:44:57,854 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 07:44:57,858 INFO L137 encePairwiseOnDemand]: 20/33 looper letters, 85 selfloop transitions, 42 changer transitions 15/142 dead transitions. [2022-12-06 07:44:57,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 142 transitions, 1920 flow [2022-12-06 07:44:57,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:44:57,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:44:57,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-12-06 07:44:57,859 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-06 07:44:57,859 INFO L175 Difference]: Start difference. First operand has 86 places, 94 transitions, 1280 flow. Second operand 8 states and 88 transitions. [2022-12-06 07:44:57,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 142 transitions, 1920 flow [2022-12-06 07:44:57,877 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 07:44:57,879 INFO L231 Difference]: Finished difference. Result has 90 places, 95 transitions, 1318 flow [2022-12-06 07:44:57,879 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 07:44:57,879 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 61 predicate places. [2022-12-06 07:44:57,879 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:57,879 INFO L89 Accepts]: Start accepts. Operand has 90 places, 95 transitions, 1318 flow [2022-12-06 07:44:57,880 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:57,880 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:57,881 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 95 transitions, 1318 flow [2022-12-06 07:44:57,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 95 transitions, 1318 flow [2022-12-06 07:44:57,914 INFO L130 PetriNetUnfolder]: 152/391 cut-off events. [2022-12-06 07:44:57,914 INFO L131 PetriNetUnfolder]: For 3810/3873 co-relation queries the response was YES. [2022-12-06 07:44:57,915 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 07:44:57,917 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 95 transitions, 1318 flow [2022-12-06 07:44:57,917 INFO L188 LiptonReduction]: Number of co-enabled transitions 568 [2022-12-06 07:44:57,918 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:44:57,919 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-06 07:44:57,919 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 95 transitions, 1318 flow [2022-12-06 07:44:57,919 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 07:44:57,919 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:57,919 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 07:44:57,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-06 07:44:57,919 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 07:44:57,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:57,920 INFO L85 PathProgramCache]: Analyzing trace with hash 539111118, now seen corresponding path program 1 times [2022-12-06 07:44:57,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:57,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92550049] [2022-12-06 07:44:57,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:57,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:58,855 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 07:44:58,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:58,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92550049] [2022-12-06 07:44:58,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92550049] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:44:58,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075113705] [2022-12-06 07:44:58,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:58,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:44:58,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:44:58,858 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 07:44:58,859 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 07:44:58,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:58,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-06 07:44:59,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:44:59,076 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 07:44:59,100 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 07:44:59,190 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 07:44:59,237 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 07:44:59,481 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 07:44:59,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:45:00,116 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 07:45:00,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075113705] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:45:00,116 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:45:00,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-12-06 07:45:00,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613206254] [2022-12-06 07:45:00,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:45:00,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-06 07:45:00,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:00,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-06 07:45:00,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=568, Unknown=4, NotChecked=0, Total=702 [2022-12-06 07:45:00,118 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 07:45:00,118 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 07:45:00,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:00,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 07:45:00,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:08,535 WARN L233 SmtUtils]: Spent 7.23s on a formula simplification. DAG size of input: 84 DAG size of output: 66 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:45:14,576 INFO L130 PetriNetUnfolder]: 1127/1939 cut-off events. [2022-12-06 07:45:14,576 INFO L131 PetriNetUnfolder]: For 22999/22999 co-relation queries the response was YES. [2022-12-06 07:45:14,581 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 07:45:14,587 INFO L137 encePairwiseOnDemand]: 11/32 looper letters, 224 selfloop transitions, 137 changer transitions 26/387 dead transitions. [2022-12-06 07:45:14,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 387 transitions, 4501 flow [2022-12-06 07:45:14,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-06 07:45:14,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-12-06 07:45:14,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 276 transitions. [2022-12-06 07:45:14,596 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26136363636363635 [2022-12-06 07:45:14,597 INFO L175 Difference]: Start difference. First operand has 88 places, 95 transitions, 1318 flow. Second operand 33 states and 276 transitions. [2022-12-06 07:45:14,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 387 transitions, 4501 flow [2022-12-06 07:45:14,624 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 07:45:14,628 INFO L231 Difference]: Finished difference. Result has 124 places, 203 transitions, 3023 flow [2022-12-06 07:45:14,628 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 07:45:14,628 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 95 predicate places. [2022-12-06 07:45:14,628 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:14,629 INFO L89 Accepts]: Start accepts. Operand has 124 places, 203 transitions, 3023 flow [2022-12-06 07:45:14,629 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:14,630 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:14,630 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 203 transitions, 3023 flow [2022-12-06 07:45:14,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 203 transitions, 3023 flow [2022-12-06 07:45:14,690 INFO L130 PetriNetUnfolder]: 270/745 cut-off events. [2022-12-06 07:45:14,690 INFO L131 PetriNetUnfolder]: For 7879/8017 co-relation queries the response was YES. [2022-12-06 07:45:14,692 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 07:45:14,697 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 203 transitions, 3023 flow [2022-12-06 07:45:14,697 INFO L188 LiptonReduction]: Number of co-enabled transitions 998 [2022-12-06 07:45:14,918 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 07:45:15,171 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 07:45:15,202 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 07:45:15,343 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 07:45:15,628 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 07:45:15,808 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 07:45:15,954 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 07:45:15,955 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1327 [2022-12-06 07:45:15,955 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 197 transitions, 3093 flow [2022-12-06 07:45:15,955 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 07:45:15,955 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:15,956 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 07:45:15,963 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 07:45:16,159 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 07:45:16,160 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 07:45:16,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:16,160 INFO L85 PathProgramCache]: Analyzing trace with hash 278805811, now seen corresponding path program 1 times [2022-12-06 07:45:16,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:16,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400130009] [2022-12-06 07:45:16,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:16,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:17,019 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 07:45:17,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:17,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400130009] [2022-12-06 07:45:17,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400130009] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:45:17,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969590441] [2022-12-06 07:45:17,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:17,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:45:17,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:45:17,021 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 07:45:17,022 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 07:45:17,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:17,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-06 07:45:17,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:45:17,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:45:17,235 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 07:45:17,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:45:17,299 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 07:45:17,505 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:45:17,505 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 07:45:17,650 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 07:45:17,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:45:18,152 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 07:45:18,228 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:45:18,228 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 07:45:18,254 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:45:18,254 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 07:45:18,275 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:45:18,275 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 07:45:19,386 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 07:45:19,387 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 07:45:19,394 INFO L321 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-12-06 07:45:19,394 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 07:45:19,437 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 07:45:19,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969590441] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:45:19,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:45:19,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 20 [2022-12-06 07:45:19,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121442868] [2022-12-06 07:45:19,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:45:19,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 07:45:19,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:19,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 07:45:19,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=352, Unknown=5, NotChecked=38, Total=462 [2022-12-06 07:45:19,439 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 07:45:19,439 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 07:45:19,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:19,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 07:45:19,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:21,202 INFO L130 PetriNetUnfolder]: 1154/1984 cut-off events. [2022-12-06 07:45:21,203 INFO L131 PetriNetUnfolder]: For 29684/29684 co-relation queries the response was YES. [2022-12-06 07:45:21,209 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 07:45:21,217 INFO L137 encePairwiseOnDemand]: 28/42 looper letters, 191 selfloop transitions, 60 changer transitions 13/264 dead transitions. [2022-12-06 07:45:21,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 264 transitions, 4111 flow [2022-12-06 07:45:21,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 07:45:21,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 07:45:21,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 107 transitions. [2022-12-06 07:45:21,219 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23160173160173161 [2022-12-06 07:45:21,219 INFO L175 Difference]: Start difference. First operand has 116 places, 197 transitions, 3093 flow. Second operand 11 states and 107 transitions. [2022-12-06 07:45:21,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 264 transitions, 4111 flow [2022-12-06 07:45:21,294 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 07:45:21,298 INFO L231 Difference]: Finished difference. Result has 123 places, 207 transitions, 2839 flow [2022-12-06 07:45:21,298 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 07:45:21,298 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 94 predicate places. [2022-12-06 07:45:21,298 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:21,299 INFO L89 Accepts]: Start accepts. Operand has 123 places, 207 transitions, 2839 flow [2022-12-06 07:45:21,299 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:21,300 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:21,300 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 207 transitions, 2839 flow [2022-12-06 07:45:21,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 207 transitions, 2839 flow [2022-12-06 07:45:21,362 INFO L130 PetriNetUnfolder]: 277/767 cut-off events. [2022-12-06 07:45:21,363 INFO L131 PetriNetUnfolder]: For 7706/7816 co-relation queries the response was YES. [2022-12-06 07:45:21,365 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 07:45:21,370 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 207 transitions, 2839 flow [2022-12-06 07:45:21,370 INFO L188 LiptonReduction]: Number of co-enabled transitions 1012 [2022-12-06 07:45:23,483 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 07:45:23,863 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 07:45:23,864 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2566 [2022-12-06 07:45:23,864 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 205 transitions, 2874 flow [2022-12-06 07:45:23,864 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 07:45:23,864 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:23,864 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:23,869 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 07:45:24,067 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 07:45:24,068 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 07:45:24,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:24,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1287188282, now seen corresponding path program 1 times [2022-12-06 07:45:24,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:24,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017438646] [2022-12-06 07:45:24,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:24,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:24,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:25,853 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 07:45:25,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:25,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017438646] [2022-12-06 07:45:25,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017438646] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:25,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:25,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:45:25,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899411793] [2022-12-06 07:45:25,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:25,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:45:25,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:25,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:45:25,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:45:25,854 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 07:45:25,854 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 07:45:25,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:25,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 07:45:25,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:26,490 INFO L130 PetriNetUnfolder]: 1169/2016 cut-off events. [2022-12-06 07:45:26,491 INFO L131 PetriNetUnfolder]: For 27131/27131 co-relation queries the response was YES. [2022-12-06 07:45:26,496 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 07:45:26,503 INFO L137 encePairwiseOnDemand]: 28/46 looper letters, 175 selfloop transitions, 70 changer transitions 15/260 dead transitions. [2022-12-06 07:45:26,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 260 transitions, 3863 flow [2022-12-06 07:45:26,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:45:26,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:45:26,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2022-12-06 07:45:26,504 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2826086956521739 [2022-12-06 07:45:26,505 INFO L175 Difference]: Start difference. First operand has 120 places, 205 transitions, 2874 flow. Second operand 7 states and 91 transitions. [2022-12-06 07:45:26,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 260 transitions, 3863 flow [2022-12-06 07:45:26,547 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 07:45:26,550 INFO L231 Difference]: Finished difference. Result has 125 places, 207 transitions, 2964 flow [2022-12-06 07:45:26,550 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 07:45:26,551 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 96 predicate places. [2022-12-06 07:45:26,551 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:26,551 INFO L89 Accepts]: Start accepts. Operand has 125 places, 207 transitions, 2964 flow [2022-12-06 07:45:26,552 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:26,552 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:26,552 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 207 transitions, 2964 flow [2022-12-06 07:45:26,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 207 transitions, 2964 flow [2022-12-06 07:45:26,625 INFO L130 PetriNetUnfolder]: 280/781 cut-off events. [2022-12-06 07:45:26,625 INFO L131 PetriNetUnfolder]: For 8130/8254 co-relation queries the response was YES. [2022-12-06 07:45:26,627 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 07:45:26,631 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 207 transitions, 2964 flow [2022-12-06 07:45:26,631 INFO L188 LiptonReduction]: Number of co-enabled transitions 1004 [2022-12-06 07:45:26,632 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:45:26,633 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:45:26,633 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 207 transitions, 2964 flow [2022-12-06 07:45:26,633 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 07:45:26,633 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:26,633 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:26,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-06 07:45:26,633 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 07:45:26,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:26,634 INFO L85 PathProgramCache]: Analyzing trace with hash 2126455981, now seen corresponding path program 1 times [2022-12-06 07:45:26,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:26,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057539418] [2022-12-06 07:45:26,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:26,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:27,650 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 07:45:27,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:27,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057539418] [2022-12-06 07:45:27,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057539418] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:27,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:27,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:45:27,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491272878] [2022-12-06 07:45:27,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:27,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:45:27,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:27,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:45:27,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:45:27,651 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 07:45:27,652 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 07:45:27,652 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:27,652 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 07:45:27,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:28,169 INFO L130 PetriNetUnfolder]: 1159/1985 cut-off events. [2022-12-06 07:45:28,169 INFO L131 PetriNetUnfolder]: For 27018/27018 co-relation queries the response was YES. [2022-12-06 07:45:28,177 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 07:45:28,185 INFO L137 encePairwiseOnDemand]: 34/44 looper letters, 179 selfloop transitions, 44 changer transitions 14/237 dead transitions. [2022-12-06 07:45:28,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 237 transitions, 3590 flow [2022-12-06 07:45:28,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:45:28,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:45:28,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-12-06 07:45:28,186 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29545454545454547 [2022-12-06 07:45:28,186 INFO L175 Difference]: Start difference. First operand has 122 places, 207 transitions, 2964 flow. Second operand 6 states and 78 transitions. [2022-12-06 07:45:28,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 237 transitions, 3590 flow [2022-12-06 07:45:28,224 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 07:45:28,229 INFO L231 Difference]: Finished difference. Result has 125 places, 206 transitions, 2990 flow [2022-12-06 07:45:28,229 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 07:45:28,230 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 96 predicate places. [2022-12-06 07:45:28,230 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:28,230 INFO L89 Accepts]: Start accepts. Operand has 125 places, 206 transitions, 2990 flow [2022-12-06 07:45:28,231 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:28,231 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:28,231 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 206 transitions, 2990 flow [2022-12-06 07:45:28,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 206 transitions, 2990 flow [2022-12-06 07:45:28,290 INFO L130 PetriNetUnfolder]: 280/771 cut-off events. [2022-12-06 07:45:28,291 INFO L131 PetriNetUnfolder]: For 8959/9082 co-relation queries the response was YES. [2022-12-06 07:45:28,293 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 07:45:28,297 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 206 transitions, 2990 flow [2022-12-06 07:45:28,297 INFO L188 LiptonReduction]: Number of co-enabled transitions 1004 [2022-12-06 07:45:28,298 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:45:28,299 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 69 [2022-12-06 07:45:28,299 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 206 transitions, 2990 flow [2022-12-06 07:45:28,299 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 07:45:28,299 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:28,299 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 07:45:28,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-06 07:45:28,299 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 07:45:28,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:28,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1850105592, now seen corresponding path program 1 times [2022-12-06 07:45:28,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:28,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921158124] [2022-12-06 07:45:28,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:28,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:28,866 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 07:45:28,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:28,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921158124] [2022-12-06 07:45:28,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921158124] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:28,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:28,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:45:28,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124179563] [2022-12-06 07:45:28,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:28,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:45:28,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:28,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:45:28,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:45:28,868 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 07:45:28,868 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 07:45:28,868 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:28,868 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 07:45:28,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:29,629 INFO L130 PetriNetUnfolder]: 1203/2140 cut-off events. [2022-12-06 07:45:29,630 INFO L131 PetriNetUnfolder]: For 28472/28472 co-relation queries the response was YES. [2022-12-06 07:45:29,636 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 07:45:29,641 INFO L137 encePairwiseOnDemand]: 29/43 looper letters, 221 selfloop transitions, 40 changer transitions 14/275 dead transitions. [2022-12-06 07:45:29,642 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 275 transitions, 4011 flow [2022-12-06 07:45:29,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:45:29,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:45:29,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2022-12-06 07:45:29,643 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3168604651162791 [2022-12-06 07:45:29,643 INFO L175 Difference]: Start difference. First operand has 122 places, 206 transitions, 2990 flow. Second operand 8 states and 109 transitions. [2022-12-06 07:45:29,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 275 transitions, 4011 flow [2022-12-06 07:45:29,677 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 07:45:29,681 INFO L231 Difference]: Finished difference. Result has 128 places, 214 transitions, 3157 flow [2022-12-06 07:45:29,681 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 07:45:29,681 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 99 predicate places. [2022-12-06 07:45:29,681 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:29,681 INFO L89 Accepts]: Start accepts. Operand has 128 places, 214 transitions, 3157 flow [2022-12-06 07:45:29,682 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:29,683 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:29,683 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 214 transitions, 3157 flow [2022-12-06 07:45:29,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 214 transitions, 3157 flow [2022-12-06 07:45:29,745 INFO L130 PetriNetUnfolder]: 276/832 cut-off events. [2022-12-06 07:45:29,745 INFO L131 PetriNetUnfolder]: For 9073/9196 co-relation queries the response was YES. [2022-12-06 07:45:29,748 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 07:45:29,752 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 214 transitions, 3157 flow [2022-12-06 07:45:29,752 INFO L188 LiptonReduction]: Number of co-enabled transitions 1064 [2022-12-06 07:45:29,753 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:45:29,753 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 72 [2022-12-06 07:45:29,753 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 214 transitions, 3157 flow [2022-12-06 07:45:29,753 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 07:45:29,753 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:29,753 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 07:45:29,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-06 07:45:29,754 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 07:45:29,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:29,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1595528476, now seen corresponding path program 1 times [2022-12-06 07:45:29,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:29,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269941670] [2022-12-06 07:45:29,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:29,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:29,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:30,903 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 07:45:30,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:30,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269941670] [2022-12-06 07:45:30,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269941670] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:30,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:30,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:45:30,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578811091] [2022-12-06 07:45:30,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:30,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:45:30,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:30,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:45:30,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:45:30,904 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 07:45:30,905 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 07:45:30,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:30,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 07:45:30,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:31,921 INFO L130 PetriNetUnfolder]: 1211/2153 cut-off events. [2022-12-06 07:45:31,921 INFO L131 PetriNetUnfolder]: For 29962/29962 co-relation queries the response was YES. [2022-12-06 07:45:31,927 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 07:45:31,933 INFO L137 encePairwiseOnDemand]: 23/42 looper letters, 182 selfloop transitions, 80 changer transitions 14/276 dead transitions. [2022-12-06 07:45:31,933 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 276 transitions, 4179 flow [2022-12-06 07:45:31,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:45:31,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:45:31,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2022-12-06 07:45:31,934 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26455026455026454 [2022-12-06 07:45:31,934 INFO L175 Difference]: Start difference. First operand has 126 places, 214 transitions, 3157 flow. Second operand 9 states and 100 transitions. [2022-12-06 07:45:31,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 276 transitions, 4179 flow [2022-12-06 07:45:31,978 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 07:45:31,982 INFO L231 Difference]: Finished difference. Result has 135 places, 215 transitions, 3314 flow [2022-12-06 07:45:31,982 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 07:45:31,983 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 106 predicate places. [2022-12-06 07:45:31,983 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:31,983 INFO L89 Accepts]: Start accepts. Operand has 135 places, 215 transitions, 3314 flow [2022-12-06 07:45:31,984 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:31,986 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:31,986 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 215 transitions, 3314 flow [2022-12-06 07:45:31,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 215 transitions, 3314 flow [2022-12-06 07:45:32,055 INFO L130 PetriNetUnfolder]: 273/832 cut-off events. [2022-12-06 07:45:32,055 INFO L131 PetriNetUnfolder]: For 9752/9852 co-relation queries the response was YES. [2022-12-06 07:45:32,059 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 07:45:32,065 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 215 transitions, 3314 flow [2022-12-06 07:45:32,065 INFO L188 LiptonReduction]: Number of co-enabled transitions 1072 [2022-12-06 07:45:32,069 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 07:45:32,159 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:45:32,159 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:45:32,159 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 214 transitions, 3308 flow [2022-12-06 07:45:32,160 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 07:45:32,160 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:32,160 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 07:45:32,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-06 07:45:32,160 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 07:45:32,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:32,160 INFO L85 PathProgramCache]: Analyzing trace with hash 66329345, now seen corresponding path program 1 times [2022-12-06 07:45:32,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:32,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619727793] [2022-12-06 07:45:32,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:32,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:32,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:32,213 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 07:45:32,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:32,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619727793] [2022-12-06 07:45:32,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619727793] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:32,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:32,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:45:32,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745095183] [2022-12-06 07:45:32,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:32,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:45:32,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:32,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:45:32,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:45:32,215 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 07:45:32,215 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 07:45:32,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:32,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 07:45:32,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:32,669 INFO L130 PetriNetUnfolder]: 1254/2310 cut-off events. [2022-12-06 07:45:32,669 INFO L131 PetriNetUnfolder]: For 33159/33159 co-relation queries the response was YES. [2022-12-06 07:45:32,676 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 07:45:32,684 INFO L137 encePairwiseOnDemand]: 26/42 looper letters, 204 selfloop transitions, 61 changer transitions 2/267 dead transitions. [2022-12-06 07:45:32,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 267 transitions, 4382 flow [2022-12-06 07:45:32,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:45:32,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:45:32,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-12-06 07:45:32,685 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39880952380952384 [2022-12-06 07:45:32,685 INFO L175 Difference]: Start difference. First operand has 132 places, 214 transitions, 3308 flow. Second operand 4 states and 67 transitions. [2022-12-06 07:45:32,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 267 transitions, 4382 flow [2022-12-06 07:45:32,731 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 07:45:32,734 INFO L231 Difference]: Finished difference. Result has 129 places, 216 transitions, 3388 flow [2022-12-06 07:45:32,734 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 07:45:32,735 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 100 predicate places. [2022-12-06 07:45:32,735 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:32,735 INFO L89 Accepts]: Start accepts. Operand has 129 places, 216 transitions, 3388 flow [2022-12-06 07:45:32,736 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:32,736 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:32,736 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 216 transitions, 3388 flow [2022-12-06 07:45:32,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 216 transitions, 3388 flow [2022-12-06 07:45:32,809 INFO L130 PetriNetUnfolder]: 273/899 cut-off events. [2022-12-06 07:45:32,809 INFO L131 PetriNetUnfolder]: For 10631/10752 co-relation queries the response was YES. [2022-12-06 07:45:32,812 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 07:45:32,816 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 216 transitions, 3388 flow [2022-12-06 07:45:32,816 INFO L188 LiptonReduction]: Number of co-enabled transitions 1066 [2022-12-06 07:45:32,817 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:45:32,817 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:45:32,817 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 216 transitions, 3388 flow [2022-12-06 07:45:32,818 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 07:45:32,818 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:32,818 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 07:45:32,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-06 07:45:32,818 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 07:45:32,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:32,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1498197417, now seen corresponding path program 1 times [2022-12-06 07:45:32,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:32,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065730893] [2022-12-06 07:45:32,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:32,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:33,678 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 07:45:33,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:33,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065730893] [2022-12-06 07:45:33,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065730893] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:45:33,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598577351] [2022-12-06 07:45:33,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:33,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:45:33,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:45:33,680 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 07:45:33,687 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 07:45:33,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:33,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-06 07:45:33,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:45:33,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:45:33,878 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 07:45:34,029 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 07:45:34,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:45:34,285 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-06 07:45:34,285 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 07:45:34,300 INFO L321 Elim1Store]: treesize reduction 23, result has 14.8 percent of original size [2022-12-06 07:45:34,301 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 07:45:34,373 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 07:45:34,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598577351] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:45:34,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:45:34,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-12-06 07:45:34,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919659793] [2022-12-06 07:45:34,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:45:34,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 07:45:34,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:34,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 07:45:34,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2022-12-06 07:45:34,375 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 07:45:34,375 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 07:45:34,375 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:34,375 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 07:45:34,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:37,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 07:45:38,228 INFO L130 PetriNetUnfolder]: 1677/3071 cut-off events. [2022-12-06 07:45:38,229 INFO L131 PetriNetUnfolder]: For 42713/42713 co-relation queries the response was YES. [2022-12-06 07:45:38,237 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 07:45:38,245 INFO L137 encePairwiseOnDemand]: 12/37 looper letters, 229 selfloop transitions, 179 changer transitions 16/424 dead transitions. [2022-12-06 07:45:38,245 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 424 transitions, 6102 flow [2022-12-06 07:45:38,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 07:45:38,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 07:45:38,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 192 transitions. [2022-12-06 07:45:38,247 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2594594594594595 [2022-12-06 07:45:38,247 INFO L175 Difference]: Start difference. First operand has 128 places, 216 transitions, 3388 flow. Second operand 20 states and 192 transitions. [2022-12-06 07:45:38,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 424 transitions, 6102 flow [2022-12-06 07:45:38,301 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 07:45:38,306 INFO L231 Difference]: Finished difference. Result has 156 places, 268 transitions, 4572 flow [2022-12-06 07:45:38,306 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 07:45:38,306 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 127 predicate places. [2022-12-06 07:45:38,306 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:38,307 INFO L89 Accepts]: Start accepts. Operand has 156 places, 268 transitions, 4572 flow [2022-12-06 07:45:38,308 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:38,308 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:38,308 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 268 transitions, 4572 flow [2022-12-06 07:45:38,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 268 transitions, 4572 flow [2022-12-06 07:45:38,410 INFO L130 PetriNetUnfolder]: 336/1150 cut-off events. [2022-12-06 07:45:38,410 INFO L131 PetriNetUnfolder]: For 15539/15664 co-relation queries the response was YES. [2022-12-06 07:45:38,414 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 07:45:38,420 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 268 transitions, 4572 flow [2022-12-06 07:45:38,420 INFO L188 LiptonReduction]: Number of co-enabled transitions 1360 [2022-12-06 07:45:38,422 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 07:45:38,730 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 07:45:38,865 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:45:38,866 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 560 [2022-12-06 07:45:38,866 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 267 transitions, 4618 flow [2022-12-06 07:45:38,866 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 07:45:38,866 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:38,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 07:45:38,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 07:45:39,072 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 07:45:39,073 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 07:45:39,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:39,073 INFO L85 PathProgramCache]: Analyzing trace with hash 2067507264, now seen corresponding path program 1 times [2022-12-06 07:45:39,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:39,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773500358] [2022-12-06 07:45:39,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:39,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:39,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:40,155 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 07:45:40,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:40,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773500358] [2022-12-06 07:45:40,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773500358] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:45:40,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784366477] [2022-12-06 07:45:40,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:40,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:45:40,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:45:40,157 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 07:45:40,159 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 07:45:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:40,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-06 07:45:40,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:45:40,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:45:40,462 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 07:45:40,525 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 07:45:40,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:45:40,790 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-06 07:45:40,791 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 07:45:40,795 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:45:40,795 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 07:45:40,900 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 07:45:40,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784366477] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:45:40,900 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:45:40,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-12-06 07:45:40,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464644373] [2022-12-06 07:45:40,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:45:40,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 07:45:40,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:40,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 07:45:40,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2022-12-06 07:45:40,902 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 07:45:40,902 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 07:45:40,902 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:40,902 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 07:45:40,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:43,511 INFO L130 PetriNetUnfolder]: 1715/3149 cut-off events. [2022-12-06 07:45:43,511 INFO L131 PetriNetUnfolder]: For 55292/55292 co-relation queries the response was YES. [2022-12-06 07:45:43,523 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 07:45:43,534 INFO L137 encePairwiseOnDemand]: 14/41 looper letters, 267 selfloop transitions, 150 changer transitions 14/431 dead transitions. [2022-12-06 07:45:43,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 431 transitions, 6944 flow [2022-12-06 07:45:43,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 07:45:43,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 07:45:43,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 180 transitions. [2022-12-06 07:45:43,536 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23106546854942234 [2022-12-06 07:45:43,536 INFO L175 Difference]: Start difference. First operand has 154 places, 267 transitions, 4618 flow. Second operand 19 states and 180 transitions. [2022-12-06 07:45:43,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 431 transitions, 6944 flow [2022-12-06 07:45:43,663 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 07:45:43,668 INFO L231 Difference]: Finished difference. Result has 169 places, 275 transitions, 4746 flow [2022-12-06 07:45:43,669 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 07:45:43,669 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 140 predicate places. [2022-12-06 07:45:43,669 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:43,669 INFO L89 Accepts]: Start accepts. Operand has 169 places, 275 transitions, 4746 flow [2022-12-06 07:45:43,671 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:43,671 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:43,671 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 275 transitions, 4746 flow [2022-12-06 07:45:43,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 275 transitions, 4746 flow [2022-12-06 07:45:43,800 INFO L130 PetriNetUnfolder]: 347/1217 cut-off events. [2022-12-06 07:45:43,800 INFO L131 PetriNetUnfolder]: For 15611/15775 co-relation queries the response was YES. [2022-12-06 07:45:43,804 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 07:45:43,813 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 167 places, 275 transitions, 4746 flow [2022-12-06 07:45:43,813 INFO L188 LiptonReduction]: Number of co-enabled transitions 1410 [2022-12-06 07:45:43,904 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 07:45:43,966 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:45:43,967 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 298 [2022-12-06 07:45:43,967 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 274 transitions, 4746 flow [2022-12-06 07:45:43,967 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 07:45:43,967 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:43,968 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 07:45:43,973 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 07:45:44,173 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 07:45:44,173 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 07:45:44,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:44,173 INFO L85 PathProgramCache]: Analyzing trace with hash -4401964, now seen corresponding path program 1 times [2022-12-06 07:45:44,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:44,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365348014] [2022-12-06 07:45:44,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:44,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:44,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:47,050 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 07:45:47,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:47,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365348014] [2022-12-06 07:45:47,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365348014] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:47,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:47,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 07:45:47,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153221716] [2022-12-06 07:45:47,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:47,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:45:47,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:47,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:45:47,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:45:47,052 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 07:45:47,052 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 07:45:47,052 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:47,052 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 07:45:47,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:48,232 INFO L130 PetriNetUnfolder]: 1749/3191 cut-off events. [2022-12-06 07:45:48,232 INFO L131 PetriNetUnfolder]: For 55239/55239 co-relation queries the response was YES. [2022-12-06 07:45:48,241 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 07:45:48,249 INFO L137 encePairwiseOnDemand]: 26/42 looper letters, 254 selfloop transitions, 68 changer transitions 13/335 dead transitions. [2022-12-06 07:45:48,249 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 335 transitions, 6005 flow [2022-12-06 07:45:48,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:45:48,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:45:48,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2022-12-06 07:45:48,251 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28273809523809523 [2022-12-06 07:45:48,251 INFO L175 Difference]: Start difference. First operand has 165 places, 274 transitions, 4746 flow. Second operand 8 states and 95 transitions. [2022-12-06 07:45:48,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 335 transitions, 6005 flow [2022-12-06 07:45:48,353 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 07:45:48,358 INFO L231 Difference]: Finished difference. Result has 166 places, 292 transitions, 5072 flow [2022-12-06 07:45:48,358 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 07:45:48,358 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 137 predicate places. [2022-12-06 07:45:48,358 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:48,358 INFO L89 Accepts]: Start accepts. Operand has 166 places, 292 transitions, 5072 flow [2022-12-06 07:45:48,360 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:48,360 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:48,360 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 292 transitions, 5072 flow [2022-12-06 07:45:48,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 292 transitions, 5072 flow [2022-12-06 07:45:48,476 INFO L130 PetriNetUnfolder]: 363/1267 cut-off events. [2022-12-06 07:45:48,477 INFO L131 PetriNetUnfolder]: For 16144/16201 co-relation queries the response was YES. [2022-12-06 07:45:48,482 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 07:45:48,489 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 165 places, 292 transitions, 5072 flow [2022-12-06 07:45:48,489 INFO L188 LiptonReduction]: Number of co-enabled transitions 1478 [2022-12-06 07:45:48,648 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 07:45:48,766 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 07:45:48,798 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 07:45:48,933 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:45:48,934 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 576 [2022-12-06 07:45:48,934 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 291 transitions, 5108 flow [2022-12-06 07:45:48,934 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 07:45:48,934 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:48,934 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 07:45:48,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-06 07:45:48,935 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 07:45:48,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:48,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1282979069, now seen corresponding path program 1 times [2022-12-06 07:45:48,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:48,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059915336] [2022-12-06 07:45:48,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:48,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:48,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:49,005 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 07:45:49,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:49,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059915336] [2022-12-06 07:45:49,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059915336] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:49,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:49,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:45:49,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024963006] [2022-12-06 07:45:49,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:49,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:45:49,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:49,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:45:49,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:45:49,007 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 07:45:49,007 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 07:45:49,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:49,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 07:45:49,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:49,605 INFO L130 PetriNetUnfolder]: 1744/3204 cut-off events. [2022-12-06 07:45:49,606 INFO L131 PetriNetUnfolder]: For 57659/57659 co-relation queries the response was YES. [2022-12-06 07:45:49,619 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 07:45:49,631 INFO L137 encePairwiseOnDemand]: 27/47 looper letters, 271 selfloop transitions, 80 changer transitions 10/361 dead transitions. [2022-12-06 07:45:49,631 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 361 transitions, 6455 flow [2022-12-06 07:45:49,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:45:49,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:45:49,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2022-12-06 07:45:49,632 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31560283687943264 [2022-12-06 07:45:49,632 INFO L175 Difference]: Start difference. First operand has 164 places, 291 transitions, 5108 flow. Second operand 6 states and 89 transitions. [2022-12-06 07:45:49,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 361 transitions, 6455 flow [2022-12-06 07:45:49,759 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 07:45:49,764 INFO L231 Difference]: Finished difference. Result has 168 places, 282 transitions, 4994 flow [2022-12-06 07:45:49,764 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 07:45:49,764 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 139 predicate places. [2022-12-06 07:45:49,764 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:49,764 INFO L89 Accepts]: Start accepts. Operand has 168 places, 282 transitions, 4994 flow [2022-12-06 07:45:49,765 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:49,765 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:49,766 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 282 transitions, 4994 flow [2022-12-06 07:45:49,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 282 transitions, 4994 flow [2022-12-06 07:45:49,894 INFO L130 PetriNetUnfolder]: 353/1245 cut-off events. [2022-12-06 07:45:49,894 INFO L131 PetriNetUnfolder]: For 17257/17324 co-relation queries the response was YES. [2022-12-06 07:45:49,899 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 07:45:49,907 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 165 places, 282 transitions, 4994 flow [2022-12-06 07:45:49,908 INFO L188 LiptonReduction]: Number of co-enabled transitions 1428 [2022-12-06 07:45:49,937 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:45:49,938 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:45:49,938 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 281 transitions, 4978 flow [2022-12-06 07:45:49,938 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 07:45:49,938 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:49,938 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:49,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-06 07:45:49,938 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 07:45:49,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:49,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1598092600, now seen corresponding path program 1 times [2022-12-06 07:45:49,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:49,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334388057] [2022-12-06 07:45:49,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:49,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:49,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:52,389 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 07:45:52,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:52,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334388057] [2022-12-06 07:45:52,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334388057] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:52,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:52,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:45:52,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103016689] [2022-12-06 07:45:52,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:52,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:45:52,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:52,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:45:52,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:45:52,391 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 07:45:52,391 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 07:45:52,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:52,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 07:45:52,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:53,427 INFO L130 PetriNetUnfolder]: 1733/3192 cut-off events. [2022-12-06 07:45:53,427 INFO L131 PetriNetUnfolder]: For 58127/58127 co-relation queries the response was YES. [2022-12-06 07:45:53,440 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 07:45:53,451 INFO L137 encePairwiseOnDemand]: 26/44 looper letters, 245 selfloop transitions, 64 changer transitions 16/325 dead transitions. [2022-12-06 07:45:53,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 325 transitions, 5997 flow [2022-12-06 07:45:53,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:45:53,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:45:53,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 88 transitions. [2022-12-06 07:45:53,452 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2857142857142857 [2022-12-06 07:45:53,453 INFO L175 Difference]: Start difference. First operand has 164 places, 281 transitions, 4978 flow. Second operand 7 states and 88 transitions. [2022-12-06 07:45:53,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 325 transitions, 5997 flow [2022-12-06 07:45:53,573 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 07:45:53,578 INFO L231 Difference]: Finished difference. Result has 168 places, 282 transitions, 5063 flow [2022-12-06 07:45:53,578 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 07:45:53,578 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 139 predicate places. [2022-12-06 07:45:53,579 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:53,579 INFO L89 Accepts]: Start accepts. Operand has 168 places, 282 transitions, 5063 flow [2022-12-06 07:45:53,580 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:53,580 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:53,580 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 282 transitions, 5063 flow [2022-12-06 07:45:53,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 282 transitions, 5063 flow [2022-12-06 07:45:53,718 INFO L130 PetriNetUnfolder]: 352/1262 cut-off events. [2022-12-06 07:45:53,718 INFO L131 PetriNetUnfolder]: For 18261/18328 co-relation queries the response was YES. [2022-12-06 07:45:53,723 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 07:45:53,733 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 166 places, 282 transitions, 5063 flow [2022-12-06 07:45:53,733 INFO L188 LiptonReduction]: Number of co-enabled transitions 1430 [2022-12-06 07:45:53,734 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:45:53,735 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 156 [2022-12-06 07:45:53,735 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 282 transitions, 5063 flow [2022-12-06 07:45:53,735 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 07:45:53,735 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:53,735 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 07:45:53,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-06 07:45:53,735 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 07:45:53,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:53,736 INFO L85 PathProgramCache]: Analyzing trace with hash -925610045, now seen corresponding path program 1 times [2022-12-06 07:45:53,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:53,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313109633] [2022-12-06 07:45:53,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:53,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:55,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 07:45:55,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:55,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313109633] [2022-12-06 07:45:55,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313109633] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:55,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:55,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:45:55,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734195182] [2022-12-06 07:45:55,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:55,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:45:55,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:55,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:45:55,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:45:55,247 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 07:45:55,247 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 07:45:55,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:55,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 07:45:55,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:56,138 INFO L130 PetriNetUnfolder]: 1717/3162 cut-off events. [2022-12-06 07:45:56,138 INFO L131 PetriNetUnfolder]: For 59029/59029 co-relation queries the response was YES. [2022-12-06 07:45:56,149 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 07:45:56,158 INFO L137 encePairwiseOnDemand]: 26/43 looper letters, 243 selfloop transitions, 63 changer transitions 15/321 dead transitions. [2022-12-06 07:45:56,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 321 transitions, 5998 flow [2022-12-06 07:45:56,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:45:56,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:45:56,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2022-12-06 07:45:56,159 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27906976744186046 [2022-12-06 07:45:56,159 INFO L175 Difference]: Start difference. First operand has 166 places, 282 transitions, 5063 flow. Second operand 7 states and 84 transitions. [2022-12-06 07:45:56,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 321 transitions, 5998 flow [2022-12-06 07:45:56,269 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 07:45:56,274 INFO L231 Difference]: Finished difference. Result has 168 places, 283 transitions, 5057 flow [2022-12-06 07:45:56,274 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 07:45:56,275 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 139 predicate places. [2022-12-06 07:45:56,275 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:56,275 INFO L89 Accepts]: Start accepts. Operand has 168 places, 283 transitions, 5057 flow [2022-12-06 07:45:56,276 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:56,276 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:56,276 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 283 transitions, 5057 flow [2022-12-06 07:45:56,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 283 transitions, 5057 flow [2022-12-06 07:45:56,387 INFO L130 PetriNetUnfolder]: 351/1261 cut-off events. [2022-12-06 07:45:56,387 INFO L131 PetriNetUnfolder]: For 17917/17975 co-relation queries the response was YES. [2022-12-06 07:45:56,391 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 07:45:56,398 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 167 places, 283 transitions, 5057 flow [2022-12-06 07:45:56,399 INFO L188 LiptonReduction]: Number of co-enabled transitions 1430 [2022-12-06 07:45:56,400 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 07:45:56,539 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 07:45:56,655 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 07:45:56,993 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 07:45:57,107 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 07:45:57,235 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:45:57,236 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 961 [2022-12-06 07:45:57,236 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 280 transitions, 5069 flow [2022-12-06 07:45:57,236 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 07:45:57,237 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:57,237 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:57,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-06 07:45:57,237 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 07:45:57,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:57,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1279041597, now seen corresponding path program 1 times [2022-12-06 07:45:57,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:57,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424789856] [2022-12-06 07:45:57,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:57,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:57,883 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 07:45:57,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:57,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424789856] [2022-12-06 07:45:57,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424789856] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:45:57,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:45:57,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:45:57,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070841983] [2022-12-06 07:45:57,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:45:57,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:45:57,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:57,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:45:57,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:45:57,884 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 07:45:57,884 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 07:45:57,885 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:57,885 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 07:45:57,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:58,516 INFO L130 PetriNetUnfolder]: 1703/3130 cut-off events. [2022-12-06 07:45:58,516 INFO L131 PetriNetUnfolder]: For 58011/58011 co-relation queries the response was YES. [2022-12-06 07:45:58,528 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 07:45:58,538 INFO L137 encePairwiseOnDemand]: 27/45 looper letters, 241 selfloop transitions, 61 changer transitions 14/316 dead transitions. [2022-12-06 07:45:58,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 316 transitions, 5985 flow [2022-12-06 07:45:58,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:45:58,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:45:58,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2022-12-06 07:45:58,539 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-06 07:45:58,539 INFO L175 Difference]: Start difference. First operand has 164 places, 280 transitions, 5069 flow. Second operand 6 states and 81 transitions. [2022-12-06 07:45:58,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 316 transitions, 5985 flow [2022-12-06 07:45:58,650 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 07:45:58,655 INFO L231 Difference]: Finished difference. Result has 166 places, 279 transitions, 5015 flow [2022-12-06 07:45:58,655 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 07:45:58,656 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 137 predicate places. [2022-12-06 07:45:58,656 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:58,656 INFO L89 Accepts]: Start accepts. Operand has 166 places, 279 transitions, 5015 flow [2022-12-06 07:45:58,657 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:58,657 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:58,657 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 279 transitions, 5015 flow [2022-12-06 07:45:58,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 279 transitions, 5015 flow [2022-12-06 07:45:58,772 INFO L130 PetriNetUnfolder]: 353/1240 cut-off events. [2022-12-06 07:45:58,772 INFO L131 PetriNetUnfolder]: For 18087/18158 co-relation queries the response was YES. [2022-12-06 07:45:58,777 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 07:45:58,807 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 164 places, 279 transitions, 5015 flow [2022-12-06 07:45:58,808 INFO L188 LiptonReduction]: Number of co-enabled transitions 1414 [2022-12-06 07:45:58,809 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:45:58,809 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 153 [2022-12-06 07:45:58,810 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 279 transitions, 5015 flow [2022-12-06 07:45:58,810 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 07:45:58,810 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:58,810 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:58,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-06 07:45:58,810 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 07:45:58,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:58,810 INFO L85 PathProgramCache]: Analyzing trace with hash -39158078, now seen corresponding path program 1 times [2022-12-06 07:45:58,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:58,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059267238] [2022-12-06 07:45:58,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:58,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:58,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:00,344 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 07:46:00,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:46:00,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059267238] [2022-12-06 07:46:00,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059267238] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:46:00,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:46:00,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:46:00,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405087984] [2022-12-06 07:46:00,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:46:00,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:46:00,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:46:00,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:46:00,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:46:00,345 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 07:46:00,345 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 07:46:00,345 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:46:00,345 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 07:46:00,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:46:01,398 INFO L130 PetriNetUnfolder]: 1718/3141 cut-off events. [2022-12-06 07:46:01,398 INFO L131 PetriNetUnfolder]: For 58680/58680 co-relation queries the response was YES. [2022-12-06 07:46:01,408 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 07:46:01,417 INFO L137 encePairwiseOnDemand]: 29/44 looper letters, 289 selfloop transitions, 23 changer transitions 15/327 dead transitions. [2022-12-06 07:46:01,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 327 transitions, 6075 flow [2022-12-06 07:46:01,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:46:01,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:46:01,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2022-12-06 07:46:01,418 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29545454545454547 [2022-12-06 07:46:01,418 INFO L175 Difference]: Start difference. First operand has 164 places, 279 transitions, 5015 flow. Second operand 7 states and 91 transitions. [2022-12-06 07:46:01,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 327 transitions, 6075 flow [2022-12-06 07:46:01,521 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 07:46:01,526 INFO L231 Difference]: Finished difference. Result has 168 places, 281 transitions, 4985 flow [2022-12-06 07:46:01,526 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 07:46:01,526 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 139 predicate places. [2022-12-06 07:46:01,526 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:46:01,526 INFO L89 Accepts]: Start accepts. Operand has 168 places, 281 transitions, 4985 flow [2022-12-06 07:46:01,527 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:46:01,527 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:46:01,528 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 281 transitions, 4985 flow [2022-12-06 07:46:01,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 281 transitions, 4985 flow [2022-12-06 07:46:01,642 INFO L130 PetriNetUnfolder]: 354/1239 cut-off events. [2022-12-06 07:46:01,643 INFO L131 PetriNetUnfolder]: For 16724/16784 co-relation queries the response was YES. [2022-12-06 07:46:01,648 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 07:46:01,654 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 165 places, 281 transitions, 4985 flow [2022-12-06 07:46:01,654 INFO L188 LiptonReduction]: Number of co-enabled transitions 1428 [2022-12-06 07:46:01,659 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 07:46:01,832 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:46:01,833 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 307 [2022-12-06 07:46:01,834 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 280 transitions, 4977 flow [2022-12-06 07:46:01,834 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 07:46:01,834 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:46:01,834 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 07:46:01,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-06 07:46:01,834 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 07:46:01,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:46:01,834 INFO L85 PathProgramCache]: Analyzing trace with hash -830601072, now seen corresponding path program 1 times [2022-12-06 07:46:01,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:46:01,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969273561] [2022-12-06 07:46:01,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:01,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:46:01,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:01,868 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 07:46:01,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:46:01,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969273561] [2022-12-06 07:46:01,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969273561] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:46:01,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:46:01,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:46:01,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634292451] [2022-12-06 07:46:01,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:46:01,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:46:01,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:46:01,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:46:01,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:46:01,870 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 07:46:01,870 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 07:46:01,870 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:46:01,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 07:46:01,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:46:02,417 INFO L130 PetriNetUnfolder]: 1783/3263 cut-off events. [2022-12-06 07:46:02,418 INFO L131 PetriNetUnfolder]: For 58264/58264 co-relation queries the response was YES. [2022-12-06 07:46:02,428 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 07:46:02,437 INFO L137 encePairwiseOnDemand]: 38/43 looper letters, 305 selfloop transitions, 12 changer transitions 0/317 dead transitions. [2022-12-06 07:46:02,437 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 317 transitions, 6000 flow [2022-12-06 07:46:02,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:46:02,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:46:02,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-12-06 07:46:02,438 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46511627906976744 [2022-12-06 07:46:02,438 INFO L175 Difference]: Start difference. First operand has 164 places, 280 transitions, 4977 flow. Second operand 3 states and 60 transitions. [2022-12-06 07:46:02,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 317 transitions, 6000 flow [2022-12-06 07:46:02,543 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 07:46:02,547 INFO L231 Difference]: Finished difference. Result has 161 places, 280 transitions, 4869 flow [2022-12-06 07:46:02,548 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 07:46:02,548 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 132 predicate places. [2022-12-06 07:46:02,548 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:46:02,548 INFO L89 Accepts]: Start accepts. Operand has 161 places, 280 transitions, 4869 flow [2022-12-06 07:46:02,550 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:46:02,550 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:46:02,550 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 280 transitions, 4869 flow [2022-12-06 07:46:02,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 280 transitions, 4869 flow [2022-12-06 07:46:02,665 INFO L130 PetriNetUnfolder]: 363/1301 cut-off events. [2022-12-06 07:46:02,666 INFO L131 PetriNetUnfolder]: For 15902/15965 co-relation queries the response was YES. [2022-12-06 07:46:02,670 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 07:46:02,678 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 280 transitions, 4869 flow [2022-12-06 07:46:02,678 INFO L188 LiptonReduction]: Number of co-enabled transitions 1422 [2022-12-06 07:46:02,679 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 07:46:02,812 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:46:02,813 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 265 [2022-12-06 07:46:02,813 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 280 transitions, 4881 flow [2022-12-06 07:46:02,813 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 07:46:02,813 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:46:02,813 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 07:46:02,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-12-06 07:46:02,813 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 07:46:02,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:46:02,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1690872659, now seen corresponding path program 1 times [2022-12-06 07:46:02,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:46:02,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230540446] [2022-12-06 07:46:02,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:02,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:46:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:04,076 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 07:46:04,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:46:04,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230540446] [2022-12-06 07:46:04,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230540446] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:46:04,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302641352] [2022-12-06 07:46:04,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:04,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:46:04,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:46:04,082 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 07:46:04,082 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 07:46:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:04,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-06 07:46:04,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:46:04,358 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:46:04,358 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 07:46:04,437 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 07:46:04,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:46:04,579 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:46:04,579 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 07:46:05,025 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 07:46:05,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302641352] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:46:05,026 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:46:05,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 19 [2022-12-06 07:46:05,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759736394] [2022-12-06 07:46:05,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:46:05,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 07:46:05,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:46:05,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 07:46:05,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2022-12-06 07:46:05,027 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 07:46:05,027 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 07:46:05,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:46:05,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 07:46:05,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:46:07,020 INFO L130 PetriNetUnfolder]: 2014/3653 cut-off events. [2022-12-06 07:46:07,021 INFO L131 PetriNetUnfolder]: For 62286/62286 co-relation queries the response was YES. [2022-12-06 07:46:07,033 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 07:46:07,046 INFO L137 encePairwiseOnDemand]: 18/42 looper letters, 247 selfloop transitions, 165 changer transitions 14/426 dead transitions. [2022-12-06 07:46:07,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 426 transitions, 7658 flow [2022-12-06 07:46:07,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 07:46:07,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 07:46:07,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 135 transitions. [2022-12-06 07:46:07,047 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24725274725274726 [2022-12-06 07:46:07,047 INFO L175 Difference]: Start difference. First operand has 161 places, 280 transitions, 4881 flow. Second operand 13 states and 135 transitions. [2022-12-06 07:46:07,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 426 transitions, 7658 flow [2022-12-06 07:46:07,202 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 07:46:07,208 INFO L231 Difference]: Finished difference. Result has 182 places, 340 transitions, 6702 flow [2022-12-06 07:46:07,208 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 07:46:07,208 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 153 predicate places. [2022-12-06 07:46:07,208 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:46:07,208 INFO L89 Accepts]: Start accepts. Operand has 182 places, 340 transitions, 6702 flow [2022-12-06 07:46:07,209 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:46:07,209 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:46:07,210 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 340 transitions, 6702 flow [2022-12-06 07:46:07,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 181 places, 340 transitions, 6702 flow [2022-12-06 07:46:07,373 INFO L130 PetriNetUnfolder]: 441/1447 cut-off events. [2022-12-06 07:46:07,374 INFO L131 PetriNetUnfolder]: For 23627/23768 co-relation queries the response was YES. [2022-12-06 07:46:07,379 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 07:46:07,389 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 181 places, 340 transitions, 6702 flow [2022-12-06 07:46:07,389 INFO L188 LiptonReduction]: Number of co-enabled transitions 1660 [2022-12-06 07:46:07,390 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:46:07,390 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 07:46:07,390 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 340 transitions, 6702 flow [2022-12-06 07:46:07,390 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 07:46:07,390 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:46:07,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 07:46:07,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 07:46:07,591 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 07:46:07,591 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 07:46:07,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:46:07,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1025969354, now seen corresponding path program 1 times [2022-12-06 07:46:07,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:46:07,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499201898] [2022-12-06 07:46:07,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:07,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:46:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:09,751 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 07:46:09,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:46:09,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499201898] [2022-12-06 07:46:09,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499201898] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:46:09,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:46:09,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:46:09,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181824144] [2022-12-06 07:46:09,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:46:09,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:46:09,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:46:09,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:46:09,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:46:09,752 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 07:46:09,752 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 07:46:09,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:46:09,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 07:46:09,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:46:10,966 INFO L130 PetriNetUnfolder]: 2018/3655 cut-off events. [2022-12-06 07:46:10,966 INFO L131 PetriNetUnfolder]: For 76192/76192 co-relation queries the response was YES. [2022-12-06 07:46:10,981 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 07:46:10,997 INFO L137 encePairwiseOnDemand]: 24/42 looper letters, 293 selfloop transitions, 89 changer transitions 13/395 dead transitions. [2022-12-06 07:46:10,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 395 transitions, 7987 flow [2022-12-06 07:46:10,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:46:10,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:46:10,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2022-12-06 07:46:10,999 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28273809523809523 [2022-12-06 07:46:10,999 INFO L175 Difference]: Start difference. First operand has 181 places, 340 transitions, 6702 flow. Second operand 8 states and 95 transitions. [2022-12-06 07:46:10,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 395 transitions, 7987 flow [2022-12-06 07:46:11,166 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 07:46:11,172 INFO L231 Difference]: Finished difference. Result has 184 places, 346 transitions, 6446 flow [2022-12-06 07:46:11,172 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 07:46:11,172 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 155 predicate places. [2022-12-06 07:46:11,173 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:46:11,173 INFO L89 Accepts]: Start accepts. Operand has 184 places, 346 transitions, 6446 flow [2022-12-06 07:46:11,174 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:46:11,174 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:46:11,174 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 184 places, 346 transitions, 6446 flow [2022-12-06 07:46:11,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 183 places, 346 transitions, 6446 flow [2022-12-06 07:46:11,316 INFO L130 PetriNetUnfolder]: 443/1444 cut-off events. [2022-12-06 07:46:11,317 INFO L131 PetriNetUnfolder]: For 20461/20601 co-relation queries the response was YES. [2022-12-06 07:46:11,323 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 07:46:11,333 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 183 places, 346 transitions, 6446 flow [2022-12-06 07:46:11,333 INFO L188 LiptonReduction]: Number of co-enabled transitions 1704 [2022-12-06 07:46:11,637 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 07:46:11,752 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 07:46:11,983 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 07:46:12,342 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 07:46:12,343 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1170 [2022-12-06 07:46:12,343 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 345 transitions, 6497 flow [2022-12-06 07:46:12,343 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 07:46:12,344 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:46:12,344 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:46:12,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-12-06 07:46:12,344 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 07:46:12,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:46:12,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1935149669, now seen corresponding path program 1 times [2022-12-06 07:46:12,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:46:12,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463874099] [2022-12-06 07:46:12,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:12,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:46:12,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:13,916 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 07:46:13,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:46:13,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463874099] [2022-12-06 07:46:13,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463874099] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:46:13,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:46:13,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:46:13,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961887399] [2022-12-06 07:46:13,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:46:13,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:46:13,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:46:13,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:46:13,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:46:13,917 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 07:46:13,917 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 07:46:13,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:46:13,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 07:46:13,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:46:14,802 INFO L130 PetriNetUnfolder]: 2025/3676 cut-off events. [2022-12-06 07:46:14,802 INFO L131 PetriNetUnfolder]: For 69811/69811 co-relation queries the response was YES. [2022-12-06 07:46:14,817 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 07:46:14,831 INFO L137 encePairwiseOnDemand]: 35/45 looper letters, 354 selfloop transitions, 14 changer transitions 16/384 dead transitions. [2022-12-06 07:46:14,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 384 transitions, 7626 flow [2022-12-06 07:46:14,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:46:14,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:46:14,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-12-06 07:46:14,832 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3037037037037037 [2022-12-06 07:46:14,832 INFO L175 Difference]: Start difference. First operand has 182 places, 345 transitions, 6497 flow. Second operand 6 states and 82 transitions. [2022-12-06 07:46:14,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 384 transitions, 7626 flow [2022-12-06 07:46:15,022 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 07:46:15,027 INFO L231 Difference]: Finished difference. Result has 185 places, 344 transitions, 6275 flow [2022-12-06 07:46:15,027 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 07:46:15,028 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 156 predicate places. [2022-12-06 07:46:15,028 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:46:15,028 INFO L89 Accepts]: Start accepts. Operand has 185 places, 344 transitions, 6275 flow [2022-12-06 07:46:15,029 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:46:15,029 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:46:15,029 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 185 places, 344 transitions, 6275 flow [2022-12-06 07:46:15,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 344 transitions, 6275 flow [2022-12-06 07:46:15,230 INFO L130 PetriNetUnfolder]: 445/1451 cut-off events. [2022-12-06 07:46:15,230 INFO L131 PetriNetUnfolder]: For 19017/19166 co-relation queries the response was YES. [2022-12-06 07:46:15,235 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 07:46:15,245 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 182 places, 344 transitions, 6275 flow [2022-12-06 07:46:15,245 INFO L188 LiptonReduction]: Number of co-enabled transitions 1684 [2022-12-06 07:46:15,246 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:46:15,247 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 219 [2022-12-06 07:46:15,247 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 344 transitions, 6275 flow [2022-12-06 07:46:15,247 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 07:46:15,247 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:46:15,247 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:46:15,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-06 07:46:15,247 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 07:46:15,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:46:15,247 INFO L85 PathProgramCache]: Analyzing trace with hash -13227142, now seen corresponding path program 1 times [2022-12-06 07:46:15,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:46:15,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798929538] [2022-12-06 07:46:15,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:15,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:46:15,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:17,525 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 07:46:17,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:46:17,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798929538] [2022-12-06 07:46:17,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798929538] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:46:17,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:46:17,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:46:17,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730845532] [2022-12-06 07:46:17,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:46:17,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:46:17,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:46:17,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:46:17,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:46:17,527 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 07:46:17,527 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 07:46:17,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:46:17,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 07:46:17,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:46:18,500 INFO L130 PetriNetUnfolder]: 2010/3644 cut-off events. [2022-12-06 07:46:18,500 INFO L131 PetriNetUnfolder]: For 64062/64062 co-relation queries the response was YES. [2022-12-06 07:46:18,515 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 07:46:18,527 INFO L137 encePairwiseOnDemand]: 28/44 looper letters, 285 selfloop transitions, 80 changer transitions 14/379 dead transitions. [2022-12-06 07:46:18,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 379 transitions, 7335 flow [2022-12-06 07:46:18,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:46:18,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:46:18,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-12-06 07:46:18,528 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30303030303030304 [2022-12-06 07:46:18,528 INFO L175 Difference]: Start difference. First operand has 182 places, 344 transitions, 6275 flow. Second operand 6 states and 80 transitions. [2022-12-06 07:46:18,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 379 transitions, 7335 flow [2022-12-06 07:46:18,709 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 07:46:18,715 INFO L231 Difference]: Finished difference. Result has 184 places, 343 transitions, 6373 flow [2022-12-06 07:46:18,715 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 07:46:18,715 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 155 predicate places. [2022-12-06 07:46:18,715 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:46:18,715 INFO L89 Accepts]: Start accepts. Operand has 184 places, 343 transitions, 6373 flow [2022-12-06 07:46:18,717 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:46:18,717 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:46:18,717 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 184 places, 343 transitions, 6373 flow [2022-12-06 07:46:18,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 343 transitions, 6373 flow [2022-12-06 07:46:18,867 INFO L130 PetriNetUnfolder]: 442/1439 cut-off events. [2022-12-06 07:46:18,868 INFO L131 PetriNetUnfolder]: For 20142/20280 co-relation queries the response was YES. [2022-12-06 07:46:18,874 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 07:46:18,885 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 182 places, 343 transitions, 6373 flow [2022-12-06 07:46:18,885 INFO L188 LiptonReduction]: Number of co-enabled transitions 1684 [2022-12-06 07:46:18,886 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:46:18,887 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:46:18,887 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 343 transitions, 6373 flow [2022-12-06 07:46:18,887 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 07:46:18,887 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:46:18,887 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:46:18,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-12-06 07:46:18,888 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 07:46:18,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:46:18,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1782800063, now seen corresponding path program 1 times [2022-12-06 07:46:18,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:46:18,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164011427] [2022-12-06 07:46:18,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:18,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:46:18,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:18,933 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 07:46:18,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:46:18,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164011427] [2022-12-06 07:46:18,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164011427] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:46:18,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:46:18,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:46:18,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278363131] [2022-12-06 07:46:18,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:46:18,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:46:18,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:46:18,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:46:18,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:46:18,935 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 07:46:18,935 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 07:46:18,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:46:18,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 07:46:18,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:46:19,518 INFO L130 PetriNetUnfolder]: 1988/3602 cut-off events. [2022-12-06 07:46:19,518 INFO L131 PetriNetUnfolder]: For 65310/65310 co-relation queries the response was YES. [2022-12-06 07:46:19,534 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 07:46:19,548 INFO L137 encePairwiseOnDemand]: 41/43 looper letters, 341 selfloop transitions, 0 changer transitions 7/348 dead transitions. [2022-12-06 07:46:19,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 348 transitions, 7081 flow [2022-12-06 07:46:19,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:46:19,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:46:19,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-12-06 07:46:19,549 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3875968992248062 [2022-12-06 07:46:19,549 INFO L175 Difference]: Start difference. First operand has 182 places, 343 transitions, 6373 flow. Second operand 3 states and 50 transitions. [2022-12-06 07:46:19,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 348 transitions, 7081 flow [2022-12-06 07:46:19,792 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 07:46:19,799 INFO L231 Difference]: Finished difference. Result has 179 places, 341 transitions, 6157 flow [2022-12-06 07:46:19,800 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 07:46:19,800 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 150 predicate places. [2022-12-06 07:46:19,800 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:46:19,800 INFO L89 Accepts]: Start accepts. Operand has 179 places, 341 transitions, 6157 flow [2022-12-06 07:46:19,802 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:46:19,802 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:46:19,803 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 341 transitions, 6157 flow [2022-12-06 07:46:19,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 341 transitions, 6157 flow [2022-12-06 07:46:20,011 INFO L130 PetriNetUnfolder]: 439/1439 cut-off events. [2022-12-06 07:46:20,012 INFO L131 PetriNetUnfolder]: For 18290/18433 co-relation queries the response was YES. [2022-12-06 07:46:20,021 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 07:46:20,036 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 341 transitions, 6157 flow [2022-12-06 07:46:20,036 INFO L188 LiptonReduction]: Number of co-enabled transitions 1674 [2022-12-06 07:46:20,037 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:46:20,038 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 238 [2022-12-06 07:46:20,038 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 341 transitions, 6157 flow [2022-12-06 07:46:20,038 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 07:46:20,038 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:46:20,038 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 07:46:20,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-12-06 07:46:20,038 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 07:46:20,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:46:20,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1286010469, now seen corresponding path program 1 times [2022-12-06 07:46:20,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:46:20,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640258173] [2022-12-06 07:46:20,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:20,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:46:20,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:20,903 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 07:46:20,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:46:20,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640258173] [2022-12-06 07:46:20,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640258173] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:46:20,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:46:20,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 07:46:20,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939628215] [2022-12-06 07:46:20,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:46:20,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:46:20,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:46:20,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:46:20,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:46:20,904 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 07:46:20,904 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 07:46:20,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:46:20,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 07:46:20,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:46:22,784 INFO L130 PetriNetUnfolder]: 2003/3631 cut-off events. [2022-12-06 07:46:22,784 INFO L131 PetriNetUnfolder]: For 61641/61641 co-relation queries the response was YES. [2022-12-06 07:46:22,796 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 07:46:22,808 INFO L137 encePairwiseOnDemand]: 31/42 looper letters, 334 selfloop transitions, 73 changer transitions 14/421 dead transitions. [2022-12-06 07:46:22,808 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 421 transitions, 7503 flow [2022-12-06 07:46:22,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 07:46:22,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 07:46:22,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 131 transitions. [2022-12-06 07:46:22,809 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28354978354978355 [2022-12-06 07:46:22,809 INFO L175 Difference]: Start difference. First operand has 176 places, 341 transitions, 6157 flow. Second operand 11 states and 131 transitions. [2022-12-06 07:46:22,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 421 transitions, 7503 flow [2022-12-06 07:46:22,971 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 07:46:22,978 INFO L231 Difference]: Finished difference. Result has 191 places, 352 transitions, 6558 flow [2022-12-06 07:46:22,978 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 07:46:22,979 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 162 predicate places. [2022-12-06 07:46:22,979 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:46:22,979 INFO L89 Accepts]: Start accepts. Operand has 191 places, 352 transitions, 6558 flow [2022-12-06 07:46:22,981 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:46:22,981 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:46:22,981 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 352 transitions, 6558 flow [2022-12-06 07:46:22,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 190 places, 352 transitions, 6558 flow [2022-12-06 07:46:23,134 INFO L130 PetriNetUnfolder]: 439/1432 cut-off events. [2022-12-06 07:46:23,134 INFO L131 PetriNetUnfolder]: For 19784/19931 co-relation queries the response was YES. [2022-12-06 07:46:23,141 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 07:46:23,150 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 190 places, 352 transitions, 6558 flow [2022-12-06 07:46:23,150 INFO L188 LiptonReduction]: Number of co-enabled transitions 1732 [2022-12-06 07:46:23,151 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 07:46:23,288 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 07:46:23,431 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:46:23,432 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 453 [2022-12-06 07:46:23,432 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 351 transitions, 6567 flow [2022-12-06 07:46:23,432 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 07:46:23,432 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:46:23,432 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 07:46:23,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-12-06 07:46:23,432 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 07:46:23,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:46:23,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1095518954, now seen corresponding path program 2 times [2022-12-06 07:46:23,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:46:23,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894269881] [2022-12-06 07:46:23,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:23,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:46:23,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:30,718 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 07:46:30,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:46:30,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894269881] [2022-12-06 07:46:30,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894269881] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:46:30,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:46:30,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 07:46:30,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463624015] [2022-12-06 07:46:30,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:46:30,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:46:30,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:46:30,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:46:30,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:46:30,720 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 07:46:30,720 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 07:46:30,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:46:30,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 07:46:30,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:46:32,518 INFO L130 PetriNetUnfolder]: 1998/3625 cut-off events. [2022-12-06 07:46:32,519 INFO L131 PetriNetUnfolder]: For 68075/68075 co-relation queries the response was YES. [2022-12-06 07:46:32,535 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 07:46:32,549 INFO L137 encePairwiseOnDemand]: 31/44 looper letters, 359 selfloop transitions, 29 changer transitions 13/401 dead transitions. [2022-12-06 07:46:32,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 401 transitions, 7840 flow [2022-12-06 07:46:32,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:46:32,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:46:32,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2022-12-06 07:46:32,550 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2727272727272727 [2022-12-06 07:46:32,551 INFO L175 Difference]: Start difference. First operand has 189 places, 351 transitions, 6567 flow. Second operand 8 states and 96 transitions. [2022-12-06 07:46:32,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 401 transitions, 7840 flow [2022-12-06 07:46:32,749 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 07:46:32,754 INFO L231 Difference]: Finished difference. Result has 196 places, 366 transitions, 6803 flow [2022-12-06 07:46:32,755 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 07:46:32,755 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 167 predicate places. [2022-12-06 07:46:32,755 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:46:32,755 INFO L89 Accepts]: Start accepts. Operand has 196 places, 366 transitions, 6803 flow [2022-12-06 07:46:32,756 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:46:32,756 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:46:32,757 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 196 places, 366 transitions, 6803 flow [2022-12-06 07:46:32,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 195 places, 366 transitions, 6803 flow [2022-12-06 07:46:32,910 INFO L130 PetriNetUnfolder]: 450/1456 cut-off events. [2022-12-06 07:46:32,910 INFO L131 PetriNetUnfolder]: For 20071/20216 co-relation queries the response was YES. [2022-12-06 07:46:32,917 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 07:46:32,927 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 195 places, 366 transitions, 6803 flow [2022-12-06 07:46:32,927 INFO L188 LiptonReduction]: Number of co-enabled transitions 1792 [2022-12-06 07:46:32,928 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 07:46:32,989 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 07:46:33,132 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:46:33,132 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 377 [2022-12-06 07:46:33,132 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 365 transitions, 6810 flow [2022-12-06 07:46:33,132 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 07:46:33,132 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:46:33,132 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 07:46:33,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-12-06 07:46:33,133 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 07:46:33,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:46:33,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1870733452, now seen corresponding path program 1 times [2022-12-06 07:46:33,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:46:33,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816632166] [2022-12-06 07:46:33,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:33,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:46:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:33,794 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 07:46:33,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:46:33,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816632166] [2022-12-06 07:46:33,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816632166] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:46:33,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:46:33,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:46:33,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385701701] [2022-12-06 07:46:33,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:46:33,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:46:33,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:46:33,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:46:33,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:46:33,795 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 07:46:33,795 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 07:46:33,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:46:33,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 07:46:33,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:46:35,429 INFO L130 PetriNetUnfolder]: 1993/3619 cut-off events. [2022-12-06 07:46:35,429 INFO L131 PetriNetUnfolder]: For 68040/68040 co-relation queries the response was YES. [2022-12-06 07:46:35,446 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 07:46:35,460 INFO L137 encePairwiseOnDemand]: 34/46 looper letters, 347 selfloop transitions, 61 changer transitions 14/422 dead transitions. [2022-12-06 07:46:35,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 422 transitions, 7977 flow [2022-12-06 07:46:35,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 07:46:35,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 07:46:35,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2022-12-06 07:46:35,461 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2565217391304348 [2022-12-06 07:46:35,461 INFO L175 Difference]: Start difference. First operand has 194 places, 365 transitions, 6810 flow. Second operand 10 states and 118 transitions. [2022-12-06 07:46:35,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 422 transitions, 7977 flow [2022-12-06 07:46:35,688 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 07:46:35,695 INFO L231 Difference]: Finished difference. Result has 203 places, 364 transitions, 6814 flow [2022-12-06 07:46:35,696 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 07:46:35,696 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 174 predicate places. [2022-12-06 07:46:35,696 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:46:35,696 INFO L89 Accepts]: Start accepts. Operand has 203 places, 364 transitions, 6814 flow [2022-12-06 07:46:35,698 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:46:35,698 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:46:35,698 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 203 places, 364 transitions, 6814 flow [2022-12-06 07:46:35,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 201 places, 364 transitions, 6814 flow [2022-12-06 07:46:35,892 INFO L130 PetriNetUnfolder]: 448/1441 cut-off events. [2022-12-06 07:46:35,892 INFO L131 PetriNetUnfolder]: For 20640/20801 co-relation queries the response was YES. [2022-12-06 07:46:35,898 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 07:46:35,908 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 201 places, 364 transitions, 6814 flow [2022-12-06 07:46:35,908 INFO L188 LiptonReduction]: Number of co-enabled transitions 1782 [2022-12-06 07:46:35,946 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 07:46:36,168 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 07:46:36,313 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 07:46:36,449 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 07:46:36,585 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 07:46:36,723 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 07:46:36,866 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 07:46:37,010 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 07:46:37,149 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:46:37,150 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1454 [2022-12-06 07:46:37,150 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 372 transitions, 7087 flow [2022-12-06 07:46:37,150 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 07:46:37,150 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:46:37,150 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 07:46:37,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-12-06 07:46:37,150 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 07:46:37,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:46:37,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1636317221, now seen corresponding path program 1 times [2022-12-06 07:46:37,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:46:37,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237581344] [2022-12-06 07:46:37,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:37,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:46:37,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:38,685 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 07:46:38,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:46:38,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237581344] [2022-12-06 07:46:38,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237581344] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:46:38,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:46:38,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:46:38,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025965210] [2022-12-06 07:46:38,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:46:38,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:46:38,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:46:38,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:46:38,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:46:38,687 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 07:46:38,687 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 07:46:38,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:46:38,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 07:46:38,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:46:39,939 INFO L130 PetriNetUnfolder]: 1986/3614 cut-off events. [2022-12-06 07:46:39,940 INFO L131 PetriNetUnfolder]: For 69425/69425 co-relation queries the response was YES. [2022-12-06 07:46:39,955 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 07:46:39,968 INFO L137 encePairwiseOnDemand]: 35/53 looper letters, 286 selfloop transitions, 104 changer transitions 16/406 dead transitions. [2022-12-06 07:46:39,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 406 transitions, 7932 flow [2022-12-06 07:46:39,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:46:39,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:46:39,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2022-12-06 07:46:39,969 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22169811320754718 [2022-12-06 07:46:39,969 INFO L175 Difference]: Start difference. First operand has 202 places, 372 transitions, 7087 flow. Second operand 8 states and 94 transitions. [2022-12-06 07:46:39,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 406 transitions, 7932 flow [2022-12-06 07:46:40,194 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 07:46:40,201 INFO L231 Difference]: Finished difference. Result has 207 places, 362 transitions, 6908 flow [2022-12-06 07:46:40,202 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 07:46:40,202 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 178 predicate places. [2022-12-06 07:46:40,202 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:46:40,202 INFO L89 Accepts]: Start accepts. Operand has 207 places, 362 transitions, 6908 flow [2022-12-06 07:46:40,204 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:46:40,204 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:46:40,204 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 207 places, 362 transitions, 6908 flow [2022-12-06 07:46:40,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 362 transitions, 6908 flow [2022-12-06 07:46:40,406 INFO L130 PetriNetUnfolder]: 445/1435 cut-off events. [2022-12-06 07:46:40,407 INFO L131 PetriNetUnfolder]: For 21414/21578 co-relation queries the response was YES. [2022-12-06 07:46:40,417 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 07:46:40,430 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 205 places, 362 transitions, 6908 flow [2022-12-06 07:46:40,431 INFO L188 LiptonReduction]: Number of co-enabled transitions 1772 [2022-12-06 07:46:40,432 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 07:46:40,589 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:46:40,589 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 387 [2022-12-06 07:46:40,589 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 362 transitions, 6933 flow [2022-12-06 07:46:40,589 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 07:46:40,590 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:46:40,590 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 07:46:40,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-12-06 07:46:40,590 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 07:46:40,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:46:40,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1816797922, now seen corresponding path program 1 times [2022-12-06 07:46:40,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:46:40,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962927071] [2022-12-06 07:46:40,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:40,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:46:40,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:40,641 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 07:46:40,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:46:40,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962927071] [2022-12-06 07:46:40,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962927071] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:46:40,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:46:40,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:46:40,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321513839] [2022-12-06 07:46:40,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:46:40,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:46:40,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:46:40,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:46:40,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:46:40,642 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 07:46:40,642 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 07:46:40,642 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:46:40,642 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 07:46:40,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:46:41,305 INFO L130 PetriNetUnfolder]: 1928/3512 cut-off events. [2022-12-06 07:46:41,306 INFO L131 PetriNetUnfolder]: For 70660/70660 co-relation queries the response was YES. [2022-12-06 07:46:41,321 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 07:46:41,334 INFO L137 encePairwiseOnDemand]: 36/45 looper letters, 396 selfloop transitions, 18 changer transitions 0/414 dead transitions. [2022-12-06 07:46:41,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 414 transitions, 8286 flow [2022-12-06 07:46:41,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:46:41,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:46:41,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-12-06 07:46:41,335 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2022-12-06 07:46:41,335 INFO L175 Difference]: Start difference. First operand has 205 places, 362 transitions, 6933 flow. Second operand 4 states and 76 transitions. [2022-12-06 07:46:41,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 414 transitions, 8286 flow [2022-12-06 07:46:41,531 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 07:46:41,536 INFO L231 Difference]: Finished difference. Result has 203 places, 362 transitions, 6751 flow [2022-12-06 07:46:41,537 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 07:46:41,537 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 174 predicate places. [2022-12-06 07:46:41,537 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:46:41,537 INFO L89 Accepts]: Start accepts. Operand has 203 places, 362 transitions, 6751 flow [2022-12-06 07:46:41,538 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:46:41,538 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:46:41,539 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 203 places, 362 transitions, 6751 flow [2022-12-06 07:46:41,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 203 places, 362 transitions, 6751 flow [2022-12-06 07:46:41,685 INFO L130 PetriNetUnfolder]: 445/1419 cut-off events. [2022-12-06 07:46:41,685 INFO L131 PetriNetUnfolder]: For 20418/20610 co-relation queries the response was YES. [2022-12-06 07:46:41,692 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 07:46:41,701 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 203 places, 362 transitions, 6751 flow [2022-12-06 07:46:41,701 INFO L188 LiptonReduction]: Number of co-enabled transitions 1766 [2022-12-06 07:46:41,703 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:46:41,703 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:46:41,703 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 362 transitions, 6751 flow [2022-12-06 07:46:41,703 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 07:46:41,703 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:46:41,703 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 07:46:41,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-12-06 07:46:41,704 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 07:46:41,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:46:41,704 INFO L85 PathProgramCache]: Analyzing trace with hash -700498293, now seen corresponding path program 1 times [2022-12-06 07:46:41,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:46:41,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871389515] [2022-12-06 07:46:41,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:41,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:46:41,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:41,741 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 07:46:41,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:46:41,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871389515] [2022-12-06 07:46:41,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871389515] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:46:41,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:46:41,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:46:41,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069586246] [2022-12-06 07:46:41,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:46:41,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:46:41,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:46:41,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:46:41,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:46:41,743 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 07:46:41,743 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 07:46:41,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:46:41,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 07:46:41,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:46:42,391 INFO L130 PetriNetUnfolder]: 1844/3374 cut-off events. [2022-12-06 07:46:42,391 INFO L131 PetriNetUnfolder]: For 65177/65177 co-relation queries the response was YES. [2022-12-06 07:46:42,408 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 07:46:42,421 INFO L137 encePairwiseOnDemand]: 37/44 looper letters, 373 selfloop transitions, 21 changer transitions 4/398 dead transitions. [2022-12-06 07:46:42,422 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 398 transitions, 7907 flow [2022-12-06 07:46:42,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:46:42,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:46:42,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:46:42,422 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39204545454545453 [2022-12-06 07:46:42,423 INFO L175 Difference]: Start difference. First operand has 203 places, 362 transitions, 6751 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:46:42,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 398 transitions, 7907 flow [2022-12-06 07:46:42,621 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 07:46:42,627 INFO L231 Difference]: Finished difference. Result has 205 places, 360 transitions, 6718 flow [2022-12-06 07:46:42,628 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 07:46:42,628 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 176 predicate places. [2022-12-06 07:46:42,628 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:46:42,628 INFO L89 Accepts]: Start accepts. Operand has 205 places, 360 transitions, 6718 flow [2022-12-06 07:46:42,630 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:46:42,630 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:46:42,630 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 205 places, 360 transitions, 6718 flow [2022-12-06 07:46:42,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 202 places, 360 transitions, 6718 flow [2022-12-06 07:46:42,819 INFO L130 PetriNetUnfolder]: 429/1356 cut-off events. [2022-12-06 07:46:42,819 INFO L131 PetriNetUnfolder]: For 19655/19839 co-relation queries the response was YES. [2022-12-06 07:46:42,828 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 07:46:42,841 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 202 places, 360 transitions, 6718 flow [2022-12-06 07:46:42,841 INFO L188 LiptonReduction]: Number of co-enabled transitions 1738 [2022-12-06 07:46:42,843 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:46:42,843 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 215 [2022-12-06 07:46:42,843 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 360 transitions, 6718 flow [2022-12-06 07:46:42,843 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 07:46:42,843 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:46:42,844 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 07:46:42,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-12-06 07:46:42,844 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 07:46:42,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:46:42,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1611419292, now seen corresponding path program 3 times [2022-12-06 07:46:42,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:46:42,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449949952] [2022-12-06 07:46:42,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:42,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:46:42,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:43,670 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 07:46:43,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:46:43,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449949952] [2022-12-06 07:46:43,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449949952] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:46:43,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:46:43,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:46:43,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624836295] [2022-12-06 07:46:43,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:46:43,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:46:43,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:46:43,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:46:43,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:46:43,671 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 07:46:43,672 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 07:46:43,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:46:43,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 07:46:43,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:46:44,606 INFO L130 PetriNetUnfolder]: 1846/3371 cut-off events. [2022-12-06 07:46:44,607 INFO L131 PetriNetUnfolder]: For 63693/63693 co-relation queries the response was YES. [2022-12-06 07:46:44,625 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 07:46:44,640 INFO L137 encePairwiseOnDemand]: 26/43 looper letters, 283 selfloop transitions, 104 changer transitions 15/402 dead transitions. [2022-12-06 07:46:44,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 402 transitions, 7833 flow [2022-12-06 07:46:44,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:46:44,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:46:44,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2022-12-06 07:46:44,641 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25872093023255816 [2022-12-06 07:46:44,641 INFO L175 Difference]: Start difference. First operand has 202 places, 360 transitions, 6718 flow. Second operand 8 states and 89 transitions. [2022-12-06 07:46:44,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 402 transitions, 7833 flow [2022-12-06 07:46:44,823 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 07:46:44,828 INFO L231 Difference]: Finished difference. Result has 208 places, 364 transitions, 6936 flow [2022-12-06 07:46:44,829 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 07:46:44,829 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 179 predicate places. [2022-12-06 07:46:44,829 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:46:44,829 INFO L89 Accepts]: Start accepts. Operand has 208 places, 364 transitions, 6936 flow [2022-12-06 07:46:44,830 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:46:44,830 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:46:44,831 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 208 places, 364 transitions, 6936 flow [2022-12-06 07:46:44,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 207 places, 364 transitions, 6936 flow [2022-12-06 07:46:44,971 INFO L130 PetriNetUnfolder]: 429/1364 cut-off events. [2022-12-06 07:46:44,972 INFO L131 PetriNetUnfolder]: For 20865/21046 co-relation queries the response was YES. [2022-12-06 07:46:44,978 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 07:46:44,985 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 207 places, 364 transitions, 6936 flow [2022-12-06 07:46:44,985 INFO L188 LiptonReduction]: Number of co-enabled transitions 1746 [2022-12-06 07:46:44,987 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 07:46:45,125 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 07:46:45,270 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:46:45,270 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 441 [2022-12-06 07:46:45,270 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 362 transitions, 6940 flow [2022-12-06 07:46:45,271 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 07:46:45,271 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:46:45,271 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 07:46:45,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-12-06 07:46:45,271 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 07:46:45,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:46:45,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1190152250, now seen corresponding path program 1 times [2022-12-06 07:46:45,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:46:45,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160359918] [2022-12-06 07:46:45,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:45,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:46:45,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:46,285 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 07:46:46,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:46:46,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160359918] [2022-12-06 07:46:46,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160359918] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:46:46,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256517093] [2022-12-06 07:46:46,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:46,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:46:46,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:46:46,287 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 07:46:46,289 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 07:46:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:46,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-06 07:46:46,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:46:46,571 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:46:46,571 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 07:46:46,660 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 07:46:46,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:46:46,764 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:46:46,764 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 07:46:47,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 07:46:47,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256517093] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:46:47,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:46:47,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2022-12-06 07:46:47,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143265886] [2022-12-06 07:46:47,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:46:47,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 07:46:47,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:46:47,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 07:46:47,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-12-06 07:46:47,153 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 07:46:47,153 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 07:46:47,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:46:47,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 07:46:47,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:46:48,590 INFO L130 PetriNetUnfolder]: 1978/3543 cut-off events. [2022-12-06 07:46:48,591 INFO L131 PetriNetUnfolder]: For 69333/69333 co-relation queries the response was YES. [2022-12-06 07:46:48,607 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 07:46:48,622 INFO L137 encePairwiseOnDemand]: 24/45 looper letters, 280 selfloop transitions, 178 changer transitions 13/471 dead transitions. [2022-12-06 07:46:48,622 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 471 transitions, 9206 flow [2022-12-06 07:46:48,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 07:46:48,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 07:46:48,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 137 transitions. [2022-12-06 07:46:48,623 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2767676767676768 [2022-12-06 07:46:48,623 INFO L175 Difference]: Start difference. First operand has 205 places, 362 transitions, 6940 flow. Second operand 11 states and 137 transitions. [2022-12-06 07:46:48,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 471 transitions, 9206 flow [2022-12-06 07:46:48,828 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 07:46:48,834 INFO L231 Difference]: Finished difference. Result has 216 places, 389 transitions, 7749 flow [2022-12-06 07:46:48,834 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 07:46:48,835 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 187 predicate places. [2022-12-06 07:46:48,835 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:46:48,835 INFO L89 Accepts]: Start accepts. Operand has 216 places, 389 transitions, 7749 flow [2022-12-06 07:46:48,836 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:46:48,836 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:46:48,836 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 216 places, 389 transitions, 7749 flow [2022-12-06 07:46:48,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 215 places, 389 transitions, 7749 flow [2022-12-06 07:46:48,996 INFO L130 PetriNetUnfolder]: 491/1456 cut-off events. [2022-12-06 07:46:48,997 INFO L131 PetriNetUnfolder]: For 24460/24646 co-relation queries the response was YES. [2022-12-06 07:46:49,004 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 07:46:49,013 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 215 places, 389 transitions, 7749 flow [2022-12-06 07:46:49,013 INFO L188 LiptonReduction]: Number of co-enabled transitions 1860 [2022-12-06 07:46:49,014 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 07:46:49,150 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:46:49,151 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 316 [2022-12-06 07:46:49,151 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 388 transitions, 7743 flow [2022-12-06 07:46:49,151 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 07:46:49,151 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:46:49,151 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:46:49,158 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 07:46:49,355 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 07:46:49,355 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 07:46:49,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:46:49,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1535869740, now seen corresponding path program 1 times [2022-12-06 07:46:49,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:46:49,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641858577] [2022-12-06 07:46:49,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:49,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:46:49,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:50,867 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 07:46:50,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:46:50,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641858577] [2022-12-06 07:46:50,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641858577] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:46:50,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:46:50,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:46:50,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552561539] [2022-12-06 07:46:50,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:46:50,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:46:50,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:46:50,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:46:50,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:46:50,869 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 07:46:50,869 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 07:46:50,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:46:50,869 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 07:46:50,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:46:52,080 INFO L130 PetriNetUnfolder]: 1973/3537 cut-off events. [2022-12-06 07:46:52,081 INFO L131 PetriNetUnfolder]: For 77697/77697 co-relation queries the response was YES. [2022-12-06 07:46:52,099 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 07:46:52,115 INFO L137 encePairwiseOnDemand]: 32/46 looper letters, 331 selfloop transitions, 78 changer transitions 14/423 dead transitions. [2022-12-06 07:46:52,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 423 transitions, 8822 flow [2022-12-06 07:46:52,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:46:52,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:46:52,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2022-12-06 07:46:52,116 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2670807453416149 [2022-12-06 07:46:52,116 INFO L175 Difference]: Start difference. First operand has 214 places, 388 transitions, 7743 flow. Second operand 7 states and 86 transitions. [2022-12-06 07:46:52,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 423 transitions, 8822 flow [2022-12-06 07:46:52,408 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 07:46:52,417 INFO L231 Difference]: Finished difference. Result has 215 places, 387 transitions, 7556 flow [2022-12-06 07:46:52,417 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 07:46:52,417 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 186 predicate places. [2022-12-06 07:46:52,418 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:46:52,418 INFO L89 Accepts]: Start accepts. Operand has 215 places, 387 transitions, 7556 flow [2022-12-06 07:46:52,420 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:46:52,420 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:46:52,420 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 215 places, 387 transitions, 7556 flow [2022-12-06 07:46:52,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 213 places, 387 transitions, 7556 flow [2022-12-06 07:46:52,609 INFO L130 PetriNetUnfolder]: 489/1441 cut-off events. [2022-12-06 07:46:52,609 INFO L131 PetriNetUnfolder]: For 24596/24772 co-relation queries the response was YES. [2022-12-06 07:46:52,616 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 07:46:52,627 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 213 places, 387 transitions, 7556 flow [2022-12-06 07:46:52,627 INFO L188 LiptonReduction]: Number of co-enabled transitions 1852 [2022-12-06 07:46:52,628 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:46:52,628 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 210 [2022-12-06 07:46:52,628 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 387 transitions, 7556 flow [2022-12-06 07:46:52,628 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 07:46:52,628 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:46:52,629 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 07:46:52,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-12-06 07:46:52,629 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 07:46:52,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:46:52,629 INFO L85 PathProgramCache]: Analyzing trace with hash -39074545, now seen corresponding path program 1 times [2022-12-06 07:46:52,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:46:52,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119834020] [2022-12-06 07:46:52,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:52,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:46:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:53,614 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 07:46:53,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:46:53,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119834020] [2022-12-06 07:46:53,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119834020] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:46:53,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737043234] [2022-12-06 07:46:53,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:53,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:46:53,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:46:53,615 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 07:46:53,617 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 07:46:53,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:53,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-06 07:46:53,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:46:53,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:46:53,868 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 07:46:53,921 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 07:46:53,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:46:54,043 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:46:54,043 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 07:46:54,049 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:46:54,049 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 07:46:54,230 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 07:46:54,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737043234] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:46:54,230 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:46:54,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-06 07:46:54,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570924351] [2022-12-06 07:46:54,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:46:54,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 07:46:54,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:46:54,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 07:46:54,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2022-12-06 07:46:54,232 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 07:46:54,232 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 07:46:54,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:46:54,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 07:46:54,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:46:55,839 INFO L130 PetriNetUnfolder]: 1986/3562 cut-off events. [2022-12-06 07:46:55,839 INFO L131 PetriNetUnfolder]: For 76373/76373 co-relation queries the response was YES. [2022-12-06 07:46:55,857 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 07:46:55,872 INFO L137 encePairwiseOnDemand]: 25/45 looper letters, 291 selfloop transitions, 148 changer transitions 16/455 dead transitions. [2022-12-06 07:46:55,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 455 transitions, 9128 flow [2022-12-06 07:46:55,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:46:55,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:46:55,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2022-12-06 07:46:55,873 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2641975308641975 [2022-12-06 07:46:55,873 INFO L175 Difference]: Start difference. First operand has 213 places, 387 transitions, 7556 flow. Second operand 9 states and 107 transitions. [2022-12-06 07:46:55,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 455 transitions, 9128 flow [2022-12-06 07:46:56,154 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 07:46:56,160 INFO L231 Difference]: Finished difference. Result has 220 places, 387 transitions, 7840 flow [2022-12-06 07:46:56,161 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 07:46:56,161 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 191 predicate places. [2022-12-06 07:46:56,161 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:46:56,161 INFO L89 Accepts]: Start accepts. Operand has 220 places, 387 transitions, 7840 flow [2022-12-06 07:46:56,163 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:46:56,163 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:46:56,163 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 220 places, 387 transitions, 7840 flow [2022-12-06 07:46:56,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 218 places, 387 transitions, 7840 flow [2022-12-06 07:46:56,337 INFO L130 PetriNetUnfolder]: 495/1463 cut-off events. [2022-12-06 07:46:56,338 INFO L131 PetriNetUnfolder]: For 27520/27717 co-relation queries the response was YES. [2022-12-06 07:46:56,345 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 07:46:56,356 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 218 places, 387 transitions, 7840 flow [2022-12-06 07:46:56,356 INFO L188 LiptonReduction]: Number of co-enabled transitions 1860 [2022-12-06 07:46:56,357 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:46:56,358 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-06 07:46:56,358 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 387 transitions, 7840 flow [2022-12-06 07:46:56,358 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 07:46:56,358 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:46:56,358 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 07:46:56,363 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 07:46:56,559 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 07:46:56,559 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 07:46:56,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:46:56,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1636657641, now seen corresponding path program 1 times [2022-12-06 07:46:56,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:46:56,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046391240] [2022-12-06 07:46:56,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:56,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:46:56,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:47:00,674 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 07:47:00,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:47:00,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046391240] [2022-12-06 07:47:00,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046391240] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:47:00,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:47:00,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:47:00,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008090695] [2022-12-06 07:47:00,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:47:00,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:47:00,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:47:00,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:47:00,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:47:00,676 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 07:47:00,676 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 07:47:00,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:47:00,676 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 07:47:00,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:47:02,238 INFO L130 PetriNetUnfolder]: 1977/3549 cut-off events. [2022-12-06 07:47:02,238 INFO L131 PetriNetUnfolder]: For 84030/84030 co-relation queries the response was YES. [2022-12-06 07:47:02,255 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 07:47:02,270 INFO L137 encePairwiseOnDemand]: 27/44 looper letters, 300 selfloop transitions, 106 changer transitions 21/427 dead transitions. [2022-12-06 07:47:02,270 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 427 transitions, 8988 flow [2022-12-06 07:47:02,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:47:02,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:47:02,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-12-06 07:47:02,271 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25 [2022-12-06 07:47:02,271 INFO L175 Difference]: Start difference. First operand has 218 places, 387 transitions, 7840 flow. Second operand 8 states and 88 transitions. [2022-12-06 07:47:02,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 427 transitions, 8988 flow [2022-12-06 07:47:02,550 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 07:47:02,557 INFO L231 Difference]: Finished difference. Result has 221 places, 383 transitions, 7790 flow [2022-12-06 07:47:02,557 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 07:47:02,557 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 192 predicate places. [2022-12-06 07:47:02,557 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:47:02,557 INFO L89 Accepts]: Start accepts. Operand has 221 places, 383 transitions, 7790 flow [2022-12-06 07:47:02,559 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:47:02,559 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:47:02,559 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 221 places, 383 transitions, 7790 flow [2022-12-06 07:47:02,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 218 places, 383 transitions, 7790 flow [2022-12-06 07:47:02,740 INFO L130 PetriNetUnfolder]: 492/1442 cut-off events. [2022-12-06 07:47:02,740 INFO L131 PetriNetUnfolder]: For 27933/28147 co-relation queries the response was YES. [2022-12-06 07:47:02,746 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 07:47:02,755 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 218 places, 383 transitions, 7790 flow [2022-12-06 07:47:02,755 INFO L188 LiptonReduction]: Number of co-enabled transitions 1848 [2022-12-06 07:47:02,756 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 07:47:02,992 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 07:47:03,146 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 07:47:03,453 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:47:03,453 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 896 [2022-12-06 07:47:03,453 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 382 transitions, 7818 flow [2022-12-06 07:47:03,453 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 07:47:03,453 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:47:03,454 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 07:47:03,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-12-06 07:47:03,454 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 07:47:03,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:47:03,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1533538133, now seen corresponding path program 1 times [2022-12-06 07:47:03,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:47:03,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989967253] [2022-12-06 07:47:03,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:47:03,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:47:03,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:47:04,729 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 07:47:04,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:47:04,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989967253] [2022-12-06 07:47:04,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989967253] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:47:04,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:47:04,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 07:47:04,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415467610] [2022-12-06 07:47:04,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:47:04,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:47:04,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:47:04,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:47:04,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:47:04,731 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 07:47:04,731 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 07:47:04,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:47:04,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 07:47:04,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:47:06,070 INFO L130 PetriNetUnfolder]: 1965/3518 cut-off events. [2022-12-06 07:47:06,070 INFO L131 PetriNetUnfolder]: For 83471/83471 co-relation queries the response was YES. [2022-12-06 07:47:06,085 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 07:47:06,097 INFO L137 encePairwiseOnDemand]: 24/46 looper letters, 301 selfloop transitions, 142 changer transitions 14/457 dead transitions. [2022-12-06 07:47:06,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 457 transitions, 9502 flow [2022-12-06 07:47:06,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:47:06,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:47:06,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2022-12-06 07:47:06,099 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.296195652173913 [2022-12-06 07:47:06,099 INFO L175 Difference]: Start difference. First operand has 217 places, 382 transitions, 7818 flow. Second operand 8 states and 109 transitions. [2022-12-06 07:47:06,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 457 transitions, 9502 flow [2022-12-06 07:47:06,338 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 07:47:06,344 INFO L231 Difference]: Finished difference. Result has 220 places, 386 transitions, 7973 flow [2022-12-06 07:47:06,345 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 07:47:06,345 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 191 predicate places. [2022-12-06 07:47:06,345 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:47:06,345 INFO L89 Accepts]: Start accepts. Operand has 220 places, 386 transitions, 7973 flow [2022-12-06 07:47:06,346 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:47:06,346 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:47:06,346 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 220 places, 386 transitions, 7973 flow [2022-12-06 07:47:06,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 217 places, 386 transitions, 7973 flow [2022-12-06 07:47:06,500 INFO L130 PetriNetUnfolder]: 480/1419 cut-off events. [2022-12-06 07:47:06,500 INFO L131 PetriNetUnfolder]: For 28224/28412 co-relation queries the response was YES. [2022-12-06 07:47:06,508 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 07:47:06,518 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 217 places, 386 transitions, 7973 flow [2022-12-06 07:47:06,518 INFO L188 LiptonReduction]: Number of co-enabled transitions 1848 [2022-12-06 07:47:06,520 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 07:47:06,665 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 07:47:07,036 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:47:07,037 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 692 [2022-12-06 07:47:07,037 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 385 transitions, 7973 flow [2022-12-06 07:47:07,037 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 07:47:07,037 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:47:07,037 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:47:07,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-12-06 07:47:07,037 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 07:47:07,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:47:07,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1135747298, now seen corresponding path program 1 times [2022-12-06 07:47:07,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:47:07,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519574042] [2022-12-06 07:47:07,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:47:07,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:47:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:47:11,182 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 07:47:11,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:47:11,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519574042] [2022-12-06 07:47:11,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519574042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:47:11,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:47:11,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:47:11,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883515020] [2022-12-06 07:47:11,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:47:11,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:47:11,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:47:11,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:47:11,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:47:11,184 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 07:47:11,184 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 07:47:11,184 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:47:11,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 07:47:11,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:47:12,542 INFO L130 PetriNetUnfolder]: 1957/3499 cut-off events. [2022-12-06 07:47:12,542 INFO L131 PetriNetUnfolder]: For 87666/87666 co-relation queries the response was YES. [2022-12-06 07:47:12,558 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 07:47:12,571 INFO L137 encePairwiseOnDemand]: 29/46 looper letters, 301 selfloop transitions, 104 changer transitions 14/419 dead transitions. [2022-12-06 07:47:12,571 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 419 transitions, 9061 flow [2022-12-06 07:47:12,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:47:12,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:47:12,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2022-12-06 07:47:12,572 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29347826086956524 [2022-12-06 07:47:12,572 INFO L175 Difference]: Start difference. First operand has 216 places, 385 transitions, 7973 flow. Second operand 6 states and 81 transitions. [2022-12-06 07:47:12,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 419 transitions, 9061 flow [2022-12-06 07:47:12,830 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 07:47:12,836 INFO L231 Difference]: Finished difference. Result has 218 places, 384 transitions, 7977 flow [2022-12-06 07:47:12,836 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 07:47:12,836 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 189 predicate places. [2022-12-06 07:47:12,837 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:47:12,837 INFO L89 Accepts]: Start accepts. Operand has 218 places, 384 transitions, 7977 flow [2022-12-06 07:47:12,838 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:47:12,838 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:47:12,838 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 218 places, 384 transitions, 7977 flow [2022-12-06 07:47:12,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 216 places, 384 transitions, 7977 flow [2022-12-06 07:47:12,996 INFO L130 PetriNetUnfolder]: 486/1431 cut-off events. [2022-12-06 07:47:12,996 INFO L131 PetriNetUnfolder]: For 29715/29916 co-relation queries the response was YES. [2022-12-06 07:47:13,004 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 07:47:13,014 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 216 places, 384 transitions, 7977 flow [2022-12-06 07:47:13,014 INFO L188 LiptonReduction]: Number of co-enabled transitions 1844 [2022-12-06 07:47:13,015 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:47:13,016 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:47:13,016 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 384 transitions, 7977 flow [2022-12-06 07:47:13,016 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 07:47:13,016 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:47:13,016 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 07:47:13,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-12-06 07:47:13,016 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 07:47:13,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:47:13,016 INFO L85 PathProgramCache]: Analyzing trace with hash -245444503, now seen corresponding path program 1 times [2022-12-06 07:47:13,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:47:13,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926329791] [2022-12-06 07:47:13,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:47:13,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:47:13,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:47:14,827 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 07:47:14,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:47:14,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926329791] [2022-12-06 07:47:14,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926329791] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:47:14,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:47:14,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:47:14,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152470461] [2022-12-06 07:47:14,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:47:14,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:47:14,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:47:14,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:47:14,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:47:14,829 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 07:47:14,829 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 07:47:14,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:47:14,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 07:47:14,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:47:15,961 INFO L130 PetriNetUnfolder]: 1951/3486 cut-off events. [2022-12-06 07:47:15,962 INFO L131 PetriNetUnfolder]: For 89588/89588 co-relation queries the response was YES. [2022-12-06 07:47:15,981 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 07:47:15,995 INFO L137 encePairwiseOnDemand]: 26/45 looper letters, 302 selfloop transitions, 107 changer transitions 13/422 dead transitions. [2022-12-06 07:47:15,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 422 transitions, 9104 flow [2022-12-06 07:47:15,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:47:15,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:47:15,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 85 transitions. [2022-12-06 07:47:15,996 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2698412698412698 [2022-12-06 07:47:15,996 INFO L175 Difference]: Start difference. First operand has 216 places, 384 transitions, 7977 flow. Second operand 7 states and 85 transitions. [2022-12-06 07:47:15,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 422 transitions, 9104 flow [2022-12-06 07:47:16,279 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 07:47:16,287 INFO L231 Difference]: Finished difference. Result has 219 places, 385 transitions, 7996 flow [2022-12-06 07:47:16,287 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 07:47:16,288 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 190 predicate places. [2022-12-06 07:47:16,288 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:47:16,288 INFO L89 Accepts]: Start accepts. Operand has 219 places, 385 transitions, 7996 flow [2022-12-06 07:47:16,290 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:47:16,290 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:47:16,290 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 219 places, 385 transitions, 7996 flow [2022-12-06 07:47:16,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 218 places, 385 transitions, 7996 flow [2022-12-06 07:47:16,475 INFO L130 PetriNetUnfolder]: 486/1424 cut-off events. [2022-12-06 07:47:16,475 INFO L131 PetriNetUnfolder]: For 29790/29992 co-relation queries the response was YES. [2022-12-06 07:47:16,481 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 07:47:16,490 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 218 places, 385 transitions, 7996 flow [2022-12-06 07:47:16,490 INFO L188 LiptonReduction]: Number of co-enabled transitions 1844 [2022-12-06 07:47:16,492 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 07:47:16,733 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:47:16,734 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 446 [2022-12-06 07:47:16,734 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 384 transitions, 7990 flow [2022-12-06 07:47:16,734 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 07:47:16,734 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:47:16,734 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 07:47:16,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-12-06 07:47:16,734 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 07:47:16,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:47:16,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1672887372, now seen corresponding path program 1 times [2022-12-06 07:47:16,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:47:16,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827721234] [2022-12-06 07:47:16,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:47:16,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:47:16,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:47:18,306 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 07:47:18,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:47:18,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827721234] [2022-12-06 07:47:18,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827721234] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:47:18,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:47:18,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:47:18,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727697102] [2022-12-06 07:47:18,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:47:18,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:47:18,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:47:18,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:47:18,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:47:18,308 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 07:47:18,308 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 07:47:18,308 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:47:18,308 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 07:47:18,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:47:19,538 INFO L130 PetriNetUnfolder]: 1975/3534 cut-off events. [2022-12-06 07:47:19,538 INFO L131 PetriNetUnfolder]: For 89599/89599 co-relation queries the response was YES. [2022-12-06 07:47:19,554 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 07:47:19,567 INFO L137 encePairwiseOnDemand]: 25/45 looper letters, 300 selfloop transitions, 139 changer transitions 16/455 dead transitions. [2022-12-06 07:47:19,567 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 455 transitions, 9636 flow [2022-12-06 07:47:19,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:47:19,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:47:19,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2022-12-06 07:47:19,568 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2972222222222222 [2022-12-06 07:47:19,568 INFO L175 Difference]: Start difference. First operand has 217 places, 384 transitions, 7990 flow. Second operand 8 states and 107 transitions. [2022-12-06 07:47:19,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 455 transitions, 9636 flow [2022-12-06 07:47:19,840 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 07:47:19,846 INFO L231 Difference]: Finished difference. Result has 221 places, 385 transitions, 8142 flow [2022-12-06 07:47:19,846 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 07:47:19,847 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 192 predicate places. [2022-12-06 07:47:19,847 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:47:19,847 INFO L89 Accepts]: Start accepts. Operand has 221 places, 385 transitions, 8142 flow [2022-12-06 07:47:19,848 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:47:19,848 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:47:19,848 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 221 places, 385 transitions, 8142 flow [2022-12-06 07:47:19,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 219 places, 385 transitions, 8142 flow [2022-12-06 07:47:20,004 INFO L130 PetriNetUnfolder]: 482/1422 cut-off events. [2022-12-06 07:47:20,004 INFO L131 PetriNetUnfolder]: For 31037/31242 co-relation queries the response was YES. [2022-12-06 07:47:20,011 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 07:47:20,022 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 219 places, 385 transitions, 8142 flow [2022-12-06 07:47:20,023 INFO L188 LiptonReduction]: Number of co-enabled transitions 1852 [2022-12-06 07:47:20,024 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 07:47:20,390 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:47:20,391 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 544 [2022-12-06 07:47:20,391 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 385 transitions, 8150 flow [2022-12-06 07:47:20,391 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 07:47:20,391 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:47:20,391 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:47:20,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-12-06 07:47:20,391 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 07:47:20,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:47:20,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1115365228, now seen corresponding path program 1 times [2022-12-06 07:47:20,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:47:20,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195340541] [2022-12-06 07:47:20,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:47:20,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:47:20,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:47:20,975 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 07:47:20,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:47:20,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195340541] [2022-12-06 07:47:20,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195340541] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:47:20,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:47:20,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:47:20,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636416397] [2022-12-06 07:47:20,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:47:20,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:47:20,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:47:20,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:47:20,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:47:20,977 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 07:47:20,977 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 07:47:20,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:47:20,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 07:47:20,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:47:21,878 INFO L130 PetriNetUnfolder]: 1961/3506 cut-off events. [2022-12-06 07:47:21,878 INFO L131 PetriNetUnfolder]: For 94687/94687 co-relation queries the response was YES. [2022-12-06 07:47:21,891 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 07:47:21,904 INFO L137 encePairwiseOnDemand]: 28/44 looper letters, 302 selfloop transitions, 103 changer transitions 14/419 dead transitions. [2022-12-06 07:47:21,904 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 419 transitions, 9244 flow [2022-12-06 07:47:21,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:47:21,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:47:21,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2022-12-06 07:47:21,905 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29924242424242425 [2022-12-06 07:47:21,905 INFO L175 Difference]: Start difference. First operand has 219 places, 385 transitions, 8150 flow. Second operand 6 states and 79 transitions. [2022-12-06 07:47:21,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 419 transitions, 9244 flow [2022-12-06 07:47:22,161 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 07:47:22,167 INFO L231 Difference]: Finished difference. Result has 220 places, 384 transitions, 8113 flow [2022-12-06 07:47:22,168 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 07:47:22,168 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 191 predicate places. [2022-12-06 07:47:22,168 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:47:22,168 INFO L89 Accepts]: Start accepts. Operand has 220 places, 384 transitions, 8113 flow [2022-12-06 07:47:22,169 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:47:22,169 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:47:22,170 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 220 places, 384 transitions, 8113 flow [2022-12-06 07:47:22,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 218 places, 384 transitions, 8113 flow [2022-12-06 07:47:22,327 INFO L130 PetriNetUnfolder]: 475/1403 cut-off events. [2022-12-06 07:47:22,328 INFO L131 PetriNetUnfolder]: For 30618/30798 co-relation queries the response was YES. [2022-12-06 07:47:22,335 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 07:47:22,345 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 218 places, 384 transitions, 8113 flow [2022-12-06 07:47:22,346 INFO L188 LiptonReduction]: Number of co-enabled transitions 1852 [2022-12-06 07:47:22,347 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:47:22,347 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:47:22,347 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 384 transitions, 8113 flow [2022-12-06 07:47:22,347 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 07:47:22,347 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:47:22,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 07:47:22,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-12-06 07:47:22,348 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 07:47:22,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:47:22,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1332687482, now seen corresponding path program 1 times [2022-12-06 07:47:22,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:47:22,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539461333] [2022-12-06 07:47:22,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:47:22,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:47:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:47:22,426 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 07:47:22,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:47:22,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539461333] [2022-12-06 07:47:22,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539461333] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:47:22,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:47:22,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:47:22,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078026592] [2022-12-06 07:47:22,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:47:22,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:47:22,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:47:22,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:47:22,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:47:22,427 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 07:47:22,427 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 07:47:22,427 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:47:22,427 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 07:47:22,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:47:23,523 INFO L130 PetriNetUnfolder]: 2555/4827 cut-off events. [2022-12-06 07:47:23,524 INFO L131 PetriNetUnfolder]: For 112176/112176 co-relation queries the response was YES. [2022-12-06 07:47:23,546 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 07:47:23,563 INFO L137 encePairwiseOnDemand]: 33/43 looper letters, 535 selfloop transitions, 53 changer transitions 6/594 dead transitions. [2022-12-06 07:47:23,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 594 transitions, 12330 flow [2022-12-06 07:47:23,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:47:23,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:47:23,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2022-12-06 07:47:23,566 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4186046511627907 [2022-12-06 07:47:23,566 INFO L175 Difference]: Start difference. First operand has 218 places, 384 transitions, 8113 flow. Second operand 6 states and 108 transitions. [2022-12-06 07:47:23,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 594 transitions, 12330 flow [2022-12-06 07:47:23,970 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 07:47:23,977 INFO L231 Difference]: Finished difference. Result has 219 places, 374 transitions, 7778 flow [2022-12-06 07:47:23,977 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 07:47:23,977 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 190 predicate places. [2022-12-06 07:47:23,977 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:47:23,977 INFO L89 Accepts]: Start accepts. Operand has 219 places, 374 transitions, 7778 flow [2022-12-06 07:47:23,979 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:47:23,979 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:47:23,979 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 219 places, 374 transitions, 7778 flow [2022-12-06 07:47:23,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 219 places, 374 transitions, 7778 flow [2022-12-06 07:47:24,221 INFO L130 PetriNetUnfolder]: 548/1928 cut-off events. [2022-12-06 07:47:24,221 INFO L131 PetriNetUnfolder]: For 34094/34314 co-relation queries the response was YES. [2022-12-06 07:47:24,229 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 07:47:24,242 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 219 places, 374 transitions, 7778 flow [2022-12-06 07:47:24,242 INFO L188 LiptonReduction]: Number of co-enabled transitions 1854 [2022-12-06 07:47:24,243 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:47:24,244 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 267 [2022-12-06 07:47:24,244 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 374 transitions, 7778 flow [2022-12-06 07:47:24,244 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 07:47:24,244 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:47:24,244 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 07:47:24,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-12-06 07:47:24,244 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 07:47:24,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:47:24,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1273808541, now seen corresponding path program 2 times [2022-12-06 07:47:24,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:47:24,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53316977] [2022-12-06 07:47:24,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:47:24,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:47:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:47:25,236 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 07:47:25,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:47:25,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53316977] [2022-12-06 07:47:25,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53316977] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:47:25,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455231862] [2022-12-06 07:47:25,237 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:47:25,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:47:25,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:47:25,238 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 07:47:25,239 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 07:47:25,443 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:47:25,443 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:47:25,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-06 07:47:25,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:47:25,605 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:47:25,606 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 07:47:25,711 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 07:47:25,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:47:25,839 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:47:25,840 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 07:47:26,121 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 07:47:26,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455231862] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:47:26,122 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:47:26,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 19 [2022-12-06 07:47:26,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51385873] [2022-12-06 07:47:26,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:47:26,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 07:47:26,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:47:26,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 07:47:26,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2022-12-06 07:47:26,123 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 07:47:26,123 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 07:47:26,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:47:26,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 07:47:26,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:47:28,438 INFO L130 PetriNetUnfolder]: 2611/4947 cut-off events. [2022-12-06 07:47:28,438 INFO L131 PetriNetUnfolder]: For 117828/117828 co-relation queries the response was YES. [2022-12-06 07:47:28,464 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 07:47:28,482 INFO L137 encePairwiseOnDemand]: 20/43 looper letters, 266 selfloop transitions, 182 changer transitions 16/464 dead transitions. [2022-12-06 07:47:28,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 464 transitions, 9659 flow [2022-12-06 07:47:28,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 07:47:28,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 07:47:28,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 137 transitions. [2022-12-06 07:47:28,484 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24508050089445438 [2022-12-06 07:47:28,484 INFO L175 Difference]: Start difference. First operand has 219 places, 374 transitions, 7778 flow. Second operand 13 states and 137 transitions. [2022-12-06 07:47:28,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 464 transitions, 9659 flow [2022-12-06 07:47:28,970 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 07:47:28,977 INFO L231 Difference]: Finished difference. Result has 232 places, 392 transitions, 8400 flow [2022-12-06 07:47:28,977 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 07:47:28,978 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 203 predicate places. [2022-12-06 07:47:28,978 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:47:28,978 INFO L89 Accepts]: Start accepts. Operand has 232 places, 392 transitions, 8400 flow [2022-12-06 07:47:28,980 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:47:28,981 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:47:28,981 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 232 places, 392 transitions, 8400 flow [2022-12-06 07:47:28,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 231 places, 392 transitions, 8400 flow [2022-12-06 07:47:29,200 INFO L130 PetriNetUnfolder]: 564/1970 cut-off events. [2022-12-06 07:47:29,200 INFO L131 PetriNetUnfolder]: For 36235/36447 co-relation queries the response was YES. [2022-12-06 07:47:29,209 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 07:47:29,224 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 231 places, 392 transitions, 8400 flow [2022-12-06 07:47:29,224 INFO L188 LiptonReduction]: Number of co-enabled transitions 1890 [2022-12-06 07:47:29,225 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:47:29,225 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 247 [2022-12-06 07:47:29,225 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 392 transitions, 8400 flow [2022-12-06 07:47:29,226 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 07:47:29,226 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:47:29,226 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 07:47:29,234 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 07:47:29,426 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 07:47:29,426 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 07:47:29,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:47:29,427 INFO L85 PathProgramCache]: Analyzing trace with hash 505928229, now seen corresponding path program 3 times [2022-12-06 07:47:29,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:47:29,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288649719] [2022-12-06 07:47:29,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:47:29,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:47:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:47:35,311 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 07:47:35,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:47:35,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288649719] [2022-12-06 07:47:35,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288649719] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:47:35,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996342231] [2022-12-06 07:47:35,312 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 07:47:35,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:47:35,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:47:35,313 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 07:47:35,315 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 07:47:35,519 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 07:47:35,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:47:35,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-06 07:47:35,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:47:35,821 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 07:47:35,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:47:36,043 INFO L321 Elim1Store]: treesize reduction 23, result has 14.8 percent of original size [2022-12-06 07:47:36,044 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 07:47:36,270 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 07:47:36,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996342231] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:47:36,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:47:36,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 22 [2022-12-06 07:47:36,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735425868] [2022-12-06 07:47:36,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:47:36,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 07:47:36,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:47:36,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 07:47:36,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2022-12-06 07:47:36,271 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 07:47:36,271 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 07:47:36,272 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:47:36,272 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 07:47:36,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:47:40,547 INFO L130 PetriNetUnfolder]: 3042/5736 cut-off events. [2022-12-06 07:47:40,547 INFO L131 PetriNetUnfolder]: For 138313/138313 co-relation queries the response was YES. [2022-12-06 07:47:40,579 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 07:47:40,603 INFO L137 encePairwiseOnDemand]: 17/43 looper letters, 204 selfloop transitions, 357 changer transitions 14/575 dead transitions. [2022-12-06 07:47:40,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 575 transitions, 11693 flow [2022-12-06 07:47:40,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 07:47:40,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 07:47:40,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 187 transitions. [2022-12-06 07:47:40,605 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21744186046511627 [2022-12-06 07:47:40,605 INFO L175 Difference]: Start difference. First operand has 231 places, 392 transitions, 8400 flow. Second operand 20 states and 187 transitions. [2022-12-06 07:47:40,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 575 transitions, 11693 flow [2022-12-06 07:47:41,244 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 07:47:41,252 INFO L231 Difference]: Finished difference. Result has 250 places, 468 transitions, 10653 flow [2022-12-06 07:47:41,253 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 07:47:41,253 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 221 predicate places. [2022-12-06 07:47:41,253 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:47:41,253 INFO L89 Accepts]: Start accepts. Operand has 250 places, 468 transitions, 10653 flow [2022-12-06 07:47:41,255 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:47:41,255 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:47:41,255 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 250 places, 468 transitions, 10653 flow [2022-12-06 07:47:41,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 249 places, 468 transitions, 10653 flow [2022-12-06 07:47:41,548 INFO L130 PetriNetUnfolder]: 664/2369 cut-off events. [2022-12-06 07:47:41,548 INFO L131 PetriNetUnfolder]: For 48913/49107 co-relation queries the response was YES. [2022-12-06 07:47:41,563 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 07:47:41,582 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 249 places, 468 transitions, 10653 flow [2022-12-06 07:47:41,583 INFO L188 LiptonReduction]: Number of co-enabled transitions 2194 [2022-12-06 07:47:41,584 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:47:41,584 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 331 [2022-12-06 07:47:41,584 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 468 transitions, 10653 flow [2022-12-06 07:47:41,585 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 07:47:41,585 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:47:41,585 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 07:47:41,590 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 07:47:41,785 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 07:47:41,786 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 07:47:41,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:47:41,786 INFO L85 PathProgramCache]: Analyzing trace with hash 307714863, now seen corresponding path program 4 times [2022-12-06 07:47:41,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:47:41,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123918883] [2022-12-06 07:47:41,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:47:41,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:47:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:47:43,505 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 07:47:43,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:47:43,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123918883] [2022-12-06 07:47:43,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123918883] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:47:43,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148177207] [2022-12-06 07:47:43,505 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 07:47:43,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:47:43,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:47:43,507 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 07:47:43,509 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 07:47:43,660 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 07:47:43,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:47:43,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-06 07:47:43,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:47:43,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:47:43,788 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 07:47:43,946 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 07:47:43,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:47:44,124 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 07:47:44,168 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:47:44,169 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 07:47:44,195 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:47:44,196 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 07:47:44,752 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 07:47:44,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148177207] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:47:44,753 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:47:44,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-12-06 07:47:44,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301845806] [2022-12-06 07:47:44,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:47:44,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 07:47:44,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:47:44,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 07:47:44,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=482, Unknown=1, NotChecked=44, Total=600 [2022-12-06 07:47:44,754 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 07:47:44,754 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 07:47:44,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:47:44,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 07:47:44,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:47:47,707 INFO L130 PetriNetUnfolder]: 3040/5748 cut-off events. [2022-12-06 07:47:47,707 INFO L131 PetriNetUnfolder]: For 168727/168727 co-relation queries the response was YES. [2022-12-06 07:47:47,732 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 07:47:47,753 INFO L137 encePairwiseOnDemand]: 19/43 looper letters, 386 selfloop transitions, 142 changer transitions 16/544 dead transitions. [2022-12-06 07:47:47,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 544 transitions, 12470 flow [2022-12-06 07:47:47,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 07:47:47,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 07:47:47,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 128 transitions. [2022-12-06 07:47:47,754 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24806201550387597 [2022-12-06 07:47:47,754 INFO L175 Difference]: Start difference. First operand has 249 places, 468 transitions, 10653 flow. Second operand 12 states and 128 transitions. [2022-12-06 07:47:47,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 544 transitions, 12470 flow [2022-12-06 07:47:48,504 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 07:47:48,512 INFO L231 Difference]: Finished difference. Result has 248 places, 471 transitions, 10193 flow [2022-12-06 07:47:48,512 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 07:47:48,513 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 219 predicate places. [2022-12-06 07:47:48,513 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:47:48,513 INFO L89 Accepts]: Start accepts. Operand has 248 places, 471 transitions, 10193 flow [2022-12-06 07:47:48,515 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:47:48,516 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:47:48,516 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 248 places, 471 transitions, 10193 flow [2022-12-06 07:47:48,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 247 places, 471 transitions, 10193 flow [2022-12-06 07:47:48,786 INFO L130 PetriNetUnfolder]: 662/2355 cut-off events. [2022-12-06 07:47:48,786 INFO L131 PetriNetUnfolder]: For 43540/43756 co-relation queries the response was YES. [2022-12-06 07:47:48,797 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 07:47:48,813 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 247 places, 471 transitions, 10193 flow [2022-12-06 07:47:48,814 INFO L188 LiptonReduction]: Number of co-enabled transitions 2218 [2022-12-06 07:47:48,815 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:47:48,815 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 302 [2022-12-06 07:47:48,815 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 471 transitions, 10193 flow [2022-12-06 07:47:48,815 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 07:47:48,816 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:47:48,816 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 07:47:48,821 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 07:47:49,016 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 07:47:49,016 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 07:47:49,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:47:49,017 INFO L85 PathProgramCache]: Analyzing trace with hash 243654579, now seen corresponding path program 5 times [2022-12-06 07:47:49,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:47:49,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532215499] [2022-12-06 07:47:49,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:47:49,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:47:49,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:47:50,145 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 07:47:50,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:47:50,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532215499] [2022-12-06 07:47:50,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532215499] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:47:50,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445850285] [2022-12-06 07:47:50,145 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 07:47:50,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:47:50,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:47:50,147 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 07:47:50,148 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 07:47:50,299 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:47:50,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:47:50,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-06 07:47:50,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:47:50,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:47:50,425 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 07:47:50,535 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 07:47:50,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:47:52,740 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-06 07:47:52,740 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 07:47:52,760 INFO L321 Elim1Store]: treesize reduction 23, result has 14.8 percent of original size [2022-12-06 07:47:52,761 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 07:47:52,903 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 07:47:52,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445850285] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:47:52,904 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:47:52,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-12-06 07:47:52,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42437648] [2022-12-06 07:47:52,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:47:52,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-06 07:47:52,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:47:52,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-06 07:47:52,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=537, Unknown=1, NotChecked=0, Total=650 [2022-12-06 07:47:52,905 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 07:47:52,905 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 07:47:52,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:47:52,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 07:47:52,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:48:04,821 INFO L130 PetriNetUnfolder]: 3153/6022 cut-off events. [2022-12-06 07:48:04,821 INFO L131 PetriNetUnfolder]: For 148321/148321 co-relation queries the response was YES. [2022-12-06 07:48:04,856 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 07:48:04,881 INFO L137 encePairwiseOnDemand]: 16/43 looper letters, 343 selfloop transitions, 321 changer transitions 18/682 dead transitions. [2022-12-06 07:48:04,882 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 682 transitions, 14097 flow [2022-12-06 07:48:04,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-06 07:48:04,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-06 07:48:04,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 228 transitions. [2022-12-06 07:48:04,883 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1893687707641196 [2022-12-06 07:48:04,883 INFO L175 Difference]: Start difference. First operand has 247 places, 471 transitions, 10193 flow. Second operand 28 states and 228 transitions. [2022-12-06 07:48:04,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 682 transitions, 14097 flow [2022-12-06 07:48:05,603 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 07:48:05,613 INFO L231 Difference]: Finished difference. Result has 276 places, 514 transitions, 11626 flow [2022-12-06 07:48:05,613 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 07:48:05,613 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 247 predicate places. [2022-12-06 07:48:05,614 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:48:05,614 INFO L89 Accepts]: Start accepts. Operand has 276 places, 514 transitions, 11626 flow [2022-12-06 07:48:05,616 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:48:05,616 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:48:05,616 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 276 places, 514 transitions, 11626 flow [2022-12-06 07:48:05,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 275 places, 514 transitions, 11626 flow [2022-12-06 07:48:05,917 INFO L130 PetriNetUnfolder]: 672/2487 cut-off events. [2022-12-06 07:48:05,918 INFO L131 PetriNetUnfolder]: For 48796/48978 co-relation queries the response was YES. [2022-12-06 07:48:05,931 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 07:48:05,950 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 275 places, 514 transitions, 11626 flow [2022-12-06 07:48:05,950 INFO L188 LiptonReduction]: Number of co-enabled transitions 2388 [2022-12-06 07:48:05,952 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:48:05,952 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 338 [2022-12-06 07:48:05,952 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 514 transitions, 11626 flow [2022-12-06 07:48:05,953 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 07:48:05,953 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:48:05,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 07:48:05,958 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 07:48:06,153 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 07:48:06,153 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 07:48:06,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:48:06,154 INFO L85 PathProgramCache]: Analyzing trace with hash -2064700453, now seen corresponding path program 6 times [2022-12-06 07:48:06,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:48:06,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193873503] [2022-12-06 07:48:06,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:48:06,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:48:06,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:48:07,435 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 07:48:07,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:48:07,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193873503] [2022-12-06 07:48:07,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193873503] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:48:07,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399097897] [2022-12-06 07:48:07,435 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 07:48:07,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:48:07,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:48:07,440 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 07:48:07,441 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 07:48:07,625 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-06 07:48:07,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:48:07,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-06 07:48:07,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:48:07,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:48:07,762 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 07:48:07,862 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 07:48:07,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:48:07,962 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2361 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2361) c_~queue~0.base))) (or (not (= (mod (select .cse0 (+ (* c_~end~0 4) c_~queue~0.offset)) 4294967296) (mod |c_thread2Thread1of1ForFork0_~x~1#1| 4294967296))) (let ((.cse1 (* c_~start~0 4))) (= (mod (select .cse0 (+ .cse1 c_~queue~0.offset 4)) 4294967296) (mod (select .cse0 (+ .cse1 c_~queue~0.offset)) 4294967296)))))) is different from false [2022-12-06 07:48:08,002 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:48:08,002 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 07:48:08,024 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:48:08,025 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 07:48:08,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 07:48:08,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399097897] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:48:08,302 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:48:08,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-12-06 07:48:08,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385806638] [2022-12-06 07:48:08,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:48:08,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 07:48:08,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:48:08,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 07:48:08,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=478, Unknown=1, NotChecked=44, Total=600 [2022-12-06 07:48:08,303 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 07:48:08,303 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 07:48:08,304 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:48:08,304 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 07:48:08,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:48:10,902 INFO L130 PetriNetUnfolder]: 3177/6066 cut-off events. [2022-12-06 07:48:10,902 INFO L131 PetriNetUnfolder]: For 168294/168294 co-relation queries the response was YES. [2022-12-06 07:48:10,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52377 conditions, 6066 events. 3177/6066 cut-off events. For 168294/168294 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 45375 event pairs, 681 based on Foata normal form. 4/6070 useless extension candidates. Maximal degree in co-relation 52159. Up to 4552 conditions per place. [2022-12-06 07:48:10,957 INFO L137 encePairwiseOnDemand]: 19/43 looper letters, 427 selfloop transitions, 163 changer transitions 20/610 dead transitions. [2022-12-06 07:48:10,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 610 transitions, 13923 flow [2022-12-06 07:48:10,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 07:48:10,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 07:48:10,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 142 transitions. [2022-12-06 07:48:10,958 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23588039867109634 [2022-12-06 07:48:10,958 INFO L175 Difference]: Start difference. First operand has 275 places, 514 transitions, 11626 flow. Second operand 14 states and 142 transitions. [2022-12-06 07:48:10,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 610 transitions, 13923 flow [2022-12-06 07:48:11,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 610 transitions, 13127 flow, removed 111 selfloop flow, removed 18 redundant places. [2022-12-06 07:48:11,687 INFO L231 Difference]: Finished difference. Result has 273 places, 518 transitions, 11324 flow [2022-12-06 07:48:11,687 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=14, PETRI_FLOW=11324, PETRI_PLACES=273, PETRI_TRANSITIONS=518} [2022-12-06 07:48:11,687 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 244 predicate places. [2022-12-06 07:48:11,687 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:48:11,687 INFO L89 Accepts]: Start accepts. Operand has 273 places, 518 transitions, 11324 flow [2022-12-06 07:48:11,689 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:48:11,690 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:48:11,690 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 273 places, 518 transitions, 11324 flow [2022-12-06 07:48:11,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 272 places, 518 transitions, 11324 flow [2022-12-06 07:48:11,999 INFO L130 PetriNetUnfolder]: 678/2530 cut-off events. [2022-12-06 07:48:11,999 INFO L131 PetriNetUnfolder]: For 44475/44683 co-relation queries the response was YES. [2022-12-06 07:48:12,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17380 conditions, 2530 events. 678/2530 cut-off events. For 44475/44683 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 25828 event pairs, 18 based on Foata normal form. 27/2495 useless extension candidates. Maximal degree in co-relation 17208. Up to 378 conditions per place. [2022-12-06 07:48:12,036 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 272 places, 518 transitions, 11324 flow [2022-12-06 07:48:12,036 INFO L188 LiptonReduction]: Number of co-enabled transitions 2420 [2022-12-06 07:48:12,038 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:48:12,039 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 352 [2022-12-06 07:48:12,039 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 518 transitions, 11324 flow [2022-12-06 07:48:12,039 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 07:48:12,039 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:48:12,039 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 07:48:12,045 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 07:48:12,239 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 07:48:12,240 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 07:48:12,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:48:12,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1854349095, now seen corresponding path program 7 times [2022-12-06 07:48:12,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:48:12,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988019053] [2022-12-06 07:48:12,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:48:12,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:48:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:48:13,499 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 07:48:13,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:48:13,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988019053] [2022-12-06 07:48:13,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988019053] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:48:13,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525901085] [2022-12-06 07:48:13,501 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 07:48:13,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:48:13,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:48:13,502 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 07:48:13,521 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 07:48:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:48:13,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-06 07:48:13,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:48:13,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:48:13,885 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 07:48:13,962 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 07:48:13,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:48:14,241 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-06 07:48:14,242 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 07:48:14,259 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:48:14,259 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 07:48:14,372 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 07:48:14,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525901085] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:48:14,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:48:14,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-12-06 07:48:14,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101020511] [2022-12-06 07:48:14,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:48:14,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-06 07:48:14,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:48:14,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-06 07:48:14,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=537, Unknown=1, NotChecked=0, Total=650 [2022-12-06 07:48:14,374 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 07:48:14,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 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 07:48:14,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:48:14,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 07:48:14,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:48:17,858 INFO L130 PetriNetUnfolder]: 3166/6044 cut-off events. [2022-12-06 07:48:17,858 INFO L131 PetriNetUnfolder]: For 153459/153459 co-relation queries the response was YES. [2022-12-06 07:48:17,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51175 conditions, 6044 events. 3166/6044 cut-off events. For 153459/153459 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 45224 event pairs, 408 based on Foata normal form. 3/6047 useless extension candidates. Maximal degree in co-relation 50959. Up to 1371 conditions per place. [2022-12-06 07:48:17,918 INFO L137 encePairwiseOnDemand]: 17/43 looper letters, 326 selfloop transitions, 311 changer transitions 23/660 dead transitions. [2022-12-06 07:48:17,918 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 660 transitions, 14077 flow [2022-12-06 07:48:17,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 07:48:17,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 07:48:17,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 197 transitions. [2022-12-06 07:48:17,919 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21816168327796234 [2022-12-06 07:48:17,919 INFO L175 Difference]: Start difference. First operand has 272 places, 518 transitions, 11324 flow. Second operand 21 states and 197 transitions. [2022-12-06 07:48:17,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 660 transitions, 14077 flow [2022-12-06 07:48:18,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 660 transitions, 13782 flow, removed 10 selfloop flow, removed 14 redundant places. [2022-12-06 07:48:18,691 INFO L231 Difference]: Finished difference. Result has 283 places, 526 transitions, 12010 flow [2022-12-06 07:48:18,691 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=11029, PETRI_DIFFERENCE_MINUEND_PLACES=258, 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=12010, PETRI_PLACES=283, PETRI_TRANSITIONS=526} [2022-12-06 07:48:18,691 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 254 predicate places. [2022-12-06 07:48:18,691 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:48:18,691 INFO L89 Accepts]: Start accepts. Operand has 283 places, 526 transitions, 12010 flow [2022-12-06 07:48:18,694 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:48:18,694 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:48:18,694 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 283 places, 526 transitions, 12010 flow [2022-12-06 07:48:18,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 280 places, 526 transitions, 12010 flow [2022-12-06 07:48:19,085 INFO L130 PetriNetUnfolder]: 668/2492 cut-off events. [2022-12-06 07:48:19,085 INFO L131 PetriNetUnfolder]: For 47941/48117 co-relation queries the response was YES. [2022-12-06 07:48:19,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17903 conditions, 2492 events. 668/2492 cut-off events. For 47941/48117 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 25232 event pairs, 19 based on Foata normal form. 26/2471 useless extension candidates. Maximal degree in co-relation 17727. Up to 370 conditions per place. [2022-12-06 07:48:19,115 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 280 places, 526 transitions, 12010 flow [2022-12-06 07:48:19,116 INFO L188 LiptonReduction]: Number of co-enabled transitions 2488 [2022-12-06 07:48:19,117 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:48:19,117 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 426 [2022-12-06 07:48:19,117 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 526 transitions, 12010 flow [2022-12-06 07:48:19,117 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 07:48:19,117 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:48:19,117 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 07:48:19,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-06 07:48:19,318 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 07:48:19,318 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 07:48:19,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:48:19,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1589529119, now seen corresponding path program 8 times [2022-12-06 07:48:19,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:48:19,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851324858] [2022-12-06 07:48:19,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:48:19,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:48:19,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:48:20,112 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 07:48:20,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:48:20,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851324858] [2022-12-06 07:48:20,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851324858] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:48:20,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634959863] [2022-12-06 07:48:20,113 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:48:20,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:48:20,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:48:20,114 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 07:48:20,116 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 07:48:20,312 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:48:20,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:48:20,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-06 07:48:20,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:48:20,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:48:20,471 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 07:48:20,535 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 07:48:20,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:48:20,718 INFO L321 Elim1Store]: treesize reduction 23, result has 14.8 percent of original size [2022-12-06 07:48:20,719 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 07:48:20,725 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:48:20,725 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 07:48:20,869 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 07:48:20,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634959863] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:48:20,870 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:48:20,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-12-06 07:48:20,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107312539] [2022-12-06 07:48:20,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:48:20,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-06 07:48:20,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:48:20,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-06 07:48:20,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=544, Unknown=1, NotChecked=0, Total=650 [2022-12-06 07:48:20,870 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 07:48:20,871 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 526 transitions, 12010 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 07:48:20,871 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:48:20,871 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 07:48:20,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:48:25,471 INFO L130 PetriNetUnfolder]: 3261/6204 cut-off events. [2022-12-06 07:48:25,471 INFO L131 PetriNetUnfolder]: For 178795/178795 co-relation queries the response was YES. [2022-12-06 07:48:25,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55216 conditions, 6204 events. 3261/6204 cut-off events. For 178795/178795 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 46495 event pairs, 477 based on Foata normal form. 4/6208 useless extension candidates. Maximal degree in co-relation 54996. Up to 1371 conditions per place. [2022-12-06 07:48:25,552 INFO L137 encePairwiseOnDemand]: 17/43 looper letters, 366 selfloop transitions, 316 changer transitions 28/710 dead transitions. [2022-12-06 07:48:25,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 710 transitions, 15640 flow [2022-12-06 07:48:25,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-06 07:48:25,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-06 07:48:25,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 235 transitions. [2022-12-06 07:48:25,554 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1884522854851644 [2022-12-06 07:48:25,554 INFO L175 Difference]: Start difference. First operand has 280 places, 526 transitions, 12010 flow. Second operand 29 states and 235 transitions. [2022-12-06 07:48:25,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 710 transitions, 15640 flow [2022-12-06 07:48:26,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 710 transitions, 15358 flow, removed 30 selfloop flow, removed 11 redundant places. [2022-12-06 07:48:26,490 INFO L231 Difference]: Finished difference. Result has 302 places, 548 transitions, 12958 flow [2022-12-06 07:48:26,491 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=11744, PETRI_DIFFERENCE_MINUEND_PLACES=269, 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=12958, PETRI_PLACES=302, PETRI_TRANSITIONS=548} [2022-12-06 07:48:26,491 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 273 predicate places. [2022-12-06 07:48:26,491 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:48:26,491 INFO L89 Accepts]: Start accepts. Operand has 302 places, 548 transitions, 12958 flow [2022-12-06 07:48:26,495 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:48:26,495 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:48:26,495 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 302 places, 548 transitions, 12958 flow [2022-12-06 07:48:26,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 299 places, 548 transitions, 12958 flow [2022-12-06 07:48:26,889 INFO L130 PetriNetUnfolder]: 691/2506 cut-off events. [2022-12-06 07:48:26,889 INFO L131 PetriNetUnfolder]: For 50663/50849 co-relation queries the response was YES. [2022-12-06 07:48:26,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18835 conditions, 2506 events. 691/2506 cut-off events. For 50663/50849 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 25148 event pairs, 21 based on Foata normal form. 26/2483 useless extension candidates. Maximal degree in co-relation 18654. Up to 377 conditions per place. [2022-12-06 07:48:26,928 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 299 places, 548 transitions, 12958 flow [2022-12-06 07:48:26,928 INFO L188 LiptonReduction]: Number of co-enabled transitions 2562 [2022-12-06 07:48:26,930 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:48:26,931 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 440 [2022-12-06 07:48:26,931 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 548 transitions, 12958 flow [2022-12-06 07:48:26,931 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 07:48:26,931 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:48:26,931 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 07:48:26,937 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 07:48:27,134 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 07:48:27,135 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 07:48:27,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:48:27,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1177154903, now seen corresponding path program 1 times [2022-12-06 07:48:27,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:48:27,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214855317] [2022-12-06 07:48:27,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:48:27,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:48:27,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:48:27,186 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 07:48:27,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:48:27,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214855317] [2022-12-06 07:48:27,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214855317] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:48:27,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:48:27,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:48:27,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059050517] [2022-12-06 07:48:27,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:48:27,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:48:27,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:48:27,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:48:27,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:48:27,187 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 07:48:27,187 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 548 transitions, 12958 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 07:48:27,187 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:48:27,187 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 07:48:27,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:48:28,746 INFO L130 PetriNetUnfolder]: 3198/6006 cut-off events. [2022-12-06 07:48:28,746 INFO L131 PetriNetUnfolder]: For 180554/180554 co-relation queries the response was YES. [2022-12-06 07:48:28,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55148 conditions, 6006 events. 3198/6006 cut-off events. For 180554/180554 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 44078 event pairs, 838 based on Foata normal form. 6/6012 useless extension candidates. Maximal degree in co-relation 54929. Up to 3695 conditions per place. [2022-12-06 07:48:28,810 INFO L137 encePairwiseOnDemand]: 29/43 looper letters, 510 selfloop transitions, 95 changer transitions 5/610 dead transitions. [2022-12-06 07:48:28,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 610 transitions, 15147 flow [2022-12-06 07:48:28,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:48:28,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:48:28,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-12-06 07:48:28,811 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38953488372093026 [2022-12-06 07:48:28,812 INFO L175 Difference]: Start difference. First operand has 299 places, 548 transitions, 12958 flow. Second operand 4 states and 67 transitions. [2022-12-06 07:48:28,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 610 transitions, 15147 flow [2022-12-06 07:48:29,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 610 transitions, 14537 flow, removed 52 selfloop flow, removed 21 redundant places. [2022-12-06 07:48:29,647 INFO L231 Difference]: Finished difference. Result has 281 places, 540 transitions, 12391 flow [2022-12-06 07:48:29,648 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=12246, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=12391, PETRI_PLACES=281, PETRI_TRANSITIONS=540} [2022-12-06 07:48:29,648 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 252 predicate places. [2022-12-06 07:48:29,648 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:48:29,648 INFO L89 Accepts]: Start accepts. Operand has 281 places, 540 transitions, 12391 flow [2022-12-06 07:48:29,651 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:48:29,651 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:48:29,651 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 281 places, 540 transitions, 12391 flow [2022-12-06 07:48:29,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 281 places, 540 transitions, 12391 flow [2022-12-06 07:48:30,048 INFO L130 PetriNetUnfolder]: 690/2488 cut-off events. [2022-12-06 07:48:30,048 INFO L131 PetriNetUnfolder]: For 48042/48213 co-relation queries the response was YES. [2022-12-06 07:48:30,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18241 conditions, 2488 events. 690/2488 cut-off events. For 48042/48213 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 24985 event pairs, 18 based on Foata normal form. 21/2451 useless extension candidates. Maximal degree in co-relation 17950. Up to 379 conditions per place. [2022-12-06 07:48:30,083 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 281 places, 540 transitions, 12391 flow [2022-12-06 07:48:30,083 INFO L188 LiptonReduction]: Number of co-enabled transitions 2522 [2022-12-06 07:48:30,084 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:48:30,085 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 437 [2022-12-06 07:48:30,085 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 540 transitions, 12391 flow [2022-12-06 07:48:30,085 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 07:48:30,085 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:48:30,085 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 07:48:30,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-12-06 07:48:30,085 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 07:48:30,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:48:30,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1333794509, now seen corresponding path program 9 times [2022-12-06 07:48:30,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:48:30,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120810027] [2022-12-06 07:48:30,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:48:30,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:48:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:48:31,346 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 07:48:31,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:48:31,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120810027] [2022-12-06 07:48:31,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120810027] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:48:31,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843786759] [2022-12-06 07:48:31,347 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 07:48:31,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:48:31,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:48:31,348 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 07:48:31,350 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 07:48:31,552 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 07:48:31,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:48:31,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-06 07:48:31,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:48:31,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:48:31,724 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 07:48:31,811 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 07:48:31,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:48:32,029 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-06 07:48:32,030 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 07:48:32,042 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:48:32,043 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 07:48:32,197 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 07:48:32,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843786759] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:48:32,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:48:32,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-12-06 07:48:32,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115044586] [2022-12-06 07:48:32,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:48:32,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-06 07:48:32,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:48:32,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-06 07:48:32,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=540, Unknown=1, NotChecked=0, Total=650 [2022-12-06 07:48:32,198 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 07:48:32,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 540 transitions, 12391 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 07:48:32,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:48:32,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 07:48:32,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:48:36,798 INFO L130 PetriNetUnfolder]: 3194/6023 cut-off events. [2022-12-06 07:48:36,798 INFO L131 PetriNetUnfolder]: For 169583/169583 co-relation queries the response was YES. [2022-12-06 07:48:36,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53626 conditions, 6023 events. 3194/6023 cut-off events. For 169583/169583 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 44295 event pairs, 485 based on Foata normal form. 4/6027 useless extension candidates. Maximal degree in co-relation 52820. Up to 1400 conditions per place. [2022-12-06 07:48:36,853 INFO L137 encePairwiseOnDemand]: 15/42 looper letters, 386 selfloop transitions, 277 changer transitions 20/683 dead transitions. [2022-12-06 07:48:36,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 683 transitions, 15236 flow [2022-12-06 07:48:36,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-06 07:48:36,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-06 07:48:36,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 214 transitions. [2022-12-06 07:48:36,854 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.18871252204585537 [2022-12-06 07:48:36,855 INFO L175 Difference]: Start difference. First operand has 281 places, 540 transitions, 12391 flow. Second operand 27 states and 214 transitions. [2022-12-06 07:48:36,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 683 transitions, 15236 flow [2022-12-06 07:48:37,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 683 transitions, 15078 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-06 07:48:37,630 INFO L231 Difference]: Finished difference. Result has 306 places, 532 transitions, 12572 flow [2022-12-06 07:48:37,630 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=12243, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=277, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=12572, PETRI_PLACES=306, PETRI_TRANSITIONS=532} [2022-12-06 07:48:37,630 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 277 predicate places. [2022-12-06 07:48:37,631 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:48:37,631 INFO L89 Accepts]: Start accepts. Operand has 306 places, 532 transitions, 12572 flow [2022-12-06 07:48:37,633 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:48:37,633 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:48:37,633 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 306 places, 532 transitions, 12572 flow [2022-12-06 07:48:37,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 303 places, 532 transitions, 12572 flow [2022-12-06 07:48:37,945 INFO L130 PetriNetUnfolder]: 681/2423 cut-off events. [2022-12-06 07:48:37,945 INFO L131 PetriNetUnfolder]: For 49274/49435 co-relation queries the response was YES. [2022-12-06 07:48:37,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18456 conditions, 2423 events. 681/2423 cut-off events. For 49274/49435 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 23954 event pairs, 21 based on Foata normal form. 24/2397 useless extension candidates. Maximal degree in co-relation 18282. Up to 370 conditions per place. [2022-12-06 07:48:37,979 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 303 places, 532 transitions, 12572 flow [2022-12-06 07:48:37,979 INFO L188 LiptonReduction]: Number of co-enabled transitions 2486 [2022-12-06 07:48:37,981 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:48:37,981 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 351 [2022-12-06 07:48:37,981 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 532 transitions, 12572 flow [2022-12-06 07:48:37,981 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 07:48:37,981 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:48:37,981 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 07:48:37,987 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 07:48:38,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:48:38,182 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 07:48:38,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:48:38,182 INFO L85 PathProgramCache]: Analyzing trace with hash 967847853, now seen corresponding path program 1 times [2022-12-06 07:48:38,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:48:38,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140669391] [2022-12-06 07:48:38,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:48:38,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:48:38,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:48:39,236 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 07:48:39,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:48:39,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140669391] [2022-12-06 07:48:39,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140669391] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:48:39,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118736508] [2022-12-06 07:48:39,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:48:39,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:48:39,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:48:39,239 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 07:48:39,240 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 07:48:39,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:48:39,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-06 07:48:39,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:48:39,623 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 07:48:39,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:48:39,811 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-06 07:48:39,811 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 07:48:39,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 07:48:39,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118736508] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:48:39,898 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:48:39,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-12-06 07:48:39,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240410127] [2022-12-06 07:48:39,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:48:39,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 07:48:39,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:48:39,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 07:48:39,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2022-12-06 07:48:39,899 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 07:48:39,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 532 transitions, 12572 flow. Second operand has 21 states, 20 states have (on average 2.65) internal successors, (53), 21 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 07:48:39,899 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:48:39,899 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 07:48:39,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:48:42,978 INFO L130 PetriNetUnfolder]: 3360/6285 cut-off events. [2022-12-06 07:48:42,978 INFO L131 PetriNetUnfolder]: For 185122/185122 co-relation queries the response was YES. [2022-12-06 07:48:43,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57806 conditions, 6285 events. 3360/6285 cut-off events. For 185122/185122 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 46422 event pairs, 270 based on Foata normal form. 1/6286 useless extension candidates. Maximal degree in co-relation 57590. Up to 1211 conditions per place. [2022-12-06 07:48:43,192 INFO L137 encePairwiseOnDemand]: 18/42 looper letters, 258 selfloop transitions, 412 changer transitions 13/683 dead transitions. [2022-12-06 07:48:43,192 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 683 transitions, 15861 flow [2022-12-06 07:48:43,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 07:48:43,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 07:48:43,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 188 transitions. [2022-12-06 07:48:43,193 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22380952380952382 [2022-12-06 07:48:43,193 INFO L175 Difference]: Start difference. First operand has 303 places, 532 transitions, 12572 flow. Second operand 20 states and 188 transitions. [2022-12-06 07:48:43,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 683 transitions, 15861 flow [2022-12-06 07:48:44,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 683 transitions, 15318 flow, removed 1 selfloop flow, removed 21 redundant places. [2022-12-06 07:48:44,160 INFO L231 Difference]: Finished difference. Result has 308 places, 584 transitions, 14477 flow [2022-12-06 07:48:44,161 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=12062, PETRI_DIFFERENCE_MINUEND_PLACES=282, 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=20, PETRI_FLOW=14477, PETRI_PLACES=308, PETRI_TRANSITIONS=584} [2022-12-06 07:48:44,161 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 279 predicate places. [2022-12-06 07:48:44,161 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:48:44,161 INFO L89 Accepts]: Start accepts. Operand has 308 places, 584 transitions, 14477 flow [2022-12-06 07:48:44,164 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:48:44,164 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:48:44,165 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 308 places, 584 transitions, 14477 flow [2022-12-06 07:48:44,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 307 places, 584 transitions, 14477 flow [2022-12-06 07:48:44,547 INFO L130 PetriNetUnfolder]: 731/2627 cut-off events. [2022-12-06 07:48:44,547 INFO L131 PetriNetUnfolder]: For 59695/59885 co-relation queries the response was YES. [2022-12-06 07:48:44,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20858 conditions, 2627 events. 731/2627 cut-off events. For 59695/59885 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 26580 event pairs, 21 based on Foata normal form. 15/2581 useless extension candidates. Maximal degree in co-relation 20680. Up to 416 conditions per place. [2022-12-06 07:48:44,585 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 307 places, 584 transitions, 14477 flow [2022-12-06 07:48:44,585 INFO L188 LiptonReduction]: Number of co-enabled transitions 2762 [2022-12-06 07:48:44,727 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 07:48:44,876 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 07:48:45,050 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 07:48:45,203 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:48:45,203 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1042 [2022-12-06 07:48:45,204 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 582 transitions, 14484 flow [2022-12-06 07:48:45,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.65) internal successors, (53), 21 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 07:48:45,204 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:48:45,204 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 07:48:45,217 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 07:48:45,409 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 07:48:45,410 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 07:48:45,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:48:45,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1035103645, now seen corresponding path program 1 times [2022-12-06 07:48:45,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:48:45,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442618176] [2022-12-06 07:48:45,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:48:45,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:48:45,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:48:45,500 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 07:48:45,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:48:45,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442618176] [2022-12-06 07:48:45,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442618176] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:48:45,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638573296] [2022-12-06 07:48:45,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:48:45,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:48:45,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:48:45,502 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 07:48:45,504 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 07:48:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:48:45,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 07:48:45,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:48:45,767 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 07:48:45,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:48:45,803 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 07:48:45,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638573296] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:48:45,803 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:48:45,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2022-12-06 07:48:45,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220772156] [2022-12-06 07:48:45,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:48:45,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:48:45,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:48:45,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:48:45,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:48:45,804 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 07:48:45,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 582 transitions, 14484 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 07:48:45,804 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:48:45,804 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 07:48:45,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:48:48,264 INFO L130 PetriNetUnfolder]: 4205/7827 cut-off events. [2022-12-06 07:48:48,264 INFO L131 PetriNetUnfolder]: For 273758/273758 co-relation queries the response was YES. [2022-12-06 07:48:48,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76335 conditions, 7827 events. 4205/7827 cut-off events. For 273758/273758 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 59852 event pairs, 1121 based on Foata normal form. 117/7944 useless extension candidates. Maximal degree in co-relation 76103. Up to 6238 conditions per place. [2022-12-06 07:48:48,345 INFO L137 encePairwiseOnDemand]: 38/46 looper letters, 770 selfloop transitions, 74 changer transitions 0/844 dead transitions. [2022-12-06 07:48:48,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 844 transitions, 21612 flow [2022-12-06 07:48:48,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 07:48:48,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 07:48:48,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 140 transitions. [2022-12-06 07:48:48,346 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2766798418972332 [2022-12-06 07:48:48,346 INFO L175 Difference]: Start difference. First operand has 305 places, 582 transitions, 14484 flow. Second operand 11 states and 140 transitions. [2022-12-06 07:48:48,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 844 transitions, 21612 flow [2022-12-06 07:48:49,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 844 transitions, 20835 flow, removed 135 selfloop flow, removed 10 redundant places. [2022-12-06 07:48:49,930 INFO L231 Difference]: Finished difference. Result has 313 places, 650 transitions, 15717 flow [2022-12-06 07:48:49,931 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=13874, PETRI_DIFFERENCE_MINUEND_PLACES=295, 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=15717, PETRI_PLACES=313, PETRI_TRANSITIONS=650} [2022-12-06 07:48:49,931 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 284 predicate places. [2022-12-06 07:48:49,931 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:48:49,931 INFO L89 Accepts]: Start accepts. Operand has 313 places, 650 transitions, 15717 flow [2022-12-06 07:48:49,933 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:48:49,933 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:48:49,933 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 313 places, 650 transitions, 15717 flow [2022-12-06 07:48:49,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 313 places, 650 transitions, 15717 flow [2022-12-06 07:48:50,458 INFO L130 PetriNetUnfolder]: 919/3327 cut-off events. [2022-12-06 07:48:50,458 INFO L131 PetriNetUnfolder]: For 79120/79342 co-relation queries the response was YES. [2022-12-06 07:48:50,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25845 conditions, 3327 events. 919/3327 cut-off events. For 79120/79342 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 35764 event pairs, 28 based on Foata normal form. 15/3275 useless extension candidates. Maximal degree in co-relation 25532. Up to 567 conditions per place. [2022-12-06 07:48:50,507 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 313 places, 650 transitions, 15717 flow [2022-12-06 07:48:50,507 INFO L188 LiptonReduction]: Number of co-enabled transitions 3152 [2022-12-06 07:48:50,690 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:48:50,690 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 759 [2022-12-06 07:48:50,690 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 650 transitions, 15741 flow [2022-12-06 07:48:50,691 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 07:48:50,691 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:48:50,691 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 07:48:50,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-06 07:48:50,891 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 07:48:50,891 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 07:48:50,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:48:50,892 INFO L85 PathProgramCache]: Analyzing trace with hash 532494216, now seen corresponding path program 1 times [2022-12-06 07:48:50,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:48:50,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080598016] [2022-12-06 07:48:50,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:48:50,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:48:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:48:52,281 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 07:48:52,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:48:52,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080598016] [2022-12-06 07:48:52,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080598016] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:48:52,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:48:52,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 07:48:52,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33343456] [2022-12-06 07:48:52,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:48:52,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:48:52,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:48:52,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:48:52,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:48:52,283 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 07:48:52,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 650 transitions, 15741 flow. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 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 07:48:52,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:48:52,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 07:48:52,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:48:55,184 INFO L130 PetriNetUnfolder]: 4209/7845 cut-off events. [2022-12-06 07:48:55,184 INFO L131 PetriNetUnfolder]: For 275368/275368 co-relation queries the response was YES. [2022-12-06 07:48:55,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75070 conditions, 7845 events. 4209/7845 cut-off events. For 275368/275368 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 59851 event pairs, 946 based on Foata normal form. 1/7846 useless extension candidates. Maximal degree in co-relation 74236. Up to 6172 conditions per place. [2022-12-06 07:48:55,270 INFO L137 encePairwiseOnDemand]: 26/46 looper letters, 561 selfloop transitions, 116 changer transitions 16/693 dead transitions. [2022-12-06 07:48:55,270 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 693 transitions, 17574 flow [2022-12-06 07:48:55,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:48:55,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:48:55,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2022-12-06 07:48:55,271 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2608695652173913 [2022-12-06 07:48:55,271 INFO L175 Difference]: Start difference. First operand has 313 places, 650 transitions, 15741 flow. Second operand 8 states and 96 transitions. [2022-12-06 07:48:55,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 693 transitions, 17574 flow [2022-12-06 07:48:56,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 693 transitions, 17204 flow, removed 182 selfloop flow, removed 2 redundant places. [2022-12-06 07:48:56,903 INFO L231 Difference]: Finished difference. Result has 320 places, 647 transitions, 15559 flow [2022-12-06 07:48:56,904 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=15391, PETRI_DIFFERENCE_MINUEND_PLACES=311, 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=15559, PETRI_PLACES=320, PETRI_TRANSITIONS=647} [2022-12-06 07:48:56,904 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 291 predicate places. [2022-12-06 07:48:56,904 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:48:56,904 INFO L89 Accepts]: Start accepts. Operand has 320 places, 647 transitions, 15559 flow [2022-12-06 07:48:56,908 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:48:56,908 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:48:56,908 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 320 places, 647 transitions, 15559 flow [2022-12-06 07:48:56,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 318 places, 647 transitions, 15559 flow [2022-12-06 07:48:57,456 INFO L130 PetriNetUnfolder]: 919/3278 cut-off events. [2022-12-06 07:48:57,456 INFO L131 PetriNetUnfolder]: For 79802/79998 co-relation queries the response was YES. [2022-12-06 07:48:57,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25764 conditions, 3278 events. 919/3278 cut-off events. For 79802/79998 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 34725 event pairs, 29 based on Foata normal form. 11/3217 useless extension candidates. Maximal degree in co-relation 25598. Up to 568 conditions per place. [2022-12-06 07:48:57,504 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 318 places, 647 transitions, 15559 flow [2022-12-06 07:48:57,504 INFO L188 LiptonReduction]: Number of co-enabled transitions 3134 [2022-12-06 07:48:57,506 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:48:57,506 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 602 [2022-12-06 07:48:57,506 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 647 transitions, 15559 flow [2022-12-06 07:48:57,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 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 07:48:57,506 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:48:57,507 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 07:48:57,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2022-12-06 07:48:57,507 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 07:48:57,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:48:57,507 INFO L85 PathProgramCache]: Analyzing trace with hash -440173848, now seen corresponding path program 1 times [2022-12-06 07:48:57,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:48:57,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989983976] [2022-12-06 07:48:57,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:48:57,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:48:57,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:48:58,602 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 07:48:58,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:48:58,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989983976] [2022-12-06 07:48:58,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989983976] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:48:58,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316770242] [2022-12-06 07:48:58,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:48:58,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:48:58,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:48:58,604 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 07:48:58,606 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 07:48:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:48:58,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-06 07:48:58,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:48:58,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:48:58,847 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 07:48:58,993 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 07:48:58,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:48:59,188 INFO L321 Elim1Store]: treesize reduction 23, result has 14.8 percent of original size [2022-12-06 07:48:59,189 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 07:48:59,195 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:48:59,196 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 07:48:59,281 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 07:48:59,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316770242] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:48:59,281 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:48:59,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 19 [2022-12-06 07:48:59,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501739510] [2022-12-06 07:48:59,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:48:59,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 07:48:59,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:48:59,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 07:48:59,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2022-12-06 07:48:59,282 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 07:48:59,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 647 transitions, 15559 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 07:48:59,282 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:48:59,282 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 07:48:59,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:02,739 INFO L130 PetriNetUnfolder]: 4207/7841 cut-off events. [2022-12-06 07:49:02,739 INFO L131 PetriNetUnfolder]: For 272528/272528 co-relation queries the response was YES. [2022-12-06 07:49:02,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74714 conditions, 7841 events. 4207/7841 cut-off events. For 272528/272528 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 59924 event pairs, 621 based on Foata normal form. 1/7842 useless extension candidates. Maximal degree in co-relation 74478. Up to 1439 conditions per place. [2022-12-06 07:49:02,814 INFO L137 encePairwiseOnDemand]: 19/45 looper letters, 391 selfloop transitions, 323 changer transitions 14/728 dead transitions. [2022-12-06 07:49:02,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 728 transitions, 17815 flow [2022-12-06 07:49:02,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 07:49:02,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 07:49:02,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 149 transitions. [2022-12-06 07:49:02,815 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22074074074074074 [2022-12-06 07:49:02,815 INFO L175 Difference]: Start difference. First operand has 318 places, 647 transitions, 15559 flow. Second operand 15 states and 149 transitions. [2022-12-06 07:49:02,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 728 transitions, 17815 flow [2022-12-06 07:49:04,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 728 transitions, 17603 flow, removed 3 selfloop flow, removed 7 redundant places. [2022-12-06 07:49:04,568 INFO L231 Difference]: Finished difference. Result has 328 places, 650 transitions, 16271 flow [2022-12-06 07:49:04,568 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=15349, PETRI_DIFFERENCE_MINUEND_PLACES=311, 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=16271, PETRI_PLACES=328, PETRI_TRANSITIONS=650} [2022-12-06 07:49:04,569 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 299 predicate places. [2022-12-06 07:49:04,569 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:04,569 INFO L89 Accepts]: Start accepts. Operand has 328 places, 650 transitions, 16271 flow [2022-12-06 07:49:04,573 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:04,573 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:04,573 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 328 places, 650 transitions, 16271 flow [2022-12-06 07:49:04,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 326 places, 650 transitions, 16271 flow [2022-12-06 07:49:05,091 INFO L130 PetriNetUnfolder]: 912/3267 cut-off events. [2022-12-06 07:49:05,091 INFO L131 PetriNetUnfolder]: For 85759/85945 co-relation queries the response was YES. [2022-12-06 07:49:05,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26623 conditions, 3267 events. 912/3267 cut-off events. For 85759/85945 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 34718 event pairs, 28 based on Foata normal form. 11/3212 useless extension candidates. Maximal degree in co-relation 26432. Up to 563 conditions per place. [2022-12-06 07:49:05,141 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 326 places, 650 transitions, 16271 flow [2022-12-06 07:49:05,142 INFO L188 LiptonReduction]: Number of co-enabled transitions 3154 [2022-12-06 07:49:05,146 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 07:49:05,418 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:49:05,419 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 850 [2022-12-06 07:49:05,419 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 649 transitions, 16257 flow [2022-12-06 07:49:05,419 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 07:49:05,419 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:05,419 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 07:49:05,424 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 07:49:05,621 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 07:49:05,621 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 07:49:05,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:05,621 INFO L85 PathProgramCache]: Analyzing trace with hash -675003397, now seen corresponding path program 1 times [2022-12-06 07:49:05,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:05,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119673226] [2022-12-06 07:49:05,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:05,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:05,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:05,689 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 07:49:05,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:05,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119673226] [2022-12-06 07:49:05,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119673226] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:49:05,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:49:05,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:49:05,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978465633] [2022-12-06 07:49:05,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:49:05,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:49:05,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:05,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:49:05,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:49:05,691 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 07:49:05,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 649 transitions, 16257 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 07:49:05,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:05,691 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 07:49:05,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:07,909 INFO L130 PetriNetUnfolder]: 4180/7790 cut-off events. [2022-12-06 07:49:07,909 INFO L131 PetriNetUnfolder]: For 298457/298457 co-relation queries the response was YES. [2022-12-06 07:49:07,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76596 conditions, 7790 events. 4180/7790 cut-off events. For 298457/298457 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 59491 event pairs, 1274 based on Foata normal form. 5/7795 useless extension candidates. Maximal degree in co-relation 76359. Up to 7473 conditions per place. [2022-12-06 07:49:07,988 INFO L137 encePairwiseOnDemand]: 38/45 looper letters, 660 selfloop transitions, 17 changer transitions 5/682 dead transitions. [2022-12-06 07:49:07,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 682 transitions, 17970 flow [2022-12-06 07:49:07,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:49:07,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:49:07,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-12-06 07:49:07,989 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37222222222222223 [2022-12-06 07:49:07,989 INFO L175 Difference]: Start difference. First operand has 325 places, 649 transitions, 16257 flow. Second operand 4 states and 67 transitions. [2022-12-06 07:49:07,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 682 transitions, 17970 flow [2022-12-06 07:49:09,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 682 transitions, 17534 flow, removed 12 selfloop flow, removed 9 redundant places. [2022-12-06 07:49:09,605 INFO L231 Difference]: Finished difference. Result has 319 places, 646 transitions, 15763 flow [2022-12-06 07:49:09,605 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=15782, PETRI_DIFFERENCE_MINUEND_PLACES=316, 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=15763, PETRI_PLACES=319, PETRI_TRANSITIONS=646} [2022-12-06 07:49:09,606 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 290 predicate places. [2022-12-06 07:49:09,606 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:09,606 INFO L89 Accepts]: Start accepts. Operand has 319 places, 646 transitions, 15763 flow [2022-12-06 07:49:09,608 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:09,608 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:09,608 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 319 places, 646 transitions, 15763 flow [2022-12-06 07:49:09,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 318 places, 646 transitions, 15763 flow [2022-12-06 07:49:10,186 INFO L130 PetriNetUnfolder]: 909/3257 cut-off events. [2022-12-06 07:49:10,186 INFO L131 PetriNetUnfolder]: For 80598/80783 co-relation queries the response was YES. [2022-12-06 07:49:10,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25896 conditions, 3257 events. 909/3257 cut-off events. For 80598/80783 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 34644 event pairs, 28 based on Foata normal form. 11/3202 useless extension candidates. Maximal degree in co-relation 25576. Up to 562 conditions per place. [2022-12-06 07:49:10,243 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 318 places, 646 transitions, 15763 flow [2022-12-06 07:49:10,243 INFO L188 LiptonReduction]: Number of co-enabled transitions 3130 [2022-12-06 07:49:10,245 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:49:10,246 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 640 [2022-12-06 07:49:10,246 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 646 transitions, 15763 flow [2022-12-06 07:49:10,246 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 07:49:10,246 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:10,246 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 07:49:10,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2022-12-06 07:49:10,246 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 07:49:10,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:10,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1638854652, now seen corresponding path program 1 times [2022-12-06 07:49:10,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:10,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653955965] [2022-12-06 07:49:10,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:10,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:10,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:11,145 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 07:49:11,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:11,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653955965] [2022-12-06 07:49:11,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653955965] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:49:11,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242943150] [2022-12-06 07:49:11,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:11,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:11,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:49:11,147 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 07:49:11,149 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 07:49:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:11,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-06 07:49:11,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:49:11,511 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 07:49:11,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:49:11,690 INFO L321 Elim1Store]: treesize reduction 23, result has 14.8 percent of original size [2022-12-06 07:49:11,691 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 07:49:11,763 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 07:49:11,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242943150] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:49:11,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:49:11,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-12-06 07:49:11,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89700135] [2022-12-06 07:49:11,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:49:11,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 07:49:11,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:11,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 07:49:11,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2022-12-06 07:49:11,765 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 07:49:11,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 646 transitions, 15763 flow. Second operand has 22 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 22 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 07:49:11,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:11,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 07:49:11,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:15,891 INFO L130 PetriNetUnfolder]: 4906/9164 cut-off events. [2022-12-06 07:49:15,891 INFO L131 PetriNetUnfolder]: For 322566/322566 co-relation queries the response was YES. [2022-12-06 07:49:16,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86781 conditions, 9164 events. 4906/9164 cut-off events. For 322566/322566 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 72376 event pairs, 374 based on Foata normal form. 1/9165 useless extension candidates. Maximal degree in co-relation 85948. Up to 1836 conditions per place. [2022-12-06 07:49:16,166 INFO L137 encePairwiseOnDemand]: 17/44 looper letters, 336 selfloop transitions, 484 changer transitions 13/833 dead transitions. [2022-12-06 07:49:16,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 833 transitions, 20341 flow [2022-12-06 07:49:16,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 07:49:16,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 07:49:16,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 195 transitions. [2022-12-06 07:49:16,171 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2215909090909091 [2022-12-06 07:49:16,172 INFO L175 Difference]: Start difference. First operand has 318 places, 646 transitions, 15763 flow. Second operand 20 states and 195 transitions. [2022-12-06 07:49:16,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 833 transitions, 20341 flow [2022-12-06 07:49:18,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 833 transitions, 20130 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-12-06 07:49:18,323 INFO L231 Difference]: Finished difference. Result has 340 places, 730 transitions, 19159 flow [2022-12-06 07:49:18,324 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=15588, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=646, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=406, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=19159, PETRI_PLACES=340, PETRI_TRANSITIONS=730} [2022-12-06 07:49:18,324 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 311 predicate places. [2022-12-06 07:49:18,324 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:18,324 INFO L89 Accepts]: Start accepts. Operand has 340 places, 730 transitions, 19159 flow [2022-12-06 07:49:18,327 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:18,327 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:18,328 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 340 places, 730 transitions, 19159 flow [2022-12-06 07:49:18,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 339 places, 730 transitions, 19159 flow [2022-12-06 07:49:18,953 INFO L130 PetriNetUnfolder]: 995/3720 cut-off events. [2022-12-06 07:49:18,953 INFO L131 PetriNetUnfolder]: For 102059/102254 co-relation queries the response was YES. [2022-12-06 07:49:18,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30837 conditions, 3720 events. 995/3720 cut-off events. For 102059/102254 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 41336 event pairs, 33 based on Foata normal form. 11/3660 useless extension candidates. Maximal degree in co-relation 30642. Up to 624 conditions per place. [2022-12-06 07:49:19,009 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 339 places, 730 transitions, 19159 flow [2022-12-06 07:49:19,009 INFO L188 LiptonReduction]: Number of co-enabled transitions 3636 [2022-12-06 07:49:19,027 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [689] $Ultimate##0-->L67-5: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_237| 1) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork0_~i~1#1_237|) 4294967296) (mod v_~A~0_280 4294967296)) (= |v_thread2Thread1of1ForFork0_~x~1#1_248| v_~B~0_164)) InVars {~A~0=v_~A~0_280, ~B~0=v_~B~0_164} OutVars{~A~0=v_~A~0_280, ~B~0=v_~B~0_164, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_237|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_85|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_248|} 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 07:49:19,257 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 07:49:19,405 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [742] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse0 (mod v_~A~0_384 4294967296))) (and (= |v_thread2Thread1of1ForFork0_~i~1#1_405| 1) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_198| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_198|) (= v_~end~0_782 (+ v_~end~0_783 1)) (not (= (ite (and (<= 0 v_~end~0_783) (< v_~end~0_783 v_~n~0_384)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~x~1#1_428| v_~B~0_208) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_198| (ite (= (mod (select (select |v_#memory_int_700| v_~queue~0.base_378) (+ (* v_~end~0_783 4) v_~queue~0.offset_378)) 4294967296) (mod |v_thread2Thread1of1ForFork0_~x~1#1_428| 4294967296)) 1 0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork0_~i~1#1_405|) 4294967296) .cse0) (= |v_thread2Thread1of1ForFork0_#res#1.base_188| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_405| 4294967296) .cse0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_188| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_198| 0)))) InVars {~queue~0.offset=v_~queue~0.offset_378, ~A~0=v_~A~0_384, ~B~0=v_~B~0_208, #memory_int=|v_#memory_int_700|, ~end~0=v_~end~0_783, ~queue~0.base=v_~queue~0.base_378, ~n~0=v_~n~0_384} OutVars{~queue~0.offset=v_~queue~0.offset_378, ~A~0=v_~A~0_384, ~B~0=v_~B~0_208, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_188|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_198|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_405|, ~queue~0.base=v_~queue~0.base_378, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_198|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_188|, #memory_int=|v_#memory_int_700|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_198|, ~end~0=v_~end~0_782, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_428|, ~n~0=v_~n~0_384, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_158|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_198|} 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 07:49:19,547 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [742] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse0 (mod v_~A~0_384 4294967296))) (and (= |v_thread2Thread1of1ForFork0_~i~1#1_405| 1) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_198| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_198|) (= v_~end~0_782 (+ v_~end~0_783 1)) (not (= (ite (and (<= 0 v_~end~0_783) (< v_~end~0_783 v_~n~0_384)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~x~1#1_428| v_~B~0_208) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_198| (ite (= (mod (select (select |v_#memory_int_700| v_~queue~0.base_378) (+ (* v_~end~0_783 4) v_~queue~0.offset_378)) 4294967296) (mod |v_thread2Thread1of1ForFork0_~x~1#1_428| 4294967296)) 1 0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork0_~i~1#1_405|) 4294967296) .cse0) (= |v_thread2Thread1of1ForFork0_#res#1.base_188| 0) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_405| 4294967296) .cse0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_188| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_198| 0)))) InVars {~queue~0.offset=v_~queue~0.offset_378, ~A~0=v_~A~0_384, ~B~0=v_~B~0_208, #memory_int=|v_#memory_int_700|, ~end~0=v_~end~0_783, ~queue~0.base=v_~queue~0.base_378, ~n~0=v_~n~0_384} OutVars{~queue~0.offset=v_~queue~0.offset_378, ~A~0=v_~A~0_384, ~B~0=v_~B~0_208, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_188|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_198|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_405|, ~queue~0.base=v_~queue~0.base_378, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_198|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_188|, #memory_int=|v_#memory_int_700|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_198|, ~end~0=v_~end~0_782, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_428|, ~n~0=v_~n~0_384, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_158|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_198|} 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 [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 07:49:19,738 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:49:19,739 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1415 [2022-12-06 07:49:19,739 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 728 transitions, 19213 flow [2022-12-06 07:49:19,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 22 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 07:49:19,739 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:19,739 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 07:49:19,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-06 07:49:19,944 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 07:49:19,945 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 07:49:19,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:19,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1077895977, now seen corresponding path program 1 times [2022-12-06 07:49:19,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:19,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904723379] [2022-12-06 07:49:19,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:19,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:22,184 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 07:49:22,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:22,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904723379] [2022-12-06 07:49:22,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904723379] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:49:22,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149169703] [2022-12-06 07:49:22,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:22,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:22,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:49:22,186 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 07:49:22,190 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 07:49:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:22,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-06 07:49:22,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:49:22,592 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 07:49:22,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:49:22,756 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-06 07:49:22,757 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 07:49:22,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 07:49:22,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149169703] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:49:22,939 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:49:22,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 23 [2022-12-06 07:49:22,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964222906] [2022-12-06 07:49:22,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:49:22,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 07:49:22,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:22,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 07:49:22,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2022-12-06 07:49:22,940 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 07:49:22,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 728 transitions, 19213 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 07:49:22,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:22,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 07:49:22,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:28,952 INFO L130 PetriNetUnfolder]: 5424/10030 cut-off events. [2022-12-06 07:49:28,952 INFO L131 PetriNetUnfolder]: For 421393/421393 co-relation queries the response was YES. [2022-12-06 07:49:29,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102906 conditions, 10030 events. 5424/10030 cut-off events. For 421393/421393 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 79722 event pairs, 622 based on Foata normal form. 7/10037 useless extension candidates. Maximal degree in co-relation 102665. Up to 2393 conditions per place. [2022-12-06 07:49:29,069 INFO L137 encePairwiseOnDemand]: 20/49 looper letters, 420 selfloop transitions, 541 changer transitions 29/990 dead transitions. [2022-12-06 07:49:29,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 990 transitions, 26033 flow [2022-12-06 07:49:29,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-06 07:49:29,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-06 07:49:29,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 250 transitions. [2022-12-06 07:49:29,070 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.18221574344023322 [2022-12-06 07:49:29,070 INFO L175 Difference]: Start difference. First operand has 337 places, 728 transitions, 19213 flow. Second operand 28 states and 250 transitions. [2022-12-06 07:49:29,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 990 transitions, 26033 flow [2022-12-06 07:49:32,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 990 transitions, 25307 flow, removed 132 selfloop flow, removed 6 redundant places. [2022-12-06 07:49:32,429 INFO L231 Difference]: Finished difference. Result has 370 places, 841 transitions, 23122 flow [2022-12-06 07:49:32,429 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=18636, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=728, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=436, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=23122, PETRI_PLACES=370, PETRI_TRANSITIONS=841} [2022-12-06 07:49:32,430 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 341 predicate places. [2022-12-06 07:49:32,430 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:32,430 INFO L89 Accepts]: Start accepts. Operand has 370 places, 841 transitions, 23122 flow [2022-12-06 07:49:32,433 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:32,433 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:32,433 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 370 places, 841 transitions, 23122 flow [2022-12-06 07:49:32,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 367 places, 841 transitions, 23122 flow [2022-12-06 07:49:33,240 INFO L130 PetriNetUnfolder]: 1169/4117 cut-off events. [2022-12-06 07:49:33,240 INFO L131 PetriNetUnfolder]: For 128126/128372 co-relation queries the response was YES. [2022-12-06 07:49:33,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36875 conditions, 4117 events. 1169/4117 cut-off events. For 128126/128372 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 45577 event pairs, 41 based on Foata normal form. 8/4039 useless extension candidates. Maximal degree in co-relation 36624. Up to 751 conditions per place. [2022-12-06 07:49:33,305 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 367 places, 841 transitions, 23122 flow [2022-12-06 07:49:33,305 INFO L188 LiptonReduction]: Number of co-enabled transitions 4066 [2022-12-06 07:49:33,307 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:49:33,307 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 877 [2022-12-06 07:49:33,307 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 841 transitions, 23122 flow [2022-12-06 07:49:33,307 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 07:49:33,307 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:33,308 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:49:33,313 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 07:49:33,508 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 07:49:33,508 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 07:49:33,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:33,509 INFO L85 PathProgramCache]: Analyzing trace with hash 629082592, now seen corresponding path program 1 times [2022-12-06 07:49:33,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:33,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933336983] [2022-12-06 07:49:33,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:33,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:33,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:34,479 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 07:49:34,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:34,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933336983] [2022-12-06 07:49:34,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933336983] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:49:34,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:49:34,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:49:34,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949854345] [2022-12-06 07:49:34,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:49:34,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:49:34,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:34,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:49:34,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:49:34,480 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-06 07:49:34,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 841 transitions, 23122 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 07:49:34,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:34,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-06 07:49:34,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:49:38,097 INFO L130 PetriNetUnfolder]: 5378/9945 cut-off events. [2022-12-06 07:49:38,098 INFO L131 PetriNetUnfolder]: For 447575/447575 co-relation queries the response was YES. [2022-12-06 07:49:38,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107583 conditions, 9945 events. 5378/9945 cut-off events. For 447575/447575 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 78657 event pairs, 1122 based on Foata normal form. 1/9946 useless extension candidates. Maximal degree in co-relation 107286. Up to 6182 conditions per place. [2022-12-06 07:49:38,213 INFO L137 encePairwiseOnDemand]: 27/48 looper letters, 686 selfloop transitions, 185 changer transitions 16/887 dead transitions. [2022-12-06 07:49:38,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 887 transitions, 25658 flow [2022-12-06 07:49:38,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:49:38,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:49:38,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2022-12-06 07:49:38,214 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28273809523809523 [2022-12-06 07:49:38,214 INFO L175 Difference]: Start difference. First operand has 367 places, 841 transitions, 23122 flow. Second operand 7 states and 95 transitions. [2022-12-06 07:49:38,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 887 transitions, 25658 flow [2022-12-06 07:49:42,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 887 transitions, 24945 flow, removed 336 selfloop flow, removed 5 redundant places. [2022-12-06 07:49:42,188 INFO L231 Difference]: Finished difference. Result has 370 places, 838 transitions, 22851 flow [2022-12-06 07:49:42,189 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=22573, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=841, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=185, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=656, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=22851, PETRI_PLACES=370, PETRI_TRANSITIONS=838} [2022-12-06 07:49:42,189 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 341 predicate places. [2022-12-06 07:49:42,189 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:42,189 INFO L89 Accepts]: Start accepts. Operand has 370 places, 838 transitions, 22851 flow [2022-12-06 07:49:42,218 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:42,218 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:42,218 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 370 places, 838 transitions, 22851 flow [2022-12-06 07:49:42,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 368 places, 838 transitions, 22851 flow [2022-12-06 07:49:43,251 INFO L130 PetriNetUnfolder]: 1169/4117 cut-off events. [2022-12-06 07:49:43,251 INFO L131 PetriNetUnfolder]: For 130517/130791 co-relation queries the response was YES. [2022-12-06 07:49:43,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36500 conditions, 4117 events. 1169/4117 cut-off events. For 130517/130791 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 45550 event pairs, 41 based on Foata normal form. 7/4022 useless extension candidates. Maximal degree in co-relation 36304. Up to 750 conditions per place. [2022-12-06 07:49:43,329 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 368 places, 838 transitions, 22851 flow [2022-12-06 07:49:43,329 INFO L188 LiptonReduction]: Number of co-enabled transitions 4052 [2022-12-06 07:49:43,331 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:49:43,331 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1142 [2022-12-06 07:49:43,331 INFO L495 AbstractCegarLoop]: Abstraction has has 368 places, 838 transitions, 22851 flow [2022-12-06 07:49:43,331 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 07:49:43,331 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:43,331 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 07:49:43,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2022-12-06 07:49:43,332 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 07:49:43,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:43,332 INFO L85 PathProgramCache]: Analyzing trace with hash -132287974, now seen corresponding path program 1 times [2022-12-06 07:49:43,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:43,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039303714] [2022-12-06 07:49:43,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:43,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:44,355 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 07:49:44,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:44,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039303714] [2022-12-06 07:49:44,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039303714] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:49:44,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518322078] [2022-12-06 07:49:44,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:44,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:44,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:49:44,358 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 07:49:44,359 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 07:49:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:44,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-06 07:49:44,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:49:44,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:49:44,608 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 07:49:44,729 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 07:49:44,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:49:44,928 INFO L321 Elim1Store]: treesize reduction 23, result has 14.8 percent of original size [2022-12-06 07:49:44,928 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 120 treesize of output 82 [2022-12-06 07:49:44,937 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:49:44,937 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 66 treesize of output 46 [2022-12-06 07:52:06,264 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 07:52:06,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518322078] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:52:06,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:52:06,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 07:52:06,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126227521] [2022-12-06 07:52:06,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:52:06,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 07:52:06,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:52:06,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 07:52:06,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2022-12-06 07:52:06,265 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 07:52:06,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 838 transitions, 22851 flow. Second operand has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 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 07:52:06,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:52:06,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 07:52:06,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:52:10,968 INFO L130 PetriNetUnfolder]: 5379/9945 cut-off events. [2022-12-06 07:52:10,969 INFO L131 PetriNetUnfolder]: For 459157/459157 co-relation queries the response was YES. [2022-12-06 07:52:11,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107082 conditions, 9945 events. 5379/9945 cut-off events. For 459157/459157 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 78832 event pairs, 766 based on Foata normal form. 1/9946 useless extension candidates. Maximal degree in co-relation 106830. Up to 1968 conditions per place. [2022-12-06 07:52:11,102 INFO L137 encePairwiseOnDemand]: 19/47 looper letters, 488 selfloop transitions, 458 changer transitions 14/960 dead transitions. [2022-12-06 07:52:11,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 960 transitions, 26548 flow [2022-12-06 07:52:11,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 07:52:11,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 07:52:11,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 177 transitions. [2022-12-06 07:52:11,104 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20921985815602837 [2022-12-06 07:52:11,104 INFO L175 Difference]: Start difference. First operand has 368 places, 838 transitions, 22851 flow. Second operand 18 states and 177 transitions. [2022-12-06 07:52:11,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 960 transitions, 26548 flow [2022-12-06 07:52:14,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 960 transitions, 26078 flow, removed 12 selfloop flow, removed 7 redundant places. [2022-12-06 07:52:14,779 INFO L231 Difference]: Finished difference. Result has 381 places, 846 transitions, 23752 flow [2022-12-06 07:52:14,780 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=22394, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=838, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=450, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=23752, PETRI_PLACES=381, PETRI_TRANSITIONS=846} [2022-12-06 07:52:14,780 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 352 predicate places. [2022-12-06 07:52:14,780 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:52:14,780 INFO L89 Accepts]: Start accepts. Operand has 381 places, 846 transitions, 23752 flow [2022-12-06 07:52:14,784 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:52:14,784 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:52:14,784 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 381 places, 846 transitions, 23752 flow [2022-12-06 07:52:14,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 379 places, 846 transitions, 23752 flow [2022-12-06 07:52:15,519 INFO L130 PetriNetUnfolder]: 1170/4120 cut-off events. [2022-12-06 07:52:15,519 INFO L131 PetriNetUnfolder]: For 139848/140122 co-relation queries the response was YES. [2022-12-06 07:52:15,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37578 conditions, 4120 events. 1170/4120 cut-off events. For 139848/140122 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 45589 event pairs, 41 based on Foata normal form. 7/4026 useless extension candidates. Maximal degree in co-relation 37371. Up to 753 conditions per place. [2022-12-06 07:52:15,588 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 379 places, 846 transitions, 23752 flow [2022-12-06 07:52:15,589 INFO L188 LiptonReduction]: Number of co-enabled transitions 4084 [2022-12-06 07:52:15,594 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [744] $Ultimate##0-->L104-3: Formula: (let ((.cse0 (mod v_~A~0_388 4294967296))) (and (= (store |v_#memory_int_707| |v_ULTIMATE.start_main_~#t3~0#1.base_244| (store (select |v_#memory_int_707| |v_ULTIMATE.start_main_~#t3~0#1.base_244|) |v_ULTIMATE.start_main_~#t3~0#1.offset_226| |v_ULTIMATE.start_main_#t~pre18#1_259|)) |v_#memory_int_706|) (= |v_thread2Thread1of1ForFork0_#res#1.base_190| 0) (= (+ |v_#pthreadsForks_483| 1) |v_#pthreadsForks_482|) (= |v_thread2Thread1of1ForFork0_~i~1#1_407| 1) (not (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_407| 4294967296) .cse0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_200| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_200|) (not (= (ite (and (<= 0 v_~end~0_791) (< v_~end~0_791 v_~n~0_388)) 1 0) 0)) (= v_~end~0_790 (+ v_~end~0_791 1)) (= |v_thread2Thread1of1ForFork0_~x~1#1_430| v_~B~0_210) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork0_~i~1#1_407|) 4294967296) .cse0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_200| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_200| (ite (= (mod |v_thread2Thread1of1ForFork0_~x~1#1_430| 4294967296) (mod (select (select |v_#memory_int_707| v_~queue~0.base_382) (+ v_~queue~0.offset_382 (* v_~end~0_791 4))) 4294967296)) 1 0)) (= |v_ULTIMATE.start_main_#t~pre18#1_259| |v_#pthreadsForks_483|) (= |v_thread2Thread1of1ForFork0_#res#1.offset_190| 0))) InVars {~queue~0.offset=v_~queue~0.offset_382, ~A~0=v_~A~0_388, #pthreadsForks=|v_#pthreadsForks_483|, ~B~0=v_~B~0_210, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_226|, #memory_int=|v_#memory_int_707|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_244|, ~end~0=v_~end~0_791, ~queue~0.base=v_~queue~0.base_382, ~n~0=v_~n~0_388} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_259|, ~queue~0.offset=v_~queue~0.offset_382, ~A~0=v_~A~0_388, ~B~0=v_~B~0_210, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_226|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_190|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_200|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_244|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_407|, ~queue~0.base=v_~queue~0.base_382, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_200|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_190|, #pthreadsForks=|v_#pthreadsForks_482|, #memory_int=|v_#memory_int_706|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_272|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_200|, ~end~0=v_~end~0_790, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_228|, thread2Thread1of1ForFork0_~x~1#1=|v_thread2Thread1of1ForFork0_~x~1#1_430|, ~n~0=v_~n~0_388, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_160|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_200|} 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] 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 07:52:15,839 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:52:15,840 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1060 [2022-12-06 07:52:15,840 INFO L495 AbstractCegarLoop]: Abstraction has has 378 places, 845 transitions, 23736 flow [2022-12-06 07:52:15,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 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 07:52:15,840 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:52:15,840 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 07:52:15,847 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 07:52:16,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:52:16,041 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 07:52:16,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:52:16,042 INFO L85 PathProgramCache]: Analyzing trace with hash 300793204, now seen corresponding path program 1 times [2022-12-06 07:52:16,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:52:16,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167881890] [2022-12-06 07:52:16,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:16,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:52:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:16,154 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 07:52:16,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:52:16,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167881890] [2022-12-06 07:52:16,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167881890] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:52:16,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:52:16,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:52:16,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975576965] [2022-12-06 07:52:16,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:52:16,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:52:16,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:52:16,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:52:16,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:52:16,155 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 07:52:16,155 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 845 transitions, 23736 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 07:52:16,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:52:16,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 07:52:16,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:52:19,714 INFO L130 PetriNetUnfolder]: 5345/9885 cut-off events. [2022-12-06 07:52:19,714 INFO L131 PetriNetUnfolder]: For 483988/483988 co-relation queries the response was YES. [2022-12-06 07:52:19,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108089 conditions, 9885 events. 5345/9885 cut-off events. For 483988/483988 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 77662 event pairs, 1240 based on Foata normal form. 10/9895 useless extension candidates. Maximal degree in co-relation 107836. Up to 6984 conditions per place. [2022-12-06 07:52:19,835 INFO L137 encePairwiseOnDemand]: 35/47 looper letters, 723 selfloop transitions, 159 changer transitions 3/885 dead transitions. [2022-12-06 07:52:19,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 885 transitions, 26021 flow [2022-12-06 07:52:19,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:52:19,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:52:19,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2022-12-06 07:52:19,836 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3404255319148936 [2022-12-06 07:52:19,836 INFO L175 Difference]: Start difference. First operand has 378 places, 845 transitions, 23736 flow. Second operand 5 states and 80 transitions. [2022-12-06 07:52:19,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 885 transitions, 26021 flow [2022-12-06 07:52:23,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 885 transitions, 25679 flow, removed 11 selfloop flow, removed 7 redundant places. [2022-12-06 07:52:23,541 INFO L231 Difference]: Finished difference. Result has 375 places, 835 transitions, 23348 flow [2022-12-06 07:52:23,542 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=23161, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=838, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=159, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=679, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=23348, PETRI_PLACES=375, PETRI_TRANSITIONS=835} [2022-12-06 07:52:23,543 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 346 predicate places. [2022-12-06 07:52:23,543 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:52:23,543 INFO L89 Accepts]: Start accepts. Operand has 375 places, 835 transitions, 23348 flow [2022-12-06 07:52:23,548 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:52:23,549 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:52:23,549 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 375 places, 835 transitions, 23348 flow [2022-12-06 07:52:23,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 375 places, 835 transitions, 23348 flow [2022-12-06 07:52:24,288 INFO L130 PetriNetUnfolder]: 1154/4089 cut-off events. [2022-12-06 07:52:24,288 INFO L131 PetriNetUnfolder]: For 135839/136066 co-relation queries the response was YES. [2022-12-06 07:52:24,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37132 conditions, 4089 events. 1154/4089 cut-off events. For 135839/136066 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 45105 event pairs, 41 based on Foata normal form. 7/4013 useless extension candidates. Maximal degree in co-relation 36771. Up to 732 conditions per place. [2022-12-06 07:52:24,361 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 375 places, 835 transitions, 23348 flow [2022-12-06 07:52:24,361 INFO L188 LiptonReduction]: Number of co-enabled transitions 4048 [2022-12-06 07:52:24,364 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:52:24,364 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 821 [2022-12-06 07:52:24,364 INFO L495 AbstractCegarLoop]: Abstraction has has 375 places, 835 transitions, 23348 flow [2022-12-06 07:52:24,364 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 07:52:24,364 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:52:24,364 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 07:52:24,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2022-12-06 07:52:24,365 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 07:52:24,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:52:24,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1079055405, now seen corresponding path program 1 times [2022-12-06 07:52:24,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:52:24,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758228576] [2022-12-06 07:52:24,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:24,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:52:24,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:25,502 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 07:52:25,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:52:25,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758228576] [2022-12-06 07:52:25,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758228576] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:52:25,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:52:25,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:52:25,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929804273] [2022-12-06 07:52:25,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:52:25,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:52:25,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:52:25,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:52:25,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:52:25,509 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 07:52:25,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 835 transitions, 23348 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 07:52:25,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:52:25,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 07:52:25,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:52:28,924 INFO L130 PetriNetUnfolder]: 5369/9922 cut-off events. [2022-12-06 07:52:28,924 INFO L131 PetriNetUnfolder]: For 474592/474592 co-relation queries the response was YES. [2022-12-06 07:52:29,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108577 conditions, 9922 events. 5369/9922 cut-off events. For 474592/474592 co-relation queries the response was YES. Maximal size of possible extension queue 613. Compared 78007 event pairs, 1279 based on Foata normal form. 1/9923 useless extension candidates. Maximal degree in co-relation 107585. Up to 7606 conditions per place. [2022-12-06 07:52:29,250 INFO L137 encePairwiseOnDemand]: 25/45 looper letters, 686 selfloop transitions, 190 changer transitions 13/889 dead transitions. [2022-12-06 07:52:29,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 889 transitions, 25910 flow [2022-12-06 07:52:29,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:52:29,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:52:29,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2022-12-06 07:52:29,251 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2777777777777778 [2022-12-06 07:52:29,252 INFO L175 Difference]: Start difference. First operand has 375 places, 835 transitions, 23348 flow. Second operand 8 states and 100 transitions. [2022-12-06 07:52:29,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 889 transitions, 25910 flow [2022-12-06 07:52:32,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 889 transitions, 25535 flow, removed 16 selfloop flow, removed 5 redundant places. [2022-12-06 07:52:33,002 INFO L231 Difference]: Finished difference. Result has 381 places, 843 transitions, 23768 flow [2022-12-06 07:52:33,003 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=22982, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=835, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=182, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=647, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=23768, PETRI_PLACES=381, PETRI_TRANSITIONS=843} [2022-12-06 07:52:33,003 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 352 predicate places. [2022-12-06 07:52:33,003 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:52:33,003 INFO L89 Accepts]: Start accepts. Operand has 381 places, 843 transitions, 23768 flow [2022-12-06 07:52:33,007 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:52:33,007 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:52:33,007 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 381 places, 843 transitions, 23768 flow [2022-12-06 07:52:33,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 380 places, 843 transitions, 23768 flow [2022-12-06 07:52:33,733 INFO L130 PetriNetUnfolder]: 1163/4108 cut-off events. [2022-12-06 07:52:33,733 INFO L131 PetriNetUnfolder]: For 142437/142664 co-relation queries the response was YES. [2022-12-06 07:52:33,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37677 conditions, 4108 events. 1163/4108 cut-off events. For 142437/142664 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 45327 event pairs, 42 based on Foata normal form. 7/4032 useless extension candidates. Maximal degree in co-relation 37467. Up to 741 conditions per place. [2022-12-06 07:52:33,802 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 380 places, 843 transitions, 23768 flow [2022-12-06 07:52:33,802 INFO L188 LiptonReduction]: Number of co-enabled transitions 4074 [2022-12-06 07:52:33,805 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 07:52:33,952 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:52:33,953 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 950 [2022-12-06 07:52:33,953 INFO L495 AbstractCegarLoop]: Abstraction has has 379 places, 842 transitions, 23748 flow [2022-12-06 07:52:33,953 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 07:52:33,953 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:52:33,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 07:52:33,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2022-12-06 07:52:33,953 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 07:52:33,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:52:33,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1934632223, now seen corresponding path program 2 times [2022-12-06 07:52:33,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:52:33,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902019279] [2022-12-06 07:52:33,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:33,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:52:34,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:36,100 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 07:52:36,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:52:36,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902019279] [2022-12-06 07:52:36,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902019279] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:52:36,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:52:36,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 07:52:36,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843688376] [2022-12-06 07:52:36,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:52:36,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:52:36,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:52:36,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:52:36,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:52:36,102 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 07:52:36,102 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 842 transitions, 23748 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 07:52:36,102 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:52:36,102 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 07:52:36,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:52:39,997 INFO L130 PetriNetUnfolder]: 5377/9936 cut-off events. [2022-12-06 07:52:39,997 INFO L131 PetriNetUnfolder]: For 485894/485894 co-relation queries the response was YES. [2022-12-06 07:52:40,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109263 conditions, 9936 events. 5377/9936 cut-off events. For 485894/485894 co-relation queries the response was YES. Maximal size of possible extension queue 613. Compared 78105 event pairs, 1314 based on Foata normal form. 1/9937 useless extension candidates. Maximal degree in co-relation 109007. Up to 8262 conditions per place. [2022-12-06 07:52:40,107 INFO L137 encePairwiseOnDemand]: 25/46 looper letters, 721 selfloop transitions, 156 changer transitions 13/890 dead transitions. [2022-12-06 07:52:40,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 890 transitions, 26088 flow [2022-12-06 07:52:40,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:52:40,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:52:40,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2022-12-06 07:52:40,108 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2717391304347826 [2022-12-06 07:52:40,108 INFO L175 Difference]: Start difference. First operand has 379 places, 842 transitions, 23748 flow. Second operand 8 states and 100 transitions. [2022-12-06 07:52:40,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 890 transitions, 26088 flow [2022-12-06 07:52:43,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 890 transitions, 25889 flow, removed 33 selfloop flow, removed 4 redundant places. [2022-12-06 07:52:43,897 INFO L231 Difference]: Finished difference. Result has 385 places, 846 transitions, 24091 flow [2022-12-06 07:52:43,898 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=23551, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=842, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=152, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=686, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=24091, PETRI_PLACES=385, PETRI_TRANSITIONS=846} [2022-12-06 07:52:43,898 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 356 predicate places. [2022-12-06 07:52:43,898 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:52:43,898 INFO L89 Accepts]: Start accepts. Operand has 385 places, 846 transitions, 24091 flow [2022-12-06 07:52:43,902 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:52:43,903 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:52:43,903 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 385 places, 846 transitions, 24091 flow [2022-12-06 07:52:43,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 384 places, 846 transitions, 24091 flow [2022-12-06 07:52:44,621 INFO L130 PetriNetUnfolder]: 1165/4112 cut-off events. [2022-12-06 07:52:44,621 INFO L131 PetriNetUnfolder]: For 152044/152271 co-relation queries the response was YES. [2022-12-06 07:52:44,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38001 conditions, 4112 events. 1165/4112 cut-off events. For 152044/152271 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 45310 event pairs, 42 based on Foata normal form. 7/4035 useless extension candidates. Maximal degree in co-relation 37790. Up to 741 conditions per place. [2022-12-06 07:52:44,689 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 384 places, 846 transitions, 24091 flow [2022-12-06 07:52:44,690 INFO L188 LiptonReduction]: Number of co-enabled transitions 4086 [2022-12-06 07:52:44,693 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 07:52:44,834 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:52:44,835 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 937 [2022-12-06 07:52:44,835 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 845 transitions, 24073 flow [2022-12-06 07:52:44,835 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 07:52:44,835 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:52:44,836 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 07:52:44,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2022-12-06 07:52:44,836 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 07:52:44,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:52:44,836 INFO L85 PathProgramCache]: Analyzing trace with hash 143179, now seen corresponding path program 1 times [2022-12-06 07:52:44,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:52:44,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921150824] [2022-12-06 07:52:44,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:44,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:52:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:47,067 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 07:52:47,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:52:47,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921150824] [2022-12-06 07:52:47,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921150824] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:52:47,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:52:47,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:52:47,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094573012] [2022-12-06 07:52:47,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:52:47,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:52:47,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:52:47,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:52:47,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:52:47,069 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 07:52:47,069 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 845 transitions, 24073 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 07:52:47,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:52:47,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 07:52:47,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:52:51,212 INFO L130 PetriNetUnfolder]: 5382/9950 cut-off events. [2022-12-06 07:52:51,212 INFO L131 PetriNetUnfolder]: For 505986/505986 co-relation queries the response was YES. [2022-12-06 07:52:51,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109778 conditions, 9950 events. 5382/9950 cut-off events. For 505986/505986 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 78629 event pairs, 1122 based on Foata normal form. 1/9951 useless extension candidates. Maximal degree in co-relation 109521. Up to 6161 conditions per place. [2022-12-06 07:52:51,329 INFO L137 encePairwiseOnDemand]: 26/47 looper letters, 693 selfloop transitions, 188 changer transitions 16/897 dead transitions. [2022-12-06 07:52:51,329 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 897 transitions, 26585 flow [2022-12-06 07:52:51,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:52:51,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:52:51,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-12-06 07:52:51,330 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26861702127659576 [2022-12-06 07:52:51,330 INFO L175 Difference]: Start difference. First operand has 383 places, 845 transitions, 24073 flow. Second operand 8 states and 101 transitions. [2022-12-06 07:52:51,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 897 transitions, 26585 flow [2022-12-06 07:52:55,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 897 transitions, 26427 flow, removed 13 selfloop flow, removed 6 redundant places. [2022-12-06 07:52:55,332 INFO L231 Difference]: Finished difference. Result has 387 places, 845 transitions, 24418 flow [2022-12-06 07:52:55,333 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=23915, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=845, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=187, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=657, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=24418, PETRI_PLACES=387, PETRI_TRANSITIONS=845} [2022-12-06 07:52:55,333 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 358 predicate places. [2022-12-06 07:52:55,333 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:52:55,333 INFO L89 Accepts]: Start accepts. Operand has 387 places, 845 transitions, 24418 flow [2022-12-06 07:52:55,337 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:52:55,337 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:52:55,337 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 387 places, 845 transitions, 24418 flow [2022-12-06 07:52:55,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 385 places, 845 transitions, 24418 flow [2022-12-06 07:52:56,134 INFO L130 PetriNetUnfolder]: 1161/4110 cut-off events. [2022-12-06 07:52:56,134 INFO L131 PetriNetUnfolder]: For 164514/164839 co-relation queries the response was YES. [2022-12-06 07:52:56,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38251 conditions, 4110 events. 1161/4110 cut-off events. For 164514/164839 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 45518 event pairs, 42 based on Foata normal form. 6/4029 useless extension candidates. Maximal degree in co-relation 38039. Up to 742 conditions per place. [2022-12-06 07:52:56,204 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 385 places, 845 transitions, 24418 flow [2022-12-06 07:52:56,204 INFO L188 LiptonReduction]: Number of co-enabled transitions 4082 [2022-12-06 07:52:56,206 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:52:56,207 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 874 [2022-12-06 07:52:56,207 INFO L495 AbstractCegarLoop]: Abstraction has has 385 places, 845 transitions, 24418 flow [2022-12-06 07:52:56,207 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 07:52:56,207 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:52:56,207 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 07:52:56,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2022-12-06 07:52:56,207 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 07:52:56,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:52:56,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1582989584, now seen corresponding path program 1 times [2022-12-06 07:52:56,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:52:56,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643241028] [2022-12-06 07:52:56,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:56,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:52:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:58,196 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 07:52:58,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:52:58,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643241028] [2022-12-06 07:52:58,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643241028] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:52:58,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:52:58,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:52:58,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729346770] [2022-12-06 07:52:58,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:52:58,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:52:58,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:52:58,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:52:58,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:52:58,198 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 07:52:58,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 845 transitions, 24418 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 07:52:58,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:52:58,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 07:52:58,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:53:02,422 INFO L130 PetriNetUnfolder]: 5387/9960 cut-off events. [2022-12-06 07:53:02,422 INFO L131 PetriNetUnfolder]: For 538670/538670 co-relation queries the response was YES. [2022-12-06 07:53:02,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111257 conditions, 9960 events. 5387/9960 cut-off events. For 538670/538670 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 78444 event pairs, 1257 based on Foata normal form. 1/9961 useless extension candidates. Maximal degree in co-relation 110999. Up to 7832 conditions per place. [2022-12-06 07:53:02,542 INFO L137 encePairwiseOnDemand]: 26/46 looper letters, 711 selfloop transitions, 166 changer transitions 16/893 dead transitions. [2022-12-06 07:53:02,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 893 transitions, 26778 flow [2022-12-06 07:53:02,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:53:02,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:53:02,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2022-12-06 07:53:02,543 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.266304347826087 [2022-12-06 07:53:02,543 INFO L175 Difference]: Start difference. First operand has 385 places, 845 transitions, 24418 flow. Second operand 8 states and 98 transitions. [2022-12-06 07:53:02,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 893 transitions, 26778 flow [2022-12-06 07:53:06,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 893 transitions, 26521 flow, removed 5 selfloop flow, removed 6 redundant places. [2022-12-06 07:53:06,387 INFO L231 Difference]: Finished difference. Result has 389 places, 845 transitions, 24592 flow [2022-12-06 07:53:06,387 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=24162, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=845, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=165, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=679, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=24592, PETRI_PLACES=389, PETRI_TRANSITIONS=845} [2022-12-06 07:53:06,388 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 360 predicate places. [2022-12-06 07:53:06,388 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:53:06,388 INFO L89 Accepts]: Start accepts. Operand has 389 places, 845 transitions, 24592 flow [2022-12-06 07:53:06,392 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:53:06,393 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:53:06,393 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 389 places, 845 transitions, 24592 flow [2022-12-06 07:53:06,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 387 places, 845 transitions, 24592 flow [2022-12-06 07:53:07,166 INFO L130 PetriNetUnfolder]: 1165/4120 cut-off events. [2022-12-06 07:53:07,167 INFO L131 PetriNetUnfolder]: For 169169/169505 co-relation queries the response was YES. [2022-12-06 07:53:07,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38668 conditions, 4120 events. 1165/4120 cut-off events. For 169169/169505 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 45562 event pairs, 43 based on Foata normal form. 7/4041 useless extension candidates. Maximal degree in co-relation 38455. Up to 745 conditions per place. [2022-12-06 07:53:07,249 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 387 places, 845 transitions, 24592 flow [2022-12-06 07:53:07,249 INFO L188 LiptonReduction]: Number of co-enabled transitions 4090 [2022-12-06 07:53:07,251 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:53:07,252 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 864 [2022-12-06 07:53:07,252 INFO L495 AbstractCegarLoop]: Abstraction has has 387 places, 845 transitions, 24592 flow [2022-12-06 07:53:07,252 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 07:53:07,252 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:53:07,252 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 07:53:07,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2022-12-06 07:53:07,252 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 07:53:07,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:53:07,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1554379751, now seen corresponding path program 2 times [2022-12-06 07:53:07,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:53:07,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239887856] [2022-12-06 07:53:07,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:07,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:53:07,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:08,634 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 07:53:08,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:53:08,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239887856] [2022-12-06 07:53:08,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239887856] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:53:08,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989951013] [2022-12-06 07:53:08,635 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:53:08,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:53:08,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:53:08,636 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 07:53:08,638 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 07:53:08,863 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:53:08,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:53:08,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-06 07:53:08,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:53:09,014 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:53:09,014 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 07:53:09,099 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 07:53:09,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:53:09,234 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:53:09,234 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 07:53:09,613 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 07:53:09,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989951013] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:53:09,613 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:53:09,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 20 [2022-12-06 07:53:09,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844065773] [2022-12-06 07:53:09,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:53:09,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 07:53:09,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:53:09,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 07:53:09,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2022-12-06 07:53:09,614 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 07:53:09,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 845 transitions, 24592 flow. Second operand has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:53:09,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:53:09,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 07:53:09,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:53:14,785 INFO L130 PetriNetUnfolder]: 5499/10211 cut-off events. [2022-12-06 07:53:14,785 INFO L131 PetriNetUnfolder]: For 549715/549715 co-relation queries the response was YES. [2022-12-06 07:53:14,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114331 conditions, 10211 events. 5499/10211 cut-off events. For 549715/549715 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 81503 event pairs, 1100 based on Foata normal form. 6/10217 useless extension candidates. Maximal degree in co-relation 114072. Up to 7873 conditions per place. [2022-12-06 07:53:14,909 INFO L137 encePairwiseOnDemand]: 21/45 looper letters, 649 selfloop transitions, 284 changer transitions 17/950 dead transitions. [2022-12-06 07:53:14,909 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 950 transitions, 28138 flow [2022-12-06 07:53:14,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 07:53:14,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 07:53:14,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 171 transitions. [2022-12-06 07:53:14,910 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2111111111111111 [2022-12-06 07:53:14,910 INFO L175 Difference]: Start difference. First operand has 387 places, 845 transitions, 24592 flow. Second operand 18 states and 171 transitions. [2022-12-06 07:53:14,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 950 transitions, 28138 flow [2022-12-06 07:53:18,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 950 transitions, 27898 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-12-06 07:53:18,900 INFO L231 Difference]: Finished difference. Result has 402 places, 869 transitions, 25917 flow [2022-12-06 07:53:18,901 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=24352, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=845, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=260, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=561, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=25917, PETRI_PLACES=402, PETRI_TRANSITIONS=869} [2022-12-06 07:53:18,901 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 373 predicate places. [2022-12-06 07:53:18,901 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:53:18,901 INFO L89 Accepts]: Start accepts. Operand has 402 places, 869 transitions, 25917 flow [2022-12-06 07:53:18,905 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:53:18,905 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:53:18,905 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 402 places, 869 transitions, 25917 flow [2022-12-06 07:53:18,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 401 places, 869 transitions, 25917 flow [2022-12-06 07:53:19,781 INFO L130 PetriNetUnfolder]: 1191/4217 cut-off events. [2022-12-06 07:53:19,781 INFO L131 PetriNetUnfolder]: For 175613/175992 co-relation queries the response was YES. [2022-12-06 07:53:19,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40500 conditions, 4217 events. 1191/4217 cut-off events. For 175613/175992 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 46915 event pairs, 43 based on Foata normal form. 7/4120 useless extension candidates. Maximal degree in co-relation 40286. Up to 768 conditions per place. [2022-12-06 07:53:19,846 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 401 places, 869 transitions, 25917 flow [2022-12-06 07:53:19,846 INFO L188 LiptonReduction]: Number of co-enabled transitions 4194 [2022-12-06 07:53:19,848 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:53:19,849 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 948 [2022-12-06 07:53:19,849 INFO L495 AbstractCegarLoop]: Abstraction has has 401 places, 869 transitions, 25917 flow [2022-12-06 07:53:19,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:53:19,849 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:53:19,849 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 07:53:19,855 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 07:53:20,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:53:20,052 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 07:53:20,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:53:20,052 INFO L85 PathProgramCache]: Analyzing trace with hash 78297868, now seen corresponding path program 1 times [2022-12-06 07:53:20,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:53:20,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532685221] [2022-12-06 07:53:20,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:20,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:53:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:21,458 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 07:53:21,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:53:21,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532685221] [2022-12-06 07:53:21,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532685221] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:53:21,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837079769] [2022-12-06 07:53:21,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:21,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:53:21,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:53:21,460 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 07:53:21,462 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 07:53:21,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:21,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-06 07:53:21,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:53:21,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:53:21,769 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 20 treesize of output 22 [2022-12-06 07:53:21,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:53:21,907 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 34 treesize of output 34 [2022-12-06 07:53:21,983 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:53:21,984 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 89 treesize of output 35 [2022-12-06 07:53:22,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:53:22,009 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:53:22,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837079769] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:53:22,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:53:22,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 17 [2022-12-06 07:53:22,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877219264] [2022-12-06 07:53:22,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:53:22,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:53:22,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:53:22,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:53:22,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2022-12-06 07:53:22,010 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 07:53:22,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 869 transitions, 25917 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 07:53:22,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:53:22,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 07:53:22,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:53:26,155 INFO L130 PetriNetUnfolder]: 5456/10133 cut-off events. [2022-12-06 07:53:26,156 INFO L131 PetriNetUnfolder]: For 560712/560712 co-relation queries the response was YES. [2022-12-06 07:53:26,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115315 conditions, 10133 events. 5456/10133 cut-off events. For 560712/560712 co-relation queries the response was YES. Maximal size of possible extension queue 660. Compared 80923 event pairs, 1249 based on Foata normal form. 1/10134 useless extension candidates. Maximal degree in co-relation 115055. Up to 8695 conditions per place. [2022-12-06 07:53:26,275 INFO L137 encePairwiseOnDemand]: 30/45 looper letters, 731 selfloop transitions, 138 changer transitions 32/901 dead transitions. [2022-12-06 07:53:26,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 901 transitions, 28011 flow [2022-12-06 07:53:26,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:53:26,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:53:26,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2022-12-06 07:53:26,276 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.273015873015873 [2022-12-06 07:53:26,276 INFO L175 Difference]: Start difference. First operand has 401 places, 869 transitions, 25917 flow. Second operand 7 states and 86 transitions. [2022-12-06 07:53:26,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 901 transitions, 28011 flow [2022-12-06 07:53:30,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 901 transitions, 27605 flow, removed 23 selfloop flow, removed 12 redundant places. [2022-12-06 07:53:30,677 INFO L231 Difference]: Finished difference. Result has 397 places, 864 transitions, 25670 flow [2022-12-06 07:53:30,678 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=25511, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=869, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=731, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=25670, PETRI_PLACES=397, PETRI_TRANSITIONS=864} [2022-12-06 07:53:30,679 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 368 predicate places. [2022-12-06 07:53:30,679 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:53:30,679 INFO L89 Accepts]: Start accepts. Operand has 397 places, 864 transitions, 25670 flow [2022-12-06 07:53:30,685 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:53:30,685 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:53:30,685 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 397 places, 864 transitions, 25670 flow [2022-12-06 07:53:30,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 393 places, 864 transitions, 25670 flow [2022-12-06 07:53:31,583 INFO L130 PetriNetUnfolder]: 1183/4178 cut-off events. [2022-12-06 07:53:31,584 INFO L131 PetriNetUnfolder]: For 176523/176889 co-relation queries the response was YES. [2022-12-06 07:53:31,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40030 conditions, 4178 events. 1183/4178 cut-off events. For 176523/176889 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 46518 event pairs, 40 based on Foata normal form. 8/4088 useless extension candidates. Maximal degree in co-relation 39843. Up to 756 conditions per place. [2022-12-06 07:53:31,654 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 393 places, 864 transitions, 25670 flow [2022-12-06 07:53:31,655 INFO L188 LiptonReduction]: Number of co-enabled transitions 4178 [2022-12-06 07:53:31,656 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:53:31,657 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 978 [2022-12-06 07:53:31,657 INFO L495 AbstractCegarLoop]: Abstraction has has 393 places, 864 transitions, 25670 flow [2022-12-06 07:53:31,657 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 07:53:31,657 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:53:31,657 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 07:53:31,662 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 07:53:31,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:53:31,858 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 07:53:31,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:53:31,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1178954094, now seen corresponding path program 1 times [2022-12-06 07:53:31,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:53:31,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901873340] [2022-12-06 07:53:31,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:31,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:53:31,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:31,945 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 07:53:31,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:53:31,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901873340] [2022-12-06 07:53:31,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901873340] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:53:31,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497978045] [2022-12-06 07:53:31,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:31,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:53:31,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:53:31,947 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 07:53:31,949 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 07:53:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:32,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 07:53:32,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:53:32,167 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 07:53:32,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:53:32,206 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 07:53:32,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497978045] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:53:32,207 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:53:32,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-12-06 07:53:32,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022010904] [2022-12-06 07:53:32,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:53:32,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 07:53:32,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:53:32,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 07:53:32,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-12-06 07:53:32,208 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 07:53:32,208 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 864 transitions, 25670 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 07:53:32,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:53:32,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 07:53:32,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:53:37,275 INFO L130 PetriNetUnfolder]: 6503/12574 cut-off events. [2022-12-06 07:53:37,275 INFO L131 PetriNetUnfolder]: For 677721/677721 co-relation queries the response was YES. [2022-12-06 07:53:37,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139688 conditions, 12574 events. 6503/12574 cut-off events. For 677721/677721 co-relation queries the response was YES. Maximal size of possible extension queue 769. Compared 108254 event pairs, 749 based on Foata normal form. 217/12791 useless extension candidates. Maximal degree in co-relation 139322. Up to 3529 conditions per place. [2022-12-06 07:53:37,436 INFO L137 encePairwiseOnDemand]: 20/44 looper letters, 720 selfloop transitions, 461 changer transitions 46/1227 dead transitions. [2022-12-06 07:53:37,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 1227 transitions, 36700 flow [2022-12-06 07:53:37,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 07:53:37,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 07:53:37,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 200 transitions. [2022-12-06 07:53:37,437 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25252525252525254 [2022-12-06 07:53:37,437 INFO L175 Difference]: Start difference. First operand has 393 places, 864 transitions, 25670 flow. Second operand 18 states and 200 transitions. [2022-12-06 07:53:37,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 1227 transitions, 36700 flow [2022-12-06 07:53:44,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 1227 transitions, 35963 flow, removed 20 selfloop flow, removed 7 redundant places. [2022-12-06 07:53:44,107 INFO L231 Difference]: Finished difference. Result has 409 places, 903 transitions, 27656 flow [2022-12-06 07:53:44,107 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=24008, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=828, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=365, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=27656, PETRI_PLACES=409, PETRI_TRANSITIONS=903} [2022-12-06 07:53:44,108 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 380 predicate places. [2022-12-06 07:53:44,108 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:53:44,108 INFO L89 Accepts]: Start accepts. Operand has 409 places, 903 transitions, 27656 flow [2022-12-06 07:53:44,112 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:53:44,113 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:53:44,113 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 409 places, 903 transitions, 27656 flow [2022-12-06 07:53:44,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 405 places, 903 transitions, 27656 flow [2022-12-06 07:53:45,199 INFO L130 PetriNetUnfolder]: 1297/5179 cut-off events. [2022-12-06 07:53:45,200 INFO L131 PetriNetUnfolder]: For 205449/205814 co-relation queries the response was YES. [2022-12-06 07:53:45,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48626 conditions, 5179 events. 1297/5179 cut-off events. For 205449/205814 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 62093 event pairs, 56 based on Foata normal form. 3/5091 useless extension candidates. Maximal degree in co-relation 48240. Up to 908 conditions per place. [2022-12-06 07:53:45,295 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 405 places, 903 transitions, 27656 flow [2022-12-06 07:53:45,295 INFO L188 LiptonReduction]: Number of co-enabled transitions 4520 [2022-12-06 07:53:45,297 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:53:45,297 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1189 [2022-12-06 07:53:45,298 INFO L495 AbstractCegarLoop]: Abstraction has has 405 places, 903 transitions, 27656 flow [2022-12-06 07:53:45,298 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 07:53:45,298 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:53:45,298 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 07:53:45,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-12-06 07:53:45,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:53:45,498 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 07:53:45,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:53:45,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1787895021, now seen corresponding path program 3 times [2022-12-06 07:53:45,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:53:45,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725644210] [2022-12-06 07:53:45,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:45,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:53:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:46,426 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 07:53:46,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:53:46,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725644210] [2022-12-06 07:53:46,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725644210] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:53:46,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086344221] [2022-12-06 07:53:46,426 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 07:53:46,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:53:46,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:53:46,427 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 07:53:46,429 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 07:53:46,692 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 07:53:46,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:53:46,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-06 07:53:46,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:53:46,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 07:53:46,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:53:47,085 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-06 07:53:47,086 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 07:53:47,207 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 07:53:47,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086344221] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:53:47,207 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:53:47,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 22 [2022-12-06 07:53:47,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793445646] [2022-12-06 07:53:47,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:53:47,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 07:53:47,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:53:47,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 07:53:47,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2022-12-06 07:53:47,208 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 07:53:47,208 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 903 transitions, 27656 flow. Second operand has 23 states, 22 states have (on average 2.590909090909091) internal successors, (57), 23 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 07:53:47,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:53:47,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 07:53:47,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:53:53,633 INFO L130 PetriNetUnfolder]: 6522/12539 cut-off events. [2022-12-06 07:53:53,633 INFO L131 PetriNetUnfolder]: For 690366/690366 co-relation queries the response was YES. [2022-12-06 07:53:53,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143299 conditions, 12539 events. 6522/12539 cut-off events. For 690366/690366 co-relation queries the response was YES. Maximal size of possible extension queue 747. Compared 107104 event pairs, 484 based on Foata normal form. 2/12541 useless extension candidates. Maximal degree in co-relation 142087. Up to 2886 conditions per place. [2022-12-06 07:53:54,092 INFO L137 encePairwiseOnDemand]: 19/44 looper letters, 296 selfloop transitions, 722 changer transitions 14/1032 dead transitions. [2022-12-06 07:53:54,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 1032 transitions, 31633 flow [2022-12-06 07:53:54,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 07:53:54,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 07:53:54,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 185 transitions. [2022-12-06 07:53:54,094 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22129186602870812 [2022-12-06 07:53:54,094 INFO L175 Difference]: Start difference. First operand has 405 places, 903 transitions, 27656 flow. Second operand 19 states and 185 transitions. [2022-12-06 07:53:54,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 423 places, 1032 transitions, 31633 flow [2022-12-06 07:54:01,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 1032 transitions, 29687 flow, removed 264 selfloop flow, removed 21 redundant places. [2022-12-06 07:54:01,289 INFO L231 Difference]: Finished difference. Result has 407 places, 934 transitions, 28977 flow [2022-12-06 07:54:01,289 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=25871, PETRI_DIFFERENCE_MINUEND_PLACES=384, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=903, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=691, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=28977, PETRI_PLACES=407, PETRI_TRANSITIONS=934} [2022-12-06 07:54:01,290 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 378 predicate places. [2022-12-06 07:54:01,290 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:01,290 INFO L89 Accepts]: Start accepts. Operand has 407 places, 934 transitions, 28977 flow [2022-12-06 07:54:01,295 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:01,296 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:01,296 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 407 places, 934 transitions, 28977 flow [2022-12-06 07:54:01,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 406 places, 934 transitions, 28977 flow [2022-12-06 07:54:02,275 INFO L130 PetriNetUnfolder]: 1316/5227 cut-off events. [2022-12-06 07:54:02,275 INFO L131 PetriNetUnfolder]: For 202434/202721 co-relation queries the response was YES. [2022-12-06 07:54:02,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49371 conditions, 5227 events. 1316/5227 cut-off events. For 202434/202721 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 62576 event pairs, 56 based on Foata normal form. 5/5142 useless extension candidates. Maximal degree in co-relation 49092. Up to 915 conditions per place. [2022-12-06 07:54:02,374 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 406 places, 934 transitions, 28977 flow [2022-12-06 07:54:02,374 INFO L188 LiptonReduction]: Number of co-enabled transitions 4684 [2022-12-06 07:54:02,376 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:54:02,377 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1087 [2022-12-06 07:54:02,377 INFO L495 AbstractCegarLoop]: Abstraction has has 406 places, 934 transitions, 28977 flow [2022-12-06 07:54:02,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.590909090909091) internal successors, (57), 23 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 07:54:02,377 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:02,377 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:02,382 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 07:54:02,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:02,578 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 07:54:02,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:02,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1098755627, now seen corresponding path program 10 times [2022-12-06 07:54:02,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:02,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236724402] [2022-12-06 07:54:02,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:02,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:02,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:02,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:02,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:02,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236724402] [2022-12-06 07:54:02,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236724402] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:54:02,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634766565] [2022-12-06 07:54:02,660 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 07:54:02,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:02,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:54:02,662 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 07:54:02,662 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 07:54:02,867 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 07:54:02,867 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:54:02,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 07:54:02,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:54:02,894 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:02,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:54:02,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:02,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634766565] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:54:02,938 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:54:02,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-12-06 07:54:02,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880549946] [2022-12-06 07:54:02,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:54:02,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 07:54:02,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:02,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 07:54:02,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-12-06 07:54:02,939 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 07:54:02,939 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 934 transitions, 28977 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 07:54:02,939 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:02,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 07:54:02,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:09,959 INFO L130 PetriNetUnfolder]: 8171/15943 cut-off events. [2022-12-06 07:54:09,959 INFO L131 PetriNetUnfolder]: For 908209/908209 co-relation queries the response was YES. [2022-12-06 07:54:10,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184434 conditions, 15943 events. 8171/15943 cut-off events. For 908209/908209 co-relation queries the response was YES. Maximal size of possible extension queue 990. Compared 144038 event pairs, 2070 based on Foata normal form. 136/16079 useless extension candidates. Maximal degree in co-relation 183940. Up to 9453 conditions per place. [2022-12-06 07:54:10,167 INFO L137 encePairwiseOnDemand]: 23/44 looper letters, 1239 selfloop transitions, 253 changer transitions 5/1497 dead transitions. [2022-12-06 07:54:10,168 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 1497 transitions, 46617 flow [2022-12-06 07:54:10,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 07:54:10,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 07:54:10,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 216 transitions. [2022-12-06 07:54:10,169 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2727272727272727 [2022-12-06 07:54:10,169 INFO L175 Difference]: Start difference. First operand has 406 places, 934 transitions, 28977 flow. Second operand 18 states and 216 transitions. [2022-12-06 07:54:10,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 423 places, 1497 transitions, 46617 flow [2022-12-06 07:54:20,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 1497 transitions, 45526 flow, removed 76 selfloop flow, removed 10 redundant places. [2022-12-06 07:54:20,545 INFO L231 Difference]: Finished difference. Result has 423 places, 1058 transitions, 32186 flow [2022-12-06 07:54:20,546 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=28152, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=931, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=766, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=32186, PETRI_PLACES=423, PETRI_TRANSITIONS=1058} [2022-12-06 07:54:20,546 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 394 predicate places. [2022-12-06 07:54:20,546 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:20,546 INFO L89 Accepts]: Start accepts. Operand has 423 places, 1058 transitions, 32186 flow [2022-12-06 07:54:20,551 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:20,551 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:20,551 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 423 places, 1058 transitions, 32186 flow [2022-12-06 07:54:20,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 423 places, 1058 transitions, 32186 flow [2022-12-06 07:54:21,855 INFO L130 PetriNetUnfolder]: 1574/6552 cut-off events. [2022-12-06 07:54:21,855 INFO L131 PetriNetUnfolder]: For 241816/242203 co-relation queries the response was YES. [2022-12-06 07:54:21,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61096 conditions, 6552 events. 1574/6552 cut-off events. For 241816/242203 co-relation queries the response was YES. Maximal size of possible extension queue 703. Compared 83403 event pairs, 56 based on Foata normal form. 3/6411 useless extension candidates. Maximal degree in co-relation 60734. Up to 1057 conditions per place. [2022-12-06 07:54:21,993 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 423 places, 1058 transitions, 32186 flow [2022-12-06 07:54:21,993 INFO L188 LiptonReduction]: Number of co-enabled transitions 5320 [2022-12-06 07:54:21,995 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 07:54:22,079 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [671] $Ultimate##0-->L103-3: Formula: (and (= |v_thread1Thread1of1ForFork2_~x~0#1_190| v_~B~0_130) (< 0 (mod v_~A~0_244 4294967296)) (= (+ |v_#pthreadsForks_297| 1) |v_#pthreadsForks_296|) (= |v_ULTIMATE.start_main_#t~pre16#1_162| |v_#pthreadsForks_297|) (= |v_thread1Thread1of1ForFork2_~i~0#1_185| 1) (= (store |v_#memory_int_465| |v_ULTIMATE.start_main_~#t2~0#1.base_79| (store (select |v_#memory_int_465| |v_ULTIMATE.start_main_~#t2~0#1.base_79|) |v_ULTIMATE.start_main_~#t2~0#1.offset_55| |v_ULTIMATE.start_main_#t~pre16#1_162|)) |v_#memory_int_464|)) InVars {~A~0=v_~A~0_244, #pthreadsForks=|v_#pthreadsForks_297|, ~B~0=v_~B~0_130, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_55|, #memory_int=|v_#memory_int_465|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_79|} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_63|, ~A~0=v_~A~0_244, #pthreadsForks=|v_#pthreadsForks_296|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_72|, ~B~0=v_~B~0_130, thread1Thread1of1ForFork2_~x~0#1=|v_thread1Thread1of1ForFork2_~x~0#1_190|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_55|, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_185|, #memory_int=|v_#memory_int_464|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_162|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_79|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_50|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, #pthreadsForks, ULTIMATE.start_main_#t~pre14#1, thread1Thread1of1ForFork2_~x~0#1, thread1Thread1of1ForFork2_~i~0#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet15#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 07:54:22,153 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:54:22,153 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1607 [2022-12-06 07:54:22,153 INFO L495 AbstractCegarLoop]: Abstraction has has 423 places, 1058 transitions, 32239 flow [2022-12-06 07:54:22,154 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 07:54:22,154 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:22,154 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 07:54:22,175 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 07:54:22,361 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,SelfDestructingSolverStorable94 [2022-12-06 07:54:22,362 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 07:54:22,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:22,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1536027288, now seen corresponding path program 1 times [2022-12-06 07:54:22,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:22,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651679111] [2022-12-06 07:54:22,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:22,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:22,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:22,454 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 07:54:22,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:22,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651679111] [2022-12-06 07:54:22,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651679111] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:54:22,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371883863] [2022-12-06 07:54:22,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:22,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:22,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:54:22,456 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 07:54:22,457 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 07:54:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:22,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 07:54:22,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:54:22,742 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 07:54:22,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:54:22,775 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 07:54:22,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371883863] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:54:22,775 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:54:22,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-06 07:54:22,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498717561] [2022-12-06 07:54:22,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:54:22,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:54:22,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:22,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:54:22,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:54:22,776 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 07:54:22,776 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 423 places, 1058 transitions, 32239 flow. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 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 07:54:22,776 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:22,776 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 07:54:22,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:30,022 INFO L130 PetriNetUnfolder]: 8306/16192 cut-off events. [2022-12-06 07:54:30,023 INFO L131 PetriNetUnfolder]: For 932157/932157 co-relation queries the response was YES. [2022-12-06 07:54:30,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186983 conditions, 16192 events. 8306/16192 cut-off events. For 932157/932157 co-relation queries the response was YES. Maximal size of possible extension queue 1022. Compared 146256 event pairs, 2860 based on Foata normal form. 95/16287 useless extension candidates. Maximal degree in co-relation 185701. Up to 15427 conditions per place. [2022-12-06 07:54:30,334 INFO L137 encePairwiseOnDemand]: 37/47 looper letters, 1100 selfloop transitions, 67 changer transitions 0/1167 dead transitions. [2022-12-06 07:54:30,335 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 1167 transitions, 37254 flow [2022-12-06 07:54:30,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 07:54:30,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 07:54:30,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2022-12-06 07:54:30,335 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23404255319148937 [2022-12-06 07:54:30,335 INFO L175 Difference]: Start difference. First operand has 423 places, 1058 transitions, 32239 flow. Second operand 10 states and 110 transitions. [2022-12-06 07:54:30,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 432 places, 1167 transitions, 37254 flow [2022-12-06 07:54:41,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 428 places, 1167 transitions, 36621 flow, removed 283 selfloop flow, removed 4 redundant places. [2022-12-06 07:54:41,517 INFO L231 Difference]: Finished difference. Result has 432 places, 1089 transitions, 32816 flow [2022-12-06 07:54:41,518 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=31635, PETRI_DIFFERENCE_MINUEND_PLACES=419, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1058, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1013, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=32816, PETRI_PLACES=432, PETRI_TRANSITIONS=1089} [2022-12-06 07:54:41,518 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 403 predicate places. [2022-12-06 07:54:41,518 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:41,518 INFO L89 Accepts]: Start accepts. Operand has 432 places, 1089 transitions, 32816 flow [2022-12-06 07:54:41,529 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:41,529 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:41,529 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 432 places, 1089 transitions, 32816 flow [2022-12-06 07:54:41,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 432 places, 1089 transitions, 32816 flow [2022-12-06 07:54:42,900 INFO L130 PetriNetUnfolder]: 1593/6639 cut-off events. [2022-12-06 07:54:42,900 INFO L131 PetriNetUnfolder]: For 240673/240958 co-relation queries the response was YES. [2022-12-06 07:54:42,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61497 conditions, 6639 events. 1593/6639 cut-off events. For 240673/240958 co-relation queries the response was YES. Maximal size of possible extension queue 719. Compared 84667 event pairs, 62 based on Foata normal form. 3/6516 useless extension candidates. Maximal degree in co-relation 61130. Up to 1082 conditions per place. [2022-12-06 07:54:43,045 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 432 places, 1089 transitions, 32816 flow [2022-12-06 07:54:43,045 INFO L188 LiptonReduction]: Number of co-enabled transitions 5444 [2022-12-06 07:54:43,048 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:54:43,049 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1531 [2022-12-06 07:54:43,049 INFO L495 AbstractCegarLoop]: Abstraction has has 432 places, 1089 transitions, 32816 flow [2022-12-06 07:54:43,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 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 07:54:43,049 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:43,049 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 07:54:43,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-12-06 07:54:43,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:43,250 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 07:54:43,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:43,250 INFO L85 PathProgramCache]: Analyzing trace with hash -597049609, now seen corresponding path program 1 times [2022-12-06 07:54:43,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:43,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412192167] [2022-12-06 07:54:43,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:43,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:43,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:43,307 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 07:54:43,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:43,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412192167] [2022-12-06 07:54:43,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412192167] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:54:43,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967703831] [2022-12-06 07:54:43,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:43,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:43,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:54:43,309 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 07:54:43,310 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 07:54:43,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:43,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 07:54:43,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:54:43,555 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 07:54:43,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:54:43,581 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 07:54:43,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967703831] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:54:43,581 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:54:43,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-12-06 07:54:43,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823490952] [2022-12-06 07:54:43,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:54:43,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:54:43,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:43,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:54:43,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:54:43,582 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 07:54:43,583 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 432 places, 1089 transitions, 32816 flow. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:43,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:43,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 07:54:43,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:51,808 INFO L130 PetriNetUnfolder]: 8988/17460 cut-off events. [2022-12-06 07:54:51,808 INFO L131 PetriNetUnfolder]: For 979107/979107 co-relation queries the response was YES. [2022-12-06 07:54:52,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199641 conditions, 17460 events. 8988/17460 cut-off events. For 979107/979107 co-relation queries the response was YES. Maximal size of possible extension queue 1094. Compared 158951 event pairs, 2895 based on Foata normal form. 57/17517 useless extension candidates. Maximal degree in co-relation 198354. Up to 13613 conditions per place. [2022-12-06 07:54:52,334 INFO L137 encePairwiseOnDemand]: 37/47 looper letters, 1168 selfloop transitions, 109 changer transitions 0/1277 dead transitions. [2022-12-06 07:54:52,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 1277 transitions, 40933 flow [2022-12-06 07:54:52,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:54:52,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:54:52,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2022-12-06 07:54:52,335 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31560283687943264 [2022-12-06 07:54:52,335 INFO L175 Difference]: Start difference. First operand has 432 places, 1089 transitions, 32816 flow. Second operand 6 states and 89 transitions. [2022-12-06 07:54:52,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 1277 transitions, 40933 flow [2022-12-06 07:55:05,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 1277 transitions, 40568 flow, removed 171 selfloop flow, removed 1 redundant places. [2022-12-06 07:55:05,555 INFO L231 Difference]: Finished difference. Result has 439 places, 1118 transitions, 33829 flow [2022-12-06 07:55:05,555 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=32451, PETRI_DIFFERENCE_MINUEND_PLACES=431, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1089, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=980, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=33829, PETRI_PLACES=439, PETRI_TRANSITIONS=1118} [2022-12-06 07:55:05,556 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 410 predicate places. [2022-12-06 07:55:05,556 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:55:05,556 INFO L89 Accepts]: Start accepts. Operand has 439 places, 1118 transitions, 33829 flow [2022-12-06 07:55:05,561 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:55:05,561 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:55:05,562 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 439 places, 1118 transitions, 33829 flow [2022-12-06 07:55:05,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 439 places, 1118 transitions, 33829 flow [2022-12-06 07:55:07,143 INFO L130 PetriNetUnfolder]: 1732/7170 cut-off events. [2022-12-06 07:55:07,143 INFO L131 PetriNetUnfolder]: For 267317/267638 co-relation queries the response was YES. [2022-12-06 07:55:07,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67035 conditions, 7170 events. 1732/7170 cut-off events. For 267317/267638 co-relation queries the response was YES. Maximal size of possible extension queue 772. Compared 92508 event pairs, 66 based on Foata normal form. 3/7035 useless extension candidates. Maximal degree in co-relation 66652. Up to 1208 conditions per place. [2022-12-06 07:55:07,258 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 439 places, 1118 transitions, 33829 flow [2022-12-06 07:55:07,258 INFO L188 LiptonReduction]: Number of co-enabled transitions 5642 [2022-12-06 07:55:07,260 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:55:07,260 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1704 [2022-12-06 07:55:07,261 INFO L495 AbstractCegarLoop]: Abstraction has has 439 places, 1118 transitions, 33829 flow [2022-12-06 07:55:07,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:55:07,261 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:55:07,261 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 07:55:07,267 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 07:55:07,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:55:07,461 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 07:55:07,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:55:07,462 INFO L85 PathProgramCache]: Analyzing trace with hash -724624011, now seen corresponding path program 1 times [2022-12-06 07:55:07,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:55:07,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288872620] [2022-12-06 07:55:07,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:55:07,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:55:07,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:55:07,549 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 07:55:07,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:55:07,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288872620] [2022-12-06 07:55:07,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288872620] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:55:07,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:55:07,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:55:07,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997076456] [2022-12-06 07:55:07,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:55:07,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:55:07,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:55:07,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:55:07,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:55:07,550 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 07:55:07,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 1118 transitions, 33829 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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 07:55:07,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:55:07,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 07:55:07,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:55:15,503 INFO L130 PetriNetUnfolder]: 8995/17530 cut-off events. [2022-12-06 07:55:15,504 INFO L131 PetriNetUnfolder]: For 989338/989338 co-relation queries the response was YES. [2022-12-06 07:55:15,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200218 conditions, 17530 events. 8995/17530 cut-off events. For 989338/989338 co-relation queries the response was YES. Maximal size of possible extension queue 1096. Compared 160176 event pairs, 3074 based on Foata normal form. 11/17541 useless extension candidates. Maximal degree in co-relation 198916. Up to 16644 conditions per place. [2022-12-06 07:55:15,716 INFO L137 encePairwiseOnDemand]: 37/47 looper letters, 1135 selfloop transitions, 54 changer transitions 0/1189 dead transitions. [2022-12-06 07:55:15,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 1189 transitions, 37519 flow [2022-12-06 07:55:15,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:55:15,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:55:15,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2022-12-06 07:55:15,717 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3262411347517731 [2022-12-06 07:55:15,717 INFO L175 Difference]: Start difference. First operand has 439 places, 1118 transitions, 33829 flow. Second operand 6 states and 92 transitions. [2022-12-06 07:55:15,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 1189 transitions, 37519 flow [2022-12-06 07:55:28,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 1189 transitions, 37385 flow, removed 57 selfloop flow, removed 2 redundant places. [2022-12-06 07:55:28,458 INFO L231 Difference]: Finished difference. Result has 443 places, 1124 transitions, 33972 flow [2022-12-06 07:55:28,459 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=33695, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1064, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=33972, PETRI_PLACES=443, PETRI_TRANSITIONS=1124} [2022-12-06 07:55:28,459 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 414 predicate places. [2022-12-06 07:55:28,459 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:55:28,459 INFO L89 Accepts]: Start accepts. Operand has 443 places, 1124 transitions, 33972 flow [2022-12-06 07:55:28,464 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:55:28,464 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:55:28,464 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 443 places, 1124 transitions, 33972 flow [2022-12-06 07:55:28,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 443 places, 1124 transitions, 33972 flow [2022-12-06 07:55:29,871 INFO L130 PetriNetUnfolder]: 1723/7196 cut-off events. [2022-12-06 07:55:29,871 INFO L131 PetriNetUnfolder]: For 266831/267152 co-relation queries the response was YES. [2022-12-06 07:55:29,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66999 conditions, 7196 events. 1723/7196 cut-off events. For 266831/267152 co-relation queries the response was YES. Maximal size of possible extension queue 773. Compared 93196 event pairs, 67 based on Foata normal form. 3/7056 useless extension candidates. Maximal degree in co-relation 66617. Up to 1205 conditions per place. [2022-12-06 07:55:30,025 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 443 places, 1124 transitions, 33972 flow [2022-12-06 07:55:30,025 INFO L188 LiptonReduction]: Number of co-enabled transitions 5666 [2022-12-06 07:55:30,028 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:55:30,029 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1570 [2022-12-06 07:55:30,029 INFO L495 AbstractCegarLoop]: Abstraction has has 443 places, 1124 transitions, 33972 flow [2022-12-06 07:55:30,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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 07:55:30,029 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:55:30,029 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 07:55:30,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2022-12-06 07:55:30,029 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 07:55:30,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:55:30,029 INFO L85 PathProgramCache]: Analyzing trace with hash 175087679, now seen corresponding path program 1 times [2022-12-06 07:55:30,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:55:30,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450370048] [2022-12-06 07:55:30,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:55:30,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:55:30,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:55:30,101 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 07:55:30,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:55:30,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450370048] [2022-12-06 07:55:30,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450370048] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:55:30,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053001661] [2022-12-06 07:55:30,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:55:30,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:55:30,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:55:30,104 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:55:30,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-06 07:55:30,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:55:30,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 07:55:30,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:55:30,343 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 07:55:30,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:55:30,377 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 07:55:30,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053001661] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:55:30,378 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:55:30,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 9 [2022-12-06 07:55:30,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941280725] [2022-12-06 07:55:30,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:55:30,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:55:30,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:55:30,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:55:30,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:55:30,378 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 07:55:30,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 1124 transitions, 33972 flow. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 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 07:55:30,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:55:30,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 07:55:30,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:55:40,285 INFO L130 PetriNetUnfolder]: 10494/20412 cut-off events. [2022-12-06 07:55:40,285 INFO L131 PetriNetUnfolder]: For 1172531/1172531 co-relation queries the response was YES. [2022-12-06 07:55:40,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232561 conditions, 20412 events. 10494/20412 cut-off events. For 1172531/1172531 co-relation queries the response was YES. Maximal size of possible extension queue 1274. Compared 191096 event pairs, 2637 based on Foata normal form. 45/20457 useless extension candidates. Maximal degree in co-relation 230775. Up to 10817 conditions per place. [2022-12-06 07:55:40,601 INFO L137 encePairwiseOnDemand]: 22/47 looper letters, 1155 selfloop transitions, 412 changer transitions 1/1568 dead transitions. [2022-12-06 07:55:40,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 1568 transitions, 48744 flow [2022-12-06 07:55:40,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 07:55:40,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 07:55:40,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 168 transitions. [2022-12-06 07:55:40,602 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2978723404255319 [2022-12-06 07:55:40,602 INFO L175 Difference]: Start difference. First operand has 443 places, 1124 transitions, 33972 flow. Second operand 12 states and 168 transitions. [2022-12-06 07:55:40,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 1568 transitions, 48744 flow [2022-12-06 07:55:56,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 1568 transitions, 48621 flow, removed 15 selfloop flow, removed 3 redundant places. [2022-12-06 07:55:56,944 INFO L231 Difference]: Finished difference. Result has 456 places, 1206 transitions, 37795 flow [2022-12-06 07:55:56,945 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=33849, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=338, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=775, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=37795, PETRI_PLACES=456, PETRI_TRANSITIONS=1206} [2022-12-06 07:55:56,945 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 427 predicate places. [2022-12-06 07:55:56,945 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:55:56,946 INFO L89 Accepts]: Start accepts. Operand has 456 places, 1206 transitions, 37795 flow [2022-12-06 07:55:56,951 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:55:56,952 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:55:56,952 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 456 places, 1206 transitions, 37795 flow [2022-12-06 07:55:56,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 456 places, 1206 transitions, 37795 flow [2022-12-06 07:55:58,834 INFO L130 PetriNetUnfolder]: 1997/8407 cut-off events. [2022-12-06 07:55:58,835 INFO L131 PetriNetUnfolder]: For 317575/317959 co-relation queries the response was YES. [2022-12-06 07:55:58,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79133 conditions, 8407 events. 1997/8407 cut-off events. For 317575/317959 co-relation queries the response was YES. Maximal size of possible extension queue 906. Compared 112134 event pairs, 85 based on Foata normal form. 3/8251 useless extension candidates. Maximal degree in co-relation 78638. Up to 1460 conditions per place. [2022-12-06 07:55:58,996 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 456 places, 1206 transitions, 37795 flow [2022-12-06 07:55:58,996 INFO L188 LiptonReduction]: Number of co-enabled transitions 6144 [2022-12-06 07:55:58,999 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:55:58,999 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2054 [2022-12-06 07:55:58,999 INFO L495 AbstractCegarLoop]: Abstraction has has 456 places, 1206 transitions, 37795 flow [2022-12-06 07:55:58,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 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 07:55:58,999 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:55:58,999 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 07:55:59,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-12-06 07:55:59,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:55:59,200 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 07:55:59,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:55:59,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1392745755, now seen corresponding path program 2 times [2022-12-06 07:55:59,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:55:59,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989303665] [2022-12-06 07:55:59,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:55:59,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:55:59,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:55:59,283 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 07:55:59,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:55:59,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989303665] [2022-12-06 07:55:59,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989303665] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:55:59,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:55:59,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:55:59,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294505426] [2022-12-06 07:55:59,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:55:59,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:55:59,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:55:59,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:55:59,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:55:59,284 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 07:55:59,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 1206 transitions, 37795 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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 07:55:59,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:55:59,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 07:55:59,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:56:09,131 INFO L130 PetriNetUnfolder]: 10387/20199 cut-off events. [2022-12-06 07:56:09,131 INFO L131 PetriNetUnfolder]: For 1171590/1171590 co-relation queries the response was YES. [2022-12-06 07:56:09,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234661 conditions, 20199 events. 10387/20199 cut-off events. For 1171590/1171590 co-relation queries the response was YES. Maximal size of possible extension queue 1257. Compared 188338 event pairs, 3552 based on Foata normal form. 11/20210 useless extension candidates. Maximal degree in co-relation 232736. Up to 19562 conditions per place. [2022-12-06 07:56:09,500 INFO L137 encePairwiseOnDemand]: 39/47 looper letters, 1196 selfloop transitions, 41 changer transitions 6/1243 dead transitions. [2022-12-06 07:56:09,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 1243 transitions, 40838 flow [2022-12-06 07:56:09,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:56:09,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:56:09,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2022-12-06 07:56:09,501 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32340425531914896 [2022-12-06 07:56:09,501 INFO L175 Difference]: Start difference. First operand has 456 places, 1206 transitions, 37795 flow. Second operand 5 states and 76 transitions. [2022-12-06 07:56:09,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 1243 transitions, 40838 flow [2022-12-06 07:56:27,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 1243 transitions, 40241 flow, removed 202 selfloop flow, removed 6 redundant places. [2022-12-06 07:56:27,515 INFO L231 Difference]: Finished difference. Result has 454 places, 1202 transitions, 37132 flow [2022-12-06 07:56:27,517 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=37135, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=37132, PETRI_PLACES=454, PETRI_TRANSITIONS=1202} [2022-12-06 07:56:27,517 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 425 predicate places. [2022-12-06 07:56:27,517 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:56:27,517 INFO L89 Accepts]: Start accepts. Operand has 454 places, 1202 transitions, 37132 flow [2022-12-06 07:56:27,524 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:56:27,524 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:56:27,524 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 454 places, 1202 transitions, 37132 flow [2022-12-06 07:56:27,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 453 places, 1202 transitions, 37132 flow [2022-12-06 07:56:29,510 INFO L130 PetriNetUnfolder]: 1988/8326 cut-off events. [2022-12-06 07:56:29,510 INFO L131 PetriNetUnfolder]: For 303429/303797 co-relation queries the response was YES. [2022-12-06 07:56:29,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77453 conditions, 8326 events. 1988/8326 cut-off events. For 303429/303797 co-relation queries the response was YES. Maximal size of possible extension queue 896. Compared 110781 event pairs, 85 based on Foata normal form. 2/8176 useless extension candidates. Maximal degree in co-relation 76956. Up to 1453 conditions per place. [2022-12-06 07:56:29,678 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 453 places, 1202 transitions, 37132 flow [2022-12-06 07:56:29,678 INFO L188 LiptonReduction]: Number of co-enabled transitions 6124 [2022-12-06 07:56:29,680 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 07:56:29,725 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:56:29,726 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2209 [2022-12-06 07:56:29,726 INFO L495 AbstractCegarLoop]: Abstraction has has 453 places, 1202 transitions, 37149 flow [2022-12-06 07:56:29,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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 07:56:29,726 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:56:29,726 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 07:56:29,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2022-12-06 07:56:29,726 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 07:56:29,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:56:29,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1231988870, now seen corresponding path program 1 times [2022-12-06 07:56:29,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:56:29,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535427437] [2022-12-06 07:56:29,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:29,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:56:29,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:29,812 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 07:56:29,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:56:29,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535427437] [2022-12-06 07:56:29,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535427437] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:56:29,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:56:29,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:56:29,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619001032] [2022-12-06 07:56:29,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:56:29,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:56:29,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:56:29,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:56:29,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:56:29,813 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-06 07:56:29,813 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 1202 transitions, 37149 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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 07:56:29,813 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:56:29,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-06 07:56:29,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:56:39,402 INFO L130 PetriNetUnfolder]: 10345/20130 cut-off events. [2022-12-06 07:56:39,403 INFO L131 PetriNetUnfolder]: For 1125598/1125598 co-relation queries the response was YES. [2022-12-06 07:56:39,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231376 conditions, 20130 events. 10345/20130 cut-off events. For 1125598/1125598 co-relation queries the response was YES. Maximal size of possible extension queue 1255. Compared 187950 event pairs, 2096 based on Foata normal form. 11/20141 useless extension candidates. Maximal degree in co-relation 229451. Up to 11626 conditions per place. [2022-12-06 07:56:39,679 INFO L137 encePairwiseOnDemand]: 32/48 looper letters, 1051 selfloop transitions, 217 changer transitions 2/1270 dead transitions. [2022-12-06 07:56:39,679 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 1270 transitions, 40679 flow [2022-12-06 07:56:39,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:56:39,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:56:39,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 114 transitions. [2022-12-06 07:56:39,680 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.296875 [2022-12-06 07:56:39,680 INFO L175 Difference]: Start difference. First operand has 453 places, 1202 transitions, 37149 flow. Second operand 8 states and 114 transitions. [2022-12-06 07:56:39,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 1270 transitions, 40679 flow Received shutdown request... [2022-12-06 07:56:45,818 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 07:56:45,830 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 07:56:45,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2022-12-06 07:56:45,830 WARN L619 AbstractCegarLoop]: Verification canceled: while executing RemoveRedundantFlow. [2022-12-06 07:56:45,831 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 07:56:45,831 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 07:56:45,831 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 07:56:45,832 INFO L458 BasicCegarLoop]: Path program histogram: [10, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:56:45,834 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 07:56:45,834 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 07:56:45,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 07:56:45 BasicIcfg [2022-12-06 07:56:45,836 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 07:56:45,836 INFO L158 Benchmark]: Toolchain (without parser) took 773689.27ms. Allocated memory was 179.3MB in the beginning and 5.7GB in the end (delta: 5.5GB). Free memory was 156.8MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. [2022-12-06 07:56:45,837 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 179.3MB. Free memory was 156.8MB in the beginning and 156.8MB in the end (delta: 66.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 07:56:45,837 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.31ms. Allocated memory is still 179.3MB. Free memory was 156.8MB in the beginning and 143.7MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 07:56:45,837 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.65ms. Allocated memory is still 179.3MB. Free memory was 143.7MB in the beginning and 141.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 07:56:45,837 INFO L158 Benchmark]: Boogie Preprocessor took 37.64ms. Allocated memory is still 179.3MB. Free memory was 141.6MB in the beginning and 140.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 07:56:45,837 INFO L158 Benchmark]: RCFGBuilder took 607.67ms. Allocated memory is still 179.3MB. Free memory was 140.1MB in the beginning and 114.4MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-06 07:56:45,837 INFO L158 Benchmark]: TraceAbstraction took 772681.36ms. Allocated memory was 179.3MB in the beginning and 5.7GB in the end (delta: 5.5GB). Free memory was 113.3MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. [2022-12-06 07:56:45,838 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.24ms. Allocated memory is still 179.3MB. Free memory was 156.8MB in the beginning and 156.8MB in the end (delta: 66.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 289.31ms. Allocated memory is still 179.3MB. Free memory was 156.8MB in the beginning and 143.7MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 67.65ms. Allocated memory is still 179.3MB. Free memory was 143.7MB in the beginning and 141.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.64ms. Allocated memory is still 179.3MB. Free memory was 141.6MB in the beginning and 140.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 607.67ms. Allocated memory is still 179.3MB. Free memory was 140.1MB in the beginning and 114.4MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 772681.36ms. Allocated memory was 179.3MB in the beginning and 5.7GB in the end (delta: 5.5GB). Free memory was 113.3MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.2s, 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: 22, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 20, dependent conditional: 0, dependent unconditional: 20, 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.0s, 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.1s, 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.6s, 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.4s, 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: 17, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 9, dependent conditional: 9, 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: 1.2s, 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: 61, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 44, dependent conditional: 44, 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.7s, 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: 18, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 14, dependent conditional: 14, 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.3s, 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.3s, 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: 11, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 7, dependent conditional: 7, 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.2s, 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.3s, 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.5s, 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.4s, 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.2s, 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: 1.0s, 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.2s, 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.3s, 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.5s, 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.4s, 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, 272 PlacesBefore, 272 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, 280 PlacesBefore, 280 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, 299 PlacesBefore, 299 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, 281 PlacesBefore, 281 PlacesAfterwards, 540 TransitionsBefore, 540 TransitionsAfterwards, 2522 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, 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.6s, 307 PlacesBefore, 305 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, 313 PlacesBefore, 313 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, 318 PlacesBefore, 318 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.3s, 326 PlacesBefore, 325 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, 318 PlacesBefore, 318 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.7s, 339 PlacesBefore, 337 PlacesAfterwards, 730 TransitionsBefore, 728 TransitionsAfterwards, 3636 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 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: 6, 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: 15, independent: 15, independent conditional: 6, 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: 7, independent: 7, independent conditional: 4, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 8, independent conditional: 2, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 4, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 308, Positive cache size: 295, Positive conditional cache size: 251, Positive unconditional cache size: 44, 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.0s, 367 PlacesBefore, 367 PlacesAfterwards, 841 TransitionsBefore, 841 TransitionsAfterwards, 4066 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): 308, Positive cache size: 295, Positive conditional cache size: 251, Positive unconditional cache size: 44, 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, 368 PlacesBefore, 368 PlacesAfterwards, 838 TransitionsBefore, 838 TransitionsAfterwards, 4052 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): 308, Positive cache size: 295, Positive conditional cache size: 251, Positive unconditional cache size: 44, 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, 379 PlacesBefore, 378 PlacesAfterwards, 846 TransitionsBefore, 845 TransitionsAfterwards, 4084 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): 308, Positive cache size: 295, Positive conditional cache size: 251, Positive unconditional cache size: 44, 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, 375 PlacesBefore, 375 PlacesAfterwards, 835 TransitionsBefore, 835 TransitionsAfterwards, 4048 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): 308, Positive cache size: 295, Positive conditional cache size: 251, Positive unconditional cache size: 44, 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, 380 PlacesBefore, 379 PlacesAfterwards, 843 TransitionsBefore, 842 TransitionsAfterwards, 4074 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): 309, Positive cache size: 296, Positive conditional cache size: 252, Positive unconditional cache size: 44, 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, 384 PlacesBefore, 383 PlacesAfterwards, 846 TransitionsBefore, 845 TransitionsAfterwards, 4086 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): 313, Positive cache size: 300, Positive conditional cache size: 256, Positive unconditional cache size: 44, 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, 845 TransitionsBefore, 845 TransitionsAfterwards, 4082 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): 313, Positive cache size: 300, Positive conditional cache size: 256, Positive unconditional cache size: 44, 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, 387 PlacesBefore, 387 PlacesAfterwards, 845 TransitionsBefore, 845 TransitionsAfterwards, 4090 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): 313, Positive cache size: 300, Positive conditional cache size: 256, Positive unconditional cache size: 44, 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, 401 PlacesBefore, 401 PlacesAfterwards, 869 TransitionsBefore, 869 TransitionsAfterwards, 4194 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): 313, Positive cache size: 300, Positive conditional cache size: 256, Positive unconditional cache size: 44, 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, 393 PlacesBefore, 393 PlacesAfterwards, 864 TransitionsBefore, 864 TransitionsAfterwards, 4178 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): 313, Positive cache size: 300, Positive conditional cache size: 256, Positive unconditional cache size: 44, 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, 405 PlacesBefore, 405 PlacesAfterwards, 903 TransitionsBefore, 903 TransitionsAfterwards, 4520 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): 313, Positive cache size: 300, Positive conditional cache size: 256, Positive unconditional cache size: 44, 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, 406 PlacesBefore, 406 PlacesAfterwards, 934 TransitionsBefore, 934 TransitionsAfterwards, 4684 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): 313, Positive cache size: 300, Positive conditional cache size: 256, Positive unconditional cache size: 44, 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, 423 PlacesBefore, 423 PlacesAfterwards, 1058 TransitionsBefore, 1058 TransitionsAfterwards, 5320 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 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: 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: 7, independent: 3, independent conditional: 3, 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): 375, Positive cache size: 362, Positive conditional cache size: 316, Positive unconditional cache size: 46, 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, 432 PlacesBefore, 432 PlacesAfterwards, 1089 TransitionsBefore, 1089 TransitionsAfterwards, 5444 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): 375, Positive cache size: 362, Positive conditional cache size: 316, Positive unconditional cache size: 46, 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, 439 PlacesBefore, 439 PlacesAfterwards, 1118 TransitionsBefore, 1118 TransitionsAfterwards, 5642 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): 375, Positive cache size: 362, Positive conditional cache size: 316, Positive unconditional cache size: 46, 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, 443 PlacesBefore, 443 PlacesAfterwards, 1124 TransitionsBefore, 1124 TransitionsAfterwards, 5666 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): 375, Positive cache size: 362, Positive conditional cache size: 316, Positive unconditional cache size: 46, 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, 456 PlacesBefore, 456 PlacesAfterwards, 1206 TransitionsBefore, 1206 TransitionsAfterwards, 6144 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): 375, Positive cache size: 362, Positive conditional cache size: 316, Positive unconditional cache size: 46, 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, 453 PlacesBefore, 453 PlacesAfterwards, 1202 TransitionsBefore, 1202 TransitionsAfterwards, 6124 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, 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): 378, Positive cache size: 365, Positive conditional cache size: 319, Positive unconditional cache size: 46, 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 - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 103]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 104]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 170 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 772.5s, OverallIterations: 101, TraceHistogramMax: 2, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 414.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.4s, HoareTripleCheckerStatistics: 52 mSolverCounterUnknown, 8923 SdHoareTripleChecker+Valid, 58.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8923 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 52.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 268 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2439 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 51832 IncrementalHoareTripleChecker+Invalid, 54591 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2439 mSolverCounterUnsat, 0 mSDtfsCounter, 51832 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2079 GetRequests, 742 SyntacticMatches, 28 SemanticMatches, 1309 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 5965 ImplicationChecksByTransitivity, 72.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37795occurred in iteration=99, InterpolantAutomatonStates: 960, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 4.0s SatisfiabilityAnalysisTime, 274.6s InterpolantComputationTime, 2289 NumberOfCodeBlocks, 2289 NumberOfCodeBlocksAsserted, 140 NumberOfCheckSat, 2642 ConstructedInterpolants, 21 QuantifiedInterpolants, 146383 SizeOfPredicates, 492 NumberOfNonLiveVariables, 7054 ConjunctsInSsa, 959 ConjunctsInUnsatCore, 158 InterpolantComputations, 73 PerfectInterpolantSequences, 18/103 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown