/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/test-easy11.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:44:06,188 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:44:06,189 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:44:06,209 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:44:06,210 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:44:06,212 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:44:06,214 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:44:06,217 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:44:06,220 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:44:06,223 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:44:06,224 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:44:06,227 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:44:06,227 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:44:06,229 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:44:06,229 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:44:06,231 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:44:06,231 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:44:06,232 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:44:06,233 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:44:06,234 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:44:06,234 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:44:06,235 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:44:06,236 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:44:06,236 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:44:06,238 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:44:06,238 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:44:06,239 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:44:06,239 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:44:06,239 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:44:06,240 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:44:06,240 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:44:06,241 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:44:06,241 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:44:06,241 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:44:06,242 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:44:06,242 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:44:06,243 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:44:06,243 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:44:06,243 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:44:06,244 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:44:06,244 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:44:06,245 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:44:06,258 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:44:06,259 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:44:06,259 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:44:06,260 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:44:06,260 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:44:06,260 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:44:06,260 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:44:06,260 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:44:06,260 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:44:06,260 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:44:06,261 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:44:06,261 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:44:06,261 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:44:06,261 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:44:06,261 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:44:06,261 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:44:06,261 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:44:06,261 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:44:06,262 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:44:06,262 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:44:06,262 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:44:06,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:44:06,262 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:44:06,262 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:44:06,262 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:44:06,263 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:44:06,263 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:44:06,263 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:44:06,263 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 05:44:06,526 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:44:06,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:44:06,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:44:06,548 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:44:06,548 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:44:06,549 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/test-easy11.wvr.c [2022-12-06 05:44:07,655 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:44:07,872 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:44:07,872 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy11.wvr.c [2022-12-06 05:44:07,882 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39f9e7af4/fe29ff45bd07444a9a947223465a1ce1/FLAGa43c227ce [2022-12-06 05:44:07,893 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39f9e7af4/fe29ff45bd07444a9a947223465a1ce1 [2022-12-06 05:44:07,895 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:44:07,896 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:44:07,897 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:44:07,897 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:44:07,899 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:44:07,899 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:44:07" (1/1) ... [2022-12-06 05:44:07,900 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1685a25a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:44:07, skipping insertion in model container [2022-12-06 05:44:07,900 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:44:07" (1/1) ... [2022-12-06 05:44:07,905 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:44:07,922 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:44:08,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:44:08,025 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:44:08,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:44:08,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:44:08,033 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/test-easy11.wvr.c[2005,2018] [2022-12-06 05:44:08,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:44:08,043 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:44:08,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:44:08,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:44:08,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:44:08,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:44:08,064 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/test-easy11.wvr.c[2005,2018] [2022-12-06 05:44:08,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:44:08,080 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:44:08,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:44:08 WrapperNode [2022-12-06 05:44:08,080 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:44:08,081 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:44:08,081 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:44:08,081 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:44:08,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:44:08" (1/1) ... [2022-12-06 05:44:08,091 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:44:08" (1/1) ... [2022-12-06 05:44:08,106 INFO L138 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 53 [2022-12-06 05:44:08,107 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:44:08,107 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:44:08,107 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:44:08,107 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:44:08,114 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:44:08" (1/1) ... [2022-12-06 05:44:08,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:44:08" (1/1) ... [2022-12-06 05:44:08,115 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:44:08" (1/1) ... [2022-12-06 05:44:08,116 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:44:08" (1/1) ... [2022-12-06 05:44:08,118 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:44:08" (1/1) ... [2022-12-06 05:44:08,121 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:44:08" (1/1) ... [2022-12-06 05:44:08,122 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:44:08" (1/1) ... [2022-12-06 05:44:08,122 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:44:08" (1/1) ... [2022-12-06 05:44:08,124 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:44:08,124 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:44:08,124 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:44:08,124 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:44:08,125 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:44:08" (1/1) ... [2022-12-06 05:44:08,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:44:08,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:44:08,189 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 05:44:08,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 05:44:08,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:44:08,235 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:44:08,238 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:44:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:44:08,239 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:44:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:44:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:44:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:44:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 05:44:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 05:44:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:44:08,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:44:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:44:08,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:44:08,241 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 05:44:08,334 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:44:08,336 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:44:08,520 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:44:08,525 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:44:08,525 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-06 05:44:08,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:44:08 BoogieIcfgContainer [2022-12-06 05:44:08,527 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:44:08,528 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:44:08,529 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:44:08,531 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:44:08,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:44:07" (1/3) ... [2022-12-06 05:44:08,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b61ce0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:44:08, skipping insertion in model container [2022-12-06 05:44:08,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:44:08" (2/3) ... [2022-12-06 05:44:08,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b61ce0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:44:08, skipping insertion in model container [2022-12-06 05:44:08,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:44:08" (3/3) ... [2022-12-06 05:44:08,533 INFO L112 eAbstractionObserver]: Analyzing ICFG test-easy11.wvr.c [2022-12-06 05:44:08,563 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:44:08,563 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:44:08,563 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:44:08,607 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 05:44:08,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 80 transitions, 176 flow [2022-12-06 05:44:08,713 INFO L130 PetriNetUnfolder]: 6/78 cut-off events. [2022-12-06 05:44:08,714 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:44:08,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 78 events. 6/78 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2022-12-06 05:44:08,718 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 80 transitions, 176 flow [2022-12-06 05:44:08,722 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 70 transitions, 152 flow [2022-12-06 05:44:08,723 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:08,740 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 70 transitions, 152 flow [2022-12-06 05:44:08,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 70 transitions, 152 flow [2022-12-06 05:44:08,764 INFO L130 PetriNetUnfolder]: 6/70 cut-off events. [2022-12-06 05:44:08,764 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:44:08,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 70 events. 6/70 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 48 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2022-12-06 05:44:08,767 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 70 transitions, 152 flow [2022-12-06 05:44:08,767 INFO L188 LiptonReduction]: Number of co-enabled transitions 572 [2022-12-06 05:44:10,653 INFO L203 LiptonReduction]: Total number of compositions: 55 [2022-12-06 05:44:10,666 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:44:10,671 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;@7f9303b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:44:10,671 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 05:44:10,675 INFO L130 PetriNetUnfolder]: 2/14 cut-off events. [2022-12-06 05:44:10,675 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:44:10,675 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:10,676 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:10,676 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:10,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:10,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1773824805, now seen corresponding path program 1 times [2022-12-06 05:44:10,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:10,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147158045] [2022-12-06 05:44:10,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:10,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:10,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:11,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:11,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:11,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147158045] [2022-12-06 05:44:11,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147158045] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:11,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:11,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:44:11,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286855053] [2022-12-06 05:44:11,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:11,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:44:11,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:11,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:44:11,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:44:11,118 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 05:44:11,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 15 transitions, 42 flow. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:11,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:11,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 05:44:11,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:11,282 INFO L130 PetriNetUnfolder]: 42/82 cut-off events. [2022-12-06 05:44:11,283 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-06 05:44:11,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 82 events. 42/82 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 170 event pairs, 7 based on Foata normal form. 1/65 useless extension candidates. Maximal degree in co-relation 132. Up to 34 conditions per place. [2022-12-06 05:44:11,285 INFO L137 encePairwiseOnDemand]: 8/15 looper letters, 23 selfloop transitions, 8 changer transitions 5/36 dead transitions. [2022-12-06 05:44:11,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 36 transitions, 165 flow [2022-12-06 05:44:11,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:44:11,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:44:11,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2022-12-06 05:44:11,295 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3523809523809524 [2022-12-06 05:44:11,297 INFO L175 Difference]: Start difference. First operand has 20 places, 15 transitions, 42 flow. Second operand 7 states and 37 transitions. [2022-12-06 05:44:11,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 36 transitions, 165 flow [2022-12-06 05:44:11,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 36 transitions, 151 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 05:44:11,301 INFO L231 Difference]: Finished difference. Result has 27 places, 21 transitions, 84 flow [2022-12-06 05:44:11,302 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=84, PETRI_PLACES=27, PETRI_TRANSITIONS=21} [2022-12-06 05:44:11,305 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 7 predicate places. [2022-12-06 05:44:11,305 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:11,306 INFO L89 Accepts]: Start accepts. Operand has 27 places, 21 transitions, 84 flow [2022-12-06 05:44:11,309 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:11,309 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:11,309 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 21 transitions, 84 flow [2022-12-06 05:44:11,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 21 transitions, 84 flow [2022-12-06 05:44:11,315 INFO L130 PetriNetUnfolder]: 6/25 cut-off events. [2022-12-06 05:44:11,315 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:44:11,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 25 events. 6/25 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 31 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 47. Up to 5 conditions per place. [2022-12-06 05:44:11,316 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 21 transitions, 84 flow [2022-12-06 05:44:11,316 INFO L188 LiptonReduction]: Number of co-enabled transitions 60 [2022-12-06 05:44:11,336 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:44:11,337 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-06 05:44:11,338 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 20 transitions, 78 flow [2022-12-06 05:44:11,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:11,338 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:11,338 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:11,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:44:11,338 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:11,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:11,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1697445439, now seen corresponding path program 2 times [2022-12-06 05:44:11,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:11,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972333826] [2022-12-06 05:44:11,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:11,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:11,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:11,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:11,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:11,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972333826] [2022-12-06 05:44:11,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972333826] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:11,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:11,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:44:11,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990678029] [2022-12-06 05:44:11,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:11,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:44:11,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:11,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:44:11,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:44:11,468 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 05:44:11,468 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 20 transitions, 78 flow. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:11,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:11,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 05:44:11,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:11,579 INFO L130 PetriNetUnfolder]: 46/88 cut-off events. [2022-12-06 05:44:11,580 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-12-06 05:44:11,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 88 events. 46/88 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 195 event pairs, 1 based on Foata normal form. 1/89 useless extension candidates. Maximal degree in co-relation 241. Up to 22 conditions per place. [2022-12-06 05:44:11,581 INFO L137 encePairwiseOnDemand]: 9/16 looper letters, 29 selfloop transitions, 9 changer transitions 5/43 dead transitions. [2022-12-06 05:44:11,581 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 43 transitions, 228 flow [2022-12-06 05:44:11,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:44:11,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:44:11,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2022-12-06 05:44:11,582 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38392857142857145 [2022-12-06 05:44:11,582 INFO L175 Difference]: Start difference. First operand has 25 places, 20 transitions, 78 flow. Second operand 7 states and 43 transitions. [2022-12-06 05:44:11,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 43 transitions, 228 flow [2022-12-06 05:44:11,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 43 transitions, 216 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 05:44:11,583 INFO L231 Difference]: Finished difference. Result has 30 places, 22 transitions, 100 flow [2022-12-06 05:44:11,584 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=100, PETRI_PLACES=30, PETRI_TRANSITIONS=22} [2022-12-06 05:44:11,584 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 10 predicate places. [2022-12-06 05:44:11,584 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:11,584 INFO L89 Accepts]: Start accepts. Operand has 30 places, 22 transitions, 100 flow [2022-12-06 05:44:11,585 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:11,585 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:11,585 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 22 transitions, 100 flow [2022-12-06 05:44:11,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 22 transitions, 100 flow [2022-12-06 05:44:11,588 INFO L130 PetriNetUnfolder]: 5/26 cut-off events. [2022-12-06 05:44:11,588 INFO L131 PetriNetUnfolder]: For 6/8 co-relation queries the response was YES. [2022-12-06 05:44:11,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 26 events. 5/26 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 52. Up to 5 conditions per place. [2022-12-06 05:44:11,589 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 22 transitions, 100 flow [2022-12-06 05:44:11,589 INFO L188 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-06 05:44:11,602 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:44:11,603 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 05:44:11,603 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 21 transitions, 96 flow [2022-12-06 05:44:11,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:11,604 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:11,604 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:11,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:44:11,604 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:11,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:11,604 INFO L85 PathProgramCache]: Analyzing trace with hash 421870587, now seen corresponding path program 3 times [2022-12-06 05:44:11,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:11,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723019144] [2022-12-06 05:44:11,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:11,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:11,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:11,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:11,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:11,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723019144] [2022-12-06 05:44:11,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723019144] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:11,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:11,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:44:11,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700086778] [2022-12-06 05:44:11,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:11,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:44:11,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:11,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:44:11,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:44:11,708 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 05:44:11,708 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 21 transitions, 96 flow. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:11,708 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:11,708 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 05:44:11,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:11,806 INFO L130 PetriNetUnfolder]: 49/91 cut-off events. [2022-12-06 05:44:11,806 INFO L131 PetriNetUnfolder]: For 64/64 co-relation queries the response was YES. [2022-12-06 05:44:11,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287 conditions, 91 events. 49/91 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 187 event pairs, 7 based on Foata normal form. 1/92 useless extension candidates. Maximal degree in co-relation 276. Up to 48 conditions per place. [2022-12-06 05:44:11,807 INFO L137 encePairwiseOnDemand]: 9/17 looper letters, 24 selfloop transitions, 12 changer transitions 5/41 dead transitions. [2022-12-06 05:44:11,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 41 transitions, 241 flow [2022-12-06 05:44:11,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:44:11,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:44:11,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2022-12-06 05:44:11,808 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3445378151260504 [2022-12-06 05:44:11,808 INFO L175 Difference]: Start difference. First operand has 28 places, 21 transitions, 96 flow. Second operand 7 states and 41 transitions. [2022-12-06 05:44:11,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 41 transitions, 241 flow [2022-12-06 05:44:11,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 41 transitions, 204 flow, removed 9 selfloop flow, removed 6 redundant places. [2022-12-06 05:44:11,810 INFO L231 Difference]: Finished difference. Result has 32 places, 27 transitions, 140 flow [2022-12-06 05:44:11,810 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=140, PETRI_PLACES=32, PETRI_TRANSITIONS=27} [2022-12-06 05:44:11,811 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 12 predicate places. [2022-12-06 05:44:11,811 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:11,811 INFO L89 Accepts]: Start accepts. Operand has 32 places, 27 transitions, 140 flow [2022-12-06 05:44:11,811 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:11,811 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:11,812 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 27 transitions, 140 flow [2022-12-06 05:44:11,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 27 transitions, 140 flow [2022-12-06 05:44:11,814 INFO L130 PetriNetUnfolder]: 11/32 cut-off events. [2022-12-06 05:44:11,814 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-06 05:44:11,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 32 events. 11/32 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 53 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 76. Up to 9 conditions per place. [2022-12-06 05:44:11,815 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 27 transitions, 140 flow [2022-12-06 05:44:11,815 INFO L188 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-06 05:44:11,817 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [276] L56-2-->thread2EXIT: Formula: (and (not (< v_thread2Thread1of1ForFork1_~x~1_In_3 10000)) (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= v_~Y~0_Out_10 (+ v_thread2Thread1of1ForFork1_~x~1_In_3 v_~Y~0_In_4)) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {~Y~0=v_~Y~0_In_4, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_In_3} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_In_3, ~Y~0=v_~Y~0_Out_10, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, ~Y~0] and [262] L43-2-->L43-2: Formula: (and (= (+ v_thread1Thread1of1ForFork0_~x~0_42 1) v_thread1Thread1of1ForFork0_~x~0_41) (< v_thread1Thread1of1ForFork0_~x~0_42 10000)) InVars {thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_42} OutVars{thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_41, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~x~0, thread1Thread1of1ForFork0_#t~post1] [2022-12-06 05:44:11,917 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [260] $Ultimate##0-->L43-2: Formula: (= v_~X~0_26 v_thread1Thread1of1ForFork0_~x~0_37) InVars {~X~0=v_~X~0_26} OutVars{thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_37, ~X~0=v_~X~0_26} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~x~0] and [282] L56-2-->L43-2: Formula: (and (not (< v_thread2Thread1of1ForFork1_~x~1_51 10000)) (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= (+ v_thread2Thread1of1ForFork1_~x~1_51 v_~Y~0_108) v_~Y~0_107) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (< v_thread1Thread1of1ForFork0_~x~0_54 10000) (= v_thread1Thread1of1ForFork0_~x~0_53 (+ v_thread1Thread1of1ForFork0_~x~0_54 1))) InVars {thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_51, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_54, ~Y~0=v_~Y~0_108} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_51, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_53, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~Y~0=v_~Y~0_107} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork0_~x~0, thread1Thread1of1ForFork0_#t~post1, thread2Thread1of1ForFork1_#res.base, ~Y~0] [2022-12-06 05:44:11,949 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [260] $Ultimate##0-->L43-2: Formula: (= v_~X~0_26 v_thread1Thread1of1ForFork0_~x~0_37) InVars {~X~0=v_~X~0_26} OutVars{thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_37, ~X~0=v_~X~0_26} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~x~0] and [265] L56-2-->L56-2: Formula: (and (< v_thread2Thread1of1ForFork1_~x~1_38 10000) (= (+ v_thread2Thread1of1ForFork1_~x~1_38 1) v_thread2Thread1of1ForFork1_~x~1_37)) InVars {thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_38} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_15|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_~x~1] [2022-12-06 05:44:11,962 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:44:11,963 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 152 [2022-12-06 05:44:11,963 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 25 transitions, 140 flow [2022-12-06 05:44:11,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:11,963 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:11,963 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:11,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:44:11,964 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:11,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:11,964 INFO L85 PathProgramCache]: Analyzing trace with hash -208729587, now seen corresponding path program 1 times [2022-12-06 05:44:11,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:11,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799813052] [2022-12-06 05:44:11,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:11,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:11,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:11,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:11,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:11,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799813052] [2022-12-06 05:44:11,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799813052] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:11,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:11,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:44:11,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936678835] [2022-12-06 05:44:11,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:11,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:44:11,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:11,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:44:11,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:44:11,988 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 05:44:11,988 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 140 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:11,988 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:11,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 05:44:11,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:12,046 INFO L130 PetriNetUnfolder]: 70/127 cut-off events. [2022-12-06 05:44:12,047 INFO L131 PetriNetUnfolder]: For 168/168 co-relation queries the response was YES. [2022-12-06 05:44:12,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 428 conditions, 127 events. 70/127 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 327 event pairs, 14 based on Foata normal form. 4/131 useless extension candidates. Maximal degree in co-relation 415. Up to 80 conditions per place. [2022-12-06 05:44:12,048 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 35 selfloop transitions, 6 changer transitions 3/44 dead transitions. [2022-12-06 05:44:12,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 44 transitions, 306 flow [2022-12-06 05:44:12,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:44:12,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:44:12,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-12-06 05:44:12,049 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2022-12-06 05:44:12,049 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 140 flow. Second operand 4 states and 39 transitions. [2022-12-06 05:44:12,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 44 transitions, 306 flow [2022-12-06 05:44:12,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 44 transitions, 268 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-12-06 05:44:12,051 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 159 flow [2022-12-06 05:44:12,051 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 05:44:12,051 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 05:44:12,051 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:12,051 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 159 flow [2022-12-06 05:44:12,052 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:12,052 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:12,052 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 159 flow [2022-12-06 05:44:12,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 159 flow [2022-12-06 05:44:12,055 INFO L130 PetriNetUnfolder]: 17/47 cut-off events. [2022-12-06 05:44:12,055 INFO L131 PetriNetUnfolder]: For 56/60 co-relation queries the response was YES. [2022-12-06 05:44:12,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 47 events. 17/47 cut-off events. For 56/60 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 100 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 90. Up to 14 conditions per place. [2022-12-06 05:44:12,056 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 159 flow [2022-12-06 05:44:12,056 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-06 05:44:12,056 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:44:12,057 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-06 05:44:12,057 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 28 transitions, 159 flow [2022-12-06 05:44:12,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:12,057 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:12,058 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:12,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 05:44:12,058 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:12,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:12,058 INFO L85 PathProgramCache]: Analyzing trace with hash 2146720386, now seen corresponding path program 1 times [2022-12-06 05:44:12,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:12,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784992058] [2022-12-06 05:44:12,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:12,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:12,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:12,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:12,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784992058] [2022-12-06 05:44:12,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784992058] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:12,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:12,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:44:12,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416070080] [2022-12-06 05:44:12,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:12,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:44:12,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:12,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:44:12,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:44:12,079 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 05:44:12,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 28 transitions, 159 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:12,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:12,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 05:44:12,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:12,137 INFO L130 PetriNetUnfolder]: 109/192 cut-off events. [2022-12-06 05:44:12,138 INFO L131 PetriNetUnfolder]: For 312/312 co-relation queries the response was YES. [2022-12-06 05:44:12,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 644 conditions, 192 events. 109/192 cut-off events. For 312/312 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 555 event pairs, 25 based on Foata normal form. 2/194 useless extension candidates. Maximal degree in co-relation 459. Up to 129 conditions per place. [2022-12-06 05:44:12,139 INFO L137 encePairwiseOnDemand]: 17/21 looper letters, 44 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2022-12-06 05:44:12,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 47 transitions, 363 flow [2022-12-06 05:44:12,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:44:12,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:44:12,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-06 05:44:12,141 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-06 05:44:12,141 INFO L175 Difference]: Start difference. First operand has 29 places, 28 transitions, 159 flow. Second operand 3 states and 35 transitions. [2022-12-06 05:44:12,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 47 transitions, 363 flow [2022-12-06 05:44:12,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 47 transitions, 344 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-06 05:44:12,143 INFO L231 Difference]: Finished difference. Result has 30 places, 30 transitions, 179 flow [2022-12-06 05:44:12,143 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=179, PETRI_PLACES=30, PETRI_TRANSITIONS=30} [2022-12-06 05:44:12,144 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 10 predicate places. [2022-12-06 05:44:12,144 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:12,144 INFO L89 Accepts]: Start accepts. Operand has 30 places, 30 transitions, 179 flow [2022-12-06 05:44:12,145 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:12,145 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:12,145 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 30 transitions, 179 flow [2022-12-06 05:44:12,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 30 transitions, 179 flow [2022-12-06 05:44:12,151 INFO L130 PetriNetUnfolder]: 27/75 cut-off events. [2022-12-06 05:44:12,151 INFO L131 PetriNetUnfolder]: For 58/58 co-relation queries the response was YES. [2022-12-06 05:44:12,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 75 events. 27/75 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 230 event pairs, 0 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 164. Up to 24 conditions per place. [2022-12-06 05:44:12,152 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 30 transitions, 179 flow [2022-12-06 05:44:12,152 INFO L188 LiptonReduction]: Number of co-enabled transitions 90 [2022-12-06 05:44:12,152 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [229] $Ultimate##0-->L56-2: Formula: (= v_~X~0_10 v_thread2Thread1of1ForFork1_~x~1_25) InVars {~X~0=v_~X~0_10} OutVars{thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_25, ~X~0=v_~X~0_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~x~1] and [286] $Ultimate##0-->L56-2: Formula: (and (= v_thread2Thread1of1ForFork1_~x~1_55 (+ v_thread2Thread1of1ForFork1_~x~1_56 1)) (< v_thread2Thread1of1ForFork1_~x~1_56 10000) (= v_~X~0_50 v_thread1Thread1of1ForFork0_~x~0_67)) InVars {thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_56, ~X~0=v_~X~0_50} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_21|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_55, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_67, ~X~0=v_~X~0_50} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_~x~1, thread1Thread1of1ForFork0_~x~0] [2022-12-06 05:44:12,173 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:44:12,174 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-06 05:44:12,174 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 30 transitions, 181 flow [2022-12-06 05:44:12,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:12,175 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:12,175 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:12,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 05:44:12,175 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:12,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:12,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1085759701, now seen corresponding path program 1 times [2022-12-06 05:44:12,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:12,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490533549] [2022-12-06 05:44:12,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:12,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:12,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:12,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:12,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:12,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490533549] [2022-12-06 05:44:12,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490533549] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:12,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:12,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:44:12,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102762609] [2022-12-06 05:44:12,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:12,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:44:12,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:12,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:44:12,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:44:12,283 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 05:44:12,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 30 transitions, 181 flow. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:12,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:12,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 05:44:12,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:12,381 INFO L130 PetriNetUnfolder]: 121/222 cut-off events. [2022-12-06 05:44:12,382 INFO L131 PetriNetUnfolder]: For 303/303 co-relation queries the response was YES. [2022-12-06 05:44:12,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 752 conditions, 222 events. 121/222 cut-off events. For 303/303 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 730 event pairs, 6 based on Foata normal form. 2/220 useless extension candidates. Maximal degree in co-relation 238. Up to 134 conditions per place. [2022-12-06 05:44:12,384 INFO L137 encePairwiseOnDemand]: 13/22 looper letters, 33 selfloop transitions, 12 changer transitions 5/50 dead transitions. [2022-12-06 05:44:12,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 50 transitions, 356 flow [2022-12-06 05:44:12,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:44:12,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:44:12,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-12-06 05:44:12,385 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3181818181818182 [2022-12-06 05:44:12,385 INFO L175 Difference]: Start difference. First operand has 30 places, 30 transitions, 181 flow. Second operand 6 states and 42 transitions. [2022-12-06 05:44:12,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 50 transitions, 356 flow [2022-12-06 05:44:12,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 50 transitions, 348 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 05:44:12,387 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 222 flow [2022-12-06 05:44:12,387 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=222, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2022-12-06 05:44:12,388 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 16 predicate places. [2022-12-06 05:44:12,388 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:12,388 INFO L89 Accepts]: Start accepts. Operand has 36 places, 32 transitions, 222 flow [2022-12-06 05:44:12,389 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:12,389 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:12,389 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 32 transitions, 222 flow [2022-12-06 05:44:12,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 32 transitions, 222 flow [2022-12-06 05:44:12,396 INFO L130 PetriNetUnfolder]: 25/85 cut-off events. [2022-12-06 05:44:12,396 INFO L131 PetriNetUnfolder]: For 111/112 co-relation queries the response was YES. [2022-12-06 05:44:12,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 85 events. 25/85 cut-off events. For 111/112 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 313 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 225. Up to 24 conditions per place. [2022-12-06 05:44:12,397 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 32 transitions, 222 flow [2022-12-06 05:44:12,397 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-06 05:44:12,401 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [283] $Ultimate##0-->thread1EXIT: Formula: (and (not (< v_thread1Thread1of1ForFork0_~x~0_57 10000)) (= |v_thread1Thread1of1ForFork0_#res.base_25| 0) (= (+ v_~Y~0_112 v_thread1Thread1of1ForFork0_~x~0_57) v_~Y~0_111) (= v_~X~0_44 v_thread1Thread1of1ForFork0_~x~0_57) (= |v_thread1Thread1of1ForFork0_#res.offset_25| 0)) InVars {~X~0=v_~X~0_44, ~Y~0=v_~Y~0_112} OutVars{thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_25|, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_57, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_25|, ~X~0=v_~X~0_44, ~Y~0=v_~Y~0_111} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_~x~0, thread1Thread1of1ForFork0_#res.offset, ~Y~0] and [265] L56-2-->L56-2: Formula: (and (< v_thread2Thread1of1ForFork1_~x~1_38 10000) (= (+ v_thread2Thread1of1ForFork1_~x~1_38 1) v_thread2Thread1of1ForFork1_~x~1_37)) InVars {thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_38} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_15|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_~x~1] [2022-12-06 05:44:12,447 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [283] $Ultimate##0-->thread1EXIT: Formula: (and (not (< v_thread1Thread1of1ForFork0_~x~0_57 10000)) (= |v_thread1Thread1of1ForFork0_#res.base_25| 0) (= (+ v_~Y~0_112 v_thread1Thread1of1ForFork0_~x~0_57) v_~Y~0_111) (= v_~X~0_44 v_thread1Thread1of1ForFork0_~x~0_57) (= |v_thread1Thread1of1ForFork0_#res.offset_25| 0)) InVars {~X~0=v_~X~0_44, ~Y~0=v_~Y~0_112} OutVars{thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_25|, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_57, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_25|, ~X~0=v_~X~0_44, ~Y~0=v_~Y~0_111} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_~x~0, thread1Thread1of1ForFork0_#res.offset, ~Y~0] and [265] L56-2-->L56-2: Formula: (and (< v_thread2Thread1of1ForFork1_~x~1_38 10000) (= (+ v_thread2Thread1of1ForFork1_~x~1_38 1) v_thread2Thread1of1ForFork1_~x~1_37)) InVars {thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_38} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_15|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_~x~1] [2022-12-06 05:44:12,495 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:44:12,495 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 107 [2022-12-06 05:44:12,496 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 31 transitions, 226 flow [2022-12-06 05:44:12,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:12,496 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:12,496 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:12,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:44:12,496 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:12,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:12,497 INFO L85 PathProgramCache]: Analyzing trace with hash 821885111, now seen corresponding path program 1 times [2022-12-06 05:44:12,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:12,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793433596] [2022-12-06 05:44:12,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:12,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:12,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:12,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:12,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:12,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793433596] [2022-12-06 05:44:12,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793433596] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:12,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:12,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:44:12,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287359150] [2022-12-06 05:44:12,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:12,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:44:12,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:12,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:44:12,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:44:12,525 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 05:44:12,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 31 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:12,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:12,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 05:44:12,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:12,592 INFO L130 PetriNetUnfolder]: 115/202 cut-off events. [2022-12-06 05:44:12,592 INFO L131 PetriNetUnfolder]: For 434/434 co-relation queries the response was YES. [2022-12-06 05:44:12,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 791 conditions, 202 events. 115/202 cut-off events. For 434/434 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 584 event pairs, 31 based on Foata normal form. 4/206 useless extension candidates. Maximal degree in co-relation 770. Up to 195 conditions per place. [2022-12-06 05:44:12,593 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 33 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2022-12-06 05:44:12,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 35 transitions, 318 flow [2022-12-06 05:44:12,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:44:12,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:44:12,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2022-12-06 05:44:12,594 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4057971014492754 [2022-12-06 05:44:12,594 INFO L175 Difference]: Start difference. First operand has 34 places, 31 transitions, 226 flow. Second operand 3 states and 28 transitions. [2022-12-06 05:44:12,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 35 transitions, 318 flow [2022-12-06 05:44:12,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 35 transitions, 280 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-12-06 05:44:12,608 INFO L231 Difference]: Finished difference. Result has 32 places, 32 transitions, 208 flow [2022-12-06 05:44:12,609 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=208, PETRI_PLACES=32, PETRI_TRANSITIONS=32} [2022-12-06 05:44:12,609 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 12 predicate places. [2022-12-06 05:44:12,609 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:12,609 INFO L89 Accepts]: Start accepts. Operand has 32 places, 32 transitions, 208 flow [2022-12-06 05:44:12,610 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:12,610 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:12,610 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 32 transitions, 208 flow [2022-12-06 05:44:12,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 32 transitions, 208 flow [2022-12-06 05:44:12,614 INFO L130 PetriNetUnfolder]: 26/80 cut-off events. [2022-12-06 05:44:12,614 INFO L131 PetriNetUnfolder]: For 97/101 co-relation queries the response was YES. [2022-12-06 05:44:12,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 80 events. 26/80 cut-off events. For 97/101 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 270 event pairs, 0 based on Foata normal form. 1/77 useless extension candidates. Maximal degree in co-relation 167. Up to 24 conditions per place. [2022-12-06 05:44:12,615 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 32 transitions, 208 flow [2022-12-06 05:44:12,615 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 05:44:12,615 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [229] $Ultimate##0-->L56-2: Formula: (= v_~X~0_10 v_thread2Thread1of1ForFork1_~x~1_25) InVars {~X~0=v_~X~0_10} OutVars{thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_25, ~X~0=v_~X~0_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~x~1] and [289] $Ultimate##0-->L56-2: Formula: (and (= v_~Y~0_123 (+ v_~Y~0_124 v_thread1Thread1of1ForFork0_~x~0_73)) (= v_thread2Thread1of1ForFork1_~x~1_67 (+ v_thread2Thread1of1ForFork1_~x~1_68 1)) (= |v_thread1Thread1of1ForFork0_#res.offset_29| 0) (not (< v_thread1Thread1of1ForFork0_~x~0_73 10000)) (= v_~X~0_56 v_thread1Thread1of1ForFork0_~x~0_73) (< v_thread2Thread1of1ForFork1_~x~1_68 10000) (= |v_thread1Thread1of1ForFork0_#res.base_29| 0)) InVars {thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_68, ~X~0=v_~X~0_56, ~Y~0=v_~Y~0_124} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_27|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_67, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_29|, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_73, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_29|, ~X~0=v_~X~0_56, ~Y~0=v_~Y~0_123} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_~x~1, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_~x~0, thread1Thread1of1ForFork0_#res.offset, ~Y~0] [2022-12-06 05:44:12,622 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:44:12,622 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 05:44:12,622 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 32 transitions, 209 flow [2022-12-06 05:44:12,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:12,623 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:12,623 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:12,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 05:44:12,623 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:12,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:12,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1967771603, now seen corresponding path program 1 times [2022-12-06 05:44:12,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:12,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692445383] [2022-12-06 05:44:12,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:12,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:12,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:12,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:12,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:12,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692445383] [2022-12-06 05:44:12,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692445383] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:12,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:12,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:44:12,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299644359] [2022-12-06 05:44:12,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:12,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 05:44:12,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:12,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 05:44:12,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 05:44:12,633 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 05:44:12,633 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 32 transitions, 209 flow. Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:12,633 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:12,633 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 05:44:12,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:12,661 INFO L130 PetriNetUnfolder]: 113/200 cut-off events. [2022-12-06 05:44:12,662 INFO L131 PetriNetUnfolder]: For 388/388 co-relation queries the response was YES. [2022-12-06 05:44:12,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 200 events. 113/200 cut-off events. For 388/388 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 578 event pairs, 35 based on Foata normal form. 2/200 useless extension candidates. Maximal degree in co-relation 553. Up to 201 conditions per place. [2022-12-06 05:44:12,663 INFO L137 encePairwiseOnDemand]: 22/23 looper letters, 31 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2022-12-06 05:44:12,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 31 transitions, 257 flow [2022-12-06 05:44:12,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 05:44:12,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 05:44:12,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 23 transitions. [2022-12-06 05:44:12,664 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 05:44:12,664 INFO L175 Difference]: Start difference. First operand has 32 places, 32 transitions, 209 flow. Second operand 2 states and 23 transitions. [2022-12-06 05:44:12,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 31 transitions, 257 flow [2022-12-06 05:44:12,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 31 transitions, 255 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:44:12,666 INFO L231 Difference]: Finished difference. Result has 32 places, 31 transitions, 193 flow [2022-12-06 05:44:12,666 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=193, PETRI_PLACES=32, PETRI_TRANSITIONS=31} [2022-12-06 05:44:12,666 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 12 predicate places. [2022-12-06 05:44:12,666 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:12,667 INFO L89 Accepts]: Start accepts. Operand has 32 places, 31 transitions, 193 flow [2022-12-06 05:44:12,667 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:12,667 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:12,667 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 31 transitions, 193 flow [2022-12-06 05:44:12,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 31 transitions, 193 flow [2022-12-06 05:44:12,673 INFO L130 PetriNetUnfolder]: 25/79 cut-off events. [2022-12-06 05:44:12,673 INFO L131 PetriNetUnfolder]: For 83/86 co-relation queries the response was YES. [2022-12-06 05:44:12,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 79 events. 25/79 cut-off events. For 83/86 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 266 event pairs, 0 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 159. Up to 23 conditions per place. [2022-12-06 05:44:12,673 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 31 transitions, 193 flow [2022-12-06 05:44:12,673 INFO L188 LiptonReduction]: Number of co-enabled transitions 94 [2022-12-06 05:44:12,674 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:44:12,675 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 05:44:12,675 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 31 transitions, 193 flow [2022-12-06 05:44:12,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:12,675 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:12,675 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:12,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 05:44:12,675 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:12,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:12,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1060309493, now seen corresponding path program 4 times [2022-12-06 05:44:12,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:12,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463509141] [2022-12-06 05:44:12,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:12,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:12,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:12,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:12,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:12,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463509141] [2022-12-06 05:44:12,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463509141] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:12,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:12,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:44:12,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490142420] [2022-12-06 05:44:12,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:12,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:44:12,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:12,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:44:12,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:44:12,773 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 05:44:12,773 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 31 transitions, 193 flow. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:12,773 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:12,773 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 05:44:12,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:12,936 INFO L130 PetriNetUnfolder]: 143/261 cut-off events. [2022-12-06 05:44:12,936 INFO L131 PetriNetUnfolder]: For 349/349 co-relation queries the response was YES. [2022-12-06 05:44:12,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 906 conditions, 261 events. 143/261 cut-off events. For 349/349 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 895 event pairs, 6 based on Foata normal form. 3/262 useless extension candidates. Maximal degree in co-relation 393. Up to 140 conditions per place. [2022-12-06 05:44:12,938 INFO L137 encePairwiseOnDemand]: 9/22 looper letters, 37 selfloop transitions, 25 changer transitions 6/68 dead transitions. [2022-12-06 05:44:12,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 68 transitions, 506 flow [2022-12-06 05:44:12,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:44:12,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:44:12,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2022-12-06 05:44:12,939 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33766233766233766 [2022-12-06 05:44:12,939 INFO L175 Difference]: Start difference. First operand has 31 places, 31 transitions, 193 flow. Second operand 7 states and 52 transitions. [2022-12-06 05:44:12,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 68 transitions, 506 flow [2022-12-06 05:44:12,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 68 transitions, 506 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 05:44:12,941 INFO L231 Difference]: Finished difference. Result has 41 places, 44 transitions, 381 flow [2022-12-06 05:44:12,941 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=381, PETRI_PLACES=41, PETRI_TRANSITIONS=44} [2022-12-06 05:44:12,942 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 21 predicate places. [2022-12-06 05:44:12,942 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:12,942 INFO L89 Accepts]: Start accepts. Operand has 41 places, 44 transitions, 381 flow [2022-12-06 05:44:12,943 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:12,943 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:12,943 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 44 transitions, 381 flow [2022-12-06 05:44:12,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 44 transitions, 381 flow [2022-12-06 05:44:12,951 INFO L130 PetriNetUnfolder]: 34/95 cut-off events. [2022-12-06 05:44:12,951 INFO L131 PetriNetUnfolder]: For 226/229 co-relation queries the response was YES. [2022-12-06 05:44:12,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 95 events. 34/95 cut-off events. For 226/229 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 324 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 345. Up to 35 conditions per place. [2022-12-06 05:44:12,952 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 44 transitions, 381 flow [2022-12-06 05:44:12,952 INFO L188 LiptonReduction]: Number of co-enabled transitions 118 [2022-12-06 05:44:12,953 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [287] $Ultimate##0-->L56-2: Formula: (and (= v_thread2Thread1of1ForFork1_~x~1_59 (+ v_~X~0_52 1)) (= v_~X~0_52 v_thread1Thread1of1ForFork0_~x~0_69) (< v_thread2Thread1of1ForFork1_~x~1_59 10001)) InVars {~X~0=v_~X~0_52} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_23|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_59, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_69, ~X~0=v_~X~0_52} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_~x~1, thread1Thread1of1ForFork0_~x~0] and [262] L43-2-->L43-2: Formula: (and (= (+ v_thread1Thread1of1ForFork0_~x~0_42 1) v_thread1Thread1of1ForFork0_~x~0_41) (< v_thread1Thread1of1ForFork0_~x~0_42 10000)) InVars {thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_42} OutVars{thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_41, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~x~0, thread1Thread1of1ForFork0_#t~post1] [2022-12-06 05:44:12,977 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:44:12,978 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-06 05:44:12,978 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 44 transitions, 391 flow [2022-12-06 05:44:12,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:12,978 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:12,978 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:12,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 05:44:12,978 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:12,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:12,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1194278715, now seen corresponding path program 5 times [2022-12-06 05:44:12,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:12,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563656117] [2022-12-06 05:44:12,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:12,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:12,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:13,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:13,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:13,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563656117] [2022-12-06 05:44:13,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563656117] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:13,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:13,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:44:13,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714424289] [2022-12-06 05:44:13,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:13,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:44:13,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:13,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:44:13,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:44:13,074 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 05:44:13,074 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 44 transitions, 391 flow. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:13,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:13,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 05:44:13,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:13,215 INFO L130 PetriNetUnfolder]: 172/307 cut-off events. [2022-12-06 05:44:13,215 INFO L131 PetriNetUnfolder]: For 881/881 co-relation queries the response was YES. [2022-12-06 05:44:13,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1353 conditions, 307 events. 172/307 cut-off events. For 881/881 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1130 event pairs, 2 based on Foata normal form. 4/311 useless extension candidates. Maximal degree in co-relation 1332. Up to 159 conditions per place. [2022-12-06 05:44:13,217 INFO L137 encePairwiseOnDemand]: 9/23 looper letters, 40 selfloop transitions, 27 changer transitions 6/73 dead transitions. [2022-12-06 05:44:13,217 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 73 transitions, 697 flow [2022-12-06 05:44:13,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:44:13,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:44:13,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2022-12-06 05:44:13,218 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3167701863354037 [2022-12-06 05:44:13,219 INFO L175 Difference]: Start difference. First operand has 40 places, 44 transitions, 391 flow. Second operand 7 states and 51 transitions. [2022-12-06 05:44:13,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 73 transitions, 697 flow [2022-12-06 05:44:13,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 73 transitions, 638 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-06 05:44:13,222 INFO L231 Difference]: Finished difference. Result has 45 places, 50 transitions, 476 flow [2022-12-06 05:44:13,223 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=476, PETRI_PLACES=45, PETRI_TRANSITIONS=50} [2022-12-06 05:44:13,224 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 25 predicate places. [2022-12-06 05:44:13,224 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:13,224 INFO L89 Accepts]: Start accepts. Operand has 45 places, 50 transitions, 476 flow [2022-12-06 05:44:13,226 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:13,226 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:13,226 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 50 transitions, 476 flow [2022-12-06 05:44:13,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 50 transitions, 476 flow [2022-12-06 05:44:13,233 INFO L130 PetriNetUnfolder]: 37/106 cut-off events. [2022-12-06 05:44:13,233 INFO L131 PetriNetUnfolder]: For 330/334 co-relation queries the response was YES. [2022-12-06 05:44:13,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 453 conditions, 106 events. 37/106 cut-off events. For 330/334 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 389 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 434. Up to 38 conditions per place. [2022-12-06 05:44:13,234 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 50 transitions, 476 flow [2022-12-06 05:44:13,234 INFO L188 LiptonReduction]: Number of co-enabled transitions 138 [2022-12-06 05:44:13,236 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:44:13,236 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 05:44:13,237 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 50 transitions, 476 flow [2022-12-06 05:44:13,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:13,237 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:13,237 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:13,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 05:44:13,237 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:13,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:13,237 INFO L85 PathProgramCache]: Analyzing trace with hash 76932539, now seen corresponding path program 1 times [2022-12-06 05:44:13,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:13,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997071254] [2022-12-06 05:44:13,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:13,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:13,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:13,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:13,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:13,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997071254] [2022-12-06 05:44:13,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997071254] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:13,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:13,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:44:13,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564732339] [2022-12-06 05:44:13,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:13,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:44:13,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:13,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:44:13,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:44:13,332 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 05:44:13,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 50 transitions, 476 flow. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:13,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:13,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 05:44:13,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:13,420 INFO L130 PetriNetUnfolder]: 158/280 cut-off events. [2022-12-06 05:44:13,420 INFO L131 PetriNetUnfolder]: For 1236/1236 co-relation queries the response was YES. [2022-12-06 05:44:13,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1435 conditions, 280 events. 158/280 cut-off events. For 1236/1236 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 966 event pairs, 23 based on Foata normal form. 1/281 useless extension candidates. Maximal degree in co-relation 1412. Up to 181 conditions per place. [2022-12-06 05:44:13,423 INFO L137 encePairwiseOnDemand]: 13/23 looper letters, 42 selfloop transitions, 21 changer transitions 5/68 dead transitions. [2022-12-06 05:44:13,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 68 transitions, 727 flow [2022-12-06 05:44:13,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:44:13,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:44:13,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-12-06 05:44:13,424 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3115942028985507 [2022-12-06 05:44:13,425 INFO L175 Difference]: Start difference. First operand has 44 places, 50 transitions, 476 flow. Second operand 6 states and 43 transitions. [2022-12-06 05:44:13,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 68 transitions, 727 flow [2022-12-06 05:44:13,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 68 transitions, 682 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-06 05:44:13,431 INFO L231 Difference]: Finished difference. Result has 49 places, 53 transitions, 526 flow [2022-12-06 05:44:13,431 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=526, PETRI_PLACES=49, PETRI_TRANSITIONS=53} [2022-12-06 05:44:13,432 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 29 predicate places. [2022-12-06 05:44:13,432 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:13,432 INFO L89 Accepts]: Start accepts. Operand has 49 places, 53 transitions, 526 flow [2022-12-06 05:44:13,433 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:13,433 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:13,433 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 53 transitions, 526 flow [2022-12-06 05:44:13,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 53 transitions, 526 flow [2022-12-06 05:44:13,442 INFO L130 PetriNetUnfolder]: 38/106 cut-off events. [2022-12-06 05:44:13,442 INFO L131 PetriNetUnfolder]: For 390/394 co-relation queries the response was YES. [2022-12-06 05:44:13,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 106 events. 38/106 cut-off events. For 390/394 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 391 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 447. Up to 35 conditions per place. [2022-12-06 05:44:13,444 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 53 transitions, 526 flow [2022-12-06 05:44:13,444 INFO L188 LiptonReduction]: Number of co-enabled transitions 144 [2022-12-06 05:44:13,445 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:44:13,446 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 05:44:13,446 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 53 transitions, 526 flow [2022-12-06 05:44:13,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:13,446 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:13,446 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:13,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 05:44:13,447 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:13,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:13,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1957071411, now seen corresponding path program 1 times [2022-12-06 05:44:13,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:13,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139228410] [2022-12-06 05:44:13,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:13,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:13,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:13,485 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 05:44:13,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:13,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139228410] [2022-12-06 05:44:13,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139228410] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:44:13,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261265406] [2022-12-06 05:44:13,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:13,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:13,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:44:13,489 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:44:13,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 05:44:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:13,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 05:44:13,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:44:13,577 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 05:44:13,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:44:13,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:13,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261265406] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 05:44:13,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 05:44:13,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 5 [2022-12-06 05:44:13,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700575255] [2022-12-06 05:44:13,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:13,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:44:13,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:13,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:44:13,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:44:13,598 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 05:44:13,598 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 53 transitions, 526 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:13,598 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:13,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 05:44:13,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:13,749 INFO L130 PetriNetUnfolder]: 182/337 cut-off events. [2022-12-06 05:44:13,749 INFO L131 PetriNetUnfolder]: For 1455/1455 co-relation queries the response was YES. [2022-12-06 05:44:13,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1648 conditions, 337 events. 182/337 cut-off events. For 1455/1455 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1319 event pairs, 33 based on Foata normal form. 6/343 useless extension candidates. Maximal degree in co-relation 1614. Up to 229 conditions per place. [2022-12-06 05:44:13,753 INFO L137 encePairwiseOnDemand]: 15/23 looper letters, 54 selfloop transitions, 19 changer transitions 0/73 dead transitions. [2022-12-06 05:44:13,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 73 transitions, 785 flow [2022-12-06 05:44:13,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:44:13,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:44:13,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-06 05:44:13,754 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4782608695652174 [2022-12-06 05:44:13,754 INFO L175 Difference]: Start difference. First operand has 48 places, 53 transitions, 526 flow. Second operand 4 states and 44 transitions. [2022-12-06 05:44:13,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 73 transitions, 785 flow [2022-12-06 05:44:13,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 73 transitions, 733 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-06 05:44:13,762 INFO L231 Difference]: Finished difference. Result has 51 places, 60 transitions, 632 flow [2022-12-06 05:44:13,762 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=632, PETRI_PLACES=51, PETRI_TRANSITIONS=60} [2022-12-06 05:44:13,764 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-06 05:44:13,764 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:13,764 INFO L89 Accepts]: Start accepts. Operand has 51 places, 60 transitions, 632 flow [2022-12-06 05:44:13,766 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:13,766 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:13,767 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 60 transitions, 632 flow [2022-12-06 05:44:13,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 60 transitions, 632 flow [2022-12-06 05:44:13,785 INFO L130 PetriNetUnfolder]: 42/135 cut-off events. [2022-12-06 05:44:13,785 INFO L131 PetriNetUnfolder]: For 677/682 co-relation queries the response was YES. [2022-12-06 05:44:13,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 591 conditions, 135 events. 42/135 cut-off events. For 677/682 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 603 event pairs, 0 based on Foata normal form. 1/135 useless extension candidates. Maximal degree in co-relation 510. Up to 41 conditions per place. [2022-12-06 05:44:13,787 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 60 transitions, 632 flow [2022-12-06 05:44:13,787 INFO L188 LiptonReduction]: Number of co-enabled transitions 160 [2022-12-06 05:44:13,790 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [262] L43-2-->L43-2: Formula: (and (= (+ v_thread1Thread1of1ForFork0_~x~0_42 1) v_thread1Thread1of1ForFork0_~x~0_41) (< v_thread1Thread1of1ForFork0_~x~0_42 10000)) InVars {thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_42} OutVars{thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_41, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~x~0, thread1Thread1of1ForFork0_#t~post1] and [265] L56-2-->L56-2: Formula: (and (< v_thread2Thread1of1ForFork1_~x~1_38 10000) (= (+ v_thread2Thread1of1ForFork1_~x~1_38 1) v_thread2Thread1of1ForFork1_~x~1_37)) InVars {thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_38} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_15|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_~x~1] [2022-12-06 05:44:13,812 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:44:13,813 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-06 05:44:13,813 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 61 transitions, 656 flow [2022-12-06 05:44:13,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:13,813 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:13,813 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:13,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 05:44:14,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-06 05:44:14,023 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:14,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:14,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1389026424, now seen corresponding path program 1 times [2022-12-06 05:44:14,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:14,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534979554] [2022-12-06 05:44:14,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:14,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:14,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:14,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:14,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:14,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534979554] [2022-12-06 05:44:14,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534979554] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:14,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:14,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:44:14,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259547772] [2022-12-06 05:44:14,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:14,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:44:14,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:14,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:44:14,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:44:14,096 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 05:44:14,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 61 transitions, 656 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:14,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:14,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 05:44:14,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:14,225 INFO L130 PetriNetUnfolder]: 192/369 cut-off events. [2022-12-06 05:44:14,225 INFO L131 PetriNetUnfolder]: For 2487/2487 co-relation queries the response was YES. [2022-12-06 05:44:14,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1938 conditions, 369 events. 192/369 cut-off events. For 2487/2487 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1541 event pairs, 36 based on Foata normal form. 8/377 useless extension candidates. Maximal degree in co-relation 1475. Up to 196 conditions per place. [2022-12-06 05:44:14,229 INFO L137 encePairwiseOnDemand]: 16/24 looper letters, 58 selfloop transitions, 20 changer transitions 1/79 dead transitions. [2022-12-06 05:44:14,229 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 79 transitions, 935 flow [2022-12-06 05:44:14,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:44:14,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:44:14,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-12-06 05:44:14,230 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35 [2022-12-06 05:44:14,230 INFO L175 Difference]: Start difference. First operand has 52 places, 61 transitions, 656 flow. Second operand 5 states and 42 transitions. [2022-12-06 05:44:14,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 79 transitions, 935 flow [2022-12-06 05:44:14,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 79 transitions, 917 flow, removed 9 selfloop flow, removed 0 redundant places. [2022-12-06 05:44:14,238 INFO L231 Difference]: Finished difference. Result has 60 places, 66 transitions, 779 flow [2022-12-06 05:44:14,239 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=779, PETRI_PLACES=60, PETRI_TRANSITIONS=66} [2022-12-06 05:44:14,239 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 40 predicate places. [2022-12-06 05:44:14,239 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:14,239 INFO L89 Accepts]: Start accepts. Operand has 60 places, 66 transitions, 779 flow [2022-12-06 05:44:14,240 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:14,240 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:14,241 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 66 transitions, 779 flow [2022-12-06 05:44:14,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 66 transitions, 779 flow [2022-12-06 05:44:14,256 INFO L130 PetriNetUnfolder]: 47/149 cut-off events. [2022-12-06 05:44:14,256 INFO L131 PetriNetUnfolder]: For 1105/1110 co-relation queries the response was YES. [2022-12-06 05:44:14,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 736 conditions, 149 events. 47/149 cut-off events. For 1105/1110 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 683 event pairs, 0 based on Foata normal form. 1/149 useless extension candidates. Maximal degree in co-relation 647. Up to 43 conditions per place. [2022-12-06 05:44:14,258 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 66 transitions, 779 flow [2022-12-06 05:44:14,258 INFO L188 LiptonReduction]: Number of co-enabled transitions 170 [2022-12-06 05:44:14,259 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:44:14,260 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 05:44:14,260 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 66 transitions, 779 flow [2022-12-06 05:44:14,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:14,260 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:14,260 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:14,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 05:44:14,260 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:14,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:14,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1213199516, now seen corresponding path program 2 times [2022-12-06 05:44:14,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:14,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051429685] [2022-12-06 05:44:14,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:14,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:14,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:14,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:14,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:14,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051429685] [2022-12-06 05:44:14,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051429685] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:14,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:14,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:44:14,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905699928] [2022-12-06 05:44:14,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:14,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:44:14,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:14,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:44:14,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:44:14,292 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 05:44:14,292 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 66 transitions, 779 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:14,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:14,292 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 05:44:14,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:14,380 INFO L130 PetriNetUnfolder]: 189/368 cut-off events. [2022-12-06 05:44:14,380 INFO L131 PetriNetUnfolder]: For 3178/3178 co-relation queries the response was YES. [2022-12-06 05:44:14,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2110 conditions, 368 events. 189/368 cut-off events. For 3178/3178 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1536 event pairs, 61 based on Foata normal form. 4/372 useless extension candidates. Maximal degree in co-relation 1635. Up to 331 conditions per place. [2022-12-06 05:44:14,384 INFO L137 encePairwiseOnDemand]: 17/23 looper letters, 62 selfloop transitions, 12 changer transitions 0/74 dead transitions. [2022-12-06 05:44:14,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 74 transitions, 974 flow [2022-12-06 05:44:14,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:44:14,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:44:14,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-06 05:44:14,385 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40217391304347827 [2022-12-06 05:44:14,385 INFO L175 Difference]: Start difference. First operand has 60 places, 66 transitions, 779 flow. Second operand 4 states and 37 transitions. [2022-12-06 05:44:14,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 74 transitions, 974 flow [2022-12-06 05:44:14,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 74 transitions, 933 flow, removed 15 selfloop flow, removed 1 redundant places. [2022-12-06 05:44:14,396 INFO L231 Difference]: Finished difference. Result has 63 places, 66 transitions, 779 flow [2022-12-06 05:44:14,396 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=779, PETRI_PLACES=63, PETRI_TRANSITIONS=66} [2022-12-06 05:44:14,397 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 43 predicate places. [2022-12-06 05:44:14,397 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:14,397 INFO L89 Accepts]: Start accepts. Operand has 63 places, 66 transitions, 779 flow [2022-12-06 05:44:14,398 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:14,398 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:14,398 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 66 transitions, 779 flow [2022-12-06 05:44:14,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 66 transitions, 779 flow [2022-12-06 05:44:14,412 INFO L130 PetriNetUnfolder]: 46/154 cut-off events. [2022-12-06 05:44:14,412 INFO L131 PetriNetUnfolder]: For 1179/1184 co-relation queries the response was YES. [2022-12-06 05:44:14,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 743 conditions, 154 events. 46/154 cut-off events. For 1179/1184 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 731 event pairs, 0 based on Foata normal form. 1/154 useless extension candidates. Maximal degree in co-relation 648. Up to 42 conditions per place. [2022-12-06 05:44:14,414 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 66 transitions, 779 flow [2022-12-06 05:44:14,414 INFO L188 LiptonReduction]: Number of co-enabled transitions 166 [2022-12-06 05:44:14,414 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:44:14,415 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 05:44:14,415 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 66 transitions, 779 flow [2022-12-06 05:44:14,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:14,415 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:14,415 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:14,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 05:44:14,416 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:14,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:14,416 INFO L85 PathProgramCache]: Analyzing trace with hash -2001311863, now seen corresponding path program 1 times [2022-12-06 05:44:14,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:14,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974261873] [2022-12-06 05:44:14,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:14,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:14,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:14,502 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 05:44:14,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:14,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974261873] [2022-12-06 05:44:14,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974261873] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:44:14,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934347335] [2022-12-06 05:44:14,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:14,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:14,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:44:14,504 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:44:14,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 05:44:14,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:14,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 05:44:14,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:44:14,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 05:44:14,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:44:14,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 05:44:14,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934347335] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:44:14,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:44:14,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-06 05:44:14,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334739316] [2022-12-06 05:44:14,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:44:14,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 05:44:14,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:14,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 05:44:14,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-12-06 05:44:14,712 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 05:44:14,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 66 transitions, 779 flow. Second operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:14,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:14,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 05:44:14,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:14,906 INFO L130 PetriNetUnfolder]: 190/368 cut-off events. [2022-12-06 05:44:14,907 INFO L131 PetriNetUnfolder]: For 3036/3036 co-relation queries the response was YES. [2022-12-06 05:44:14,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2092 conditions, 368 events. 190/368 cut-off events. For 3036/3036 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1533 event pairs, 24 based on Foata normal form. 5/373 useless extension candidates. Maximal degree in co-relation 1673. Up to 199 conditions per place. [2022-12-06 05:44:14,911 INFO L137 encePairwiseOnDemand]: 12/23 looper letters, 50 selfloop transitions, 21 changer transitions 26/97 dead transitions. [2022-12-06 05:44:14,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 97 transitions, 1265 flow [2022-12-06 05:44:14,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:44:14,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:44:14,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 56 transitions. [2022-12-06 05:44:14,912 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24347826086956523 [2022-12-06 05:44:14,912 INFO L175 Difference]: Start difference. First operand has 63 places, 66 transitions, 779 flow. Second operand 10 states and 56 transitions. [2022-12-06 05:44:14,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 97 transitions, 1265 flow [2022-12-06 05:44:14,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 97 transitions, 1241 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-06 05:44:14,957 INFO L231 Difference]: Finished difference. Result has 75 places, 59 transitions, 737 flow [2022-12-06 05:44:14,958 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=737, PETRI_PLACES=75, PETRI_TRANSITIONS=59} [2022-12-06 05:44:14,959 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 55 predicate places. [2022-12-06 05:44:14,959 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:14,959 INFO L89 Accepts]: Start accepts. Operand has 75 places, 59 transitions, 737 flow [2022-12-06 05:44:14,960 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:14,960 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:14,960 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 59 transitions, 737 flow [2022-12-06 05:44:14,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 59 transitions, 737 flow [2022-12-06 05:44:14,971 INFO L130 PetriNetUnfolder]: 37/121 cut-off events. [2022-12-06 05:44:14,971 INFO L131 PetriNetUnfolder]: For 1165/1170 co-relation queries the response was YES. [2022-12-06 05:44:14,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 632 conditions, 121 events. 37/121 cut-off events. For 1165/1170 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 506 event pairs, 0 based on Foata normal form. 1/121 useless extension candidates. Maximal degree in co-relation 594. Up to 35 conditions per place. [2022-12-06 05:44:14,973 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 59 transitions, 737 flow [2022-12-06 05:44:14,973 INFO L188 LiptonReduction]: Number of co-enabled transitions 152 [2022-12-06 05:44:15,017 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [291] $Ultimate##0-->L43-2: Formula: (let ((.cse0 (+ v_~X~0_60 1))) (and (= .cse0 v_thread1Thread1of1ForFork0_~x~0_77) (= .cse0 v_thread2Thread1of1ForFork1_~x~1_75) (< v_thread2Thread1of1ForFork1_~x~1_75 10001))) InVars {~X~0=v_~X~0_60} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_31|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_75, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_77, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_27|, ~X~0=v_~X~0_60} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_~x~1, thread1Thread1of1ForFork0_~x~0, thread1Thread1of1ForFork0_#t~post1] and [265] L56-2-->L56-2: Formula: (and (< v_thread2Thread1of1ForFork1_~x~1_38 10000) (= (+ v_thread2Thread1of1ForFork1_~x~1_38 1) v_thread2Thread1of1ForFork1_~x~1_37)) InVars {thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_38} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_15|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_~x~1] [2022-12-06 05:44:15,053 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [276] L56-2-->thread2EXIT: Formula: (and (not (< v_thread2Thread1of1ForFork1_~x~1_In_3 10000)) (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= v_~Y~0_Out_10 (+ v_thread2Thread1of1ForFork1_~x~1_In_3 v_~Y~0_In_4)) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {~Y~0=v_~Y~0_In_4, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_In_3} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_In_3, ~Y~0=v_~Y~0_Out_10, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, ~Y~0] and [277] L43-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread1Thread1of1ForFork0_~x~0_In_3 10000)) (= v_~Y~0_Out_14 (+ v_~Y~0_In_6 v_thread1Thread1of1ForFork0_~x~0_In_3)) (= |v_thread1Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_In_3, ~Y~0=v_~Y~0_In_6} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_4|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_4|, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_In_3, ~Y~0=v_~Y~0_Out_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, ~Y~0] [2022-12-06 05:44:15,135 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [276] L56-2-->thread2EXIT: Formula: (and (not (< v_thread2Thread1of1ForFork1_~x~1_In_3 10000)) (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= v_~Y~0_Out_10 (+ v_thread2Thread1of1ForFork1_~x~1_In_3 v_~Y~0_In_4)) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {~Y~0=v_~Y~0_In_4, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_In_3} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_In_3, ~Y~0=v_~Y~0_Out_10, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, ~Y~0] and [277] L43-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread1Thread1of1ForFork0_~x~0_In_3 10000)) (= v_~Y~0_Out_14 (+ v_~Y~0_In_6 v_thread1Thread1of1ForFork0_~x~0_In_3)) (= |v_thread1Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_In_3, ~Y~0=v_~Y~0_In_6} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_4|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_4|, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_In_3, ~Y~0=v_~Y~0_Out_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, ~Y~0] [2022-12-06 05:44:15,256 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:44:15,257 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 298 [2022-12-06 05:44:15,257 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 58 transitions, 799 flow [2022-12-06 05:44:15,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:15,257 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:15,257 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:15,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 05:44:15,458 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,SelfDestructingSolverStorable14 [2022-12-06 05:44:15,458 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:15,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:15,458 INFO L85 PathProgramCache]: Analyzing trace with hash 274828081, now seen corresponding path program 1 times [2022-12-06 05:44:15,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:15,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119977290] [2022-12-06 05:44:15,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:15,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:15,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:15,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:15,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119977290] [2022-12-06 05:44:15,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119977290] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:15,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:15,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:44:15,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339696380] [2022-12-06 05:44:15,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:15,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:44:15,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:15,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:44:15,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:44:15,498 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 05:44:15,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 58 transitions, 799 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:15,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:15,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 05:44:15,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:15,594 INFO L130 PetriNetUnfolder]: 168/323 cut-off events. [2022-12-06 05:44:15,595 INFO L131 PetriNetUnfolder]: For 4173/4173 co-relation queries the response was YES. [2022-12-06 05:44:15,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1972 conditions, 323 events. 168/323 cut-off events. For 4173/4173 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1280 event pairs, 31 based on Foata normal form. 6/329 useless extension candidates. Maximal degree in co-relation 1924. Up to 217 conditions per place. [2022-12-06 05:44:15,598 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 66 selfloop transitions, 14 changer transitions 2/82 dead transitions. [2022-12-06 05:44:15,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 82 transitions, 1168 flow [2022-12-06 05:44:15,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:44:15,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:44:15,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-12-06 05:44:15,599 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3923076923076923 [2022-12-06 05:44:15,599 INFO L175 Difference]: Start difference. First operand has 68 places, 58 transitions, 799 flow. Second operand 5 states and 51 transitions. [2022-12-06 05:44:15,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 82 transitions, 1168 flow [2022-12-06 05:44:15,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 82 transitions, 998 flow, removed 49 selfloop flow, removed 11 redundant places. [2022-12-06 05:44:15,610 INFO L231 Difference]: Finished difference. Result has 63 places, 60 transitions, 718 flow [2022-12-06 05:44:15,611 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=718, PETRI_PLACES=63, PETRI_TRANSITIONS=60} [2022-12-06 05:44:15,612 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 43 predicate places. [2022-12-06 05:44:15,612 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:15,612 INFO L89 Accepts]: Start accepts. Operand has 63 places, 60 transitions, 718 flow [2022-12-06 05:44:15,613 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:15,613 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:15,614 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 60 transitions, 718 flow [2022-12-06 05:44:15,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 60 transitions, 718 flow [2022-12-06 05:44:15,625 INFO L130 PetriNetUnfolder]: 39/131 cut-off events. [2022-12-06 05:44:15,625 INFO L131 PetriNetUnfolder]: For 987/993 co-relation queries the response was YES. [2022-12-06 05:44:15,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 622 conditions, 131 events. 39/131 cut-off events. For 987/993 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 577 event pairs, 0 based on Foata normal form. 1/131 useless extension candidates. Maximal degree in co-relation 569. Up to 39 conditions per place. [2022-12-06 05:44:15,627 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 60 transitions, 718 flow [2022-12-06 05:44:15,627 INFO L188 LiptonReduction]: Number of co-enabled transitions 162 [2022-12-06 05:44:15,628 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:44:15,628 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 05:44:15,628 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 60 transitions, 718 flow [2022-12-06 05:44:15,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:15,629 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:15,629 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:15,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 05:44:15,629 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:15,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:15,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1114227581, now seen corresponding path program 1 times [2022-12-06 05:44:15,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:15,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513153034] [2022-12-06 05:44:15,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:15,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:15,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:15,734 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 05:44:15,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:15,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513153034] [2022-12-06 05:44:15,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513153034] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:44:15,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753498449] [2022-12-06 05:44:15,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:15,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:15,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:44:15,737 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 05:44:15,740 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 05:44:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:15,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 05:44:15,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:44:15,843 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 05:44:15,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:44:15,933 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 05:44:15,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753498449] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:44:15,933 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:44:15,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-06 05:44:15,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322906777] [2022-12-06 05:44:15,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:44:15,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:44:15,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:15,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:44:15,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:44:15,934 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 05:44:15,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 60 transitions, 718 flow. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:15,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:15,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 05:44:15,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:16,068 INFO L130 PetriNetUnfolder]: 177/337 cut-off events. [2022-12-06 05:44:16,068 INFO L131 PetriNetUnfolder]: For 2850/2850 co-relation queries the response was YES. [2022-12-06 05:44:16,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1957 conditions, 337 events. 177/337 cut-off events. For 2850/2850 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1338 event pairs, 23 based on Foata normal form. 1/338 useless extension candidates. Maximal degree in co-relation 1859. Up to 215 conditions per place. [2022-12-06 05:44:16,071 INFO L137 encePairwiseOnDemand]: 13/25 looper letters, 54 selfloop transitions, 24 changer transitions 5/83 dead transitions. [2022-12-06 05:44:16,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 83 transitions, 1073 flow [2022-12-06 05:44:16,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:44:16,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:44:16,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-12-06 05:44:16,072 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.265 [2022-12-06 05:44:16,072 INFO L175 Difference]: Start difference. First operand has 60 places, 60 transitions, 718 flow. Second operand 8 states and 53 transitions. [2022-12-06 05:44:16,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 83 transitions, 1073 flow [2022-12-06 05:44:16,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 83 transitions, 1060 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 05:44:16,082 INFO L231 Difference]: Finished difference. Result has 67 places, 65 transitions, 830 flow [2022-12-06 05:44:16,082 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=830, PETRI_PLACES=67, PETRI_TRANSITIONS=65} [2022-12-06 05:44:16,082 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 47 predicate places. [2022-12-06 05:44:16,082 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:16,082 INFO L89 Accepts]: Start accepts. Operand has 67 places, 65 transitions, 830 flow [2022-12-06 05:44:16,083 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:16,083 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:16,083 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 65 transitions, 830 flow [2022-12-06 05:44:16,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 65 transitions, 830 flow [2022-12-06 05:44:16,095 INFO L130 PetriNetUnfolder]: 43/138 cut-off events. [2022-12-06 05:44:16,095 INFO L131 PetriNetUnfolder]: For 1162/1168 co-relation queries the response was YES. [2022-12-06 05:44:16,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 714 conditions, 138 events. 43/138 cut-off events. For 1162/1168 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 613 event pairs, 0 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 677. Up to 45 conditions per place. [2022-12-06 05:44:16,097 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 65 transitions, 830 flow [2022-12-06 05:44:16,097 INFO L188 LiptonReduction]: Number of co-enabled transitions 172 [2022-12-06 05:44:16,097 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [297] $Ultimate##0-->L56-2: Formula: (and (= v_~X~0_66 v_thread1Thread1of1ForFork0_~x~0_101) (< v_thread2Thread1of1ForFork1_~x~1_94 10001) (= v_thread2Thread1of1ForFork1_~x~1_94 (+ v_~X~0_66 2))) InVars {~X~0=v_~X~0_66} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_44|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_94, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_101, ~X~0=v_~X~0_66} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_~x~1, thread1Thread1of1ForFork0_~x~0] and [262] L43-2-->L43-2: Formula: (and (= (+ v_thread1Thread1of1ForFork0_~x~0_42 1) v_thread1Thread1of1ForFork0_~x~0_41) (< v_thread1Thread1of1ForFork0_~x~0_42 10000)) InVars {thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_42} OutVars{thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_41, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~x~0, thread1Thread1of1ForFork0_#t~post1] [2022-12-06 05:44:16,139 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [277] L43-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread1Thread1of1ForFork0_~x~0_In_3 10000)) (= v_~Y~0_Out_14 (+ v_~Y~0_In_6 v_thread1Thread1of1ForFork0_~x~0_In_3)) (= |v_thread1Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_In_3, ~Y~0=v_~Y~0_In_6} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_4|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_4|, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_In_3, ~Y~0=v_~Y~0_Out_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, ~Y~0] and [265] L56-2-->L56-2: Formula: (and (< v_thread2Thread1of1ForFork1_~x~1_38 10000) (= (+ v_thread2Thread1of1ForFork1_~x~1_38 1) v_thread2Thread1of1ForFork1_~x~1_37)) InVars {thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_38} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_15|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_~x~1] [2022-12-06 05:44:16,257 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:44:16,258 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:44:16,258 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 64 transitions, 858 flow [2022-12-06 05:44:16,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:16,258 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:16,258 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:16,267 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 05:44:16,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:16,464 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:16,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:16,465 INFO L85 PathProgramCache]: Analyzing trace with hash -240766652, now seen corresponding path program 1 times [2022-12-06 05:44:16,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:16,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634753322] [2022-12-06 05:44:16,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:16,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:16,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:16,494 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 05:44:16,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:16,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634753322] [2022-12-06 05:44:16,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634753322] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:44:16,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164382206] [2022-12-06 05:44:16,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:16,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:16,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:44:16,497 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 05:44:16,499 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 05:44:16,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:16,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 05:44:16,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:44:16,561 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 05:44:16,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:44:16,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:16,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164382206] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 05:44:16,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 05:44:16,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 7 [2022-12-06 05:44:16,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857564590] [2022-12-06 05:44:16,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:16,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:44:16,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:16,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:44:16,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:44:16,588 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 05:44:16,589 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 64 transitions, 858 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:16,589 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:16,589 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 05:44:16,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:16,723 INFO L130 PetriNetUnfolder]: 180/343 cut-off events. [2022-12-06 05:44:16,723 INFO L131 PetriNetUnfolder]: For 3719/3719 co-relation queries the response was YES. [2022-12-06 05:44:16,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2086 conditions, 343 events. 180/343 cut-off events. For 3719/3719 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1385 event pairs, 26 based on Foata normal form. 6/349 useless extension candidates. Maximal degree in co-relation 2038. Up to 172 conditions per place. [2022-12-06 05:44:16,726 INFO L137 encePairwiseOnDemand]: 13/28 looper letters, 68 selfloop transitions, 27 changer transitions 0/95 dead transitions. [2022-12-06 05:44:16,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 95 transitions, 1224 flow [2022-12-06 05:44:16,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:44:16,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:44:16,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-12-06 05:44:16,727 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2022-12-06 05:44:16,727 INFO L175 Difference]: Start difference. First operand has 65 places, 64 transitions, 858 flow. Second operand 6 states and 64 transitions. [2022-12-06 05:44:16,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 95 transitions, 1224 flow [2022-12-06 05:44:16,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 95 transitions, 1088 flow, removed 28 selfloop flow, removed 7 redundant places. [2022-12-06 05:44:16,738 INFO L231 Difference]: Finished difference. Result has 67 places, 71 transitions, 913 flow [2022-12-06 05:44:16,738 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=713, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=913, PETRI_PLACES=67, PETRI_TRANSITIONS=71} [2022-12-06 05:44:16,738 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 47 predicate places. [2022-12-06 05:44:16,738 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:16,738 INFO L89 Accepts]: Start accepts. Operand has 67 places, 71 transitions, 913 flow [2022-12-06 05:44:16,739 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:16,739 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:16,739 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 71 transitions, 913 flow [2022-12-06 05:44:16,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 71 transitions, 913 flow [2022-12-06 05:44:16,751 INFO L130 PetriNetUnfolder]: 43/140 cut-off events. [2022-12-06 05:44:16,752 INFO L131 PetriNetUnfolder]: For 1263/1271 co-relation queries the response was YES. [2022-12-06 05:44:16,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 692 conditions, 140 events. 43/140 cut-off events. For 1263/1271 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 624 event pairs, 0 based on Foata normal form. 2/141 useless extension candidates. Maximal degree in co-relation 601. Up to 44 conditions per place. [2022-12-06 05:44:16,753 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 71 transitions, 913 flow [2022-12-06 05:44:16,753 INFO L188 LiptonReduction]: Number of co-enabled transitions 192 [2022-12-06 05:44:16,754 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:44:16,755 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 05:44:16,755 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 71 transitions, 913 flow [2022-12-06 05:44:16,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:16,755 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:16,755 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:16,772 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 05:44:16,961 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,SelfDestructingSolverStorable17 [2022-12-06 05:44:16,961 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:16,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:16,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1845302693, now seen corresponding path program 1 times [2022-12-06 05:44:16,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:16,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789995874] [2022-12-06 05:44:16,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:16,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:16,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:17,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:17,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:17,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789995874] [2022-12-06 05:44:17,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789995874] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:17,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:17,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:44:17,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296543376] [2022-12-06 05:44:17,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:17,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:44:17,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:17,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:44:17,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:44:17,042 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 05:44:17,042 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 71 transitions, 913 flow. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:17,042 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:17,042 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 05:44:17,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:17,154 INFO L130 PetriNetUnfolder]: 197/380 cut-off events. [2022-12-06 05:44:17,154 INFO L131 PetriNetUnfolder]: For 3574/3574 co-relation queries the response was YES. [2022-12-06 05:44:17,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2217 conditions, 380 events. 197/380 cut-off events. For 3574/3574 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1592 event pairs, 34 based on Foata normal form. 2/382 useless extension candidates. Maximal degree in co-relation 1722. Up to 237 conditions per place. [2022-12-06 05:44:17,158 INFO L137 encePairwiseOnDemand]: 13/27 looper letters, 57 selfloop transitions, 27 changer transitions 5/89 dead transitions. [2022-12-06 05:44:17,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 89 transitions, 1218 flow [2022-12-06 05:44:17,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:44:17,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:44:17,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2022-12-06 05:44:17,159 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2962962962962963 [2022-12-06 05:44:17,159 INFO L175 Difference]: Start difference. First operand has 67 places, 71 transitions, 913 flow. Second operand 6 states and 48 transitions. [2022-12-06 05:44:17,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 89 transitions, 1218 flow [2022-12-06 05:44:17,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 89 transitions, 1208 flow, removed 5 selfloop flow, removed 0 redundant places. [2022-12-06 05:44:17,177 INFO L231 Difference]: Finished difference. Result has 75 places, 76 transitions, 1043 flow [2022-12-06 05:44:17,177 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=903, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1043, PETRI_PLACES=75, PETRI_TRANSITIONS=76} [2022-12-06 05:44:17,178 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 55 predicate places. [2022-12-06 05:44:17,178 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:17,178 INFO L89 Accepts]: Start accepts. Operand has 75 places, 76 transitions, 1043 flow [2022-12-06 05:44:17,180 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:17,180 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:17,181 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 76 transitions, 1043 flow [2022-12-06 05:44:17,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 76 transitions, 1043 flow [2022-12-06 05:44:17,204 INFO L130 PetriNetUnfolder]: 45/151 cut-off events. [2022-12-06 05:44:17,204 INFO L131 PetriNetUnfolder]: For 1585/1593 co-relation queries the response was YES. [2022-12-06 05:44:17,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 799 conditions, 151 events. 45/151 cut-off events. For 1585/1593 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 705 event pairs, 0 based on Foata normal form. 2/152 useless extension candidates. Maximal degree in co-relation 757. Up to 48 conditions per place. [2022-12-06 05:44:17,206 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 76 transitions, 1043 flow [2022-12-06 05:44:17,206 INFO L188 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-06 05:44:17,207 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [293] $Ultimate##0-->L43-2: Formula: (and (= (+ v_~X~0_62 1) v_thread2Thread1of1ForFork1_~x~1_84) (< v_~X~0_62 9999) (= v_thread1Thread1of1ForFork0_~x~0_91 (+ v_~X~0_62 2))) InVars {~X~0=v_~X~0_62} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_38|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_84, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_91, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_35|, ~X~0=v_~X~0_62} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_~x~1, thread1Thread1of1ForFork0_~x~0, thread1Thread1of1ForFork0_#t~post1] and [265] L56-2-->L56-2: Formula: (and (< v_thread2Thread1of1ForFork1_~x~1_38 10000) (= (+ v_thread2Thread1of1ForFork1_~x~1_38 1) v_thread2Thread1of1ForFork1_~x~1_37)) InVars {thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_38} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_15|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_~x~1] [2022-12-06 05:44:17,310 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [265] L56-2-->L56-2: Formula: (and (< v_thread2Thread1of1ForFork1_~x~1_38 10000) (= (+ v_thread2Thread1of1ForFork1_~x~1_38 1) v_thread2Thread1of1ForFork1_~x~1_37)) InVars {thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_38} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_15|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_~x~1] and [277] L43-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread1Thread1of1ForFork0_~x~0_In_3 10000)) (= v_~Y~0_Out_14 (+ v_~Y~0_In_6 v_thread1Thread1of1ForFork0_~x~0_In_3)) (= |v_thread1Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_In_3, ~Y~0=v_~Y~0_In_6} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_4|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_4|, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_In_3, ~Y~0=v_~Y~0_Out_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, ~Y~0] [2022-12-06 05:44:17,385 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:44:17,386 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 208 [2022-12-06 05:44:17,386 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 76 transitions, 1083 flow [2022-12-06 05:44:17,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:17,386 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:17,386 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:17,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 05:44:17,386 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:17,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:17,387 INFO L85 PathProgramCache]: Analyzing trace with hash 971122339, now seen corresponding path program 1 times [2022-12-06 05:44:17,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:17,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998861824] [2022-12-06 05:44:17,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:17,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:17,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:17,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:17,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:17,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998861824] [2022-12-06 05:44:17,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998861824] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:44:17,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23637006] [2022-12-06 05:44:17,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:17,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:17,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:44:17,505 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 05:44:17,507 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 05:44:17,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:17,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 05:44:17,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:44:17,637 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 05:44:17,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:44:17,760 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 05:44:17,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23637006] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:44:17,761 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:44:17,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-06 05:44:17,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327215124] [2022-12-06 05:44:17,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:44:17,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:44:17,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:17,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:44:17,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:44:17,762 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 05:44:17,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 76 transitions, 1083 flow. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:17,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:17,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 05:44:17,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:18,056 INFO L130 PetriNetUnfolder]: 204/394 cut-off events. [2022-12-06 05:44:18,056 INFO L131 PetriNetUnfolder]: For 4414/4414 co-relation queries the response was YES. [2022-12-06 05:44:18,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2491 conditions, 394 events. 204/394 cut-off events. For 4414/4414 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1662 event pairs, 21 based on Foata normal form. 1/393 useless extension candidates. Maximal degree in co-relation 2437. Up to 212 conditions per place. [2022-12-06 05:44:18,062 INFO L137 encePairwiseOnDemand]: 10/30 looper letters, 63 selfloop transitions, 44 changer transitions 5/112 dead transitions. [2022-12-06 05:44:18,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 112 transitions, 1604 flow [2022-12-06 05:44:18,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 05:44:18,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 05:44:18,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 77 transitions. [2022-12-06 05:44:18,063 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19743589743589743 [2022-12-06 05:44:18,063 INFO L175 Difference]: Start difference. First operand has 74 places, 76 transitions, 1083 flow. Second operand 13 states and 77 transitions. [2022-12-06 05:44:18,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 112 transitions, 1604 flow [2022-12-06 05:44:18,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 112 transitions, 1532 flow, removed 24 selfloop flow, removed 2 redundant places. [2022-12-06 05:44:18,072 INFO L231 Difference]: Finished difference. Result has 87 places, 82 transitions, 1210 flow [2022-12-06 05:44:18,072 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1017, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1210, PETRI_PLACES=87, PETRI_TRANSITIONS=82} [2022-12-06 05:44:18,072 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 67 predicate places. [2022-12-06 05:44:18,072 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:18,072 INFO L89 Accepts]: Start accepts. Operand has 87 places, 82 transitions, 1210 flow [2022-12-06 05:44:18,073 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:18,073 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:18,073 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 82 transitions, 1210 flow [2022-12-06 05:44:18,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 82 transitions, 1210 flow [2022-12-06 05:44:18,083 INFO L130 PetriNetUnfolder]: 49/159 cut-off events. [2022-12-06 05:44:18,083 INFO L131 PetriNetUnfolder]: For 2138/2148 co-relation queries the response was YES. [2022-12-06 05:44:18,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 906 conditions, 159 events. 49/159 cut-off events. For 2138/2148 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 747 event pairs, 0 based on Foata normal form. 2/160 useless extension candidates. Maximal degree in co-relation 860. Up to 51 conditions per place. [2022-12-06 05:44:18,084 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 82 transitions, 1210 flow [2022-12-06 05:44:18,084 INFO L188 LiptonReduction]: Number of co-enabled transitions 222 [2022-12-06 05:44:18,177 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [277] L43-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread1Thread1of1ForFork0_~x~0_In_3 10000)) (= v_~Y~0_Out_14 (+ v_~Y~0_In_6 v_thread1Thread1of1ForFork0_~x~0_In_3)) (= |v_thread1Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_In_3, ~Y~0=v_~Y~0_In_6} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_4|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_4|, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_In_3, ~Y~0=v_~Y~0_Out_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, ~Y~0] and [265] L56-2-->L56-2: Formula: (and (< v_thread2Thread1of1ForFork1_~x~1_38 10000) (= (+ v_thread2Thread1of1ForFork1_~x~1_38 1) v_thread2Thread1of1ForFork1_~x~1_37)) InVars {thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_38} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_15|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_~x~1] [2022-12-06 05:44:18,220 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [306] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_55| 0) (= v_~Y~0_174 (+ v_~Y~0_175 v_thread1Thread1of1ForFork0_~x~0_130)) (not (< v_thread1Thread1of1ForFork0_~x~0_130 10000)) (< v_~X~0_78 10000) (= (+ v_~X~0_78 1) v_thread1Thread1of1ForFork0_~x~0_130) (= |v_thread1Thread1of1ForFork0_#res.base_55| 0)) InVars {~X~0=v_~X~0_78, ~Y~0=v_~Y~0_175} OutVars{thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_55|, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_130, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_59|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_55|, ~X~0=v_~X~0_78, ~Y~0=v_~Y~0_174} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_~x~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#res.offset, ~Y~0] and [265] L56-2-->L56-2: Formula: (and (< v_thread2Thread1of1ForFork1_~x~1_38 10000) (= (+ v_thread2Thread1of1ForFork1_~x~1_38 1) v_thread2Thread1of1ForFork1_~x~1_37)) InVars {thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_38} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_15|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_~x~1] [2022-12-06 05:44:18,261 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:44:18,261 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 05:44:18,261 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 81 transitions, 1241 flow [2022-12-06 05:44:18,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:18,262 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:18,262 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:18,270 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 05:44:18,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:18,462 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:18,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:18,463 INFO L85 PathProgramCache]: Analyzing trace with hash 221478897, now seen corresponding path program 1 times [2022-12-06 05:44:18,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:18,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461676596] [2022-12-06 05:44:18,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:18,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:18,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:18,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:18,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461676596] [2022-12-06 05:44:18,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461676596] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:18,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:18,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:44:18,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329404495] [2022-12-06 05:44:18,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:18,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:44:18,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:18,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:44:18,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:44:18,487 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 05:44:18,487 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 81 transitions, 1241 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:18,487 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:18,487 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 05:44:18,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:18,545 INFO L130 PetriNetUnfolder]: 195/374 cut-off events. [2022-12-06 05:44:18,545 INFO L131 PetriNetUnfolder]: For 5236/5236 co-relation queries the response was YES. [2022-12-06 05:44:18,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2470 conditions, 374 events. 195/374 cut-off events. For 5236/5236 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1523 event pairs, 47 based on Foata normal form. 4/378 useless extension candidates. Maximal degree in co-relation 2414. Up to 259 conditions per place. [2022-12-06 05:44:18,548 INFO L137 encePairwiseOnDemand]: 28/33 looper letters, 72 selfloop transitions, 10 changer transitions 1/83 dead transitions. [2022-12-06 05:44:18,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 83 transitions, 1396 flow [2022-12-06 05:44:18,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:44:18,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:44:18,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-12-06 05:44:18,549 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3838383838383838 [2022-12-06 05:44:18,549 INFO L175 Difference]: Start difference. First operand has 85 places, 81 transitions, 1241 flow. Second operand 3 states and 38 transitions. [2022-12-06 05:44:18,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 83 transitions, 1396 flow [2022-12-06 05:44:18,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 83 transitions, 1265 flow, removed 30 selfloop flow, removed 9 redundant places. [2022-12-06 05:44:18,558 INFO L231 Difference]: Finished difference. Result has 78 places, 78 transitions, 1073 flow [2022-12-06 05:44:18,558 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1076, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1073, PETRI_PLACES=78, PETRI_TRANSITIONS=78} [2022-12-06 05:44:18,558 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 58 predicate places. [2022-12-06 05:44:18,558 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:18,559 INFO L89 Accepts]: Start accepts. Operand has 78 places, 78 transitions, 1073 flow [2022-12-06 05:44:18,560 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:18,560 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:18,561 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 78 transitions, 1073 flow [2022-12-06 05:44:18,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 78 transitions, 1073 flow [2022-12-06 05:44:18,570 INFO L130 PetriNetUnfolder]: 48/151 cut-off events. [2022-12-06 05:44:18,571 INFO L131 PetriNetUnfolder]: For 1890/1899 co-relation queries the response was YES. [2022-12-06 05:44:18,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 806 conditions, 151 events. 48/151 cut-off events. For 1890/1899 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 671 event pairs, 0 based on Foata normal form. 2/152 useless extension candidates. Maximal degree in co-relation 710. Up to 49 conditions per place. [2022-12-06 05:44:18,572 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 78 transitions, 1073 flow [2022-12-06 05:44:18,572 INFO L188 LiptonReduction]: Number of co-enabled transitions 206 [2022-12-06 05:44:18,574 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [301] L43-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_46| 0) (= |v_thread1Thread1of1ForFork0_#res.base_46| 0) (= (+ v_thread1Thread1of1ForFork0_~x~0_114 1) v_thread1Thread1of1ForFork0_~x~0_113) (= (+ v_~Y~0_160 v_thread1Thread1of1ForFork0_~x~0_113) v_~Y~0_159) (< v_thread1Thread1of1ForFork0_~x~0_114 10000) (not (< v_thread1Thread1of1ForFork0_~x~0_113 10000))) InVars {thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_114, ~Y~0=v_~Y~0_160} OutVars{thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_46|, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_113, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_47|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_46|, ~Y~0=v_~Y~0_159} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_~x~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#res.offset, ~Y~0] and [265] L56-2-->L56-2: Formula: (and (< v_thread2Thread1of1ForFork1_~x~1_38 10000) (= (+ v_thread2Thread1of1ForFork1_~x~1_38 1) v_thread2Thread1of1ForFork1_~x~1_37)) InVars {thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_38} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_15|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_~x~1] [2022-12-06 05:44:18,633 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:44:18,634 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 05:44:18,635 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 77 transitions, 1069 flow [2022-12-06 05:44:18,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:18,635 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:18,635 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:18,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 05:44:18,635 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:18,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:18,635 INFO L85 PathProgramCache]: Analyzing trace with hash 913061274, now seen corresponding path program 1 times [2022-12-06 05:44:18,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:18,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243073761] [2022-12-06 05:44:18,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:18,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:18,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:18,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:18,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243073761] [2022-12-06 05:44:18,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243073761] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:18,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:18,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:44:18,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759805838] [2022-12-06 05:44:18,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:18,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:44:18,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:18,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:44:18,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:44:18,655 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 05:44:18,655 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 77 transitions, 1069 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:18,655 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:18,655 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 05:44:18,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:18,730 INFO L130 PetriNetUnfolder]: 185/348 cut-off events. [2022-12-06 05:44:18,730 INFO L131 PetriNetUnfolder]: For 4564/4564 co-relation queries the response was YES. [2022-12-06 05:44:18,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2196 conditions, 348 events. 185/348 cut-off events. For 4564/4564 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1338 event pairs, 47 based on Foata normal form. 4/352 useless extension candidates. Maximal degree in co-relation 1665. Up to 249 conditions per place. [2022-12-06 05:44:18,733 INFO L137 encePairwiseOnDemand]: 24/31 looper letters, 70 selfloop transitions, 16 changer transitions 1/87 dead transitions. [2022-12-06 05:44:18,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 87 transitions, 1300 flow [2022-12-06 05:44:18,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:44:18,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:44:18,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 05:44:18,734 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2022-12-06 05:44:18,734 INFO L175 Difference]: Start difference. First operand has 77 places, 77 transitions, 1069 flow. Second operand 4 states and 48 transitions. [2022-12-06 05:44:18,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 87 transitions, 1300 flow [2022-12-06 05:44:18,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 87 transitions, 1283 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-06 05:44:18,742 INFO L231 Difference]: Finished difference. Result has 79 places, 75 transitions, 1073 flow [2022-12-06 05:44:18,742 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1025, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1073, PETRI_PLACES=79, PETRI_TRANSITIONS=75} [2022-12-06 05:44:18,742 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 59 predicate places. [2022-12-06 05:44:18,743 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:18,743 INFO L89 Accepts]: Start accepts. Operand has 79 places, 75 transitions, 1073 flow [2022-12-06 05:44:18,743 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:18,743 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:18,743 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 75 transitions, 1073 flow [2022-12-06 05:44:18,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 75 transitions, 1073 flow [2022-12-06 05:44:18,752 INFO L130 PetriNetUnfolder]: 46/139 cut-off events. [2022-12-06 05:44:18,752 INFO L131 PetriNetUnfolder]: For 1854/1863 co-relation queries the response was YES. [2022-12-06 05:44:18,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 795 conditions, 139 events. 46/139 cut-off events. For 1854/1863 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 582 event pairs, 0 based on Foata normal form. 2/140 useless extension candidates. Maximal degree in co-relation 704. Up to 48 conditions per place. [2022-12-06 05:44:18,753 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 75 transitions, 1073 flow [2022-12-06 05:44:18,753 INFO L188 LiptonReduction]: Number of co-enabled transitions 200 [2022-12-06 05:44:18,754 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:44:18,754 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 05:44:18,754 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 75 transitions, 1073 flow [2022-12-06 05:44:18,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:18,754 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:18,755 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:18,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 05:44:18,755 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:18,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:18,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1277244068, now seen corresponding path program 1 times [2022-12-06 05:44:18,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:18,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791641721] [2022-12-06 05:44:18,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:18,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:18,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:18,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:18,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791641721] [2022-12-06 05:44:18,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791641721] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:18,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:18,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:44:18,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113771234] [2022-12-06 05:44:18,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:18,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:44:18,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:18,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:44:18,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:44:18,841 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 05:44:18,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 75 transitions, 1073 flow. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:18,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:18,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 05:44:18,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:18,940 INFO L130 PetriNetUnfolder]: 201/382 cut-off events. [2022-12-06 05:44:18,941 INFO L131 PetriNetUnfolder]: For 4981/4981 co-relation queries the response was YES. [2022-12-06 05:44:18,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2479 conditions, 382 events. 201/382 cut-off events. For 4981/4981 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1544 event pairs, 40 based on Foata normal form. 2/384 useless extension candidates. Maximal degree in co-relation 1908. Up to 226 conditions per place. [2022-12-06 05:44:18,944 INFO L137 encePairwiseOnDemand]: 12/29 looper letters, 56 selfloop transitions, 32 changer transitions 5/93 dead transitions. [2022-12-06 05:44:18,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 93 transitions, 1404 flow [2022-12-06 05:44:18,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:44:18,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:44:18,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2022-12-06 05:44:18,945 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28735632183908044 [2022-12-06 05:44:18,945 INFO L175 Difference]: Start difference. First operand has 79 places, 75 transitions, 1073 flow. Second operand 6 states and 50 transitions. [2022-12-06 05:44:18,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 93 transitions, 1404 flow [2022-12-06 05:44:18,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 93 transitions, 1353 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-12-06 05:44:18,954 INFO L231 Difference]: Finished difference. Result has 83 places, 80 transitions, 1187 flow [2022-12-06 05:44:18,954 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1030, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1187, PETRI_PLACES=83, PETRI_TRANSITIONS=80} [2022-12-06 05:44:18,954 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 63 predicate places. [2022-12-06 05:44:18,954 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:18,954 INFO L89 Accepts]: Start accepts. Operand has 83 places, 80 transitions, 1187 flow [2022-12-06 05:44:18,955 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:18,955 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:18,955 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 80 transitions, 1187 flow [2022-12-06 05:44:18,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 80 transitions, 1187 flow [2022-12-06 05:44:18,965 INFO L130 PetriNetUnfolder]: 48/148 cut-off events. [2022-12-06 05:44:18,965 INFO L131 PetriNetUnfolder]: For 2118/2127 co-relation queries the response was YES. [2022-12-06 05:44:18,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 880 conditions, 148 events. 48/148 cut-off events. For 2118/2127 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 643 event pairs, 0 based on Foata normal form. 2/149 useless extension candidates. Maximal degree in co-relation 837. Up to 51 conditions per place. [2022-12-06 05:44:18,994 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 80 transitions, 1187 flow [2022-12-06 05:44:18,995 INFO L188 LiptonReduction]: Number of co-enabled transitions 218 [2022-12-06 05:44:18,995 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [302] $Ultimate##0-->L56-2: Formula: (let ((.cse0 (+ v_~X~0_72 2))) (and (= v_thread2Thread1of1ForFork1_~x~1_113 .cse0) (< v_~X~0_72 9999) (= .cse0 v_thread1Thread1of1ForFork0_~x~0_118))) InVars {~X~0=v_~X~0_72} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_59|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_113, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_118, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_49|, ~X~0=v_~X~0_72} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_~x~1, thread1Thread1of1ForFork0_~x~0, thread1Thread1of1ForFork0_#t~post1] and [277] L43-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread1Thread1of1ForFork0_~x~0_In_3 10000)) (= v_~Y~0_Out_14 (+ v_~Y~0_In_6 v_thread1Thread1of1ForFork0_~x~0_In_3)) (= |v_thread1Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_In_3, ~Y~0=v_~Y~0_In_6} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_4|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_4|, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_In_3, ~Y~0=v_~Y~0_Out_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, ~Y~0] [2022-12-06 05:44:19,075 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:44:19,076 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-06 05:44:19,076 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 80 transitions, 1211 flow [2022-12-06 05:44:19,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:19,076 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:19,076 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:19,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-06 05:44:19,076 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:19,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:19,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1426684896, now seen corresponding path program 1 times [2022-12-06 05:44:19,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:19,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015630420] [2022-12-06 05:44:19,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:19,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:19,105 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 05:44:19,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:19,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015630420] [2022-12-06 05:44:19,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015630420] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:44:19,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721833660] [2022-12-06 05:44:19,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:19,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:19,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:44:19,129 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 05:44:19,130 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 05:44:19,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:19,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-06 05:44:19,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:44:19,185 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 05:44:19,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:44:19,203 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 05:44:19,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721833660] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:44:19,204 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:44:19,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-12-06 05:44:19,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209101450] [2022-12-06 05:44:19,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:44:19,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:44:19,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:19,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:44:19,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:44:19,205 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 05:44:19,205 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 80 transitions, 1211 flow. Second operand has 6 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 05:44:19,205 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:19,205 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 05:44:19,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:19,315 INFO L130 PetriNetUnfolder]: 207/396 cut-off events. [2022-12-06 05:44:19,315 INFO L131 PetriNetUnfolder]: For 5633/5633 co-relation queries the response was YES. [2022-12-06 05:44:19,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2658 conditions, 396 events. 207/396 cut-off events. For 5633/5633 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1640 event pairs, 42 based on Foata normal form. 8/402 useless extension candidates. Maximal degree in co-relation 2603. Up to 266 conditions per place. [2022-12-06 05:44:19,319 INFO L137 encePairwiseOnDemand]: 16/31 looper letters, 62 selfloop transitions, 34 changer transitions 0/96 dead transitions. [2022-12-06 05:44:19,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 96 transitions, 1524 flow [2022-12-06 05:44:19,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:44:19,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:44:19,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-12-06 05:44:19,320 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3161290322580645 [2022-12-06 05:44:19,320 INFO L175 Difference]: Start difference. First operand has 82 places, 80 transitions, 1211 flow. Second operand 5 states and 49 transitions. [2022-12-06 05:44:19,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 96 transitions, 1524 flow [2022-12-06 05:44:19,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 96 transitions, 1428 flow, removed 24 selfloop flow, removed 3 redundant places. [2022-12-06 05:44:19,332 INFO L231 Difference]: Finished difference. Result has 84 places, 83 transitions, 1242 flow [2022-12-06 05:44:19,332 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1117, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1242, PETRI_PLACES=84, PETRI_TRANSITIONS=83} [2022-12-06 05:44:19,332 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 64 predicate places. [2022-12-06 05:44:19,332 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:19,332 INFO L89 Accepts]: Start accepts. Operand has 84 places, 83 transitions, 1242 flow [2022-12-06 05:44:19,333 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:19,333 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:19,333 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 83 transitions, 1242 flow [2022-12-06 05:44:19,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 83 transitions, 1242 flow [2022-12-06 05:44:19,345 INFO L130 PetriNetUnfolder]: 48/158 cut-off events. [2022-12-06 05:44:19,346 INFO L131 PetriNetUnfolder]: For 2266/2277 co-relation queries the response was YES. [2022-12-06 05:44:19,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 158 events. 48/158 cut-off events. For 2266/2277 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 751 event pairs, 0 based on Foata normal form. 2/159 useless extension candidates. Maximal degree in co-relation 824. Up to 52 conditions per place. [2022-12-06 05:44:19,347 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 83 transitions, 1242 flow [2022-12-06 05:44:19,348 INFO L188 LiptonReduction]: Number of co-enabled transitions 236 [2022-12-06 05:44:19,348 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:44:19,349 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 05:44:19,349 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 83 transitions, 1242 flow [2022-12-06 05:44:19,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 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 05:44:19,349 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:19,349 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:19,365 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 05:44:19,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:19,555 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:19,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:19,555 INFO L85 PathProgramCache]: Analyzing trace with hash 2139037368, now seen corresponding path program 1 times [2022-12-06 05:44:19,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:19,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556638197] [2022-12-06 05:44:19,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:19,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:19,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:19,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:19,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556638197] [2022-12-06 05:44:19,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556638197] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:19,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:19,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:44:19,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136272302] [2022-12-06 05:44:19,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:19,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:44:19,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:19,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:44:19,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:44:19,574 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 05:44:19,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 83 transitions, 1242 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:19,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:19,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 05:44:19,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:19,631 INFO L130 PetriNetUnfolder]: 203/392 cut-off events. [2022-12-06 05:44:19,632 INFO L131 PetriNetUnfolder]: For 5772/5772 co-relation queries the response was YES. [2022-12-06 05:44:19,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2663 conditions, 392 events. 203/392 cut-off events. For 5772/5772 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1616 event pairs, 51 based on Foata normal form. 4/396 useless extension candidates. Maximal degree in co-relation 2267. Up to 285 conditions per place. [2022-12-06 05:44:19,635 INFO L137 encePairwiseOnDemand]: 26/31 looper letters, 75 selfloop transitions, 10 changer transitions 1/86 dead transitions. [2022-12-06 05:44:19,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 86 transitions, 1432 flow [2022-12-06 05:44:19,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:44:19,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:44:19,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-06 05:44:19,635 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3978494623655914 [2022-12-06 05:44:19,635 INFO L175 Difference]: Start difference. First operand has 84 places, 83 transitions, 1242 flow. Second operand 3 states and 37 transitions. [2022-12-06 05:44:19,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 86 transitions, 1432 flow [2022-12-06 05:44:19,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 86 transitions, 1391 flow, removed 19 selfloop flow, removed 1 redundant places. [2022-12-06 05:44:19,647 INFO L231 Difference]: Finished difference. Result has 85 places, 81 transitions, 1190 flow [2022-12-06 05:44:19,647 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1194, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1190, PETRI_PLACES=85, PETRI_TRANSITIONS=81} [2022-12-06 05:44:19,647 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 65 predicate places. [2022-12-06 05:44:19,647 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:19,647 INFO L89 Accepts]: Start accepts. Operand has 85 places, 81 transitions, 1190 flow [2022-12-06 05:44:19,648 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:19,648 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:19,648 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 81 transitions, 1190 flow [2022-12-06 05:44:19,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 81 transitions, 1190 flow [2022-12-06 05:44:19,657 INFO L130 PetriNetUnfolder]: 47/154 cut-off events. [2022-12-06 05:44:19,657 INFO L131 PetriNetUnfolder]: For 2199/2209 co-relation queries the response was YES. [2022-12-06 05:44:19,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 895 conditions, 154 events. 47/154 cut-off events. For 2199/2209 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 712 event pairs, 0 based on Foata normal form. 2/155 useless extension candidates. Maximal degree in co-relation 792. Up to 49 conditions per place. [2022-12-06 05:44:19,659 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 81 transitions, 1190 flow [2022-12-06 05:44:19,659 INFO L188 LiptonReduction]: Number of co-enabled transitions 228 [2022-12-06 05:44:19,732 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:44:19,733 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-06 05:44:19,733 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 80 transitions, 1186 flow [2022-12-06 05:44:19,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:19,733 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:19,733 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:19,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-06 05:44:19,733 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:19,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:19,734 INFO L85 PathProgramCache]: Analyzing trace with hash 674842605, now seen corresponding path program 1 times [2022-12-06 05:44:19,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:19,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013077256] [2022-12-06 05:44:19,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:19,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:19,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:19,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:19,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013077256] [2022-12-06 05:44:19,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013077256] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:19,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:19,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:44:19,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734004042] [2022-12-06 05:44:19,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:19,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:44:19,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:19,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:44:19,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:44:19,750 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 05:44:19,750 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 80 transitions, 1186 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:19,750 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:19,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 05:44:19,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:19,808 INFO L130 PetriNetUnfolder]: 202/385 cut-off events. [2022-12-06 05:44:19,809 INFO L131 PetriNetUnfolder]: For 5580/5580 co-relation queries the response was YES. [2022-12-06 05:44:19,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2598 conditions, 385 events. 202/385 cut-off events. For 5580/5580 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1553 event pairs, 67 based on Foata normal form. 2/387 useless extension candidates. Maximal degree in co-relation 2253. Up to 365 conditions per place. [2022-12-06 05:44:19,812 INFO L137 encePairwiseOnDemand]: 24/30 looper letters, 76 selfloop transitions, 7 changer transitions 0/83 dead transitions. [2022-12-06 05:44:19,812 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 83 transitions, 1390 flow [2022-12-06 05:44:19,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:44:19,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:44:19,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 05:44:19,812 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37777777777777777 [2022-12-06 05:44:19,813 INFO L175 Difference]: Start difference. First operand has 84 places, 80 transitions, 1186 flow. Second operand 3 states and 34 transitions. [2022-12-06 05:44:19,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 83 transitions, 1390 flow [2022-12-06 05:44:19,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 83 transitions, 1374 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-06 05:44:19,823 INFO L231 Difference]: Finished difference. Result has 86 places, 81 transitions, 1213 flow [2022-12-06 05:44:19,823 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1170, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1213, PETRI_PLACES=86, PETRI_TRANSITIONS=81} [2022-12-06 05:44:19,823 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 66 predicate places. [2022-12-06 05:44:19,824 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:19,824 INFO L89 Accepts]: Start accepts. Operand has 86 places, 81 transitions, 1213 flow [2022-12-06 05:44:19,824 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:19,824 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:19,824 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 81 transitions, 1213 flow [2022-12-06 05:44:19,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 81 transitions, 1213 flow [2022-12-06 05:44:19,834 INFO L130 PetriNetUnfolder]: 48/159 cut-off events. [2022-12-06 05:44:19,834 INFO L131 PetriNetUnfolder]: For 2338/2348 co-relation queries the response was YES. [2022-12-06 05:44:19,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 934 conditions, 159 events. 48/159 cut-off events. For 2338/2348 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 733 event pairs, 0 based on Foata normal form. 2/160 useless extension candidates. Maximal degree in co-relation 826. Up to 51 conditions per place. [2022-12-06 05:44:19,835 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 81 transitions, 1213 flow [2022-12-06 05:44:19,835 INFO L188 LiptonReduction]: Number of co-enabled transitions 224 [2022-12-06 05:44:19,836 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:44:19,836 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 05:44:19,836 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 81 transitions, 1213 flow [2022-12-06 05:44:19,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:19,836 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:19,837 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:19,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-06 05:44:19,837 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:19,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:19,837 INFO L85 PathProgramCache]: Analyzing trace with hash -525797799, now seen corresponding path program 1 times [2022-12-06 05:44:19,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:19,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42873896] [2022-12-06 05:44:19,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:19,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:19,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:19,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:19,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:19,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42873896] [2022-12-06 05:44:19,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42873896] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:19,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:19,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:44:19,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766903310] [2022-12-06 05:44:19,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:19,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:44:19,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:19,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:44:19,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:44:19,857 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 05:44:19,857 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 81 transitions, 1213 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:19,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:19,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 05:44:19,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:19,912 INFO L130 PetriNetUnfolder]: 200/383 cut-off events. [2022-12-06 05:44:19,912 INFO L131 PetriNetUnfolder]: For 5587/5587 co-relation queries the response was YES. [2022-12-06 05:44:19,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2609 conditions, 383 events. 200/383 cut-off events. For 5587/5587 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1543 event pairs, 71 based on Foata normal form. 2/385 useless extension candidates. Maximal degree in co-relation 2261. Up to 363 conditions per place. [2022-12-06 05:44:19,915 INFO L137 encePairwiseOnDemand]: 25/30 looper letters, 76 selfloop transitions, 6 changer transitions 0/82 dead transitions. [2022-12-06 05:44:19,915 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 82 transitions, 1372 flow [2022-12-06 05:44:19,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:44:19,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:44:19,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-12-06 05:44:19,916 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-06 05:44:19,916 INFO L175 Difference]: Start difference. First operand has 86 places, 81 transitions, 1213 flow. Second operand 3 states and 33 transitions. [2022-12-06 05:44:19,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 82 transitions, 1372 flow [2022-12-06 05:44:19,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 82 transitions, 1350 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-06 05:44:19,926 INFO L231 Difference]: Finished difference. Result has 86 places, 80 transitions, 1180 flow [2022-12-06 05:44:19,927 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1168, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1180, PETRI_PLACES=86, PETRI_TRANSITIONS=80} [2022-12-06 05:44:19,927 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 66 predicate places. [2022-12-06 05:44:19,927 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:19,927 INFO L89 Accepts]: Start accepts. Operand has 86 places, 80 transitions, 1180 flow [2022-12-06 05:44:19,927 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:19,928 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:19,928 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 80 transitions, 1180 flow [2022-12-06 05:44:19,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 80 transitions, 1180 flow [2022-12-06 05:44:19,937 INFO L130 PetriNetUnfolder]: 47/154 cut-off events. [2022-12-06 05:44:19,937 INFO L131 PetriNetUnfolder]: For 2250/2260 co-relation queries the response was YES. [2022-12-06 05:44:19,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 897 conditions, 154 events. 47/154 cut-off events. For 2250/2260 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 703 event pairs, 0 based on Foata normal form. 2/155 useless extension candidates. Maximal degree in co-relation 794. Up to 51 conditions per place. [2022-12-06 05:44:19,938 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 80 transitions, 1180 flow [2022-12-06 05:44:19,938 INFO L188 LiptonReduction]: Number of co-enabled transitions 222 [2022-12-06 05:44:20,021 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [302] $Ultimate##0-->L56-2: Formula: (let ((.cse0 (+ v_~X~0_72 2))) (and (= v_thread2Thread1of1ForFork1_~x~1_113 .cse0) (< v_~X~0_72 9999) (= .cse0 v_thread1Thread1of1ForFork0_~x~0_118))) InVars {~X~0=v_~X~0_72} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_59|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_113, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_118, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_49|, ~X~0=v_~X~0_72} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_~x~1, thread1Thread1of1ForFork0_~x~0, thread1Thread1of1ForFork0_#t~post1] and [262] L43-2-->L43-2: Formula: (and (= (+ v_thread1Thread1of1ForFork0_~x~0_42 1) v_thread1Thread1of1ForFork0_~x~0_41) (< v_thread1Thread1of1ForFork0_~x~0_42 10000)) InVars {thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_42} OutVars{thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_41, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~x~0, thread1Thread1of1ForFork0_#t~post1] [2022-12-06 05:44:20,047 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:44:20,047 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-06 05:44:20,047 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 77 transitions, 1169 flow [2022-12-06 05:44:20,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:20,047 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:20,047 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:20,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-06 05:44:20,048 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:20,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:20,048 INFO L85 PathProgramCache]: Analyzing trace with hash -2139891035, now seen corresponding path program 1 times [2022-12-06 05:44:20,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:20,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310227918] [2022-12-06 05:44:20,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:20,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:20,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:20,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:20,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:20,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310227918] [2022-12-06 05:44:20,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310227918] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:20,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:20,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:44:20,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773018574] [2022-12-06 05:44:20,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:20,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:44:20,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:20,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:44:20,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:44:20,153 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 05:44:20,153 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 77 transitions, 1169 flow. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:20,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:20,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 05:44:20,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:20,294 INFO L130 PetriNetUnfolder]: 238/451 cut-off events. [2022-12-06 05:44:20,294 INFO L131 PetriNetUnfolder]: For 5933/5933 co-relation queries the response was YES. [2022-12-06 05:44:20,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3032 conditions, 451 events. 238/451 cut-off events. For 5933/5933 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1950 event pairs, 36 based on Foata normal form. 2/453 useless extension candidates. Maximal degree in co-relation 2505. Up to 264 conditions per place. [2022-12-06 05:44:20,297 INFO L137 encePairwiseOnDemand]: 10/29 looper letters, 55 selfloop transitions, 49 changer transitions 5/109 dead transitions. [2022-12-06 05:44:20,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 109 transitions, 1732 flow [2022-12-06 05:44:20,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:44:20,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:44:20,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2022-12-06 05:44:20,298 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2629310344827586 [2022-12-06 05:44:20,298 INFO L175 Difference]: Start difference. First operand has 83 places, 77 transitions, 1169 flow. Second operand 8 states and 61 transitions. [2022-12-06 05:44:20,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 109 transitions, 1732 flow [2022-12-06 05:44:20,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 109 transitions, 1606 flow, removed 42 selfloop flow, removed 6 redundant places. [2022-12-06 05:44:20,308 INFO L231 Difference]: Finished difference. Result has 88 places, 93 transitions, 1447 flow [2022-12-06 05:44:20,308 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1085, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1447, PETRI_PLACES=88, PETRI_TRANSITIONS=93} [2022-12-06 05:44:20,312 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 68 predicate places. [2022-12-06 05:44:20,312 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:20,312 INFO L89 Accepts]: Start accepts. Operand has 88 places, 93 transitions, 1447 flow [2022-12-06 05:44:20,313 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:20,313 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:20,313 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 93 transitions, 1447 flow [2022-12-06 05:44:20,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 93 transitions, 1447 flow [2022-12-06 05:44:20,324 INFO L130 PetriNetUnfolder]: 56/175 cut-off events. [2022-12-06 05:44:20,324 INFO L131 PetriNetUnfolder]: For 1937/1947 co-relation queries the response was YES. [2022-12-06 05:44:20,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1088 conditions, 175 events. 56/175 cut-off events. For 1937/1947 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 846 event pairs, 0 based on Foata normal form. 2/176 useless extension candidates. Maximal degree in co-relation 1041. Up to 64 conditions per place. [2022-12-06 05:44:20,326 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 93 transitions, 1447 flow [2022-12-06 05:44:20,326 INFO L188 LiptonReduction]: Number of co-enabled transitions 264 [2022-12-06 05:44:20,326 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [316] $Ultimate##0-->L43-2: Formula: (and (< v_thread1Thread1of1ForFork0_~x~0_158 10001) (= (+ v_~X~0_92 2) v_thread2Thread1of1ForFork1_~x~1_166) (= (+ v_~X~0_92 3) v_thread1Thread1of1ForFork0_~x~0_158)) InVars {~X~0=v_~X~0_92} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_99|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_166, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_158, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_79|, ~X~0=v_~X~0_92} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_~x~1, thread1Thread1of1ForFork0_~x~0, thread1Thread1of1ForFork0_#t~post1] and [265] L56-2-->L56-2: Formula: (and (< v_thread2Thread1of1ForFork1_~x~1_38 10000) (= (+ v_thread2Thread1of1ForFork1_~x~1_38 1) v_thread2Thread1of1ForFork1_~x~1_37)) InVars {thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_38} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_15|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_~x~1] [2022-12-06 05:44:20,401 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [313] $Ultimate##0-->L56-2: Formula: (and (< v_thread2Thread1of1ForFork1_~x~1_156 10001) (= (+ v_~X~0_86 3) v_thread2Thread1of1ForFork1_~x~1_156) (= v_~X~0_86 v_thread1Thread1of1ForFork0_~x~0_150)) InVars {~X~0=v_~X~0_86} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_89|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_156, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_150, ~X~0=v_~X~0_86} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_~x~1, thread1Thread1of1ForFork0_~x~0] and [262] L43-2-->L43-2: Formula: (and (= (+ v_thread1Thread1of1ForFork0_~x~0_42 1) v_thread1Thread1of1ForFork0_~x~0_41) (< v_thread1Thread1of1ForFork0_~x~0_42 10000)) InVars {thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_42} OutVars{thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_41, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~x~0, thread1Thread1of1ForFork0_#t~post1] [2022-12-06 05:44:20,427 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [315] $Ultimate##0-->L43-2: Formula: (and (= v_thread1Thread1of1ForFork0_~x~0_154 (+ v_~X~0_90 3)) (= (+ v_~X~0_90 1) v_thread2Thread1of1ForFork1_~x~1_164) (< v_thread1Thread1of1ForFork0_~x~0_154 10001)) InVars {~X~0=v_~X~0_90} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_97|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_164, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_154, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_75|, ~X~0=v_~X~0_90} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_~x~1, thread1Thread1of1ForFork0_~x~0, thread1Thread1of1ForFork0_#t~post1] and [304] L56-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_51| 0) (= |v_thread1Thread1of1ForFork0_#res.offset_51| 0) (not (< v_thread1Thread1of1ForFork0_~x~0_122 10000)) (= v_~Y~0_168 (+ v_~Y~0_169 v_thread1Thread1of1ForFork0_~x~0_122)) (= v_thread2Thread1of1ForFork1_~x~1_121 (+ v_thread2Thread1of1ForFork1_~x~1_122 1)) (< v_thread2Thread1of1ForFork1_~x~1_122 10000)) InVars {thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_122, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_122, ~Y~0=v_~Y~0_169} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_67|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_121, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_51|, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_122, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_51|, ~Y~0=v_~Y~0_168} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_~x~1, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, ~Y~0] [2022-12-06 05:44:20,588 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [284] $Ultimate##0-->L43-2: Formula: (and (< v_~X~0_46 10000) (= v_thread1Thread1of1ForFork0_~x~0_59 (+ v_~X~0_46 1))) InVars {~X~0=v_~X~0_46} OutVars{thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_59, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_23|, ~X~0=v_~X~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~x~0, thread1Thread1of1ForFork0_#t~post1] and [265] L56-2-->L56-2: Formula: (and (< v_thread2Thread1of1ForFork1_~x~1_38 10000) (= (+ v_thread2Thread1of1ForFork1_~x~1_38 1) v_thread2Thread1of1ForFork1_~x~1_37)) InVars {thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_38} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_15|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_~x~1] [2022-12-06 05:44:20,635 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 05:44:20,636 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 324 [2022-12-06 05:44:20,636 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 93 transitions, 1519 flow [2022-12-06 05:44:20,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:20,636 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:20,636 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:20,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-06 05:44:20,637 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:20,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:20,637 INFO L85 PathProgramCache]: Analyzing trace with hash 226706699, now seen corresponding path program 1 times [2022-12-06 05:44:20,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:20,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494346941] [2022-12-06 05:44:20,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:20,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:20,708 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 05:44:20,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:20,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494346941] [2022-12-06 05:44:20,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494346941] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:44:20,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103699254] [2022-12-06 05:44:20,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:20,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:20,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:44:20,732 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 05:44:20,733 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 05:44:20,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:20,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 05:44:20,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:44:20,852 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 05:44:20,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:44:20,964 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 05:44:20,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103699254] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:44:20,964 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:44:20,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-06 05:44:20,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270394738] [2022-12-06 05:44:20,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:44:20,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 05:44:20,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:20,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 05:44:20,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-12-06 05:44:20,965 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 05:44:20,966 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 93 transitions, 1519 flow. Second operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:20,966 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:20,966 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 05:44:20,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:21,264 INFO L130 PetriNetUnfolder]: 258/492 cut-off events. [2022-12-06 05:44:21,264 INFO L131 PetriNetUnfolder]: For 6250/6250 co-relation queries the response was YES. [2022-12-06 05:44:21,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3490 conditions, 492 events. 258/492 cut-off events. For 6250/6250 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2184 event pairs, 38 based on Foata normal form. 5/493 useless extension candidates. Maximal degree in co-relation 3433. Up to 226 conditions per place. [2022-12-06 05:44:21,269 INFO L137 encePairwiseOnDemand]: 13/37 looper letters, 50 selfloop transitions, 16 changer transitions 59/125 dead transitions. [2022-12-06 05:44:21,269 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 125 transitions, 2044 flow [2022-12-06 05:44:21,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:44:21,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:44:21,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 76 transitions. [2022-12-06 05:44:21,271 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20540540540540542 [2022-12-06 05:44:21,271 INFO L175 Difference]: Start difference. First operand has 87 places, 93 transitions, 1519 flow. Second operand 10 states and 76 transitions. [2022-12-06 05:44:21,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 125 transitions, 2044 flow [2022-12-06 05:44:21,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 125 transitions, 1923 flow, removed 48 selfloop flow, removed 2 redundant places. [2022-12-06 05:44:21,289 INFO L231 Difference]: Finished difference. Result has 99 places, 62 transitions, 913 flow [2022-12-06 05:44:21,289 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1399, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=913, PETRI_PLACES=99, PETRI_TRANSITIONS=62} [2022-12-06 05:44:21,290 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 79 predicate places. [2022-12-06 05:44:21,290 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:21,290 INFO L89 Accepts]: Start accepts. Operand has 99 places, 62 transitions, 913 flow [2022-12-06 05:44:21,290 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:21,290 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:21,291 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 62 transitions, 913 flow [2022-12-06 05:44:21,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 62 transitions, 913 flow [2022-12-06 05:44:21,302 INFO L130 PetriNetUnfolder]: 33/124 cut-off events. [2022-12-06 05:44:21,302 INFO L131 PetriNetUnfolder]: For 1499/1504 co-relation queries the response was YES. [2022-12-06 05:44:21,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 734 conditions, 124 events. 33/124 cut-off events. For 1499/1504 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 552 event pairs, 0 based on Foata normal form. 2/125 useless extension candidates. Maximal degree in co-relation 674. Up to 34 conditions per place. [2022-12-06 05:44:21,303 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 62 transitions, 913 flow [2022-12-06 05:44:21,303 INFO L188 LiptonReduction]: Number of co-enabled transitions 178 [2022-12-06 05:44:21,304 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:44:21,305 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 05:44:21,305 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 62 transitions, 913 flow [2022-12-06 05:44:21,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:21,305 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:21,305 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:21,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 05:44:21,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:21,512 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:21,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:21,512 INFO L85 PathProgramCache]: Analyzing trace with hash -2020855813, now seen corresponding path program 1 times [2022-12-06 05:44:21,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:21,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446896810] [2022-12-06 05:44:21,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:21,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:21,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:21,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:21,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446896810] [2022-12-06 05:44:21,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446896810] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:21,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:21,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:44:21,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053167622] [2022-12-06 05:44:21,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:21,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:44:21,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:21,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:44:21,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:44:21,545 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 05:44:21,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 62 transitions, 913 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:21,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:21,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 05:44:21,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:21,633 INFO L130 PetriNetUnfolder]: 161/316 cut-off events. [2022-12-06 05:44:21,633 INFO L131 PetriNetUnfolder]: For 4665/4665 co-relation queries the response was YES. [2022-12-06 05:44:21,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2174 conditions, 316 events. 161/316 cut-off events. For 4665/4665 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1227 event pairs, 41 based on Foata normal form. 8/324 useless extension candidates. Maximal degree in co-relation 2108. Up to 225 conditions per place. [2022-12-06 05:44:21,637 INFO L137 encePairwiseOnDemand]: 17/23 looper letters, 60 selfloop transitions, 17 changer transitions 0/77 dead transitions. [2022-12-06 05:44:21,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 77 transitions, 1211 flow [2022-12-06 05:44:21,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:44:21,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:44:21,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-12-06 05:44:21,639 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3652173913043478 [2022-12-06 05:44:21,639 INFO L175 Difference]: Start difference. First operand has 82 places, 62 transitions, 913 flow. Second operand 5 states and 42 transitions. [2022-12-06 05:44:21,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 77 transitions, 1211 flow [2022-12-06 05:44:21,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 77 transitions, 1037 flow, removed 46 selfloop flow, removed 18 redundant places. [2022-12-06 05:44:21,687 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 855 flow [2022-12-06 05:44:21,688 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=787, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=855, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2022-12-06 05:44:21,688 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 49 predicate places. [2022-12-06 05:44:21,688 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:21,688 INFO L89 Accepts]: Start accepts. Operand has 69 places, 64 transitions, 855 flow [2022-12-06 05:44:21,689 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:21,689 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:21,689 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 64 transitions, 855 flow [2022-12-06 05:44:21,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 64 transitions, 855 flow [2022-12-06 05:44:21,701 INFO L130 PetriNetUnfolder]: 35/127 cut-off events. [2022-12-06 05:44:21,701 INFO L131 PetriNetUnfolder]: For 876/881 co-relation queries the response was YES. [2022-12-06 05:44:21,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 653 conditions, 127 events. 35/127 cut-off events. For 876/881 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 579 event pairs, 0 based on Foata normal form. 2/128 useless extension candidates. Maximal degree in co-relation 563. Up to 36 conditions per place. [2022-12-06 05:44:21,703 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 64 transitions, 855 flow [2022-12-06 05:44:21,703 INFO L188 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-06 05:44:21,703 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:44:21,704 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 05:44:21,704 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 855 flow [2022-12-06 05:44:21,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:21,704 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:21,704 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:21,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-06 05:44:21,705 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:21,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:21,705 INFO L85 PathProgramCache]: Analyzing trace with hash 811001803, now seen corresponding path program 2 times [2022-12-06 05:44:21,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:21,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550574949] [2022-12-06 05:44:21,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:21,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:21,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:21,782 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 05:44:21,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:21,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550574949] [2022-12-06 05:44:21,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550574949] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:44:21,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804639958] [2022-12-06 05:44:21,783 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:44:21,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:21,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:44:21,784 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 05:44:21,816 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 05:44:21,862 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:44:21,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:44:21,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 05:44:21,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:44:21,901 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 05:44:21,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:44:22,020 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 05:44:22,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804639958] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:44:22,020 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:44:22,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-06 05:44:22,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953218236] [2022-12-06 05:44:22,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:44:22,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:44:22,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:22,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:44:22,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-12-06 05:44:22,021 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 05:44:22,021 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 855 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 05:44:22,021 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:22,021 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 05:44:22,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:22,325 INFO L130 PetriNetUnfolder]: 204/386 cut-off events. [2022-12-06 05:44:22,325 INFO L131 PetriNetUnfolder]: For 3566/3566 co-relation queries the response was YES. [2022-12-06 05:44:22,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2489 conditions, 386 events. 204/386 cut-off events. For 3566/3566 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1561 event pairs, 16 based on Foata normal form. 1/387 useless extension candidates. Maximal degree in co-relation 2167. Up to 193 conditions per place. [2022-12-06 05:44:22,329 INFO L137 encePairwiseOnDemand]: 9/23 looper letters, 60 selfloop transitions, 47 changer transitions 7/114 dead transitions. [2022-12-06 05:44:22,329 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 114 transitions, 1594 flow [2022-12-06 05:44:22,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 05:44:22,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 05:44:22,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 79 transitions. [2022-12-06 05:44:22,330 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26421404682274247 [2022-12-06 05:44:22,330 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 855 flow. Second operand 13 states and 79 transitions. [2022-12-06 05:44:22,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 114 transitions, 1594 flow [2022-12-06 05:44:22,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 114 transitions, 1545 flow, removed 9 selfloop flow, removed 3 redundant places. [2022-12-06 05:44:22,340 INFO L231 Difference]: Finished difference. Result has 82 places, 81 transitions, 1216 flow [2022-12-06 05:44:22,340 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1216, PETRI_PLACES=82, PETRI_TRANSITIONS=81} [2022-12-06 05:44:22,341 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 62 predicate places. [2022-12-06 05:44:22,341 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:22,341 INFO L89 Accepts]: Start accepts. Operand has 82 places, 81 transitions, 1216 flow [2022-12-06 05:44:22,341 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:22,342 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:22,342 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 81 transitions, 1216 flow [2022-12-06 05:44:22,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 81 transitions, 1216 flow [2022-12-06 05:44:22,354 INFO L130 PetriNetUnfolder]: 48/152 cut-off events. [2022-12-06 05:44:22,354 INFO L131 PetriNetUnfolder]: For 1310/1315 co-relation queries the response was YES. [2022-12-06 05:44:22,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 894 conditions, 152 events. 48/152 cut-off events. For 1310/1315 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 700 event pairs, 0 based on Foata normal form. 2/153 useless extension candidates. Maximal degree in co-relation 851. Up to 48 conditions per place. [2022-12-06 05:44:22,356 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 81 transitions, 1216 flow [2022-12-06 05:44:22,356 INFO L188 LiptonReduction]: Number of co-enabled transitions 228 [2022-12-06 05:44:22,428 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [284] $Ultimate##0-->L43-2: Formula: (and (< v_~X~0_46 10000) (= v_thread1Thread1of1ForFork0_~x~0_59 (+ v_~X~0_46 1))) InVars {~X~0=v_~X~0_46} OutVars{thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_59, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_23|, ~X~0=v_~X~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~x~0, thread1Thread1of1ForFork0_#t~post1] and [265] L56-2-->L56-2: Formula: (and (< v_thread2Thread1of1ForFork1_~x~1_38 10000) (= (+ v_thread2Thread1of1ForFork1_~x~1_38 1) v_thread2Thread1of1ForFork1_~x~1_37)) InVars {thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_38} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_15|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_~x~1] [2022-12-06 05:44:22,472 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:44:22,473 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-06 05:44:22,473 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 80 transitions, 1224 flow [2022-12-06 05:44:22,473 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 05:44:22,473 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:22,473 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:22,482 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 05:44:22,679 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,SelfDestructingSolverStorable30 [2022-12-06 05:44:22,680 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:22,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:22,680 INFO L85 PathProgramCache]: Analyzing trace with hash -3682229, now seen corresponding path program 1 times [2022-12-06 05:44:22,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:22,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090756677] [2022-12-06 05:44:22,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:22,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:22,764 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 05:44:22,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:22,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090756677] [2022-12-06 05:44:22,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090756677] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:44:22,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628949010] [2022-12-06 05:44:22,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:22,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:22,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:44:22,766 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 05:44:22,769 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 05:44:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:22,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 05:44:22,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:44:22,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:22,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:44:23,044 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 05:44:23,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628949010] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:44:23,045 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:44:23,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-12-06 05:44:23,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680289011] [2022-12-06 05:44:23,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:44:23,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 05:44:23,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:23,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 05:44:23,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-12-06 05:44:23,046 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 05:44:23,046 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 80 transitions, 1224 flow. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:23,046 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:23,046 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 05:44:23,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:23,512 INFO L130 PetriNetUnfolder]: 305/569 cut-off events. [2022-12-06 05:44:23,512 INFO L131 PetriNetUnfolder]: For 5407/5407 co-relation queries the response was YES. [2022-12-06 05:44:23,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3943 conditions, 569 events. 305/569 cut-off events. For 5407/5407 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2588 event pairs, 17 based on Foata normal form. 1/570 useless extension candidates. Maximal degree in co-relation 3878. Up to 173 conditions per place. [2022-12-06 05:44:23,517 INFO L137 encePairwiseOnDemand]: 8/26 looper letters, 96 selfloop transitions, 61 changer transitions 15/172 dead transitions. [2022-12-06 05:44:23,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 172 transitions, 2496 flow [2022-12-06 05:44:23,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 05:44:23,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 05:44:23,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 105 transitions. [2022-12-06 05:44:23,519 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25240384615384615 [2022-12-06 05:44:23,519 INFO L175 Difference]: Start difference. First operand has 80 places, 80 transitions, 1224 flow. Second operand 16 states and 105 transitions. [2022-12-06 05:44:23,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 172 transitions, 2496 flow [2022-12-06 05:44:23,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 172 transitions, 2225 flow, removed 101 selfloop flow, removed 7 redundant places. [2022-12-06 05:44:23,536 INFO L231 Difference]: Finished difference. Result has 91 places, 98 transitions, 1569 flow [2022-12-06 05:44:23,536 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1088, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1569, PETRI_PLACES=91, PETRI_TRANSITIONS=98} [2022-12-06 05:44:23,537 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 71 predicate places. [2022-12-06 05:44:23,537 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:23,537 INFO L89 Accepts]: Start accepts. Operand has 91 places, 98 transitions, 1569 flow [2022-12-06 05:44:23,538 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:23,538 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:23,538 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 98 transitions, 1569 flow [2022-12-06 05:44:23,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 98 transitions, 1569 flow [2022-12-06 05:44:23,555 INFO L130 PetriNetUnfolder]: 69/209 cut-off events. [2022-12-06 05:44:23,556 INFO L131 PetriNetUnfolder]: For 1801/1805 co-relation queries the response was YES. [2022-12-06 05:44:23,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1250 conditions, 209 events. 69/209 cut-off events. For 1801/1805 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1063 event pairs, 2 based on Foata normal form. 1/209 useless extension candidates. Maximal degree in co-relation 1197. Up to 60 conditions per place. [2022-12-06 05:44:23,558 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 98 transitions, 1569 flow [2022-12-06 05:44:23,558 INFO L188 LiptonReduction]: Number of co-enabled transitions 282 [2022-12-06 05:44:23,560 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [276] L56-2-->thread2EXIT: Formula: (and (not (< v_thread2Thread1of1ForFork1_~x~1_In_3 10000)) (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= v_~Y~0_Out_10 (+ v_thread2Thread1of1ForFork1_~x~1_In_3 v_~Y~0_In_4)) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {~Y~0=v_~Y~0_In_4, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_In_3} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_In_3, ~Y~0=v_~Y~0_Out_10, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, ~Y~0] and [262] L43-2-->L43-2: Formula: (and (= (+ v_thread1Thread1of1ForFork0_~x~0_42 1) v_thread1Thread1of1ForFork0_~x~0_41) (< v_thread1Thread1of1ForFork0_~x~0_42 10000)) InVars {thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_42} OutVars{thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_41, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~x~0, thread1Thread1of1ForFork0_#t~post1] [2022-12-06 05:44:23,671 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [277] L43-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread1Thread1of1ForFork0_~x~0_In_3 10000)) (= v_~Y~0_Out_14 (+ v_~Y~0_In_6 v_thread1Thread1of1ForFork0_~x~0_In_3)) (= |v_thread1Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_In_3, ~Y~0=v_~Y~0_In_6} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_4|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_4|, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_In_3, ~Y~0=v_~Y~0_Out_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, ~Y~0] and [276] L56-2-->thread2EXIT: Formula: (and (not (< v_thread2Thread1of1ForFork1_~x~1_In_3 10000)) (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= v_~Y~0_Out_10 (+ v_thread2Thread1of1ForFork1_~x~1_In_3 v_~Y~0_In_4)) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {~Y~0=v_~Y~0_In_4, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_In_3} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_In_3, ~Y~0=v_~Y~0_Out_10, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, ~Y~0] [2022-12-06 05:44:23,758 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [276] L56-2-->thread2EXIT: Formula: (and (not (< v_thread2Thread1of1ForFork1_~x~1_In_3 10000)) (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= v_~Y~0_Out_10 (+ v_thread2Thread1of1ForFork1_~x~1_In_3 v_~Y~0_In_4)) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {~Y~0=v_~Y~0_In_4, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_In_3} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_In_3, ~Y~0=v_~Y~0_Out_10, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, ~Y~0] and [277] L43-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread1Thread1of1ForFork0_~x~0_In_3 10000)) (= v_~Y~0_Out_14 (+ v_~Y~0_In_6 v_thread1Thread1of1ForFork0_~x~0_In_3)) (= |v_thread1Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_In_3, ~Y~0=v_~Y~0_In_6} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_4|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_4|, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_In_3, ~Y~0=v_~Y~0_Out_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, ~Y~0] [2022-12-06 05:44:23,837 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 05:44:23,837 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 300 [2022-12-06 05:44:23,837 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 95 transitions, 1570 flow [2022-12-06 05:44:23,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:23,838 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:23,838 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:23,844 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 05:44:24,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:24,038 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:24,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:24,039 INFO L85 PathProgramCache]: Analyzing trace with hash 159029625, now seen corresponding path program 1 times [2022-12-06 05:44:24,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:24,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969256257] [2022-12-06 05:44:24,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:24,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:24,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:24,130 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 05:44:24,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:24,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969256257] [2022-12-06 05:44:24,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969256257] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:44:24,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899260879] [2022-12-06 05:44:24,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:24,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:24,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:44:24,132 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 05:44:24,147 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 05:44:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:24,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 05:44:24,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:44:24,242 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 05:44:24,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:44:24,362 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 05:44:24,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899260879] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:44:24,363 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:44:24,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-06 05:44:24,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236351340] [2022-12-06 05:44:24,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:44:24,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 05:44:24,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:24,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 05:44:24,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-12-06 05:44:24,364 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 05:44:24,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 95 transitions, 1570 flow. Second operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:24,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:24,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 05:44:24,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:24,762 INFO L130 PetriNetUnfolder]: 331/619 cut-off events. [2022-12-06 05:44:24,762 INFO L131 PetriNetUnfolder]: For 6825/6825 co-relation queries the response was YES. [2022-12-06 05:44:24,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4413 conditions, 619 events. 331/619 cut-off events. For 6825/6825 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2907 event pairs, 13 based on Foata normal form. 7/626 useless extension candidates. Maximal degree in co-relation 4340. Up to 253 conditions per place. [2022-12-06 05:44:24,766 INFO L137 encePairwiseOnDemand]: 7/30 looper letters, 64 selfloop transitions, 76 changer transitions 10/150 dead transitions. [2022-12-06 05:44:24,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 150 transitions, 2446 flow [2022-12-06 05:44:24,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:44:24,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:44:24,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 86 transitions. [2022-12-06 05:44:24,767 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2388888888888889 [2022-12-06 05:44:24,767 INFO L175 Difference]: Start difference. First operand has 88 places, 95 transitions, 1570 flow. Second operand 12 states and 86 transitions. [2022-12-06 05:44:24,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 150 transitions, 2446 flow [2022-12-06 05:44:24,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 150 transitions, 2160 flow, removed 58 selfloop flow, removed 9 redundant places. [2022-12-06 05:44:24,781 INFO L231 Difference]: Finished difference. Result has 95 places, 109 transitions, 1810 flow [2022-12-06 05:44:24,781 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1319, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1810, PETRI_PLACES=95, PETRI_TRANSITIONS=109} [2022-12-06 05:44:24,781 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 75 predicate places. [2022-12-06 05:44:24,781 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:24,781 INFO L89 Accepts]: Start accepts. Operand has 95 places, 109 transitions, 1810 flow [2022-12-06 05:44:24,782 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:24,782 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:24,782 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 109 transitions, 1810 flow [2022-12-06 05:44:24,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 109 transitions, 1810 flow [2022-12-06 05:44:24,796 INFO L130 PetriNetUnfolder]: 80/237 cut-off events. [2022-12-06 05:44:24,796 INFO L131 PetriNetUnfolder]: For 2542/2544 co-relation queries the response was YES. [2022-12-06 05:44:24,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1431 conditions, 237 events. 80/237 cut-off events. For 2542/2544 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1248 event pairs, 2 based on Foata normal form. 0/235 useless extension candidates. Maximal degree in co-relation 1372. Up to 72 conditions per place. [2022-12-06 05:44:24,798 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 109 transitions, 1810 flow [2022-12-06 05:44:24,798 INFO L188 LiptonReduction]: Number of co-enabled transitions 312 [2022-12-06 05:44:24,891 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [229] $Ultimate##0-->L56-2: Formula: (= v_~X~0_10 v_thread2Thread1of1ForFork1_~x~1_25) InVars {~X~0=v_~X~0_10} OutVars{thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_25, ~X~0=v_~X~0_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~x~1] and [277] L43-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread1Thread1of1ForFork0_~x~0_In_3 10000)) (= v_~Y~0_Out_14 (+ v_~Y~0_In_6 v_thread1Thread1of1ForFork0_~x~0_In_3)) (= |v_thread1Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_In_3, ~Y~0=v_~Y~0_In_6} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_4|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_4|, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_In_3, ~Y~0=v_~Y~0_Out_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, ~Y~0] [2022-12-06 05:44:24,944 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [229] $Ultimate##0-->L56-2: Formula: (= v_~X~0_10 v_thread2Thread1of1ForFork1_~x~1_25) InVars {~X~0=v_~X~0_10} OutVars{thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_25, ~X~0=v_~X~0_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~x~1] and [277] L43-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread1Thread1of1ForFork0_~x~0_In_3 10000)) (= v_~Y~0_Out_14 (+ v_~Y~0_In_6 v_thread1Thread1of1ForFork0_~x~0_In_3)) (= |v_thread1Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_In_3, ~Y~0=v_~Y~0_In_6} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_4|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_4|, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_In_3, ~Y~0=v_~Y~0_Out_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, ~Y~0] [2022-12-06 05:44:25,022 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [276] L56-2-->thread2EXIT: Formula: (and (not (< v_thread2Thread1of1ForFork1_~x~1_In_3 10000)) (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= v_~Y~0_Out_10 (+ v_thread2Thread1of1ForFork1_~x~1_In_3 v_~Y~0_In_4)) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {~Y~0=v_~Y~0_In_4, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_In_3} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_In_3, ~Y~0=v_~Y~0_Out_10, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, ~Y~0] and [262] L43-2-->L43-2: Formula: (and (= (+ v_thread1Thread1of1ForFork0_~x~0_42 1) v_thread1Thread1of1ForFork0_~x~0_41) (< v_thread1Thread1of1ForFork0_~x~0_42 10000)) InVars {thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_42} OutVars{thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_41, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~x~0, thread1Thread1of1ForFork0_#t~post1] [2022-12-06 05:44:25,094 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [276] L56-2-->thread2EXIT: Formula: (and (not (< v_thread2Thread1of1ForFork1_~x~1_In_3 10000)) (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= v_~Y~0_Out_10 (+ v_thread2Thread1of1ForFork1_~x~1_In_3 v_~Y~0_In_4)) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {~Y~0=v_~Y~0_In_4, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_In_3} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_In_3, ~Y~0=v_~Y~0_Out_10, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, ~Y~0] and [262] L43-2-->L43-2: Formula: (and (= (+ v_thread1Thread1of1ForFork0_~x~0_42 1) v_thread1Thread1of1ForFork0_~x~0_41) (< v_thread1Thread1of1ForFork0_~x~0_42 10000)) InVars {thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_42} OutVars{thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_41, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~x~0, thread1Thread1of1ForFork0_#t~post1] [2022-12-06 05:44:25,131 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [276] L56-2-->thread2EXIT: Formula: (and (not (< v_thread2Thread1of1ForFork1_~x~1_In_3 10000)) (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= v_~Y~0_Out_10 (+ v_thread2Thread1of1ForFork1_~x~1_In_3 v_~Y~0_In_4)) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {~Y~0=v_~Y~0_In_4, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_In_3} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_In_3, ~Y~0=v_~Y~0_Out_10, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, ~Y~0] and [262] L43-2-->L43-2: Formula: (and (= (+ v_thread1Thread1of1ForFork0_~x~0_42 1) v_thread1Thread1of1ForFork0_~x~0_41) (< v_thread1Thread1of1ForFork0_~x~0_42 10000)) InVars {thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_42} OutVars{thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_41, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~x~0, thread1Thread1of1ForFork0_#t~post1] [2022-12-06 05:44:25,171 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [276] L56-2-->thread2EXIT: Formula: (and (not (< v_thread2Thread1of1ForFork1_~x~1_In_3 10000)) (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= v_~Y~0_Out_10 (+ v_thread2Thread1of1ForFork1_~x~1_In_3 v_~Y~0_In_4)) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {~Y~0=v_~Y~0_In_4, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_In_3} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_In_3, ~Y~0=v_~Y~0_Out_10, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, ~Y~0] and [262] L43-2-->L43-2: Formula: (and (= (+ v_thread1Thread1of1ForFork0_~x~0_42 1) v_thread1Thread1of1ForFork0_~x~0_41) (< v_thread1Thread1of1ForFork0_~x~0_42 10000)) InVars {thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_42} OutVars{thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_41, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~x~0, thread1Thread1of1ForFork0_#t~post1] [2022-12-06 05:44:25,209 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [335] $Ultimate##0-->thread2EXIT: Formula: (and (< v_thread2Thread1of1ForFork1_~x~1_222 10001) (= |v_thread2Thread1of1ForFork1_#res.base_43| 0) (= v_~Y~0_252 (+ v_~Y~0_253 v_thread2Thread1of1ForFork1_~x~1_222)) (= |v_thread2Thread1of1ForFork1_#res.offset_43| 0) (= (+ v_~X~0_120 2) v_thread2Thread1of1ForFork1_~x~1_222) (not (< v_thread2Thread1of1ForFork1_~x~1_222 10000))) InVars {~X~0=v_~X~0_120, ~Y~0=v_~Y~0_253} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_43|, thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_139|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_222, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_43|, ~X~0=v_~X~0_120, ~Y~0=v_~Y~0_252} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_~x~1, thread2Thread1of1ForFork1_#res.base, ~Y~0] and [262] L43-2-->L43-2: Formula: (and (= (+ v_thread1Thread1of1ForFork0_~x~0_42 1) v_thread1Thread1of1ForFork0_~x~0_41) (< v_thread1Thread1of1ForFork0_~x~0_42 10000)) InVars {thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_42} OutVars{thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_41, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~x~0, thread1Thread1of1ForFork0_#t~post1] [2022-12-06 05:44:25,246 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [276] L56-2-->thread2EXIT: Formula: (and (not (< v_thread2Thread1of1ForFork1_~x~1_In_3 10000)) (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= v_~Y~0_Out_10 (+ v_thread2Thread1of1ForFork1_~x~1_In_3 v_~Y~0_In_4)) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {~Y~0=v_~Y~0_In_4, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_In_3} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_In_3, ~Y~0=v_~Y~0_Out_10, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, ~Y~0] and [262] L43-2-->L43-2: Formula: (and (= (+ v_thread1Thread1of1ForFork0_~x~0_42 1) v_thread1Thread1of1ForFork0_~x~0_41) (< v_thread1Thread1of1ForFork0_~x~0_42 10000)) InVars {thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_42} OutVars{thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_41, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~x~0, thread1Thread1of1ForFork0_#t~post1] [2022-12-06 05:44:25,309 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [276] L56-2-->thread2EXIT: Formula: (and (not (< v_thread2Thread1of1ForFork1_~x~1_In_3 10000)) (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= v_~Y~0_Out_10 (+ v_thread2Thread1of1ForFork1_~x~1_In_3 v_~Y~0_In_4)) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {~Y~0=v_~Y~0_In_4, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_In_3} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_In_3, ~Y~0=v_~Y~0_Out_10, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, ~Y~0] and [262] L43-2-->L43-2: Formula: (and (= (+ v_thread1Thread1of1ForFork0_~x~0_42 1) v_thread1Thread1of1ForFork0_~x~0_41) (< v_thread1Thread1of1ForFork0_~x~0_42 10000)) InVars {thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_42} OutVars{thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_41, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~x~0, thread1Thread1of1ForFork0_#t~post1] [2022-12-06 05:44:25,347 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [276] L56-2-->thread2EXIT: Formula: (and (not (< v_thread2Thread1of1ForFork1_~x~1_In_3 10000)) (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= v_~Y~0_Out_10 (+ v_thread2Thread1of1ForFork1_~x~1_In_3 v_~Y~0_In_4)) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {~Y~0=v_~Y~0_In_4, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_In_3} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_In_3, ~Y~0=v_~Y~0_Out_10, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, ~Y~0] and [262] L43-2-->L43-2: Formula: (and (= (+ v_thread1Thread1of1ForFork0_~x~0_42 1) v_thread1Thread1of1ForFork0_~x~0_41) (< v_thread1Thread1of1ForFork0_~x~0_42 10000)) InVars {thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_42} OutVars{thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_41, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~x~0, thread1Thread1of1ForFork0_#t~post1] [2022-12-06 05:44:25,385 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [276] L56-2-->thread2EXIT: Formula: (and (not (< v_thread2Thread1of1ForFork1_~x~1_In_3 10000)) (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= v_~Y~0_Out_10 (+ v_thread2Thread1of1ForFork1_~x~1_In_3 v_~Y~0_In_4)) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {~Y~0=v_~Y~0_In_4, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_In_3} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_In_3, ~Y~0=v_~Y~0_Out_10, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, ~Y~0] and [262] L43-2-->L43-2: Formula: (and (= (+ v_thread1Thread1of1ForFork0_~x~0_42 1) v_thread1Thread1of1ForFork0_~x~0_41) (< v_thread1Thread1of1ForFork0_~x~0_42 10000)) InVars {thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_42} OutVars{thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_41, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~x~0, thread1Thread1of1ForFork0_#t~post1] [2022-12-06 05:44:25,425 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 05:44:25,426 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 645 [2022-12-06 05:44:25,426 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 110 transitions, 1922 flow [2022-12-06 05:44:25,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:25,427 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:25,427 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:25,435 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 05:44:25,633 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,SelfDestructingSolverStorable32 [2022-12-06 05:44:25,634 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:25,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:25,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1639678359, now seen corresponding path program 1 times [2022-12-06 05:44:25,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:25,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603809394] [2022-12-06 05:44:25,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:25,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:25,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:25,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:25,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:25,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603809394] [2022-12-06 05:44:25,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603809394] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:25,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:25,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:44:25,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629596563] [2022-12-06 05:44:25,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:25,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:44:25,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:25,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:44:25,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:44:25,682 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 05:44:25,682 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 110 transitions, 1922 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:25,682 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:25,682 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 05:44:25,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:25,793 INFO L130 PetriNetUnfolder]: 288/549 cut-off events. [2022-12-06 05:44:25,794 INFO L131 PetriNetUnfolder]: For 6411/6411 co-relation queries the response was YES. [2022-12-06 05:44:25,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3768 conditions, 549 events. 288/549 cut-off events. For 6411/6411 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2549 event pairs, 23 based on Foata normal form. 4/551 useless extension candidates. Maximal degree in co-relation 3696. Up to 446 conditions per place. [2022-12-06 05:44:25,797 INFO L137 encePairwiseOnDemand]: 29/44 looper letters, 75 selfloop transitions, 20 changer transitions 14/109 dead transitions. [2022-12-06 05:44:25,798 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 109 transitions, 1902 flow [2022-12-06 05:44:25,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:44:25,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:44:25,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 05:44:25,799 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2727272727272727 [2022-12-06 05:44:25,799 INFO L175 Difference]: Start difference. First operand has 93 places, 110 transitions, 1922 flow. Second operand 4 states and 48 transitions. [2022-12-06 05:44:25,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 109 transitions, 1902 flow [2022-12-06 05:44:25,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 109 transitions, 1760 flow, removed 29 selfloop flow, removed 7 redundant places. [2022-12-06 05:44:25,818 INFO L231 Difference]: Finished difference. Result has 88 places, 83 transitions, 1253 flow [2022-12-06 05:44:25,818 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1481, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1253, PETRI_PLACES=88, PETRI_TRANSITIONS=83} [2022-12-06 05:44:25,818 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 68 predicate places. [2022-12-06 05:44:25,818 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:25,819 INFO L89 Accepts]: Start accepts. Operand has 88 places, 83 transitions, 1253 flow [2022-12-06 05:44:25,819 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:25,819 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:25,819 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 83 transitions, 1253 flow [2022-12-06 05:44:25,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 83 transitions, 1253 flow [2022-12-06 05:44:25,831 INFO L130 PetriNetUnfolder]: 57/190 cut-off events. [2022-12-06 05:44:25,832 INFO L131 PetriNetUnfolder]: For 1356/1359 co-relation queries the response was YES. [2022-12-06 05:44:25,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1005 conditions, 190 events. 57/190 cut-off events. For 1356/1359 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 975 event pairs, 3 based on Foata normal form. 0/188 useless extension candidates. Maximal degree in co-relation 925. Up to 63 conditions per place. [2022-12-06 05:44:25,833 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 83 transitions, 1253 flow [2022-12-06 05:44:25,833 INFO L188 LiptonReduction]: Number of co-enabled transitions 244 [2022-12-06 05:44:25,836 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [276] L56-2-->thread2EXIT: Formula: (and (not (< v_thread2Thread1of1ForFork1_~x~1_In_3 10000)) (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= v_~Y~0_Out_10 (+ v_thread2Thread1of1ForFork1_~x~1_In_3 v_~Y~0_In_4)) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {~Y~0=v_~Y~0_In_4, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_In_3} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_In_3, ~Y~0=v_~Y~0_Out_10, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, ~Y~0] and [277] L43-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread1Thread1of1ForFork0_~x~0_In_3 10000)) (= v_~Y~0_Out_14 (+ v_~Y~0_In_6 v_thread1Thread1of1ForFork0_~x~0_In_3)) (= |v_thread1Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_In_3, ~Y~0=v_~Y~0_In_6} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_4|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_4|, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_In_3, ~Y~0=v_~Y~0_Out_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, ~Y~0] [2022-12-06 05:44:25,905 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [337] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_94| 0) (= |v_thread1Thread1of1ForFork0_#res.base_94| 0) (not (< v_thread1Thread1of1ForFork0_~x~0_224 10000)) (= (+ v_~Y~0_261 v_thread1Thread1of1ForFork0_~x~0_224) v_~Y~0_260) (= v_~X~0_124 v_thread2Thread1of1ForFork1_~x~1_226)) InVars {thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_224, ~X~0=v_~X~0_124, ~Y~0=v_~Y~0_261} OutVars{thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_226, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_94|, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_224, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_94|, ~X~0=v_~X~0_124, ~Y~0=v_~Y~0_260} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~x~1, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, ~Y~0] and [265] L56-2-->L56-2: Formula: (and (< v_thread2Thread1of1ForFork1_~x~1_38 10000) (= (+ v_thread2Thread1of1ForFork1_~x~1_38 1) v_thread2Thread1of1ForFork1_~x~1_37)) InVars {thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_38} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_15|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_~x~1] [2022-12-06 05:44:26,058 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:44:26,058 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 240 [2022-12-06 05:44:26,058 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 80 transitions, 1223 flow [2022-12-06 05:44:26,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:26,059 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:26,059 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:26,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-06 05:44:26,059 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:26,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:26,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1562237562, now seen corresponding path program 1 times [2022-12-06 05:44:26,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:26,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506898427] [2022-12-06 05:44:26,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:26,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:26,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:26,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:26,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:26,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506898427] [2022-12-06 05:44:26,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506898427] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:26,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:26,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:44:26,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011325725] [2022-12-06 05:44:26,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:26,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:44:26,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:26,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:44:26,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:44:26,121 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 05:44:26,121 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 80 transitions, 1223 flow. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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 05:44:26,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:26,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 05:44:26,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:26,248 INFO L130 PetriNetUnfolder]: 282/550 cut-off events. [2022-12-06 05:44:26,249 INFO L131 PetriNetUnfolder]: For 4276/4276 co-relation queries the response was YES. [2022-12-06 05:44:26,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3329 conditions, 550 events. 282/550 cut-off events. For 4276/4276 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2617 event pairs, 33 based on Foata normal form. 3/551 useless extension candidates. Maximal degree in co-relation 3064. Up to 289 conditions per place. [2022-12-06 05:44:26,252 INFO L137 encePairwiseOnDemand]: 12/33 looper letters, 51 selfloop transitions, 48 changer transitions 9/108 dead transitions. [2022-12-06 05:44:26,252 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 108 transitions, 1645 flow [2022-12-06 05:44:26,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:44:26,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:44:26,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2022-12-06 05:44:26,253 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24675324675324675 [2022-12-06 05:44:26,253 INFO L175 Difference]: Start difference. First operand has 84 places, 80 transitions, 1223 flow. Second operand 7 states and 57 transitions. [2022-12-06 05:44:26,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 108 transitions, 1645 flow [2022-12-06 05:44:26,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 108 transitions, 1564 flow, removed 23 selfloop flow, removed 4 redundant places. [2022-12-06 05:44:26,263 INFO L231 Difference]: Finished difference. Result has 90 places, 88 transitions, 1418 flow [2022-12-06 05:44:26,264 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1146, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1418, PETRI_PLACES=90, PETRI_TRANSITIONS=88} [2022-12-06 05:44:26,264 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 70 predicate places. [2022-12-06 05:44:26,264 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:26,264 INFO L89 Accepts]: Start accepts. Operand has 90 places, 88 transitions, 1418 flow [2022-12-06 05:44:26,265 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:26,265 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:26,265 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 88 transitions, 1418 flow [2022-12-06 05:44:26,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 88 transitions, 1418 flow [2022-12-06 05:44:26,277 INFO L130 PetriNetUnfolder]: 59/205 cut-off events. [2022-12-06 05:44:26,277 INFO L131 PetriNetUnfolder]: For 1446/1449 co-relation queries the response was YES. [2022-12-06 05:44:26,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1196 conditions, 205 events. 59/205 cut-off events. For 1446/1449 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1113 event pairs, 0 based on Foata normal form. 0/203 useless extension candidates. Maximal degree in co-relation 1143. Up to 69 conditions per place. [2022-12-06 05:44:26,279 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 88 transitions, 1418 flow [2022-12-06 05:44:26,279 INFO L188 LiptonReduction]: Number of co-enabled transitions 258 [2022-12-06 05:44:26,279 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [265] L56-2-->L56-2: Formula: (and (< v_thread2Thread1of1ForFork1_~x~1_38 10000) (= (+ v_thread2Thread1of1ForFork1_~x~1_38 1) v_thread2Thread1of1ForFork1_~x~1_37)) InVars {thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_38} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_15|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_~x~1] and [277] L43-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread1Thread1of1ForFork0_~x~0_In_3 10000)) (= v_~Y~0_Out_14 (+ v_~Y~0_In_6 v_thread1Thread1of1ForFork0_~x~0_In_3)) (= |v_thread1Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_In_3, ~Y~0=v_~Y~0_In_6} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_4|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_4|, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_In_3, ~Y~0=v_~Y~0_Out_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, ~Y~0] [2022-12-06 05:44:26,323 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:44:26,324 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 60 [2022-12-06 05:44:26,324 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 88 transitions, 1429 flow [2022-12-06 05:44:26,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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 05:44:26,324 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:26,324 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:26,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-06 05:44:26,325 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:26,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:26,325 INFO L85 PathProgramCache]: Analyzing trace with hash -277707492, now seen corresponding path program 1 times [2022-12-06 05:44:26,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:26,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343577454] [2022-12-06 05:44:26,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:26,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:26,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:26,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:26,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343577454] [2022-12-06 05:44:26,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343577454] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:26,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:26,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:44:26,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994999517] [2022-12-06 05:44:26,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:26,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:44:26,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:26,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:44:26,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:44:26,347 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 05:44:26,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 88 transitions, 1429 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:26,348 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:26,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 05:44:26,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:26,453 INFO L130 PetriNetUnfolder]: 254/501 cut-off events. [2022-12-06 05:44:26,453 INFO L131 PetriNetUnfolder]: For 3879/3879 co-relation queries the response was YES. [2022-12-06 05:44:26,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3306 conditions, 501 events. 254/501 cut-off events. For 3879/3879 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2354 event pairs, 17 based on Foata normal form. 8/507 useless extension candidates. Maximal degree in co-relation 3241. Up to 433 conditions per place. [2022-12-06 05:44:26,456 INFO L137 encePairwiseOnDemand]: 16/34 looper letters, 75 selfloop transitions, 23 changer transitions 2/100 dead transitions. [2022-12-06 05:44:26,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 100 transitions, 1629 flow [2022-12-06 05:44:26,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:44:26,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:44:26,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-12-06 05:44:26,457 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3235294117647059 [2022-12-06 05:44:26,457 INFO L175 Difference]: Start difference. First operand has 89 places, 88 transitions, 1429 flow. Second operand 5 states and 55 transitions. [2022-12-06 05:44:26,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 100 transitions, 1629 flow [2022-12-06 05:44:26,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 100 transitions, 1510 flow, removed 17 selfloop flow, removed 6 redundant places. [2022-12-06 05:44:26,468 INFO L231 Difference]: Finished difference. Result has 87 places, 85 transitions, 1286 flow [2022-12-06 05:44:26,468 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1240, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1286, PETRI_PLACES=87, PETRI_TRANSITIONS=85} [2022-12-06 05:44:26,468 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 67 predicate places. [2022-12-06 05:44:26,468 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:26,468 INFO L89 Accepts]: Start accepts. Operand has 87 places, 85 transitions, 1286 flow [2022-12-06 05:44:26,469 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:26,469 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:26,469 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 85 transitions, 1286 flow [2022-12-06 05:44:26,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 85 transitions, 1286 flow [2022-12-06 05:44:26,480 INFO L130 PetriNetUnfolder]: 57/198 cut-off events. [2022-12-06 05:44:26,480 INFO L131 PetriNetUnfolder]: For 1210/1213 co-relation queries the response was YES. [2022-12-06 05:44:26,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1067 conditions, 198 events. 57/198 cut-off events. For 1210/1213 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1055 event pairs, 0 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 963. Up to 70 conditions per place. [2022-12-06 05:44:26,481 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 85 transitions, 1286 flow [2022-12-06 05:44:26,481 INFO L188 LiptonReduction]: Number of co-enabled transitions 248 [2022-12-06 05:44:26,484 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [325] $Ultimate##0-->thread1EXIT: Formula: (and (< v_~X~0_110 10000) (= |v_thread1Thread1of1ForFork0_#res.offset_80| 0) (= (+ v_~X~0_110 1) v_thread1Thread1of1ForFork0_~x~0_188) (= (+ v_~Y~0_223 v_thread1Thread1of1ForFork0_~x~0_188) v_~Y~0_222) (= |v_thread1Thread1of1ForFork0_#res.base_80| 0) (not (< v_thread1Thread1of1ForFork0_~x~0_188 10000))) InVars {~X~0=v_~X~0_110, ~Y~0=v_~Y~0_223} OutVars{thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_80|, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_188, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_106|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_80|, ~X~0=v_~X~0_110, ~Y~0=v_~Y~0_222} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_~x~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#res.offset, ~Y~0] and [276] L56-2-->thread2EXIT: Formula: (and (not (< v_thread2Thread1of1ForFork1_~x~1_In_3 10000)) (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= v_~Y~0_Out_10 (+ v_thread2Thread1of1ForFork1_~x~1_In_3 v_~Y~0_In_4)) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {~Y~0=v_~Y~0_In_4, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_In_3} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_In_3, ~Y~0=v_~Y~0_Out_10, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, ~Y~0] [2022-12-06 05:44:26,555 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [277] L43-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread1Thread1of1ForFork0_~x~0_In_3 10000)) (= v_~Y~0_Out_14 (+ v_~Y~0_In_6 v_thread1Thread1of1ForFork0_~x~0_In_3)) (= |v_thread1Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_In_3, ~Y~0=v_~Y~0_In_6} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_4|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_4|, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_In_3, ~Y~0=v_~Y~0_Out_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, ~Y~0] and [276] L56-2-->thread2EXIT: Formula: (and (not (< v_thread2Thread1of1ForFork1_~x~1_In_3 10000)) (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= v_~Y~0_Out_10 (+ v_thread2Thread1of1ForFork1_~x~1_In_3 v_~Y~0_In_4)) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {~Y~0=v_~Y~0_In_4, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_In_3} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_In_3, ~Y~0=v_~Y~0_Out_10, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, ~Y~0] [2022-12-06 05:44:26,614 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [277] L43-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread1Thread1of1ForFork0_~x~0_In_3 10000)) (= v_~Y~0_Out_14 (+ v_~Y~0_In_6 v_thread1Thread1of1ForFork0_~x~0_In_3)) (= |v_thread1Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_In_3, ~Y~0=v_~Y~0_In_6} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_4|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_4|, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_In_3, ~Y~0=v_~Y~0_Out_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, ~Y~0] and [276] L56-2-->thread2EXIT: Formula: (and (not (< v_thread2Thread1of1ForFork1_~x~1_In_3 10000)) (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= v_~Y~0_Out_10 (+ v_thread2Thread1of1ForFork1_~x~1_In_3 v_~Y~0_In_4)) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {~Y~0=v_~Y~0_In_4, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_In_3} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_In_3, ~Y~0=v_~Y~0_Out_10, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, ~Y~0] [2022-12-06 05:44:26,674 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:44:26,677 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 209 [2022-12-06 05:44:26,677 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 83 transitions, 1275 flow [2022-12-06 05:44:26,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:26,678 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:26,678 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:26,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-06 05:44:26,678 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:26,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:26,678 INFO L85 PathProgramCache]: Analyzing trace with hash -591538297, now seen corresponding path program 1 times [2022-12-06 05:44:26,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:26,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114524382] [2022-12-06 05:44:26,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:26,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:26,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:26,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:26,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114524382] [2022-12-06 05:44:26,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114524382] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:26,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:26,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:44:26,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700496177] [2022-12-06 05:44:26,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:26,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:44:26,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:26,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:44:26,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:44:26,702 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 05:44:26,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 83 transitions, 1275 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:26,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:26,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 05:44:26,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:26,805 INFO L130 PetriNetUnfolder]: 234/461 cut-off events. [2022-12-06 05:44:26,805 INFO L131 PetriNetUnfolder]: For 3579/3579 co-relation queries the response was YES. [2022-12-06 05:44:26,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2890 conditions, 461 events. 234/461 cut-off events. For 3579/3579 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2058 event pairs, 29 based on Foata normal form. 4/463 useless extension candidates. Maximal degree in co-relation 2782. Up to 390 conditions per place. [2022-12-06 05:44:26,807 INFO L137 encePairwiseOnDemand]: 24/34 looper letters, 69 selfloop transitions, 14 changer transitions 6/89 dead transitions. [2022-12-06 05:44:26,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 89 transitions, 1432 flow [2022-12-06 05:44:26,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:44:26,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:44:26,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-12-06 05:44:26,824 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33088235294117646 [2022-12-06 05:44:26,824 INFO L175 Difference]: Start difference. First operand has 87 places, 83 transitions, 1275 flow. Second operand 4 states and 45 transitions. [2022-12-06 05:44:26,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 89 transitions, 1432 flow [2022-12-06 05:44:26,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 89 transitions, 1367 flow, removed 15 selfloop flow, removed 5 redundant places. [2022-12-06 05:44:26,832 INFO L231 Difference]: Finished difference. Result has 83 places, 74 transitions, 1089 flow [2022-12-06 05:44:26,833 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1121, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1089, PETRI_PLACES=83, PETRI_TRANSITIONS=74} [2022-12-06 05:44:26,833 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 63 predicate places. [2022-12-06 05:44:26,833 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:26,833 INFO L89 Accepts]: Start accepts. Operand has 83 places, 74 transitions, 1089 flow [2022-12-06 05:44:26,833 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:26,833 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:26,834 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 74 transitions, 1089 flow [2022-12-06 05:44:26,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 74 transitions, 1089 flow [2022-12-06 05:44:26,859 INFO L130 PetriNetUnfolder]: 42/170 cut-off events. [2022-12-06 05:44:26,859 INFO L131 PetriNetUnfolder]: For 978/981 co-relation queries the response was YES. [2022-12-06 05:44:26,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 887 conditions, 170 events. 42/170 cut-off events. For 978/981 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 904 event pairs, 0 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 772. Up to 54 conditions per place. [2022-12-06 05:44:26,861 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 74 transitions, 1089 flow [2022-12-06 05:44:26,861 INFO L188 LiptonReduction]: Number of co-enabled transitions 214 [2022-12-06 05:44:26,861 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:44:26,862 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-06 05:44:26,862 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 74 transitions, 1089 flow [2022-12-06 05:44:26,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:26,862 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:26,862 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:26,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-06 05:44:26,862 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:26,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:26,863 INFO L85 PathProgramCache]: Analyzing trace with hash 319688631, now seen corresponding path program 1 times [2022-12-06 05:44:26,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:26,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574900963] [2022-12-06 05:44:26,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:26,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:26,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:26,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:26,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574900963] [2022-12-06 05:44:26,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574900963] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:26,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:26,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:44:26,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695418570] [2022-12-06 05:44:26,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:26,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:44:26,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:26,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:44:26,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:44:26,894 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 05:44:26,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 74 transitions, 1089 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:26,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:26,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 05:44:26,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:26,981 INFO L130 PetriNetUnfolder]: 216/459 cut-off events. [2022-12-06 05:44:26,981 INFO L131 PetriNetUnfolder]: For 3064/3064 co-relation queries the response was YES. [2022-12-06 05:44:26,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2754 conditions, 459 events. 216/459 cut-off events. For 3064/3064 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2209 event pairs, 27 based on Foata normal form. 2/457 useless extension candidates. Maximal degree in co-relation 2242. Up to 286 conditions per place. [2022-12-06 05:44:26,984 INFO L137 encePairwiseOnDemand]: 20/31 looper letters, 73 selfloop transitions, 21 changer transitions 6/100 dead transitions. [2022-12-06 05:44:26,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 100 transitions, 1468 flow [2022-12-06 05:44:26,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:44:26,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:44:26,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-12-06 05:44:26,985 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3010752688172043 [2022-12-06 05:44:26,985 INFO L175 Difference]: Start difference. First operand has 83 places, 74 transitions, 1089 flow. Second operand 6 states and 56 transitions. [2022-12-06 05:44:26,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 100 transitions, 1468 flow [2022-12-06 05:44:26,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 100 transitions, 1452 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 05:44:26,992 INFO L231 Difference]: Finished difference. Result has 87 places, 76 transitions, 1149 flow [2022-12-06 05:44:26,993 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1050, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1149, PETRI_PLACES=87, PETRI_TRANSITIONS=76} [2022-12-06 05:44:26,993 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 67 predicate places. [2022-12-06 05:44:26,993 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:26,993 INFO L89 Accepts]: Start accepts. Operand has 87 places, 76 transitions, 1149 flow [2022-12-06 05:44:26,993 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:26,993 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:26,994 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 76 transitions, 1149 flow [2022-12-06 05:44:26,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 76 transitions, 1149 flow [2022-12-06 05:44:27,004 INFO L130 PetriNetUnfolder]: 40/181 cut-off events. [2022-12-06 05:44:27,004 INFO L131 PetriNetUnfolder]: For 1023/1026 co-relation queries the response was YES. [2022-12-06 05:44:27,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 955 conditions, 181 events. 40/181 cut-off events. For 1023/1026 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1031 event pairs, 0 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 830. Up to 54 conditions per place. [2022-12-06 05:44:27,005 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 76 transitions, 1149 flow [2022-12-06 05:44:27,005 INFO L188 LiptonReduction]: Number of co-enabled transitions 230 [2022-12-06 05:44:27,006 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:44:27,006 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 05:44:27,006 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 76 transitions, 1149 flow [2022-12-06 05:44:27,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:27,007 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:27,007 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:27,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-06 05:44:27,007 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:27,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:27,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1768241383, now seen corresponding path program 1 times [2022-12-06 05:44:27,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:27,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645641281] [2022-12-06 05:44:27,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:27,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:27,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:27,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:27,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645641281] [2022-12-06 05:44:27,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645641281] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:27,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:27,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:44:27,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538585148] [2022-12-06 05:44:27,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:27,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:44:27,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:27,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:44:27,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:44:27,043 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 05:44:27,044 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 76 transitions, 1149 flow. Second operand has 5 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 05:44:27,044 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:27,044 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 05:44:27,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:27,136 INFO L130 PetriNetUnfolder]: 211/460 cut-off events. [2022-12-06 05:44:27,137 INFO L131 PetriNetUnfolder]: For 3383/3383 co-relation queries the response was YES. [2022-12-06 05:44:27,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2867 conditions, 460 events. 211/460 cut-off events. For 3383/3383 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2287 event pairs, 43 based on Foata normal form. 4/460 useless extension candidates. Maximal degree in co-relation 2328. Up to 175 conditions per place. [2022-12-06 05:44:27,139 INFO L137 encePairwiseOnDemand]: 17/30 looper letters, 82 selfloop transitions, 21 changer transitions 5/108 dead transitions. [2022-12-06 05:44:27,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 108 transitions, 1567 flow [2022-12-06 05:44:27,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:44:27,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:44:27,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-12-06 05:44:27,140 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30952380952380953 [2022-12-06 05:44:27,140 INFO L175 Difference]: Start difference. First operand has 87 places, 76 transitions, 1149 flow. Second operand 7 states and 65 transitions. [2022-12-06 05:44:27,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 108 transitions, 1567 flow [2022-12-06 05:44:27,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 108 transitions, 1545 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-06 05:44:27,148 INFO L231 Difference]: Finished difference. Result has 91 places, 74 transitions, 1133 flow [2022-12-06 05:44:27,148 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1120, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1133, PETRI_PLACES=91, PETRI_TRANSITIONS=74} [2022-12-06 05:44:27,150 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 71 predicate places. [2022-12-06 05:44:27,150 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:27,150 INFO L89 Accepts]: Start accepts. Operand has 91 places, 74 transitions, 1133 flow [2022-12-06 05:44:27,150 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:27,150 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:27,150 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 74 transitions, 1133 flow [2022-12-06 05:44:27,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 74 transitions, 1133 flow [2022-12-06 05:44:27,160 INFO L130 PetriNetUnfolder]: 38/179 cut-off events. [2022-12-06 05:44:27,161 INFO L131 PetriNetUnfolder]: For 996/998 co-relation queries the response was YES. [2022-12-06 05:44:27,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 961 conditions, 179 events. 38/179 cut-off events. For 996/998 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1031 event pairs, 0 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 835. Up to 53 conditions per place. [2022-12-06 05:44:27,162 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 74 transitions, 1133 flow [2022-12-06 05:44:27,162 INFO L188 LiptonReduction]: Number of co-enabled transitions 222 [2022-12-06 05:44:27,163 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:44:27,163 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 05:44:27,163 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 74 transitions, 1133 flow [2022-12-06 05:44:27,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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 05:44:27,163 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:27,164 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:27,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-06 05:44:27,164 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:27,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:27,164 INFO L85 PathProgramCache]: Analyzing trace with hash 280337409, now seen corresponding path program 2 times [2022-12-06 05:44:27,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:27,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349696621] [2022-12-06 05:44:27,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:27,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:27,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:27,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:27,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:27,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349696621] [2022-12-06 05:44:27,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349696621] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:44:27,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927147984] [2022-12-06 05:44:27,258 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:44:27,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:27,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:44:27,276 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 05:44:27,287 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 05:44:27,340 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:44:27,340 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:44:27,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 05:44:27,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:44:27,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 05:44:27,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:44:27,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 05:44:27,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927147984] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:44:27,506 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:44:27,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-12-06 05:44:27,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009036696] [2022-12-06 05:44:27,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:44:27,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 05:44:27,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:27,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 05:44:27,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-12-06 05:44:27,507 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 05:44:27,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 74 transitions, 1133 flow. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:27,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:27,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 05:44:27,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:27,876 INFO L130 PetriNetUnfolder]: 251/533 cut-off events. [2022-12-06 05:44:27,876 INFO L131 PetriNetUnfolder]: For 3162/3162 co-relation queries the response was YES. [2022-12-06 05:44:27,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3409 conditions, 533 events. 251/533 cut-off events. For 3162/3162 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2751 event pairs, 10 based on Foata normal form. 3/532 useless extension candidates. Maximal degree in co-relation 2856. Up to 135 conditions per place. [2022-12-06 05:44:27,879 INFO L137 encePairwiseOnDemand]: 7/29 looper letters, 48 selfloop transitions, 60 changer transitions 23/131 dead transitions. [2022-12-06 05:44:27,879 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 131 transitions, 1838 flow [2022-12-06 05:44:27,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 05:44:27,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 05:44:27,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 90 transitions. [2022-12-06 05:44:27,880 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1939655172413793 [2022-12-06 05:44:27,880 INFO L175 Difference]: Start difference. First operand has 91 places, 74 transitions, 1133 flow. Second operand 16 states and 90 transitions. [2022-12-06 05:44:27,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 131 transitions, 1838 flow [2022-12-06 05:44:27,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 131 transitions, 1745 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-12-06 05:44:27,890 INFO L231 Difference]: Finished difference. Result has 107 places, 82 transitions, 1328 flow [2022-12-06 05:44:27,890 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1058, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1328, PETRI_PLACES=107, PETRI_TRANSITIONS=82} [2022-12-06 05:44:27,890 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 87 predicate places. [2022-12-06 05:44:27,890 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:27,890 INFO L89 Accepts]: Start accepts. Operand has 107 places, 82 transitions, 1328 flow [2022-12-06 05:44:27,891 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:27,891 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:27,891 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 82 transitions, 1328 flow [2022-12-06 05:44:27,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 82 transitions, 1328 flow [2022-12-06 05:44:27,901 INFO L130 PetriNetUnfolder]: 33/162 cut-off events. [2022-12-06 05:44:27,902 INFO L131 PetriNetUnfolder]: For 1111/1113 co-relation queries the response was YES. [2022-12-06 05:44:27,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 985 conditions, 162 events. 33/162 cut-off events. For 1111/1113 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 921 event pairs, 0 based on Foata normal form. 0/160 useless extension candidates. Maximal degree in co-relation 929. Up to 38 conditions per place. [2022-12-06 05:44:27,903 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 82 transitions, 1328 flow [2022-12-06 05:44:27,903 INFO L188 LiptonReduction]: Number of co-enabled transitions 270 [2022-12-06 05:44:27,905 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [229] $Ultimate##0-->L56-2: Formula: (= v_~X~0_10 v_thread2Thread1of1ForFork1_~x~1_25) InVars {~X~0=v_~X~0_10} OutVars{thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_25, ~X~0=v_~X~0_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~x~1] and [262] L43-2-->L43-2: Formula: (and (= (+ v_thread1Thread1of1ForFork0_~x~0_42 1) v_thread1Thread1of1ForFork0_~x~0_41) (< v_thread1Thread1of1ForFork0_~x~0_42 10000)) InVars {thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_42} OutVars{thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_41, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~x~0, thread1Thread1of1ForFork0_#t~post1] [2022-12-06 05:44:27,917 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [229] $Ultimate##0-->L56-2: Formula: (= v_~X~0_10 v_thread2Thread1of1ForFork1_~x~1_25) InVars {~X~0=v_~X~0_10} OutVars{thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_25, ~X~0=v_~X~0_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~x~1] and [277] L43-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread1Thread1of1ForFork0_~x~0_In_3 10000)) (= v_~Y~0_Out_14 (+ v_~Y~0_In_6 v_thread1Thread1of1ForFork0_~x~0_In_3)) (= |v_thread1Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_In_3, ~Y~0=v_~Y~0_In_6} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_4|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_4|, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_In_3, ~Y~0=v_~Y~0_Out_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, ~Y~0] [2022-12-06 05:44:27,958 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [265] L56-2-->L56-2: Formula: (and (< v_thread2Thread1of1ForFork1_~x~1_38 10000) (= (+ v_thread2Thread1of1ForFork1_~x~1_38 1) v_thread2Thread1of1ForFork1_~x~1_37)) InVars {thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_38} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_15|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_~x~1] and [277] L43-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread1Thread1of1ForFork0_~x~0_In_3 10000)) (= v_~Y~0_Out_14 (+ v_~Y~0_In_6 v_thread1Thread1of1ForFork0_~x~0_In_3)) (= |v_thread1Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_In_3, ~Y~0=v_~Y~0_In_6} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_4|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_4|, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_In_3, ~Y~0=v_~Y~0_Out_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, ~Y~0] [2022-12-06 05:44:28,025 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [338] $Ultimate##0-->L56-2: Formula: (and (= v_thread2Thread1of1ForFork1_~x~1_228 (+ v_~X~0_126 1)) (< v_thread2Thread1of1ForFork1_~x~1_228 10001)) InVars {~X~0=v_~X~0_126} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_141|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_228, ~X~0=v_~X~0_126} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_~x~1] and [277] L43-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread1Thread1of1ForFork0_~x~0_In_3 10000)) (= v_~Y~0_Out_14 (+ v_~Y~0_In_6 v_thread1Thread1of1ForFork0_~x~0_In_3)) (= |v_thread1Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_In_3, ~Y~0=v_~Y~0_In_6} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_4|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_4|, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_In_3, ~Y~0=v_~Y~0_Out_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, ~Y~0] [2022-12-06 05:44:28,068 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_114| 0) (= 0 |v_thread1Thread1of1ForFork0_#res.base_114|) (= (+ v_~Y~0_343 v_thread1Thread1of1ForFork0_~x~0_286) v_~Y~0_342) (not (< v_thread1Thread1of1ForFork0_~x~0_286 10000)) (= v_~X~0_140 v_thread2Thread1of1ForFork1_~x~1_284)) InVars {thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_286, ~X~0=v_~X~0_140, ~Y~0=v_~Y~0_343} OutVars{thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_284, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_114|, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_286, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_114|, ~X~0=v_~X~0_140, ~Y~0=v_~Y~0_342} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~x~1, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, ~Y~0] and [265] L56-2-->L56-2: Formula: (and (< v_thread2Thread1of1ForFork1_~x~1_38 10000) (= (+ v_thread2Thread1of1ForFork1_~x~1_38 1) v_thread2Thread1of1ForFork1_~x~1_37)) InVars {thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_38} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_15|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_~x~1] [2022-12-06 05:44:28,101 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [265] L56-2-->L56-2: Formula: (and (< v_thread2Thread1of1ForFork1_~x~1_38 10000) (= (+ v_thread2Thread1of1ForFork1_~x~1_38 1) v_thread2Thread1of1ForFork1_~x~1_37)) InVars {thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_38} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_15|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_~x~1] and [286] $Ultimate##0-->L56-2: Formula: (and (= v_thread2Thread1of1ForFork1_~x~1_55 (+ v_thread2Thread1of1ForFork1_~x~1_56 1)) (< v_thread2Thread1of1ForFork1_~x~1_56 10000) (= v_~X~0_50 v_thread1Thread1of1ForFork0_~x~0_67)) InVars {thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_56, ~X~0=v_~X~0_50} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_21|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_55, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_67, ~X~0=v_~X~0_50} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_~x~1, thread1Thread1of1ForFork0_~x~0] [2022-12-06 05:44:28,125 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [265] L56-2-->L56-2: Formula: (and (< v_thread2Thread1of1ForFork1_~x~1_38 10000) (= (+ v_thread2Thread1of1ForFork1_~x~1_38 1) v_thread2Thread1of1ForFork1_~x~1_37)) InVars {thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_38} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_15|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_~x~1] and [284] $Ultimate##0-->L43-2: Formula: (and (< v_~X~0_46 10000) (= v_thread1Thread1of1ForFork0_~x~0_59 (+ v_~X~0_46 1))) InVars {~X~0=v_~X~0_46} OutVars{thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_59, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_23|, ~X~0=v_~X~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~x~0, thread1Thread1of1ForFork0_#t~post1] [2022-12-06 05:44:28,164 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [277] L43-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread1Thread1of1ForFork0_~x~0_In_3 10000)) (= v_~Y~0_Out_14 (+ v_~Y~0_In_6 v_thread1Thread1of1ForFork0_~x~0_In_3)) (= |v_thread1Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_In_3, ~Y~0=v_~Y~0_In_6} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_4|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_4|, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_In_3, ~Y~0=v_~Y~0_Out_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, ~Y~0] and [265] L56-2-->L56-2: Formula: (and (< v_thread2Thread1of1ForFork1_~x~1_38 10000) (= (+ v_thread2Thread1of1ForFork1_~x~1_38 1) v_thread2Thread1of1ForFork1_~x~1_37)) InVars {thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_38} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_15|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_~x~1] [2022-12-06 05:44:28,206 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [262] L43-2-->L43-2: Formula: (and (= (+ v_thread1Thread1of1ForFork0_~x~0_42 1) v_thread1Thread1of1ForFork0_~x~0_41) (< v_thread1Thread1of1ForFork0_~x~0_42 10000)) InVars {thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_42} OutVars{thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_41, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~x~0, thread1Thread1of1ForFork0_#t~post1] and [265] L56-2-->L56-2: Formula: (and (< v_thread2Thread1of1ForFork1_~x~1_38 10000) (= (+ v_thread2Thread1of1ForFork1_~x~1_38 1) v_thread2Thread1of1ForFork1_~x~1_37)) InVars {thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_38} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_15|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_~x~1] [2022-12-06 05:44:28,285 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [277] L43-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread1Thread1of1ForFork0_~x~0_In_3 10000)) (= v_~Y~0_Out_14 (+ v_~Y~0_In_6 v_thread1Thread1of1ForFork0_~x~0_In_3)) (= |v_thread1Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_In_3, ~Y~0=v_~Y~0_In_6} OutVars{thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_4|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_4|, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_In_3, ~Y~0=v_~Y~0_Out_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, ~Y~0] and [265] L56-2-->L56-2: Formula: (and (< v_thread2Thread1of1ForFork1_~x~1_38 10000) (= (+ v_thread2Thread1of1ForFork1_~x~1_38 1) v_thread2Thread1of1ForFork1_~x~1_37)) InVars {thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_38} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_15|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_~x~1] [2022-12-06 05:44:28,325 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_114| 0) (= 0 |v_thread1Thread1of1ForFork0_#res.base_114|) (= (+ v_~Y~0_343 v_thread1Thread1of1ForFork0_~x~0_286) v_~Y~0_342) (not (< v_thread1Thread1of1ForFork0_~x~0_286 10000)) (= v_~X~0_140 v_thread2Thread1of1ForFork1_~x~1_284)) InVars {thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_286, ~X~0=v_~X~0_140, ~Y~0=v_~Y~0_343} OutVars{thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_284, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_114|, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_286, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_114|, ~X~0=v_~X~0_140, ~Y~0=v_~Y~0_342} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~x~1, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, ~Y~0] and [265] L56-2-->L56-2: Formula: (and (< v_thread2Thread1of1ForFork1_~x~1_38 10000) (= (+ v_thread2Thread1of1ForFork1_~x~1_38 1) v_thread2Thread1of1ForFork1_~x~1_37)) InVars {thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_38} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_15|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_~x~1] [2022-12-06 05:44:28,401 INFO L203 LiptonReduction]: Total number of compositions: 11 [2022-12-06 05:44:28,401 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 511 [2022-12-06 05:44:28,401 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 76 transitions, 1351 flow [2022-12-06 05:44:28,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:28,402 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:28,402 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:28,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-06 05:44:28,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-06 05:44:28,602 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:44:28,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:28,603 INFO L85 PathProgramCache]: Analyzing trace with hash 678225117, now seen corresponding path program 1 times [2022-12-06 05:44:28,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:28,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896946945] [2022-12-06 05:44:28,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:28,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:28,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:28,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:28,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896946945] [2022-12-06 05:44:28,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896946945] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:28,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:28,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:44:28,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586908060] [2022-12-06 05:44:28,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:28,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:44:28,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:28,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:44:28,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:44:28,635 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 05:44:28,635 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 76 transitions, 1351 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:28,635 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:28,635 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 05:44:28,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:28,700 INFO L130 PetriNetUnfolder]: 177/378 cut-off events. [2022-12-06 05:44:28,700 INFO L131 PetriNetUnfolder]: For 4234/4234 co-relation queries the response was YES. [2022-12-06 05:44:28,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2759 conditions, 378 events. 177/378 cut-off events. For 4234/4234 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1724 event pairs, 75 based on Foata normal form. 2/378 useless extension candidates. Maximal degree in co-relation 2694. Up to 307 conditions per place. [2022-12-06 05:44:28,702 INFO L137 encePairwiseOnDemand]: 31/38 looper letters, 74 selfloop transitions, 6 changer transitions 4/84 dead transitions. [2022-12-06 05:44:28,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 84 transitions, 1540 flow [2022-12-06 05:44:28,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:44:28,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:44:28,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-12-06 05:44:28,705 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4298245614035088 [2022-12-06 05:44:28,705 INFO L175 Difference]: Start difference. First operand has 102 places, 76 transitions, 1351 flow. Second operand 3 states and 49 transitions. [2022-12-06 05:44:28,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 84 transitions, 1540 flow [2022-12-06 05:44:28,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 84 transitions, 1279 flow, removed 109 selfloop flow, removed 10 redundant places. [2022-12-06 05:44:28,714 INFO L231 Difference]: Finished difference. Result has 93 places, 71 transitions, 1011 flow [2022-12-06 05:44:28,715 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1040, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1011, PETRI_PLACES=93, PETRI_TRANSITIONS=71} [2022-12-06 05:44:28,715 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 73 predicate places. [2022-12-06 05:44:28,716 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:28,716 INFO L89 Accepts]: Start accepts. Operand has 93 places, 71 transitions, 1011 flow [2022-12-06 05:44:28,716 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:28,716 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:28,716 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 71 transitions, 1011 flow [2022-12-06 05:44:28,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 71 transitions, 1011 flow [2022-12-06 05:44:28,724 INFO L130 PetriNetUnfolder]: 31/141 cut-off events. [2022-12-06 05:44:28,724 INFO L131 PetriNetUnfolder]: For 992/996 co-relation queries the response was YES. [2022-12-06 05:44:28,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 725 conditions, 141 events. 31/141 cut-off events. For 992/996 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 718 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 694. Up to 28 conditions per place. [2022-12-06 05:44:28,725 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 71 transitions, 1011 flow [2022-12-06 05:44:28,725 INFO L188 LiptonReduction]: Number of co-enabled transitions 224 [2022-12-06 05:44:28,775 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [262] L43-2-->L43-2: Formula: (and (= (+ v_thread1Thread1of1ForFork0_~x~0_42 1) v_thread1Thread1of1ForFork0_~x~0_41) (< v_thread1Thread1of1ForFork0_~x~0_42 10000)) InVars {thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_42} OutVars{thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_41, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~x~0, thread1Thread1of1ForFork0_#t~post1] and [265] L56-2-->L56-2: Formula: (and (< v_thread2Thread1of1ForFork1_~x~1_38 10000) (= (+ v_thread2Thread1of1ForFork1_~x~1_38 1) v_thread2Thread1of1ForFork1_~x~1_37)) InVars {thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_38} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_15|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_~x~1] [2022-12-06 05:44:28,796 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [356] $Ultimate##0-->L43-2: Formula: (and (= (+ v_thread1Thread1of1ForFork0_~x~0_283 1) v_thread1Thread1of1ForFork0_~x~0_282) (< v_thread1Thread1of1ForFork0_~x~0_283 10000) (= v_~X~0_138 v_thread2Thread1of1ForFork1_~x~1_282)) InVars {thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_283, ~X~0=v_~X~0_138} OutVars{thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_282, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_282, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_148|, ~X~0=v_~X~0_138} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~x~1, thread1Thread1of1ForFork0_~x~0, thread1Thread1of1ForFork0_#t~post1] and [358] L56-2-->thread1EXIT: Formula: (and (not (< v_thread1Thread1of1ForFork0_~x~0_288 10000)) (< v_thread2Thread1of1ForFork1_~x~1_287 10000) (= v_~Y~0_346 (+ v_~Y~0_347 v_thread1Thread1of1ForFork0_~x~0_288)) (= 0 |v_thread1Thread1of1ForFork0_#res.base_116|) (= v_thread2Thread1of1ForFork1_~x~1_286 (+ v_thread2Thread1of1ForFork1_~x~1_287 1)) (= |v_thread1Thread1of1ForFork0_#res.offset_116| 0)) InVars {thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_287, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_288, ~Y~0=v_~Y~0_347} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_159|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_286, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_116|, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_288, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_116|, ~Y~0=v_~Y~0_346} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_~x~1, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, ~Y~0] [2022-12-06 05:44:28,894 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [352] L56-2-->thread1EXIT: Formula: (and (= (+ v_thread2Thread1of1ForFork1_~x~1_269 1) v_thread2Thread1of1ForFork1_~x~1_268) (= v_~Y~0_318 (+ v_~Y~0_319 v_thread1Thread1of1ForFork0_~x~0_270)) (= |v_thread1Thread1of1ForFork0_#res.offset_104| 0) (not (< v_thread1Thread1of1ForFork0_~x~0_270 10000)) (= 0 |v_thread1Thread1of1ForFork0_#res.base_104|) (< v_thread2Thread1of1ForFork1_~x~1_269 10000)) InVars {thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_269, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_270, ~Y~0=v_~Y~0_319} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_155|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_268, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_104|, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_270, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_104|, ~Y~0=v_~Y~0_318} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_~x~1, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, ~Y~0] and [265] L56-2-->L56-2: Formula: (and (< v_thread2Thread1of1ForFork1_~x~1_38 10000) (= (+ v_thread2Thread1of1ForFork1_~x~1_38 1) v_thread2Thread1of1ForFork1_~x~1_37)) InVars {thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_38} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_15|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_~x~1] [2022-12-06 05:44:28,945 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [265] L56-2-->L56-2: Formula: (and (< v_thread2Thread1of1ForFork1_~x~1_38 10000) (= (+ v_thread2Thread1of1ForFork1_~x~1_38 1) v_thread2Thread1of1ForFork1_~x~1_37)) InVars {thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_38} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_15|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_~x~1] and [365] L43-2-->L56-2: Formula: (and (= (+ v_thread1Thread1of1ForFork0_~x~0_301 1) v_thread1Thread1of1ForFork0_~x~0_300) (< v_thread1Thread1of1ForFork0_~x~0_301 10000) (= (+ v_thread2Thread1of1ForFork1_~x~1_317 1) v_thread2Thread1of1ForFork1_~x~1_316) (< v_thread2Thread1of1ForFork1_~x~1_317 10000)) InVars {thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_317, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_301} OutVars{thread2Thread1of1ForFork1_#t~post2=|v_thread2Thread1of1ForFork1_#t~post2_177|, thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_316, thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_300, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_152|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post2, thread2Thread1of1ForFork1_~x~1, thread1Thread1of1ForFork0_~x~0, thread1Thread1of1ForFork0_#t~post1] [2022-12-06 05:44:29,050 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [229] $Ultimate##0-->L56-2: Formula: (= v_~X~0_10 v_thread2Thread1of1ForFork1_~x~1_25) InVars {~X~0=v_~X~0_10} OutVars{thread2Thread1of1ForFork1_~x~1=v_thread2Thread1of1ForFork1_~x~1_25, ~X~0=v_~X~0_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~x~1] and [324] $Ultimate##0-->L43-2: Formula: (and (= v_thread1Thread1of1ForFork0_~x~0_178 (+ v_~X~0_108 2)) (< v_thread1Thread1of1ForFork0_~x~0_178 10001)) InVars {~X~0=v_~X~0_108} OutVars{thread1Thread1of1ForFork0_~x~0=v_thread1Thread1of1ForFork0_~x~0_178, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_97|, ~X~0=v_~X~0_108} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~x~0, thread1Thread1of1ForFork0_#t~post1] [2022-12-06 05:44:29,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-06 05:44:29,065 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IndexOutOfBoundsException: Index 12 out of bounds for length 12 at java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:64) at java.base/jdk.internal.util.Preconditions.outOfBoundsCheckIndex(Preconditions.java:70) at java.base/jdk.internal.util.Preconditions.checkIndex(Preconditions.java:248) at java.base/java.util.Objects.checkIndex(Objects.java:372) at java.base/java.util.ArrayList.get(ArrayList.java:459) at de.uni_freiburg.informatik.ultimate.automata.petrinet.PetriNetRun.getTransition(PetriNetRun.java:125) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ChoiceRule.adaptRun(ChoiceRule.java:163) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ChoiceRule.applyInternal(ChoiceRule.java:115) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:80) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.choiceRuleWrapper(LiptonReduction.java:239) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:200) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.(LiptonReduction.java:143) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.PetriNetLargeBlockEncoding.(PetriNetLargeBlockEncoding.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 05:44:29,068 INFO L158 Benchmark]: Toolchain (without parser) took 21172.36ms. Allocated memory was 200.3MB in the beginning and 521.1MB in the end (delta: 320.9MB). Free memory was 176.9MB in the beginning and 377.7MB in the end (delta: -200.7MB). Peak memory consumption was 120.7MB. Max. memory is 8.0GB. [2022-12-06 05:44:29,069 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 200.3MB. Free memory was 177.4MB in the beginning and 177.3MB in the end (delta: 88.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:44:29,069 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.59ms. Allocated memory is still 200.3MB. Free memory was 176.9MB in the beginning and 165.4MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 05:44:29,069 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.80ms. Allocated memory is still 200.3MB. Free memory was 165.4MB in the beginning and 164.2MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 05:44:29,069 INFO L158 Benchmark]: Boogie Preprocessor took 16.47ms. Allocated memory is still 200.3MB. Free memory was 164.2MB in the beginning and 162.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 05:44:29,069 INFO L158 Benchmark]: RCFGBuilder took 402.90ms. Allocated memory is still 200.3MB. Free memory was 162.8MB in the beginning and 149.7MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 05:44:29,069 INFO L158 Benchmark]: TraceAbstraction took 20539.53ms. Allocated memory was 200.3MB in the beginning and 521.1MB in the end (delta: 320.9MB). Free memory was 149.1MB in the beginning and 377.7MB in the end (delta: -228.5MB). Peak memory consumption was 93.4MB. Max. memory is 8.0GB. [2022-12-06 05:44:29,070 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 200.3MB. Free memory was 177.4MB in the beginning and 177.3MB in the end (delta: 88.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 183.59ms. Allocated memory is still 200.3MB. Free memory was 176.9MB in the beginning and 165.4MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.80ms. Allocated memory is still 200.3MB. Free memory was 165.4MB in the beginning and 164.2MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.47ms. Allocated memory is still 200.3MB. Free memory was 164.2MB in the beginning and 162.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 402.90ms. Allocated memory is still 200.3MB. Free memory was 162.8MB in the beginning and 149.7MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 20539.53ms. Allocated memory was 200.3MB in the beginning and 521.1MB in the end (delta: 320.9MB). Free memory was 149.1MB in the beginning and 377.7MB in the end (delta: -228.5MB). Peak memory consumption was 93.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 71 PlacesBefore, 20 PlacesAfterwards, 70 TransitionsBefore, 15 TransitionsAfterwards, 572 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 30 TrivialYvCompositions, 21 ConcurrentYvCompositions, 4 ChoiceCompositions, 55 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 312, independent: 312, independent conditional: 312, 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: 312, independent: 312, independent conditional: 0, independent unconditional: 312, 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: 312, independent: 312, independent conditional: 0, independent unconditional: 312, 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: 312, independent: 312, independent conditional: 0, independent unconditional: 312, 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: 312, independent: 312, independent conditional: 0, independent unconditional: 312, 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: 312, independent: 303, independent conditional: 0, independent unconditional: 303, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 312, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 312, unknown conditional: 0, unknown unconditional: 312] , Statistics on independence cache: Total cache size (in pairs): 517, Positive cache size: 517, Positive conditional cache size: 0, Positive unconditional cache size: 517, 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, 26 PlacesBefore, 25 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 60 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1, Positive cache size: 1, Positive conditional cache size: 1, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 29 PlacesBefore, 28 PlacesAfterwards, 22 TransitionsBefore, 21 TransitionsAfterwards, 66 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 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): 4, Positive cache size: 4, Positive conditional cache size: 4, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 31 PlacesBefore, 29 PlacesAfterwards, 27 TransitionsBefore, 25 TransitionsAfterwards, 66 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 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: 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: 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: 5, independent: 3, independent conditional: 3, 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): 6, Positive cache size: 6, Positive conditional cache size: 6, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 29 PlacesBefore, 29 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 78 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): 6, Positive cache size: 6, Positive conditional cache size: 6, 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: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 90 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): 9, Positive cache size: 9, Positive conditional cache size: 9, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 35 PlacesBefore, 34 PlacesAfterwards, 32 TransitionsBefore, 31 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 15, Positive conditional cache size: 15, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 96 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: 0, 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: 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] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 15, Positive conditional cache size: 15, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 31 PlacesBefore, 31 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 94 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): 15, Positive cache size: 15, Positive conditional cache size: 15, 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: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 118 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 16, Positive cache size: 16, Positive conditional cache size: 16, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 138 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): 16, Positive cache size: 16, Positive conditional cache size: 16, 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: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 144 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): 16, Positive cache size: 16, Positive conditional cache size: 16, 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: 0.0s, 51 PlacesBefore, 52 PlacesAfterwards, 60 TransitionsBefore, 61 TransitionsAfterwards, 160 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): 19, Positive cache size: 19, Positive conditional cache size: 19, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 60 PlacesBefore, 60 PlacesAfterwards, 66 TransitionsBefore, 66 TransitionsAfterwards, 170 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): 19, Positive cache size: 19, Positive conditional cache size: 19, 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: 0.0s, 63 PlacesBefore, 63 PlacesAfterwards, 66 TransitionsBefore, 66 TransitionsAfterwards, 166 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): 19, Positive cache size: 19, Positive conditional cache size: 19, 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: 0.3s, 69 PlacesBefore, 68 PlacesAfterwards, 59 TransitionsBefore, 58 TransitionsAfterwards, 152 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 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: 3, independent: 3, independent conditional: 1, 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: 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: 1, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 22, Positive cache size: 22, Positive conditional cache size: 20, Positive unconditional cache size: 2, 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: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 60 PlacesBefore, 60 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 162 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): 22, Positive cache size: 22, Positive conditional cache size: 20, Positive unconditional cache size: 2, 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.2s, 66 PlacesBefore, 65 PlacesAfterwards, 65 TransitionsBefore, 64 TransitionsAfterwards, 172 CoEnabledTransitionPairs, 2 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: 3, independent: 3, independent conditional: 1, 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: 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: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 25, Positive cache size: 25, Positive conditional cache size: 21, Positive unconditional cache size: 4, 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: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 67 PlacesBefore, 67 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 192 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): 25, Positive cache size: 25, Positive conditional cache size: 21, Positive unconditional cache size: 4, 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.2s, 74 PlacesBefore, 74 PlacesAfterwards, 76 TransitionsBefore, 76 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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: 1, 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: 3, independent: 3, independent conditional: 1, 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: 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: 3, independent: 1, independent conditional: 0, independent unconditional: 1, 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): 27, Positive cache size: 27, Positive conditional cache size: 22, Positive unconditional cache size: 5, 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: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 86 PlacesBefore, 85 PlacesAfterwards, 82 TransitionsBefore, 81 TransitionsAfterwards, 222 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 6, 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: 8, independent: 8, independent conditional: 6, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 7, independent conditional: 6, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 28, Positive cache size: 28, Positive conditional cache size: 22, Positive unconditional cache size: 6, 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: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 78 PlacesBefore, 77 PlacesAfterwards, 78 TransitionsBefore, 77 TransitionsAfterwards, 206 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 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): 31, Positive cache size: 31, Positive conditional cache size: 25, Positive unconditional cache size: 6, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 79 PlacesBefore, 79 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 200 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): 31, Positive cache size: 31, Positive conditional cache size: 25, Positive unconditional cache size: 6, 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.1s, 82 PlacesBefore, 82 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 218 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: 0, 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: 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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 32, Positive cache size: 32, Positive conditional cache size: 25, Positive unconditional cache size: 7, 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: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 84 PlacesBefore, 84 PlacesAfterwards, 83 TransitionsBefore, 83 TransitionsAfterwards, 236 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): 32, Positive cache size: 32, Positive conditional cache size: 25, Positive unconditional cache size: 7, 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.1s, 85 PlacesBefore, 84 PlacesAfterwards, 81 TransitionsBefore, 80 TransitionsAfterwards, 228 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 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): 35, Positive cache size: 35, Positive conditional cache size: 28, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 86 PlacesBefore, 86 PlacesAfterwards, 81 TransitionsBefore, 81 TransitionsAfterwards, 224 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): 35, Positive cache size: 35, Positive conditional cache size: 28, Positive unconditional cache size: 7, 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.1s, 86 PlacesBefore, 83 PlacesAfterwards, 80 TransitionsBefore, 77 TransitionsAfterwards, 222 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 36, Positive cache size: 36, Positive conditional cache size: 28, Positive unconditional cache size: 8, 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: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 87 PlacesBefore, 87 PlacesAfterwards, 93 TransitionsBefore, 93 TransitionsAfterwards, 264 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 3, 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: 8, independent: 8, independent conditional: 3, 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: 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] , 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: 8, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 1, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 40, Positive cache size: 40, Positive conditional cache size: 29, Positive unconditional cache size: 11, 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: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 82 PlacesBefore, 82 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 178 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): 40, Positive cache size: 40, Positive conditional cache size: 29, Positive unconditional cache size: 11, 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, 69 PlacesBefore, 69 PlacesAfterwards, 64 TransitionsBefore, 64 TransitionsAfterwards, 186 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): 40, Positive cache size: 40, Positive conditional cache size: 29, Positive unconditional cache size: 11, 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.1s, 81 PlacesBefore, 80 PlacesAfterwards, 81 TransitionsBefore, 80 TransitionsAfterwards, 228 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 41, Positive cache size: 41, Positive conditional cache size: 30, Positive unconditional cache size: 11, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 89 PlacesBefore, 88 PlacesAfterwards, 98 TransitionsBefore, 95 TransitionsAfterwards, 282 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 18, independent conditional: 15, 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: 18, independent: 18, independent conditional: 15, 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: 11, independent: 11, independent conditional: 8, 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: 11, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11, unknown conditional: 8, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 52, Positive conditional cache size: 38, Positive unconditional cache size: 14, 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: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 94 PlacesBefore, 93 PlacesAfterwards, 109 TransitionsBefore, 110 TransitionsAfterwards, 312 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 27, independent: 27, independent conditional: 27, 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: 27, independent: 27, independent conditional: 0, independent unconditional: 27, 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: 40, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 27, unknown conditional: 27, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 83, Positive conditional cache size: 69, Positive unconditional cache size: 14, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 87 PlacesBefore, 84 PlacesAfterwards, 83 TransitionsBefore, 80 TransitionsAfterwards, 244 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, 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: 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] , 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: 10, independent: 7, independent conditional: 7, 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): 86, Positive cache size: 86, Positive conditional cache size: 72, Positive unconditional cache size: 14, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 89 PlacesBefore, 89 PlacesAfterwards, 88 TransitionsBefore, 88 TransitionsAfterwards, 258 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 87, Positive conditional cache size: 72, Positive unconditional cache size: 15, 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: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 87 PlacesBefore, 87 PlacesAfterwards, 85 TransitionsBefore, 83 TransitionsAfterwards, 248 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: 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: 15, independent: 12, independent conditional: 12, 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): 90, Positive cache size: 90, Positive conditional cache size: 75, Positive unconditional cache size: 15, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 83 PlacesBefore, 83 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 214 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): 90, Positive cache size: 90, Positive conditional cache size: 75, Positive unconditional cache size: 15, 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, 87 PlacesBefore, 87 PlacesAfterwards, 76 TransitionsBefore, 76 TransitionsAfterwards, 230 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): 90, Positive cache size: 90, Positive conditional cache size: 75, Positive unconditional cache size: 15, 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, 91 PlacesBefore, 91 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 222 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): 90, Positive cache size: 90, Positive conditional cache size: 75, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 105 PlacesBefore, 102 PlacesAfterwards, 82 TransitionsBefore, 76 TransitionsAfterwards, 270 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39, independent: 39, independent conditional: 39, 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: 39, independent: 39, independent conditional: 39, 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: 39, independent: 39, independent conditional: 35, 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: 39, independent: 39, independent conditional: 35, 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: 13, independent: 13, independent conditional: 13, 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: 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: 39, independent: 26, independent conditional: 22, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 13, unknown conditional: 13, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 128, Positive cache size: 128, Positive conditional cache size: 112, Positive unconditional cache size: 16, 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: 4, Maximal queried relation: 0 - ExceptionOrErrorResult: IndexOutOfBoundsException: Index 12 out of bounds for length 12 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IndexOutOfBoundsException: Index 12 out of bounds for length 12: java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:64) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 05:44:29,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...