/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:01:34,772 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:01:34,788 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:01:34,820 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:01:34,821 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:01:34,822 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:01:34,839 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:01:34,842 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:01:34,846 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:01:34,850 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:01:34,851 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:01:34,852 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:01:34,853 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:01:34,855 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:01:34,855 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:01:34,856 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:01:34,857 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:01:34,857 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:01:34,859 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:01:34,863 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:01:34,863 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:01:34,864 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:01:34,865 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:01:34,865 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:01:34,870 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:01:34,870 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:01:34,883 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:01:34,884 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:01:34,885 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:01:34,886 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:01:34,886 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:01:34,887 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:01:34,888 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:01:34,888 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:01:34,889 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:01:34,889 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:01:34,889 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:01:34,890 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:01:34,890 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:01:34,890 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:01:34,891 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:01:34,892 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:01:34,941 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:01:34,942 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:01:34,943 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:01:34,943 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:01:34,943 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:01:34,944 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:01:34,944 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:01:34,944 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:01:34,944 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:01:34,944 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:01:34,945 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:01:34,945 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:01:34,945 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:01:34,945 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:01:34,945 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:01:34,945 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:01:34,946 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:01:34,946 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:01:34,946 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:01:34,946 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:01:34,946 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:01:34,946 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:01:34,946 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:01:34,946 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:01:34,946 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:01:34,947 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:01:34,947 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:01:34,947 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:01:34,947 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 06:01:35,424 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:01:35,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:01:35,455 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:01:35,456 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:01:35,456 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:01:35,457 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue.i [2022-12-06 06:01:36,975 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:01:37,453 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:01:37,454 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i [2022-12-06 06:01:37,510 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d34e9865/0c2d28b77030420bba25ee6a1b809ab3/FLAG7ca97eb4e [2022-12-06 06:01:37,547 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d34e9865/0c2d28b77030420bba25ee6a1b809ab3 [2022-12-06 06:01:37,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:01:37,564 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:01:37,566 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:01:37,566 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:01:37,568 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:01:37,569 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:01:37" (1/1) ... [2022-12-06 06:01:37,570 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5685aca7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:37, skipping insertion in model container [2022-12-06 06:01:37,570 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:01:37" (1/1) ... [2022-12-06 06:01:37,576 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:01:37,642 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:01:38,114 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43284,43297] [2022-12-06 06:01:38,121 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43491,43504] [2022-12-06 06:01:38,125 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43772,43785] [2022-12-06 06:01:38,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:01:38,141 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:01:38,191 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43284,43297] [2022-12-06 06:01:38,192 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43491,43504] [2022-12-06 06:01:38,193 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43772,43785] [2022-12-06 06:01:38,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:01:38,250 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:01:38,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:38 WrapperNode [2022-12-06 06:01:38,251 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:01:38,252 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:01:38,252 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:01:38,252 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:01:38,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:38" (1/1) ... [2022-12-06 06:01:38,284 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:38" (1/1) ... [2022-12-06 06:01:38,317 INFO L138 Inliner]: procedures = 274, calls = 68, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 250 [2022-12-06 06:01:38,318 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:01:38,318 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:01:38,319 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:01:38,319 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:01:38,325 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:38" (1/1) ... [2022-12-06 06:01:38,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:38" (1/1) ... [2022-12-06 06:01:38,330 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:38" (1/1) ... [2022-12-06 06:01:38,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:38" (1/1) ... [2022-12-06 06:01:38,337 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:38" (1/1) ... [2022-12-06 06:01:38,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:38" (1/1) ... [2022-12-06 06:01:38,342 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:38" (1/1) ... [2022-12-06 06:01:38,343 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:38" (1/1) ... [2022-12-06 06:01:38,345 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:01:38,346 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:01:38,346 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:01:38,346 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:01:38,347 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:38" (1/1) ... [2022-12-06 06:01:38,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:01:38,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:38,382 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 06:01:38,429 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 06:01:38,444 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-06 06:01:38,444 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-06 06:01:38,444 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-06 06:01:38,444 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-06 06:01:38,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:01:38,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:01:38,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 06:01:38,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:01:38,445 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-06 06:01:38,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:01:38,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:01:38,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:01:38,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:01:38,446 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 06:01:38,593 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:01:38,595 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:01:38,939 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:01:38,946 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:01:38,946 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-06 06:01:38,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:01:38 BoogieIcfgContainer [2022-12-06 06:01:38,948 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:01:38,949 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:01:38,949 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:01:38,952 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:01:38,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:01:37" (1/3) ... [2022-12-06 06:01:38,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27787a4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:01:38, skipping insertion in model container [2022-12-06 06:01:38,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:38" (2/3) ... [2022-12-06 06:01:38,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27787a4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:01:38, skipping insertion in model container [2022-12-06 06:01:38,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:01:38" (3/3) ... [2022-12-06 06:01:38,953 INFO L112 eAbstractionObserver]: Analyzing ICFG queue.i [2022-12-06 06:01:38,966 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:01:38,967 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-12-06 06:01:38,967 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:01:39,046 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 06:01:39,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 256 places, 264 transitions, 544 flow [2022-12-06 06:01:39,125 INFO L130 PetriNetUnfolder]: 15/262 cut-off events. [2022-12-06 06:01:39,126 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 06:01:39,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271 conditions, 262 events. 15/262 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 362 event pairs, 0 based on Foata normal form. 0/244 useless extension candidates. Maximal degree in co-relation 191. Up to 2 conditions per place. [2022-12-06 06:01:39,135 INFO L82 GeneralOperation]: Start removeDead. Operand has 256 places, 264 transitions, 544 flow [2022-12-06 06:01:39,140 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 245 places, 253 transitions, 515 flow [2022-12-06 06:01:39,141 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:39,152 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 245 places, 253 transitions, 515 flow [2022-12-06 06:01:39,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 245 places, 253 transitions, 515 flow [2022-12-06 06:01:39,203 INFO L130 PetriNetUnfolder]: 15/253 cut-off events. [2022-12-06 06:01:39,204 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 06:01:39,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 253 events. 15/253 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 328 event pairs, 0 based on Foata normal form. 0/235 useless extension candidates. Maximal degree in co-relation 191. Up to 2 conditions per place. [2022-12-06 06:01:39,213 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 245 places, 253 transitions, 515 flow [2022-12-06 06:01:39,214 INFO L188 LiptonReduction]: Number of co-enabled transitions 15600 [2022-12-06 06:01:50,476 INFO L203 LiptonReduction]: Total number of compositions: 200 [2022-12-06 06:01:50,497 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:01:50,503 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;@575217c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:01:50,504 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 06:01:50,507 INFO L130 PetriNetUnfolder]: 1/3 cut-off events. [2022-12-06 06:01:50,507 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:01:50,507 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:50,508 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1] [2022-12-06 06:01:50,509 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:01:50,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:50,512 INFO L85 PathProgramCache]: Analyzing trace with hash 32461, now seen corresponding path program 1 times [2022-12-06 06:01:50,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:50,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490536931] [2022-12-06 06:01:50,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:50,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:50,618 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 06:01:50,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:50,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490536931] [2022-12-06 06:01:50,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490536931] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:01:50,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:01:50,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:01:50,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448911238] [2022-12-06 06:01:50,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:01:50,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 06:01:50,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:50,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 06:01:50,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 06:01:50,645 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 75 [2022-12-06 06:01:50,646 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 75 transitions, 159 flow. Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:50,646 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:50,646 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 75 [2022-12-06 06:01:50,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:50,994 INFO L130 PetriNetUnfolder]: 1933/3186 cut-off events. [2022-12-06 06:01:50,995 INFO L131 PetriNetUnfolder]: For 45/45 co-relation queries the response was YES. [2022-12-06 06:01:51,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6241 conditions, 3186 events. 1933/3186 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 14805 event pairs, 1527 based on Foata normal form. 36/2412 useless extension candidates. Maximal degree in co-relation 6070. Up to 2973 conditions per place. [2022-12-06 06:01:51,011 INFO L137 encePairwiseOnDemand]: 69/75 looper letters, 59 selfloop transitions, 0 changer transitions 0/67 dead transitions. [2022-12-06 06:01:51,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 67 transitions, 261 flow [2022-12-06 06:01:51,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 06:01:51,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 06:01:51,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 83 transitions. [2022-12-06 06:01:51,021 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5533333333333333 [2022-12-06 06:01:51,022 INFO L175 Difference]: Start difference. First operand has 69 places, 75 transitions, 159 flow. Second operand 2 states and 83 transitions. [2022-12-06 06:01:51,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 67 transitions, 261 flow [2022-12-06 06:01:51,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 67 transitions, 256 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:01:51,028 INFO L231 Difference]: Finished difference. Result has 63 places, 67 transitions, 138 flow [2022-12-06 06:01:51,029 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=138, PETRI_PLACES=63, PETRI_TRANSITIONS=67} [2022-12-06 06:01:51,032 INFO L294 CegarLoopForPetriNet]: 69 programPoint places, -6 predicate places. [2022-12-06 06:01:51,032 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:51,033 INFO L89 Accepts]: Start accepts. Operand has 63 places, 67 transitions, 138 flow [2022-12-06 06:01:51,034 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:51,034 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:51,035 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 67 transitions, 138 flow [2022-12-06 06:01:51,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 67 transitions, 138 flow [2022-12-06 06:01:51,043 INFO L130 PetriNetUnfolder]: 9/67 cut-off events. [2022-12-06 06:01:51,044 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:01:51,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 67 events. 9/67 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 137 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2022-12-06 06:01:51,045 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 67 transitions, 138 flow [2022-12-06 06:01:51,045 INFO L188 LiptonReduction]: Number of co-enabled transitions 1998 [2022-12-06 06:01:51,165 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:01:51,170 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-06 06:01:51,170 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 66 transitions, 136 flow [2022-12-06 06:01:51,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:51,170 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:51,170 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:51,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:01:51,171 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:01:51,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:51,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1563190404, now seen corresponding path program 1 times [2022-12-06 06:01:51,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:51,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171775655] [2022-12-06 06:01:51,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:51,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:51,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:52,133 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 06:01:52,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:52,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171775655] [2022-12-06 06:01:52,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171775655] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:01:52,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:01:52,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:01:52,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993985638] [2022-12-06 06:01:52,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:01:52,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:01:52,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:52,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:01:52,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:01:52,136 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 66 [2022-12-06 06:01:52,136 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 66 transitions, 136 flow. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:52,136 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:52,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 66 [2022-12-06 06:01:52,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:52,630 INFO L130 PetriNetUnfolder]: 2100/3398 cut-off events. [2022-12-06 06:01:52,630 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:01:52,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6715 conditions, 3398 events. 2100/3398 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 15398 event pairs, 1512 based on Foata normal form. 0/2559 useless extension candidates. Maximal degree in co-relation 5642. Up to 3181 conditions per place. [2022-12-06 06:01:52,642 INFO L137 encePairwiseOnDemand]: 58/66 looper letters, 86 selfloop transitions, 11 changer transitions 0/102 dead transitions. [2022-12-06 06:01:52,642 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 102 transitions, 404 flow [2022-12-06 06:01:52,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:01:52,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:01:52,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2022-12-06 06:01:52,644 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29004329004329005 [2022-12-06 06:01:52,644 INFO L175 Difference]: Start difference. First operand has 61 places, 66 transitions, 136 flow. Second operand 7 states and 134 transitions. [2022-12-06 06:01:52,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 102 transitions, 404 flow [2022-12-06 06:01:52,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 102 transitions, 404 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:01:52,647 INFO L231 Difference]: Finished difference. Result has 72 places, 76 transitions, 210 flow [2022-12-06 06:01:52,647 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=210, PETRI_PLACES=72, PETRI_TRANSITIONS=76} [2022-12-06 06:01:52,648 INFO L294 CegarLoopForPetriNet]: 69 programPoint places, 3 predicate places. [2022-12-06 06:01:52,648 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:52,648 INFO L89 Accepts]: Start accepts. Operand has 72 places, 76 transitions, 210 flow [2022-12-06 06:01:52,648 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:52,648 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:52,649 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 76 transitions, 210 flow [2022-12-06 06:01:52,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 76 transitions, 210 flow [2022-12-06 06:01:52,658 INFO L130 PetriNetUnfolder]: 22/129 cut-off events. [2022-12-06 06:01:52,658 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 06:01:52,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 129 events. 22/129 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 415 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 100. Up to 9 conditions per place. [2022-12-06 06:01:52,659 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 76 transitions, 210 flow [2022-12-06 06:01:52,659 INFO L188 LiptonReduction]: Number of co-enabled transitions 1984 [2022-12-06 06:01:52,715 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [953] L981-3-->L982-1: Formula: (= (select (select |v_#memory_int_494| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_183|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_183|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_159|) InVars {t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_183|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_183|, #memory_int=|v_#memory_int_494|} OutVars{t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_183|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_183|, #memory_int=|v_#memory_int_494|, t1Thread1of1ForFork0_enqueue_#t~mem39#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_159|, t1Thread1of1ForFork0_enqueue_#t~post38#1=|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_69|, t1Thread1of1ForFork0_enqueue_#t~mem37#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem37#1_75|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem39#1, t1Thread1of1ForFork0_enqueue_#t~post38#1, t1Thread1of1ForFork0_enqueue_#t~mem37#1] and [994] L1063-4-->L1064-3: Formula: (and (= |v_#memory_int_714| (store |v_#memory_int_715| |v_ULTIMATE.start_main_~#id2~0#1.base_37| (store (select |v_#memory_int_715| |v_ULTIMATE.start_main_~#id2~0#1.base_37|) |v_ULTIMATE.start_main_~#id2~0#1.offset_37| |v_ULTIMATE.start_main_#t~pre64#1_47|))) (= |v_ULTIMATE.start_main_#t~pre64#1_47| |v_#pthreadsForks_36|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1))) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_37|, #pthreadsForks=|v_#pthreadsForks_36|, #memory_int=|v_#memory_int_715|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_37|} OutVars{ULTIMATE.start_main_#t~pre62#1=|v_ULTIMATE.start_main_#t~pre62#1_37|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_37|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_#t~pre64#1=|v_ULTIMATE.start_main_#t~pre64#1_47|, #memory_int=|v_#memory_int_714|, ULTIMATE.start_main_#t~nondet63#1=|v_ULTIMATE.start_main_#t~nondet63#1_23|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre62#1, #pthreadsForks, ULTIMATE.start_main_#t~pre64#1, #memory_int, ULTIMATE.start_main_#t~nondet63#1] [2022-12-06 06:01:52,756 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [898] L1010-->L980-1: Formula: (and (= |v_t1Thread1of1ForFork0_enqueue_#in~x#1_27| |v_t1Thread1of1ForFork0_~value~0#1_33|) (= (select (select |v_#memory_int_334| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_147|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_147|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|) (= |v_t1Thread1of1ForFork0_enqueue_~x#1_43| |v_t1Thread1of1ForFork0_enqueue_#in~x#1_27|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_27| |v_~#queue~0.offset_30|) (= |v_t1Thread1of1ForFork0_enqueue_~q#1.base_147| |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_27|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_27| |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_147|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_27| |v_~#queue~0.base_31|)) InVars {~#queue~0.base=|v_~#queue~0.base_31|, t1Thread1of1ForFork0_~value~0#1=|v_t1Thread1of1ForFork0_~value~0#1_33|, #memory_int=|v_#memory_int_334|, ~#queue~0.offset=|v_~#queue~0.offset_30|} OutVars{t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_147|, t1Thread1of1ForFork0_~value~0#1=|v_t1Thread1of1ForFork0_~value~0#1_33|, t1Thread1of1ForFork0_enqueue_#t~post41#1=|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_47|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_49|, t1Thread1of1ForFork0_enqueue_#t~mem36#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|, t1Thread1of1ForFork0_enqueue_#in~q#1.base=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_27|, ~#queue~0.base=|v_~#queue~0.base_31|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_147|, t1Thread1of1ForFork0_enqueue_#in~x#1=|v_t1Thread1of1ForFork0_enqueue_#in~x#1_27|, #memory_int=|v_#memory_int_334|, t1Thread1of1ForFork0_enqueue_~x#1=|v_t1Thread1of1ForFork0_enqueue_~x#1_43|, t1Thread1of1ForFork0_enqueue_#res#1=|v_t1Thread1of1ForFork0_enqueue_#res#1_59|, ~#queue~0.offset=|v_~#queue~0.offset_30|, t1Thread1of1ForFork0_enqueue_#t~mem39#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_117|, t1Thread1of1ForFork0_enqueue_#in~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_27|, t1Thread1of1ForFork0_enqueue_#t~post38#1=|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_63|, t1Thread1of1ForFork0_enqueue_#t~mem37#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem37#1_69|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_~q#1.base, t1Thread1of1ForFork0_enqueue_#t~post41#1, t1Thread1of1ForFork0_enqueue_#t~mem40#1, t1Thread1of1ForFork0_enqueue_#t~mem36#1, t1Thread1of1ForFork0_enqueue_#in~q#1.base, t1Thread1of1ForFork0_enqueue_~q#1.offset, t1Thread1of1ForFork0_enqueue_#in~x#1, t1Thread1of1ForFork0_enqueue_~x#1, t1Thread1of1ForFork0_enqueue_#res#1, t1Thread1of1ForFork0_enqueue_#t~mem39#1, t1Thread1of1ForFork0_enqueue_#in~q#1.offset, t1Thread1of1ForFork0_enqueue_#t~post38#1, t1Thread1of1ForFork0_enqueue_#t~mem37#1] and [994] L1063-4-->L1064-3: Formula: (and (= |v_#memory_int_714| (store |v_#memory_int_715| |v_ULTIMATE.start_main_~#id2~0#1.base_37| (store (select |v_#memory_int_715| |v_ULTIMATE.start_main_~#id2~0#1.base_37|) |v_ULTIMATE.start_main_~#id2~0#1.offset_37| |v_ULTIMATE.start_main_#t~pre64#1_47|))) (= |v_ULTIMATE.start_main_#t~pre64#1_47| |v_#pthreadsForks_36|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1))) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_37|, #pthreadsForks=|v_#pthreadsForks_36|, #memory_int=|v_#memory_int_715|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_37|} OutVars{ULTIMATE.start_main_#t~pre62#1=|v_ULTIMATE.start_main_#t~pre62#1_37|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_37|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_#t~pre64#1=|v_ULTIMATE.start_main_#t~pre64#1_47|, #memory_int=|v_#memory_int_714|, ULTIMATE.start_main_#t~nondet63#1=|v_ULTIMATE.start_main_#t~nondet63#1_23|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre62#1, #pthreadsForks, ULTIMATE.start_main_#t~pre64#1, #memory_int, ULTIMATE.start_main_#t~nondet63#1] [2022-12-06 06:01:52,849 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:01:52,850 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 202 [2022-12-06 06:01:52,850 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 74 transitions, 208 flow [2022-12-06 06:01:52,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:52,850 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:52,851 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:52,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:01:52,851 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:01:52,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:52,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1177245892, now seen corresponding path program 1 times [2022-12-06 06:01:52,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:52,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733229784] [2022-12-06 06:01:52,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:52,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:52,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:53,422 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 06:01:53,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:53,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733229784] [2022-12-06 06:01:53,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733229784] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:01:53,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:01:53,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 06:01:53,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871906575] [2022-12-06 06:01:53,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:01:53,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:01:53,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:53,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:01:53,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:01:53,424 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 70 [2022-12-06 06:01:53,424 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 74 transitions, 208 flow. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:53,424 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:53,424 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 70 [2022-12-06 06:01:53,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:53,932 INFO L130 PetriNetUnfolder]: 2401/3908 cut-off events. [2022-12-06 06:01:53,932 INFO L131 PetriNetUnfolder]: For 434/434 co-relation queries the response was YES. [2022-12-06 06:01:53,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8211 conditions, 3908 events. 2401/3908 cut-off events. For 434/434 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 19103 event pairs, 496 based on Foata normal form. 47/3071 useless extension candidates. Maximal degree in co-relation 5356. Up to 3180 conditions per place. [2022-12-06 06:01:53,945 INFO L137 encePairwiseOnDemand]: 59/70 looper letters, 127 selfloop transitions, 17 changer transitions 0/149 dead transitions. [2022-12-06 06:01:53,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 149 transitions, 669 flow [2022-12-06 06:01:53,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:01:53,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:01:53,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 178 transitions. [2022-12-06 06:01:53,946 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.363265306122449 [2022-12-06 06:01:53,946 INFO L175 Difference]: Start difference. First operand has 70 places, 74 transitions, 208 flow. Second operand 7 states and 178 transitions. [2022-12-06 06:01:53,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 149 transitions, 669 flow [2022-12-06 06:01:53,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 149 transitions, 655 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-06 06:01:53,950 INFO L231 Difference]: Finished difference. Result has 79 places, 86 transitions, 311 flow [2022-12-06 06:01:53,950 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=311, PETRI_PLACES=79, PETRI_TRANSITIONS=86} [2022-12-06 06:01:53,951 INFO L294 CegarLoopForPetriNet]: 69 programPoint places, 10 predicate places. [2022-12-06 06:01:53,951 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:53,951 INFO L89 Accepts]: Start accepts. Operand has 79 places, 86 transitions, 311 flow [2022-12-06 06:01:53,952 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:53,952 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:53,952 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 86 transitions, 311 flow [2022-12-06 06:01:53,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 86 transitions, 311 flow [2022-12-06 06:01:53,966 INFO L130 PetriNetUnfolder]: 52/288 cut-off events. [2022-12-06 06:01:53,966 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2022-12-06 06:01:53,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 392 conditions, 288 events. 52/288 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1437 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 295. Up to 16 conditions per place. [2022-12-06 06:01:53,968 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 86 transitions, 311 flow [2022-12-06 06:01:53,968 INFO L188 LiptonReduction]: Number of co-enabled transitions 2144 [2022-12-06 06:01:53,989 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1004] L981-3-->L1064-3: Formula: (and (= |v_#memory_int_1402| (store |v_#memory_int_1403| |v_ULTIMATE.start_main_~#id2~0#1.base_55| (store (select |v_#memory_int_1403| |v_ULTIMATE.start_main_~#id2~0#1.base_55|) |v_ULTIMATE.start_main_~#id2~0#1.offset_55| |v_ULTIMATE.start_main_#t~pre64#1_67|))) (= (select (select |v_#memory_int_1403| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_436|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_436|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_388|) (= |v_ULTIMATE.start_main_#t~pre64#1_67| |v_#pthreadsForks_44|) (= |v_#pthreadsForks_43| (+ |v_#pthreadsForks_44| 1))) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_55|, #pthreadsForks=|v_#pthreadsForks_44|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_436|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_436|, #memory_int=|v_#memory_int_1403|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_55|} OutVars{ULTIMATE.start_main_#t~pre62#1=|v_ULTIMATE.start_main_#t~pre62#1_45|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_55|, #pthreadsForks=|v_#pthreadsForks_43|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_436|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_436|, ULTIMATE.start_main_#t~pre64#1=|v_ULTIMATE.start_main_#t~pre64#1_67|, #memory_int=|v_#memory_int_1402|, t1Thread1of1ForFork0_enqueue_#t~mem39#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_388|, ULTIMATE.start_main_#t~nondet63#1=|v_ULTIMATE.start_main_#t~nondet63#1_29|, t1Thread1of1ForFork0_enqueue_#t~post38#1=|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_173|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_55|, t1Thread1of1ForFork0_enqueue_#t~mem37#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem37#1_197|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre62#1, #pthreadsForks, ULTIMATE.start_main_#t~pre64#1, #memory_int, t1Thread1of1ForFork0_enqueue_#t~mem39#1, ULTIMATE.start_main_#t~nondet63#1, t1Thread1of1ForFork0_enqueue_#t~post38#1, t1Thread1of1ForFork0_enqueue_#t~mem37#1] and [867] L982-1-->L988-1: Formula: (and (not (= 20 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_88|)) (= |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_37| (select (select |v_#memory_int_244| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_111|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_111|)))) InVars {t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_111|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_111|, #memory_int=|v_#memory_int_244|, t1Thread1of1ForFork0_enqueue_#t~mem39#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_88|} OutVars{t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_111|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_111|, #memory_int=|v_#memory_int_244|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_37|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1, t1Thread1of1ForFork0_enqueue_#t~mem39#1] [2022-12-06 06:01:54,048 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:01:54,049 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-06 06:01:54,049 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 86 transitions, 315 flow [2022-12-06 06:01:54,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:54,050 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:54,050 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:54,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:01:54,050 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:01:54,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:54,051 INFO L85 PathProgramCache]: Analyzing trace with hash 7846825, now seen corresponding path program 1 times [2022-12-06 06:01:54,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:54,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946805463] [2022-12-06 06:01:54,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:54,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:54,524 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 06:01:54,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:54,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946805463] [2022-12-06 06:01:54,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946805463] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:01:54,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:01:54,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 06:01:54,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620438692] [2022-12-06 06:01:54,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:01:54,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 06:01:54,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:54,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 06:01:54,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-06 06:01:54,525 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 71 [2022-12-06 06:01:54,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 86 transitions, 315 flow. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:54,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:54,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 71 [2022-12-06 06:01:54,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:54,984 INFO L130 PetriNetUnfolder]: 2370/3868 cut-off events. [2022-12-06 06:01:54,984 INFO L131 PetriNetUnfolder]: For 1013/1013 co-relation queries the response was YES. [2022-12-06 06:01:54,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8645 conditions, 3868 events. 2370/3868 cut-off events. For 1013/1013 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 19025 event pairs, 1416 based on Foata normal form. 0/2981 useless extension candidates. Maximal degree in co-relation 8214. Up to 3676 conditions per place. [2022-12-06 06:01:55,004 INFO L137 encePairwiseOnDemand]: 57/71 looper letters, 85 selfloop transitions, 18 changer transitions 0/108 dead transitions. [2022-12-06 06:01:55,005 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 108 transitions, 574 flow [2022-12-06 06:01:55,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 06:01:55,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 06:01:55,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2022-12-06 06:01:55,006 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2323943661971831 [2022-12-06 06:01:55,006 INFO L175 Difference]: Start difference. First operand has 79 places, 86 transitions, 315 flow. Second operand 8 states and 132 transitions. [2022-12-06 06:01:55,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 108 transitions, 574 flow [2022-12-06 06:01:55,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 108 transitions, 562 flow, removed 6 selfloop flow, removed 0 redundant places. [2022-12-06 06:01:55,011 INFO L231 Difference]: Finished difference. Result has 89 places, 95 transitions, 393 flow [2022-12-06 06:01:55,011 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=393, PETRI_PLACES=89, PETRI_TRANSITIONS=95} [2022-12-06 06:01:55,011 INFO L294 CegarLoopForPetriNet]: 69 programPoint places, 20 predicate places. [2022-12-06 06:01:55,012 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:55,012 INFO L89 Accepts]: Start accepts. Operand has 89 places, 95 transitions, 393 flow [2022-12-06 06:01:55,012 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:55,012 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:55,012 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 95 transitions, 393 flow [2022-12-06 06:01:55,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 95 transitions, 393 flow [2022-12-06 06:01:55,027 INFO L130 PetriNetUnfolder]: 59/300 cut-off events. [2022-12-06 06:01:55,027 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2022-12-06 06:01:55,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 300 events. 59/300 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1517 event pairs, 0 based on Foata normal form. 0/213 useless extension candidates. Maximal degree in co-relation 382. Up to 19 conditions per place. [2022-12-06 06:01:55,029 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 95 transitions, 393 flow [2022-12-06 06:01:55,029 INFO L188 LiptonReduction]: Number of co-enabled transitions 2126 [2022-12-06 06:01:55,047 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [942] L1014-->L960-1: Formula: (and (= |v_t1Thread1of1ForFork0_empty_~q#1.offset_15| |v_t1Thread1of1ForFork0_empty_#in~q#1.offset_9|) (= |v_t1Thread1of1ForFork0_empty_#t~mem31#1_41| (select (select |v_#memory_int_432| |v_t1Thread1of1ForFork0_empty_~q#1.base_15|) (+ 80 |v_t1Thread1of1ForFork0_empty_~q#1.offset_15|))) (= |v_t1Thread1of1ForFork0_empty_~q#1.base_15| |v_t1Thread1of1ForFork0_empty_#in~q#1.base_9|)) InVars {t1Thread1of1ForFork0_empty_#in~q#1.offset=|v_t1Thread1of1ForFork0_empty_#in~q#1.offset_9|, #memory_int=|v_#memory_int_432|, t1Thread1of1ForFork0_empty_#in~q#1.base=|v_t1Thread1of1ForFork0_empty_#in~q#1.base_9|} OutVars{t1Thread1of1ForFork0_empty_~q#1.offset=|v_t1Thread1of1ForFork0_empty_~q#1.offset_15|, t1Thread1of1ForFork0_empty_#in~q#1.offset=|v_t1Thread1of1ForFork0_empty_#in~q#1.offset_9|, t1Thread1of1ForFork0_empty_#t~nondet33#1=|v_t1Thread1of1ForFork0_empty_#t~nondet33#1_19|, t1Thread1of1ForFork0_empty_#t~mem32#1=|v_t1Thread1of1ForFork0_empty_#t~mem32#1_41|, t1Thread1of1ForFork0_empty_#t~mem31#1=|v_t1Thread1of1ForFork0_empty_#t~mem31#1_41|, #memory_int=|v_#memory_int_432|, t1Thread1of1ForFork0_empty_~q#1.base=|v_t1Thread1of1ForFork0_empty_~q#1.base_15|, t1Thread1of1ForFork0_empty_#in~q#1.base=|v_t1Thread1of1ForFork0_empty_#in~q#1.base_9|, t1Thread1of1ForFork0_empty_#res#1=|v_t1Thread1of1ForFork0_empty_#res#1_31|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_empty_~q#1.offset, t1Thread1of1ForFork0_empty_#t~nondet33#1, t1Thread1of1ForFork0_empty_#t~mem32#1, t1Thread1of1ForFork0_empty_#t~mem31#1, t1Thread1of1ForFork0_empty_~q#1.base, t1Thread1of1ForFork0_empty_#res#1] and [994] L1063-4-->L1064-3: Formula: (and (= |v_#memory_int_714| (store |v_#memory_int_715| |v_ULTIMATE.start_main_~#id2~0#1.base_37| (store (select |v_#memory_int_715| |v_ULTIMATE.start_main_~#id2~0#1.base_37|) |v_ULTIMATE.start_main_~#id2~0#1.offset_37| |v_ULTIMATE.start_main_#t~pre64#1_47|))) (= |v_ULTIMATE.start_main_#t~pre64#1_47| |v_#pthreadsForks_36|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1))) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_37|, #pthreadsForks=|v_#pthreadsForks_36|, #memory_int=|v_#memory_int_715|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_37|} OutVars{ULTIMATE.start_main_#t~pre62#1=|v_ULTIMATE.start_main_#t~pre62#1_37|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_37|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_#t~pre64#1=|v_ULTIMATE.start_main_#t~pre64#1_47|, #memory_int=|v_#memory_int_714|, ULTIMATE.start_main_#t~nondet63#1=|v_ULTIMATE.start_main_#t~nondet63#1_23|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre62#1, #pthreadsForks, ULTIMATE.start_main_#t~pre64#1, #memory_int, ULTIMATE.start_main_#t~nondet63#1] [2022-12-06 06:01:55,240 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1005] L981-3-->L988-1: Formula: (let ((.cse0 (select (select |v_#memory_int_1406| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_438|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_438|)))) (and (= .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_198|) (not (= .cse0 20)))) InVars {t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_438|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_438|, #memory_int=|v_#memory_int_1406|} OutVars{t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_438|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_438|, #memory_int=|v_#memory_int_1406|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_198|, t1Thread1of1ForFork0_enqueue_#t~mem39#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_390|, t1Thread1of1ForFork0_enqueue_#t~post38#1=|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_175|, t1Thread1of1ForFork0_enqueue_#t~mem37#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem37#1_199|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1, t1Thread1of1ForFork0_enqueue_#t~mem39#1, t1Thread1of1ForFork0_enqueue_#t~post38#1, t1Thread1of1ForFork0_enqueue_#t~mem37#1] and [994] L1063-4-->L1064-3: Formula: (and (= |v_#memory_int_714| (store |v_#memory_int_715| |v_ULTIMATE.start_main_~#id2~0#1.base_37| (store (select |v_#memory_int_715| |v_ULTIMATE.start_main_~#id2~0#1.base_37|) |v_ULTIMATE.start_main_~#id2~0#1.offset_37| |v_ULTIMATE.start_main_#t~pre64#1_47|))) (= |v_ULTIMATE.start_main_#t~pre64#1_47| |v_#pthreadsForks_36|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1))) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_37|, #pthreadsForks=|v_#pthreadsForks_36|, #memory_int=|v_#memory_int_715|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_37|} OutVars{ULTIMATE.start_main_#t~pre62#1=|v_ULTIMATE.start_main_#t~pre62#1_37|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_37|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_#t~pre64#1=|v_ULTIMATE.start_main_#t~pre64#1_47|, #memory_int=|v_#memory_int_714|, ULTIMATE.start_main_#t~nondet63#1=|v_ULTIMATE.start_main_#t~nondet63#1_23|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre62#1, #pthreadsForks, ULTIMATE.start_main_#t~pre64#1, #memory_int, ULTIMATE.start_main_#t~nondet63#1] [2022-12-06 06:01:55,311 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1012] L981-3-->L982-4: Formula: (let ((.cse0 (select |v_#memory_int_1755| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_578|)) (.cse1 (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_578|))) (let ((.cse2 (select .cse0 .cse1))) (and (= |v_#memory_int_1754| (store |v_#memory_int_1755| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_578| (store .cse0 .cse1 (+ .cse2 1)))) (not (= .cse2 20))))) InVars {t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_578|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_578|, #memory_int=|v_#memory_int_1755|} OutVars{t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_578|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_578|, t1Thread1of1ForFork0_enqueue_#t~post41#1=|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_201|, #memory_int=|v_#memory_int_1754|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_262|, t1Thread1of1ForFork0_enqueue_#t~mem39#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_454|, t1Thread1of1ForFork0_enqueue_#t~post38#1=|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_227|, t1Thread1of1ForFork0_enqueue_#t~mem37#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem37#1_251|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~post41#1, #memory_int, t1Thread1of1ForFork0_enqueue_#t~mem40#1, t1Thread1of1ForFork0_enqueue_#t~mem39#1, t1Thread1of1ForFork0_enqueue_#t~post38#1, t1Thread1of1ForFork0_enqueue_#t~mem37#1] and [994] L1063-4-->L1064-3: Formula: (and (= |v_#memory_int_714| (store |v_#memory_int_715| |v_ULTIMATE.start_main_~#id2~0#1.base_37| (store (select |v_#memory_int_715| |v_ULTIMATE.start_main_~#id2~0#1.base_37|) |v_ULTIMATE.start_main_~#id2~0#1.offset_37| |v_ULTIMATE.start_main_#t~pre64#1_47|))) (= |v_ULTIMATE.start_main_#t~pre64#1_47| |v_#pthreadsForks_36|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1))) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_37|, #pthreadsForks=|v_#pthreadsForks_36|, #memory_int=|v_#memory_int_715|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_37|} OutVars{ULTIMATE.start_main_#t~pre62#1=|v_ULTIMATE.start_main_#t~pre62#1_37|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_37|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_#t~pre64#1=|v_ULTIMATE.start_main_#t~pre64#1_47|, #memory_int=|v_#memory_int_714|, ULTIMATE.start_main_#t~nondet63#1=|v_ULTIMATE.start_main_#t~nondet63#1_23|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre62#1, #pthreadsForks, ULTIMATE.start_main_#t~pre64#1, #memory_int, ULTIMATE.start_main_#t~nondet63#1] [2022-12-06 06:01:55,341 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:01:55,342 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 330 [2022-12-06 06:01:55,342 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 92 transitions, 390 flow [2022-12-06 06:01:55,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:55,342 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:55,343 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:55,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:01:55,343 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:01:55,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:55,343 INFO L85 PathProgramCache]: Analyzing trace with hash 10617388, now seen corresponding path program 1 times [2022-12-06 06:01:55,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:55,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213681436] [2022-12-06 06:01:55,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:55,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:55,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:55,748 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 06:01:55,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:55,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213681436] [2022-12-06 06:01:55,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213681436] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:01:55,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:01:55,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 06:01:55,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101744953] [2022-12-06 06:01:55,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:01:55,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 06:01:55,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:55,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 06:01:55,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-06 06:01:55,756 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 76 [2022-12-06 06:01:55,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 92 transitions, 390 flow. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:55,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:55,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 76 [2022-12-06 06:01:55,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:56,668 INFO L130 PetriNetUnfolder]: 3554/5805 cut-off events. [2022-12-06 06:01:56,668 INFO L131 PetriNetUnfolder]: For 1173/1173 co-relation queries the response was YES. [2022-12-06 06:01:56,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13258 conditions, 5805 events. 3554/5805 cut-off events. For 1173/1173 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 33151 event pairs, 1021 based on Foata normal form. 0/4561 useless extension candidates. Maximal degree in co-relation 12725. Up to 3572 conditions per place. [2022-12-06 06:01:56,698 INFO L137 encePairwiseOnDemand]: 56/76 looper letters, 196 selfloop transitions, 36 changer transitions 6/243 dead transitions. [2022-12-06 06:01:56,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 243 transitions, 1258 flow [2022-12-06 06:01:56,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 06:01:56,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 06:01:56,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 284 transitions. [2022-12-06 06:01:56,700 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3397129186602871 [2022-12-06 06:01:56,700 INFO L175 Difference]: Start difference. First operand has 86 places, 92 transitions, 390 flow. Second operand 11 states and 284 transitions. [2022-12-06 06:01:56,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 243 transitions, 1258 flow [2022-12-06 06:01:56,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 243 transitions, 1210 flow, removed 22 selfloop flow, removed 3 redundant places. [2022-12-06 06:01:56,709 INFO L231 Difference]: Finished difference. Result has 99 places, 114 transitions, 590 flow [2022-12-06 06:01:56,709 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=590, PETRI_PLACES=99, PETRI_TRANSITIONS=114} [2022-12-06 06:01:56,709 INFO L294 CegarLoopForPetriNet]: 69 programPoint places, 30 predicate places. [2022-12-06 06:01:56,709 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:56,709 INFO L89 Accepts]: Start accepts. Operand has 99 places, 114 transitions, 590 flow [2022-12-06 06:01:56,710 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:56,710 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:56,710 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 114 transitions, 590 flow [2022-12-06 06:01:56,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 114 transitions, 590 flow [2022-12-06 06:01:56,735 INFO L130 PetriNetUnfolder]: 100/501 cut-off events. [2022-12-06 06:01:56,735 INFO L131 PetriNetUnfolder]: For 165/169 co-relation queries the response was YES. [2022-12-06 06:01:56,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 808 conditions, 501 events. 100/501 cut-off events. For 165/169 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3132 event pairs, 0 based on Foata normal form. 2/350 useless extension candidates. Maximal degree in co-relation 733. Up to 45 conditions per place. [2022-12-06 06:01:56,739 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 114 transitions, 590 flow [2022-12-06 06:01:56,739 INFO L188 LiptonReduction]: Number of co-enabled transitions 2500 [2022-12-06 06:01:56,814 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [942] L1014-->L960-1: Formula: (and (= |v_t1Thread1of1ForFork0_empty_~q#1.offset_15| |v_t1Thread1of1ForFork0_empty_#in~q#1.offset_9|) (= |v_t1Thread1of1ForFork0_empty_#t~mem31#1_41| (select (select |v_#memory_int_432| |v_t1Thread1of1ForFork0_empty_~q#1.base_15|) (+ 80 |v_t1Thread1of1ForFork0_empty_~q#1.offset_15|))) (= |v_t1Thread1of1ForFork0_empty_~q#1.base_15| |v_t1Thread1of1ForFork0_empty_#in~q#1.base_9|)) InVars {t1Thread1of1ForFork0_empty_#in~q#1.offset=|v_t1Thread1of1ForFork0_empty_#in~q#1.offset_9|, #memory_int=|v_#memory_int_432|, t1Thread1of1ForFork0_empty_#in~q#1.base=|v_t1Thread1of1ForFork0_empty_#in~q#1.base_9|} OutVars{t1Thread1of1ForFork0_empty_~q#1.offset=|v_t1Thread1of1ForFork0_empty_~q#1.offset_15|, t1Thread1of1ForFork0_empty_#in~q#1.offset=|v_t1Thread1of1ForFork0_empty_#in~q#1.offset_9|, t1Thread1of1ForFork0_empty_#t~nondet33#1=|v_t1Thread1of1ForFork0_empty_#t~nondet33#1_19|, t1Thread1of1ForFork0_empty_#t~mem32#1=|v_t1Thread1of1ForFork0_empty_#t~mem32#1_41|, t1Thread1of1ForFork0_empty_#t~mem31#1=|v_t1Thread1of1ForFork0_empty_#t~mem31#1_41|, #memory_int=|v_#memory_int_432|, t1Thread1of1ForFork0_empty_~q#1.base=|v_t1Thread1of1ForFork0_empty_~q#1.base_15|, t1Thread1of1ForFork0_empty_#in~q#1.base=|v_t1Thread1of1ForFork0_empty_#in~q#1.base_9|, t1Thread1of1ForFork0_empty_#res#1=|v_t1Thread1of1ForFork0_empty_#res#1_31|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_empty_~q#1.offset, t1Thread1of1ForFork0_empty_#t~nondet33#1, t1Thread1of1ForFork0_empty_#t~mem32#1, t1Thread1of1ForFork0_empty_#t~mem31#1, t1Thread1of1ForFork0_empty_~q#1.base, t1Thread1of1ForFork0_empty_#res#1] and [890] L996-1-->L996-4: Formula: (and (= (store |v_#memory_int_305| |v_t2Thread1of1ForFork1_dequeue_~q#1.base_69| (store (select |v_#memory_int_305| |v_t2Thread1of1ForFork1_dequeue_~q#1.base_69|) (+ |v_t2Thread1of1ForFork1_dequeue_~q#1.offset_69| 88) (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_19|))) |v_#memory_int_304|) (= |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_19| |v_t2Thread1of1ForFork1_dequeue_#t~mem44#1_20|)) InVars {t2Thread1of1ForFork1_dequeue_~q#1.base=|v_t2Thread1of1ForFork1_dequeue_~q#1.base_69|, t2Thread1of1ForFork1_dequeue_#t~mem44#1=|v_t2Thread1of1ForFork1_dequeue_#t~mem44#1_20|, #memory_int=|v_#memory_int_305|, t2Thread1of1ForFork1_dequeue_~q#1.offset=|v_t2Thread1of1ForFork1_dequeue_~q#1.offset_69|} OutVars{t2Thread1of1ForFork1_dequeue_#t~post45#1=|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_19|, t2Thread1of1ForFork1_dequeue_~q#1.base=|v_t2Thread1of1ForFork1_dequeue_~q#1.base_69|, #memory_int=|v_#memory_int_304|, t2Thread1of1ForFork1_dequeue_~q#1.offset=|v_t2Thread1of1ForFork1_dequeue_~q#1.offset_69|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_dequeue_#t~post45#1, t2Thread1of1ForFork1_dequeue_#t~mem44#1, #memory_int] [2022-12-06 06:01:56,926 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [942] L1014-->L960-1: Formula: (and (= |v_t1Thread1of1ForFork0_empty_~q#1.offset_15| |v_t1Thread1of1ForFork0_empty_#in~q#1.offset_9|) (= |v_t1Thread1of1ForFork0_empty_#t~mem31#1_41| (select (select |v_#memory_int_432| |v_t1Thread1of1ForFork0_empty_~q#1.base_15|) (+ 80 |v_t1Thread1of1ForFork0_empty_~q#1.offset_15|))) (= |v_t1Thread1of1ForFork0_empty_~q#1.base_15| |v_t1Thread1of1ForFork0_empty_#in~q#1.base_9|)) InVars {t1Thread1of1ForFork0_empty_#in~q#1.offset=|v_t1Thread1of1ForFork0_empty_#in~q#1.offset_9|, #memory_int=|v_#memory_int_432|, t1Thread1of1ForFork0_empty_#in~q#1.base=|v_t1Thread1of1ForFork0_empty_#in~q#1.base_9|} OutVars{t1Thread1of1ForFork0_empty_~q#1.offset=|v_t1Thread1of1ForFork0_empty_~q#1.offset_15|, t1Thread1of1ForFork0_empty_#in~q#1.offset=|v_t1Thread1of1ForFork0_empty_#in~q#1.offset_9|, t1Thread1of1ForFork0_empty_#t~nondet33#1=|v_t1Thread1of1ForFork0_empty_#t~nondet33#1_19|, t1Thread1of1ForFork0_empty_#t~mem32#1=|v_t1Thread1of1ForFork0_empty_#t~mem32#1_41|, t1Thread1of1ForFork0_empty_#t~mem31#1=|v_t1Thread1of1ForFork0_empty_#t~mem31#1_41|, #memory_int=|v_#memory_int_432|, t1Thread1of1ForFork0_empty_~q#1.base=|v_t1Thread1of1ForFork0_empty_~q#1.base_15|, t1Thread1of1ForFork0_empty_#in~q#1.base=|v_t1Thread1of1ForFork0_empty_#in~q#1.base_9|, t1Thread1of1ForFork0_empty_#res#1=|v_t1Thread1of1ForFork0_empty_#res#1_31|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_empty_~q#1.offset, t1Thread1of1ForFork0_empty_#t~nondet33#1, t1Thread1of1ForFork0_empty_#t~mem32#1, t1Thread1of1ForFork0_empty_#t~mem31#1, t1Thread1of1ForFork0_empty_~q#1.base, t1Thread1of1ForFork0_empty_#res#1] and [890] L996-1-->L996-4: Formula: (and (= (store |v_#memory_int_305| |v_t2Thread1of1ForFork1_dequeue_~q#1.base_69| (store (select |v_#memory_int_305| |v_t2Thread1of1ForFork1_dequeue_~q#1.base_69|) (+ |v_t2Thread1of1ForFork1_dequeue_~q#1.offset_69| 88) (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_19|))) |v_#memory_int_304|) (= |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_19| |v_t2Thread1of1ForFork1_dequeue_#t~mem44#1_20|)) InVars {t2Thread1of1ForFork1_dequeue_~q#1.base=|v_t2Thread1of1ForFork1_dequeue_~q#1.base_69|, t2Thread1of1ForFork1_dequeue_#t~mem44#1=|v_t2Thread1of1ForFork1_dequeue_#t~mem44#1_20|, #memory_int=|v_#memory_int_305|, t2Thread1of1ForFork1_dequeue_~q#1.offset=|v_t2Thread1of1ForFork1_dequeue_~q#1.offset_69|} OutVars{t2Thread1of1ForFork1_dequeue_#t~post45#1=|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_19|, t2Thread1of1ForFork1_dequeue_~q#1.base=|v_t2Thread1of1ForFork1_dequeue_~q#1.base_69|, #memory_int=|v_#memory_int_304|, t2Thread1of1ForFork1_dequeue_~q#1.offset=|v_t2Thread1of1ForFork1_dequeue_~q#1.offset_69|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_dequeue_#t~post45#1, t2Thread1of1ForFork1_dequeue_#t~mem44#1, #memory_int] [2022-12-06 06:01:57,080 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:01:57,081 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 372 [2022-12-06 06:01:57,081 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 112 transitions, 594 flow [2022-12-06 06:01:57,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:57,081 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:57,081 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:57,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:01:57,081 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:01:57,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:57,082 INFO L85 PathProgramCache]: Analyzing trace with hash 379906534, now seen corresponding path program 1 times [2022-12-06 06:01:57,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:57,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586266439] [2022-12-06 06:01:57,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:57,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:57,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:02:02,419 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 06:02:02,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:02:02,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586266439] [2022-12-06 06:02:02,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586266439] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:02:02,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:02:02,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:02:02,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260371687] [2022-12-06 06:02:02,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:02:02,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:02:02,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:02:02,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:02:02,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:02:02,421 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 82 [2022-12-06 06:02:02,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 112 transitions, 594 flow. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:02:02,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:02:02,422 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 82 [2022-12-06 06:02:02,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:02:08,002 INFO L130 PetriNetUnfolder]: 3478/5665 cut-off events. [2022-12-06 06:02:08,002 INFO L131 PetriNetUnfolder]: For 2227/2227 co-relation queries the response was YES. [2022-12-06 06:02:08,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13814 conditions, 5665 events. 3478/5665 cut-off events. For 2227/2227 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 31624 event pairs, 1584 based on Foata normal form. 0/4450 useless extension candidates. Maximal degree in co-relation 13272. Up to 4576 conditions per place. [2022-12-06 06:02:08,057 INFO L137 encePairwiseOnDemand]: 66/82 looper letters, 162 selfloop transitions, 23 changer transitions 4/194 dead transitions. [2022-12-06 06:02:08,057 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 194 transitions, 1188 flow [2022-12-06 06:02:08,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 06:02:08,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 06:02:08,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 211 transitions. [2022-12-06 06:02:08,060 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32164634146341464 [2022-12-06 06:02:08,060 INFO L175 Difference]: Start difference. First operand has 97 places, 112 transitions, 594 flow. Second operand 8 states and 211 transitions. [2022-12-06 06:02:08,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 194 transitions, 1188 flow [2022-12-06 06:02:08,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 194 transitions, 1119 flow, removed 28 selfloop flow, removed 4 redundant places. [2022-12-06 06:02:08,075 INFO L231 Difference]: Finished difference. Result has 103 places, 119 transitions, 642 flow [2022-12-06 06:02:08,075 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=642, PETRI_PLACES=103, PETRI_TRANSITIONS=119} [2022-12-06 06:02:08,077 INFO L294 CegarLoopForPetriNet]: 69 programPoint places, 34 predicate places. [2022-12-06 06:02:08,078 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:02:08,078 INFO L89 Accepts]: Start accepts. Operand has 103 places, 119 transitions, 642 flow [2022-12-06 06:02:08,079 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:02:08,079 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:02:08,079 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 119 transitions, 642 flow [2022-12-06 06:02:08,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 119 transitions, 642 flow [2022-12-06 06:02:08,129 INFO L130 PetriNetUnfolder]: 110/539 cut-off events. [2022-12-06 06:02:08,129 INFO L131 PetriNetUnfolder]: For 185/193 co-relation queries the response was YES. [2022-12-06 06:02:08,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 878 conditions, 539 events. 110/539 cut-off events. For 185/193 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3467 event pairs, 0 based on Foata normal form. 1/377 useless extension candidates. Maximal degree in co-relation 800. Up to 48 conditions per place. [2022-12-06 06:02:08,133 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 119 transitions, 642 flow [2022-12-06 06:02:08,134 INFO L188 LiptonReduction]: Number of co-enabled transitions 2540 [2022-12-06 06:02:08,176 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:02:08,177 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-06 06:02:08,177 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 119 transitions, 642 flow [2022-12-06 06:02:08,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:02:08,177 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:02:08,178 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:02:08,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:02:08,178 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:02:08,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:02:08,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1814691998, now seen corresponding path program 1 times [2022-12-06 06:02:08,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:02:08,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370144477] [2022-12-06 06:02:08,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:02:08,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:02:08,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:02:08,216 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 06:02:08,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:02:08,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370144477] [2022-12-06 06:02:08,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370144477] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:02:08,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:02:08,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:02:08,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415719027] [2022-12-06 06:02:08,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:02:08,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:02:08,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:02:08,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:02:08,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:02:08,217 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 82 [2022-12-06 06:02:08,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 119 transitions, 642 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:02:08,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:02:08,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 82 [2022-12-06 06:02:08,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:02:08,526 INFO L130 PetriNetUnfolder]: 2166/3688 cut-off events. [2022-12-06 06:02:08,526 INFO L131 PetriNetUnfolder]: For 1289/1289 co-relation queries the response was YES. [2022-12-06 06:02:08,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8484 conditions, 3688 events. 2166/3688 cut-off events. For 1289/1289 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 17492 event pairs, 1202 based on Foata normal form. 142/2874 useless extension candidates. Maximal degree in co-relation 8461. Up to 2067 conditions per place. [2022-12-06 06:02:08,546 INFO L137 encePairwiseOnDemand]: 78/82 looper letters, 99 selfloop transitions, 3 changer transitions 12/121 dead transitions. [2022-12-06 06:02:08,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 121 transitions, 761 flow [2022-12-06 06:02:08,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:02:08,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:02:08,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2022-12-06 06:02:08,547 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.483739837398374 [2022-12-06 06:02:08,547 INFO L175 Difference]: Start difference. First operand has 103 places, 119 transitions, 642 flow. Second operand 3 states and 119 transitions. [2022-12-06 06:02:08,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 121 transitions, 761 flow [2022-12-06 06:02:08,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 121 transitions, 696 flow, removed 2 selfloop flow, removed 13 redundant places. [2022-12-06 06:02:08,552 INFO L231 Difference]: Finished difference. Result has 92 places, 84 transitions, 376 flow [2022-12-06 06:02:08,553 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=376, PETRI_PLACES=92, PETRI_TRANSITIONS=84} [2022-12-06 06:02:08,553 INFO L294 CegarLoopForPetriNet]: 69 programPoint places, 23 predicate places. [2022-12-06 06:02:08,553 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:02:08,553 INFO L89 Accepts]: Start accepts. Operand has 92 places, 84 transitions, 376 flow [2022-12-06 06:02:08,554 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:02:08,554 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:02:08,554 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 84 transitions, 376 flow [2022-12-06 06:02:08,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 84 transitions, 376 flow [2022-12-06 06:02:08,569 INFO L130 PetriNetUnfolder]: 44/272 cut-off events. [2022-12-06 06:02:08,569 INFO L131 PetriNetUnfolder]: For 59/60 co-relation queries the response was YES. [2022-12-06 06:02:08,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 272 events. 44/272 cut-off events. For 59/60 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1074 event pairs, 1 based on Foata normal form. 1/192 useless extension candidates. Maximal degree in co-relation 383. Up to 18 conditions per place. [2022-12-06 06:02:08,572 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 84 transitions, 376 flow [2022-12-06 06:02:08,572 INFO L188 LiptonReduction]: Number of co-enabled transitions 1430 [2022-12-06 06:02:08,689 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1009] L1014-->L1064-3: Formula: (and (= |v_#memory_int_1696| (store |v_#memory_int_1697| |v_ULTIMATE.start_main_~#id2~0#1.base_117| (store (select |v_#memory_int_1697| |v_ULTIMATE.start_main_~#id2~0#1.base_117|) |v_ULTIMATE.start_main_~#id2~0#1.offset_105| |v_ULTIMATE.start_main_#t~pre64#1_121|))) (= |v_t1Thread1of1ForFork0_empty_#t~mem31#1_165| (select (select |v_#memory_int_1697| |v_t1Thread1of1ForFork0_empty_~q#1.base_95|) (+ 80 |v_t1Thread1of1ForFork0_empty_~q#1.offset_95|))) (= |v_ULTIMATE.start_main_#t~pre64#1_121| |v_#pthreadsForks_144|) (= |v_#pthreadsForks_143| (+ |v_#pthreadsForks_144| 1)) (= |v_t1Thread1of1ForFork0_empty_#in~q#1.offset_45| |v_t1Thread1of1ForFork0_empty_~q#1.offset_95|) (= |v_t1Thread1of1ForFork0_empty_#in~q#1.base_45| |v_t1Thread1of1ForFork0_empty_~q#1.base_95|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_105|, t1Thread1of1ForFork0_empty_#in~q#1.offset=|v_t1Thread1of1ForFork0_empty_#in~q#1.offset_45|, #pthreadsForks=|v_#pthreadsForks_144|, #memory_int=|v_#memory_int_1697|, t1Thread1of1ForFork0_empty_#in~q#1.base=|v_t1Thread1of1ForFork0_empty_#in~q#1.base_45|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_117|} OutVars{t1Thread1of1ForFork0_empty_~q#1.offset=|v_t1Thread1of1ForFork0_empty_~q#1.offset_95|, ULTIMATE.start_main_#t~pre62#1=|v_ULTIMATE.start_main_#t~pre62#1_95|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_105|, t1Thread1of1ForFork0_empty_#in~q#1.offset=|v_t1Thread1of1ForFork0_empty_#in~q#1.offset_45|, ULTIMATE.start_main_#t~pre64#1=|v_ULTIMATE.start_main_#t~pre64#1_121|, t1Thread1of1ForFork0_empty_#t~mem31#1=|v_t1Thread1of1ForFork0_empty_#t~mem31#1_165|, t1Thread1of1ForFork0_empty_~q#1.base=|v_t1Thread1of1ForFork0_empty_~q#1.base_95|, #pthreadsForks=|v_#pthreadsForks_143|, t1Thread1of1ForFork0_empty_#t~nondet33#1=|v_t1Thread1of1ForFork0_empty_#t~nondet33#1_111|, t1Thread1of1ForFork0_empty_#t~mem32#1=|v_t1Thread1of1ForFork0_empty_#t~mem32#1_127|, #memory_int=|v_#memory_int_1696|, t1Thread1of1ForFork0_empty_#in~q#1.base=|v_t1Thread1of1ForFork0_empty_#in~q#1.base_45|, ULTIMATE.start_main_#t~nondet63#1=|v_ULTIMATE.start_main_#t~nondet63#1_79|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_117|, t1Thread1of1ForFork0_empty_#res#1=|v_t1Thread1of1ForFork0_empty_#res#1_101|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_empty_~q#1.offset, ULTIMATE.start_main_#t~pre62#1, #pthreadsForks, t1Thread1of1ForFork0_empty_#t~nondet33#1, t1Thread1of1ForFork0_empty_#t~mem32#1, ULTIMATE.start_main_#t~pre64#1, t1Thread1of1ForFork0_empty_#t~mem31#1, #memory_int, t1Thread1of1ForFork0_empty_~q#1.base, ULTIMATE.start_main_#t~nondet63#1, t1Thread1of1ForFork0_empty_#res#1] and [995] L960-1-->L1014-3: Formula: (let ((.cse1 (= |v_t1Thread1of1ForFork0_#t~ret52#1_Out_12| |v_t1Thread1of1ForFork0_empty_#res#1_Out_16|)) (.cse0 (= |v_t1Thread1of1ForFork0_empty_#t~mem31#1_In_2| (select (select |v_#memory_int_In_64| |v_t1Thread1of1ForFork0_empty_~q#1.base_In_2|) (+ 84 |v_t1Thread1of1ForFork0_empty_~q#1.offset_In_2|))))) (or (and (= (+ |v_t1Thread1of1ForFork0_empty_#res#1_Out_16| 1) 0) .cse0 .cse1) (and .cse1 (not .cse0) (= |v_t1Thread1of1ForFork0_empty_#res#1_Out_16| 0) (= |v_t1Thread1of1ForFork0_empty_#t~nondet33#1_In_1| |v_t1Thread1of1ForFork0_empty_#t~nondet33#1_Out_10|)))) InVars {t1Thread1of1ForFork0_empty_~q#1.offset=|v_t1Thread1of1ForFork0_empty_~q#1.offset_In_2|, #memory_int=|v_#memory_int_In_64|, t1Thread1of1ForFork0_empty_~q#1.base=|v_t1Thread1of1ForFork0_empty_~q#1.base_In_2|, t1Thread1of1ForFork0_empty_#t~nondet33#1=|v_t1Thread1of1ForFork0_empty_#t~nondet33#1_In_1|, t1Thread1of1ForFork0_empty_#t~mem31#1=|v_t1Thread1of1ForFork0_empty_#t~mem31#1_In_2|} OutVars{t1Thread1of1ForFork0_empty_~q#1.offset=|v_t1Thread1of1ForFork0_empty_~q#1.offset_In_2|, t1Thread1of1ForFork0_empty_#t~nondet33#1=|v_t1Thread1of1ForFork0_empty_#t~nondet33#1_Out_10|, t1Thread1of1ForFork0_empty_#t~mem32#1=|v_t1Thread1of1ForFork0_empty_#t~mem32#1_Out_12|, t1Thread1of1ForFork0_#t~ret52#1=|v_t1Thread1of1ForFork0_#t~ret52#1_Out_12|, #memory_int=|v_#memory_int_In_64|, t1Thread1of1ForFork0_empty_~q#1.base=|v_t1Thread1of1ForFork0_empty_~q#1.base_In_2|, t1Thread1of1ForFork0_empty_#res#1=|v_t1Thread1of1ForFork0_empty_#res#1_Out_16|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_empty_#t~nondet33#1, t1Thread1of1ForFork0_empty_#t~mem32#1, t1Thread1of1ForFork0_#t~ret52#1, t1Thread1of1ForFork0_empty_#t~mem31#1, t1Thread1of1ForFork0_empty_#res#1] [2022-12-06 06:02:08,970 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 06:02:08,971 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 418 [2022-12-06 06:02:08,971 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 81 transitions, 379 flow [2022-12-06 06:02:08,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:02:08,971 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:02:08,971 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:02:08,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:02:08,971 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:02:08,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:02:08,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1929963409, now seen corresponding path program 1 times [2022-12-06 06:02:08,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:02:08,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778652028] [2022-12-06 06:02:08,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:02:08,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:02:08,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:02:14,327 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 06:02:14,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:02:14,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778652028] [2022-12-06 06:02:14,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778652028] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:02:14,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:02:14,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 06:02:14,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288725758] [2022-12-06 06:02:14,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:02:14,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 06:02:14,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:02:14,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 06:02:14,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-06 06:02:14,329 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 69 [2022-12-06 06:02:14,329 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 81 transitions, 379 flow. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:02:14,329 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:02:14,329 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 69 [2022-12-06 06:02:14,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:02:37,591 INFO L130 PetriNetUnfolder]: 2016/3425 cut-off events. [2022-12-06 06:02:37,600 INFO L131 PetriNetUnfolder]: For 871/871 co-relation queries the response was YES. [2022-12-06 06:02:37,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7684 conditions, 3425 events. 2016/3425 cut-off events. For 871/871 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 15949 event pairs, 1300 based on Foata normal form. 0/2631 useless extension candidates. Maximal degree in co-relation 6516. Up to 2783 conditions per place. [2022-12-06 06:02:37,644 INFO L137 encePairwiseOnDemand]: 52/69 looper letters, 105 selfloop transitions, 20 changer transitions 11/142 dead transitions. [2022-12-06 06:02:37,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 142 transitions, 789 flow [2022-12-06 06:02:37,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 06:02:37,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 06:02:37,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions. [2022-12-06 06:02:37,647 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2834138486312399 [2022-12-06 06:02:37,647 INFO L175 Difference]: Start difference. First operand has 82 places, 81 transitions, 379 flow. Second operand 9 states and 176 transitions. [2022-12-06 06:02:37,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 142 transitions, 789 flow [2022-12-06 06:02:37,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 142 transitions, 763 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-06 06:02:37,651 INFO L231 Difference]: Finished difference. Result has 88 places, 83 transitions, 414 flow [2022-12-06 06:02:37,653 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=414, PETRI_PLACES=88, PETRI_TRANSITIONS=83} [2022-12-06 06:02:37,655 INFO L294 CegarLoopForPetriNet]: 69 programPoint places, 19 predicate places. [2022-12-06 06:02:37,655 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:02:37,655 INFO L89 Accepts]: Start accepts. Operand has 88 places, 83 transitions, 414 flow [2022-12-06 06:02:37,657 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:02:37,657 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:02:37,658 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 83 transitions, 414 flow [2022-12-06 06:02:37,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 83 transitions, 414 flow [2022-12-06 06:02:37,697 INFO L130 PetriNetUnfolder]: 45/269 cut-off events. [2022-12-06 06:02:37,697 INFO L131 PetriNetUnfolder]: For 86/86 co-relation queries the response was YES. [2022-12-06 06:02:37,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 454 conditions, 269 events. 45/269 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1063 event pairs, 1 based on Foata normal form. 0/188 useless extension candidates. Maximal degree in co-relation 401. Up to 16 conditions per place. [2022-12-06 06:02:37,699 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 83 transitions, 414 flow [2022-12-06 06:02:37,699 INFO L188 LiptonReduction]: Number of co-enabled transitions 1380 [2022-12-06 06:02:37,749 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:02:37,750 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-06 06:02:37,750 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 82 transitions, 410 flow [2022-12-06 06:02:37,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:02:37,751 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:02:37,751 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:02:37,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:02:37,751 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:02:37,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:02:37,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1982797018, now seen corresponding path program 1 times [2022-12-06 06:02:37,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:02:37,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419923937] [2022-12-06 06:02:37,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:02:37,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:02:37,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:02:37,874 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 06:02:37,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:02:37,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419923937] [2022-12-06 06:02:37,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419923937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:02:37,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:02:37,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:02:37,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997175015] [2022-12-06 06:02:37,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:02:37,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:02:37,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:02:37,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:02:37,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:02:37,876 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 68 [2022-12-06 06:02:37,876 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 82 transitions, 410 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:02:37,876 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:02:37,876 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 68 [2022-12-06 06:02:37,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:02:38,127 INFO L130 PetriNetUnfolder]: 855/1614 cut-off events. [2022-12-06 06:02:38,127 INFO L131 PetriNetUnfolder]: For 557/557 co-relation queries the response was YES. [2022-12-06 06:02:38,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3828 conditions, 1614 events. 855/1614 cut-off events. For 557/557 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 7549 event pairs, 157 based on Foata normal form. 4/1357 useless extension candidates. Maximal degree in co-relation 3252. Up to 1215 conditions per place. [2022-12-06 06:02:38,133 INFO L137 encePairwiseOnDemand]: 60/68 looper letters, 70 selfloop transitions, 8 changer transitions 4/92 dead transitions. [2022-12-06 06:02:38,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 92 transitions, 614 flow [2022-12-06 06:02:38,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:02:38,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:02:38,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-12-06 06:02:38,144 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46568627450980393 [2022-12-06 06:02:38,144 INFO L175 Difference]: Start difference. First operand has 87 places, 82 transitions, 410 flow. Second operand 3 states and 95 transitions. [2022-12-06 06:02:38,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 92 transitions, 614 flow [2022-12-06 06:02:38,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 92 transitions, 585 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-12-06 06:02:38,147 INFO L231 Difference]: Finished difference. Result has 84 places, 79 transitions, 392 flow [2022-12-06 06:02:38,147 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=392, PETRI_PLACES=84, PETRI_TRANSITIONS=79} [2022-12-06 06:02:38,148 INFO L294 CegarLoopForPetriNet]: 69 programPoint places, 15 predicate places. [2022-12-06 06:02:38,148 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:02:38,148 INFO L89 Accepts]: Start accepts. Operand has 84 places, 79 transitions, 392 flow [2022-12-06 06:02:38,151 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:02:38,151 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:02:38,151 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 79 transitions, 392 flow [2022-12-06 06:02:38,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 79 transitions, 392 flow [2022-12-06 06:02:38,194 INFO L130 PetriNetUnfolder]: 50/281 cut-off events. [2022-12-06 06:02:38,194 INFO L131 PetriNetUnfolder]: For 80/80 co-relation queries the response was YES. [2022-12-06 06:02:38,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 529 conditions, 281 events. 50/281 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1259 event pairs, 1 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 427. Up to 51 conditions per place. [2022-12-06 06:02:38,196 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 79 transitions, 392 flow [2022-12-06 06:02:38,196 INFO L188 LiptonReduction]: Number of co-enabled transitions 622 [2022-12-06 06:02:39,707 INFO L203 LiptonReduction]: Total number of compositions: 15 [2022-12-06 06:02:39,707 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1559 [2022-12-06 06:02:39,707 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 68 transitions, 392 flow [2022-12-06 06:02:39,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:02:39,708 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:02:39,708 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:02:39,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:02:39,708 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:02:39,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:02:39,708 INFO L85 PathProgramCache]: Analyzing trace with hash -466979762, now seen corresponding path program 1 times [2022-12-06 06:02:39,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:02:39,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879927168] [2022-12-06 06:02:39,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:02:39,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:02:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:02:40,295 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 06:02:40,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:02:40,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879927168] [2022-12-06 06:02:40,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879927168] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:02:40,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:02:40,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 06:02:40,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451072473] [2022-12-06 06:02:40,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:02:40,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 06:02:40,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:02:40,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 06:02:40,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-06 06:02:40,297 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 55 [2022-12-06 06:02:40,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 68 transitions, 392 flow. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:02:40,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:02:40,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 55 [2022-12-06 06:02:40,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:02:40,681 INFO L130 PetriNetUnfolder]: 737/1377 cut-off events. [2022-12-06 06:02:40,681 INFO L131 PetriNetUnfolder]: For 627/627 co-relation queries the response was YES. [2022-12-06 06:02:40,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3582 conditions, 1377 events. 737/1377 cut-off events. For 627/627 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 6521 event pairs, 128 based on Foata normal form. 0/1307 useless extension candidates. Maximal degree in co-relation 2996. Up to 839 conditions per place. [2022-12-06 06:02:40,686 INFO L137 encePairwiseOnDemand]: 34/55 looper letters, 88 selfloop transitions, 30 changer transitions 14/135 dead transitions. [2022-12-06 06:02:40,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 135 transitions, 852 flow [2022-12-06 06:02:40,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 06:02:40,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 06:02:40,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 157 transitions. [2022-12-06 06:02:40,688 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25950413223140495 [2022-12-06 06:02:40,689 INFO L175 Difference]: Start difference. First operand has 71 places, 68 transitions, 392 flow. Second operand 11 states and 157 transitions. [2022-12-06 06:02:40,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 135 transitions, 852 flow [2022-12-06 06:02:40,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 135 transitions, 828 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:02:40,692 INFO L231 Difference]: Finished difference. Result has 85 places, 81 transitions, 541 flow [2022-12-06 06:02:40,693 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=541, PETRI_PLACES=85, PETRI_TRANSITIONS=81} [2022-12-06 06:02:40,693 INFO L294 CegarLoopForPetriNet]: 69 programPoint places, 16 predicate places. [2022-12-06 06:02:40,693 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:02:40,693 INFO L89 Accepts]: Start accepts. Operand has 85 places, 81 transitions, 541 flow [2022-12-06 06:02:40,694 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:02:40,694 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:02:40,694 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 81 transitions, 541 flow [2022-12-06 06:02:40,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 81 transitions, 541 flow [2022-12-06 06:02:40,711 INFO L130 PetriNetUnfolder]: 54/258 cut-off events. [2022-12-06 06:02:40,711 INFO L131 PetriNetUnfolder]: For 191/191 co-relation queries the response was YES. [2022-12-06 06:02:40,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 621 conditions, 258 events. 54/258 cut-off events. For 191/191 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1165 event pairs, 1 based on Foata normal form. 0/241 useless extension candidates. Maximal degree in co-relation 536. Up to 33 conditions per place. [2022-12-06 06:02:40,713 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 81 transitions, 541 flow [2022-12-06 06:02:40,713 INFO L188 LiptonReduction]: Number of co-enabled transitions 500 [2022-12-06 06:02:40,789 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [994] L1063-4-->L1064-3: Formula: (and (= |v_#memory_int_714| (store |v_#memory_int_715| |v_ULTIMATE.start_main_~#id2~0#1.base_37| (store (select |v_#memory_int_715| |v_ULTIMATE.start_main_~#id2~0#1.base_37|) |v_ULTIMATE.start_main_~#id2~0#1.offset_37| |v_ULTIMATE.start_main_#t~pre64#1_47|))) (= |v_ULTIMATE.start_main_#t~pre64#1_47| |v_#pthreadsForks_36|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1))) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_37|, #pthreadsForks=|v_#pthreadsForks_36|, #memory_int=|v_#memory_int_715|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_37|} OutVars{ULTIMATE.start_main_#t~pre62#1=|v_ULTIMATE.start_main_#t~pre62#1_37|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_37|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_#t~pre64#1=|v_ULTIMATE.start_main_#t~pre64#1_47|, #memory_int=|v_#memory_int_714|, ULTIMATE.start_main_#t~nondet63#1=|v_ULTIMATE.start_main_#t~nondet63#1_23|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre62#1, #pthreadsForks, ULTIMATE.start_main_#t~pre64#1, #memory_int, ULTIMATE.start_main_#t~nondet63#1] and [872] L982-6-->L988-6: Formula: (and (not (= 20 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_92|)) (= |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_39| (select (select |v_#memory_int_250| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_113|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_113|)))) InVars {t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_113|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_113|, #memory_int=|v_#memory_int_250|, t1Thread1of1ForFork0_enqueue_#t~mem39#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_92|} OutVars{t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_113|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_113|, #memory_int=|v_#memory_int_250|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_39|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1, t1Thread1of1ForFork0_enqueue_#t~mem39#1] [2022-12-06 06:02:40,838 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [803] L981-9-->L982-6: Formula: (= (select (select |v_#memory_int_100| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_53|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_53|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_39|) InVars {t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_53|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_53|, #memory_int=|v_#memory_int_100|} OutVars{t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_53|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_53|, #memory_int=|v_#memory_int_100|, t1Thread1of1ForFork0_enqueue_#t~mem39#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_39|, t1Thread1of1ForFork0_enqueue_#t~post38#1=|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_25|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem39#1, t1Thread1of1ForFork0_enqueue_#t~post38#1] and [1055] L1063-4-->L988-6: Formula: (and (= (select (select |v_#memory_int_2320| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_790|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_790|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_423|) (= |v_ULTIMATE.start_main_#t~pre64#1_206| |v_#pthreadsForks_230|) (= (+ |v_#pthreadsForks_230| 1) |v_#pthreadsForks_229|) (not (= 20 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_516|)) (= |v_#memory_int_2320| (store |v_#memory_int_2321| |v_ULTIMATE.start_main_~#id2~0#1.base_225| (store (select |v_#memory_int_2321| |v_ULTIMATE.start_main_~#id2~0#1.base_225|) |v_ULTIMATE.start_main_~#id2~0#1.offset_156| |v_ULTIMATE.start_main_#t~pre64#1_206|)))) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_156|, #pthreadsForks=|v_#pthreadsForks_230|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_790|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_790|, #memory_int=|v_#memory_int_2321|, t1Thread1of1ForFork0_enqueue_#t~mem39#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_516|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_225|} OutVars{ULTIMATE.start_main_#t~pre62#1=|v_ULTIMATE.start_main_#t~pre62#1_138|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_156|, #pthreadsForks=|v_#pthreadsForks_229|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_790|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_790|, ULTIMATE.start_main_#t~pre64#1=|v_ULTIMATE.start_main_#t~pre64#1_206|, #memory_int=|v_#memory_int_2320|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_423|, ULTIMATE.start_main_#t~nondet63#1=|v_ULTIMATE.start_main_#t~nondet63#1_122|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_225|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre62#1, #pthreadsForks, ULTIMATE.start_main_#t~pre64#1, #memory_int, t1Thread1of1ForFork0_enqueue_#t~mem40#1, t1Thread1of1ForFork0_enqueue_#t~mem39#1, ULTIMATE.start_main_#t~nondet63#1] [2022-12-06 06:02:40,915 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 06:02:40,916 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 223 [2022-12-06 06:02:40,916 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 77 transitions, 535 flow [2022-12-06 06:02:40,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:02:40,916 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:02:40,916 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:02:40,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:02:40,916 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:02:40,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:02:40,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1843455556, now seen corresponding path program 1 times [2022-12-06 06:02:40,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:02:40,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693032939] [2022-12-06 06:02:40,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:02:40,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:02:40,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:02:41,676 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 06:02:41,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:02:41,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693032939] [2022-12-06 06:02:41,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693032939] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:02:41,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:02:41,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 06:02:41,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936440010] [2022-12-06 06:02:41,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:02:41,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 06:02:41,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:02:41,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 06:02:41,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-06 06:02:41,677 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 53 [2022-12-06 06:02:41,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 77 transitions, 535 flow. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:02:41,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:02:41,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 53 [2022-12-06 06:02:41,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:02:42,382 INFO L130 PetriNetUnfolder]: 522/999 cut-off events. [2022-12-06 06:02:42,383 INFO L131 PetriNetUnfolder]: For 705/705 co-relation queries the response was YES. [2022-12-06 06:02:42,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3018 conditions, 999 events. 522/999 cut-off events. For 705/705 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4533 event pairs, 198 based on Foata normal form. 0/970 useless extension candidates. Maximal degree in co-relation 2554. Up to 595 conditions per place. [2022-12-06 06:02:42,388 INFO L137 encePairwiseOnDemand]: 33/53 looper letters, 84 selfloop transitions, 28 changer transitions 6/120 dead transitions. [2022-12-06 06:02:42,388 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 120 transitions, 912 flow [2022-12-06 06:02:42,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 06:02:42,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 06:02:42,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2022-12-06 06:02:42,389 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22452830188679246 [2022-12-06 06:02:42,390 INFO L175 Difference]: Start difference. First operand has 80 places, 77 transitions, 535 flow. Second operand 10 states and 119 transitions. [2022-12-06 06:02:42,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 120 transitions, 912 flow [2022-12-06 06:02:42,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 120 transitions, 868 flow, removed 11 selfloop flow, removed 5 redundant places. [2022-12-06 06:02:42,395 INFO L231 Difference]: Finished difference. Result has 88 places, 82 transitions, 613 flow [2022-12-06 06:02:42,395 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=613, PETRI_PLACES=88, PETRI_TRANSITIONS=82} [2022-12-06 06:02:42,395 INFO L294 CegarLoopForPetriNet]: 69 programPoint places, 19 predicate places. [2022-12-06 06:02:42,395 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:02:42,395 INFO L89 Accepts]: Start accepts. Operand has 88 places, 82 transitions, 613 flow [2022-12-06 06:02:42,396 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:02:42,396 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:02:42,396 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 82 transitions, 613 flow [2022-12-06 06:02:42,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 82 transitions, 613 flow [2022-12-06 06:02:42,416 INFO L130 PetriNetUnfolder]: 56/255 cut-off events. [2022-12-06 06:02:42,417 INFO L131 PetriNetUnfolder]: For 261/261 co-relation queries the response was YES. [2022-12-06 06:02:42,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 707 conditions, 255 events. 56/255 cut-off events. For 261/261 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1231 event pairs, 0 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 584. Up to 42 conditions per place. [2022-12-06 06:02:42,419 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 82 transitions, 613 flow [2022-12-06 06:02:42,419 INFO L188 LiptonReduction]: Number of co-enabled transitions 494 [2022-12-06 06:02:42,442 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:02:42,443 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48 [2022-12-06 06:02:42,443 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 81 transitions, 607 flow [2022-12-06 06:02:42,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:02:42,443 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:02:42,444 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:02:42,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:02:42,444 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:02:42,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:02:42,444 INFO L85 PathProgramCache]: Analyzing trace with hash 389204572, now seen corresponding path program 1 times [2022-12-06 06:02:42,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:02:42,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833661262] [2022-12-06 06:02:42,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:02:42,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:02:42,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:02:43,945 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 06:02:43,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:02:43,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833661262] [2022-12-06 06:02:43,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833661262] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:02:43,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:02:43,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-06 06:02:43,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929660104] [2022-12-06 06:02:43,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:02:43,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 06:02:43,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:02:43,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 06:02:43,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-12-06 06:02:43,947 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-06 06:02:43,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 81 transitions, 607 flow. Second operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 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 06:02:43,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:02:43,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-06 06:02:43,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:02:45,275 INFO L130 PetriNetUnfolder]: 1244/2163 cut-off events. [2022-12-06 06:02:45,275 INFO L131 PetriNetUnfolder]: For 1741/1741 co-relation queries the response was YES. [2022-12-06 06:02:45,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6515 conditions, 2163 events. 1244/2163 cut-off events. For 1741/1741 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 10868 event pairs, 373 based on Foata normal form. 16/2042 useless extension candidates. Maximal degree in co-relation 5668. Up to 1319 conditions per place. [2022-12-06 06:02:45,285 INFO L137 encePairwiseOnDemand]: 29/54 looper letters, 134 selfloop transitions, 46 changer transitions 44/224 dead transitions. [2022-12-06 06:02:45,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 224 transitions, 1662 flow [2022-12-06 06:02:45,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 06:02:45,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 06:02:45,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 190 transitions. [2022-12-06 06:02:45,287 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.18518518518518517 [2022-12-06 06:02:45,287 INFO L175 Difference]: Start difference. First operand has 86 places, 81 transitions, 607 flow. Second operand 19 states and 190 transitions. [2022-12-06 06:02:45,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 224 transitions, 1662 flow [2022-12-06 06:02:45,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 224 transitions, 1596 flow, removed 15 selfloop flow, removed 7 redundant places. [2022-12-06 06:02:45,297 INFO L231 Difference]: Finished difference. Result has 109 places, 114 transitions, 975 flow [2022-12-06 06:02:45,297 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=975, PETRI_PLACES=109, PETRI_TRANSITIONS=114} [2022-12-06 06:02:45,297 INFO L294 CegarLoopForPetriNet]: 69 programPoint places, 40 predicate places. [2022-12-06 06:02:45,297 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:02:45,297 INFO L89 Accepts]: Start accepts. Operand has 109 places, 114 transitions, 975 flow [2022-12-06 06:02:45,298 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:02:45,298 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:02:45,298 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 114 transitions, 975 flow [2022-12-06 06:02:45,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 114 transitions, 975 flow [2022-12-06 06:02:45,328 INFO L130 PetriNetUnfolder]: 107/410 cut-off events. [2022-12-06 06:02:45,329 INFO L131 PetriNetUnfolder]: For 807/815 co-relation queries the response was YES. [2022-12-06 06:02:45,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1403 conditions, 410 events. 107/410 cut-off events. For 807/815 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2366 event pairs, 5 based on Foata normal form. 0/389 useless extension candidates. Maximal degree in co-relation 1354. Up to 72 conditions per place. [2022-12-06 06:02:45,332 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 114 transitions, 975 flow [2022-12-06 06:02:45,332 INFO L188 LiptonReduction]: Number of co-enabled transitions 516 [2022-12-06 06:02:45,335 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [920] $Ultimate##0-->L1037-6: Formula: (and (= |v_t2Thread1of1ForFork1_#in~arg#1.base_7| |v_t2Thread1of1ForFork1_~arg#1.base_7|) (= |v_t2Thread1of1ForFork1_~i~1#1_63| 0) (= |v_t2Thread1of1ForFork1_~arg#1.offset_7| |v_t2Thread1of1ForFork1_#in~arg#1.offset_7|)) InVars {t2Thread1of1ForFork1_#in~arg#1.base=|v_t2Thread1of1ForFork1_#in~arg#1.base_7|, t2Thread1of1ForFork1_#in~arg#1.offset=|v_t2Thread1of1ForFork1_#in~arg#1.offset_7|} OutVars{t2Thread1of1ForFork1_~arg#1.base=|v_t2Thread1of1ForFork1_~arg#1.base_7|, t2Thread1of1ForFork1_~arg#1.offset=|v_t2Thread1of1ForFork1_~arg#1.offset_7|, t2Thread1of1ForFork1_#in~arg#1.base=|v_t2Thread1of1ForFork1_#in~arg#1.base_7|, t2Thread1of1ForFork1_#in~arg#1.offset=|v_t2Thread1of1ForFork1_#in~arg#1.offset_7|, t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_63|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_~arg#1.base, t2Thread1of1ForFork1_~arg#1.offset, t2Thread1of1ForFork1_~i~1#1] and [1043] L1025-1-->L1018-6: Formula: (and (= v_~dequeue_flag~0_255 1) (= v_~enqueue_flag~0_175 0) (= (store |v_#pthreadsMutex_468| |v_~#m~0.base_221| (store (select |v_#pthreadsMutex_468| |v_~#m~0.base_221|) |v_~#m~0.offset_221| 0)) |v_#pthreadsMutex_467|) (= |v_t1Thread1of1ForFork0_~i~0#1_233| (+ |v_t1Thread1of1ForFork0_~i~0#1_234| 1))) InVars {#pthreadsMutex=|v_#pthreadsMutex_468|, ~#m~0.base=|v_~#m~0.base_221|, t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_234|, ~#m~0.offset=|v_~#m~0.offset_221|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_467|, ~#m~0.base=|v_~#m~0.base_221|, t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_233|, ~#m~0.offset=|v_~#m~0.offset_221|, ~dequeue_flag~0=v_~dequeue_flag~0_255, ~enqueue_flag~0=v_~enqueue_flag~0_175, t1Thread1of1ForFork0_#t~post53#1=|v_t1Thread1of1ForFork0_#t~post53#1_27|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork0_~i~0#1, ~dequeue_flag~0, ~enqueue_flag~0, t1Thread1of1ForFork0_#t~post53#1] [2022-12-06 06:02:45,458 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [997] L1018-6-->t1EXIT: Formula: (and (= |v_t1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< |v_t1Thread1of1ForFork0_~i~0#1_In_4| 19)) (= |v_t1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_In_4|} OutVars{t1Thread1of1ForFork0_#res#1.offset=|v_t1Thread1of1ForFork0_#res#1.offset_Out_4|, t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_In_4|, t1Thread1of1ForFork0_#res#1.base=|v_t1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_#res#1.offset, t1Thread1of1ForFork0_#res#1.base] and [1059] L1037-6-->L1037-6: Formula: (let ((.cse0 (select |v_#pthreadsMutex_535| |v_~#m~0.base_253|))) (and (= (select .cse0 |v_~#m~0.offset_253|) 0) (= (store |v_#pthreadsMutex_535| |v_~#m~0.base_253| (store .cse0 |v_~#m~0.offset_253| 0)) |v_#pthreadsMutex_533|) (= 0 (mod v_~dequeue_flag~0_273 256)) (= |v_t2Thread1of1ForFork1_~i~1#1_222| (+ |v_t2Thread1of1ForFork1_~i~1#1_223| 1)) (< |v_t2Thread1of1ForFork1_~i~1#1_223| 20))) InVars {#pthreadsMutex=|v_#pthreadsMutex_535|, ~#m~0.base=|v_~#m~0.base_253|, ~#m~0.offset=|v_~#m~0.offset_253|, ~dequeue_flag~0=v_~dequeue_flag~0_273, t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_223|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_533|, ~#m~0.base=|v_~#m~0.base_253|, ~#m~0.offset=|v_~#m~0.offset_253|, ~dequeue_flag~0=v_~dequeue_flag~0_273, t2Thread1of1ForFork1_#t~nondet58#1=|v_t2Thread1of1ForFork1_#t~nondet58#1_100|, t2Thread1of1ForFork1_#t~post57#1=|v_t2Thread1of1ForFork1_#t~post57#1_55|, t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_222|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~nondet58#1, t2Thread1of1ForFork1_#t~post57#1, t2Thread1of1ForFork1_~i~1#1] [2022-12-06 06:02:45,591 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 06:02:45,592 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 295 [2022-12-06 06:02:45,592 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 111 transitions, 971 flow [2022-12-06 06:02:45,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 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 06:02:45,592 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:02:45,592 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:02:45,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:02:45,592 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:02:45,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:02:45,593 INFO L85 PathProgramCache]: Analyzing trace with hash -588858020, now seen corresponding path program 1 times [2022-12-06 06:02:45,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:02:45,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324998144] [2022-12-06 06:02:45,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:02:45,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:02:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:02:47,914 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 06:02:47,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:02:47,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324998144] [2022-12-06 06:02:47,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324998144] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:02:47,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:02:47,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-06 06:02:47,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213393660] [2022-12-06 06:02:47,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:02:47,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 06:02:47,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:02:47,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 06:02:47,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-12-06 06:02:47,916 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-06 06:02:47,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 111 transitions, 971 flow. Second operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 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 06:02:47,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:02:47,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-06 06:02:47,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:02:51,467 INFO L130 PetriNetUnfolder]: 1017/1820 cut-off events. [2022-12-06 06:02:51,467 INFO L131 PetriNetUnfolder]: For 3890/3890 co-relation queries the response was YES. [2022-12-06 06:02:51,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7225 conditions, 1820 events. 1017/1820 cut-off events. For 3890/3890 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 9205 event pairs, 291 based on Foata normal form. 26/1782 useless extension candidates. Maximal degree in co-relation 7121. Up to 1081 conditions per place. [2022-12-06 06:02:51,508 INFO L137 encePairwiseOnDemand]: 24/57 looper letters, 157 selfloop transitions, 83 changer transitions 17/257 dead transitions. [2022-12-06 06:02:51,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 257 transitions, 2391 flow [2022-12-06 06:02:51,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 06:02:51,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 06:02:51,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 208 transitions. [2022-12-06 06:02:51,514 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16586921850079744 [2022-12-06 06:02:51,514 INFO L175 Difference]: Start difference. First operand has 103 places, 111 transitions, 971 flow. Second operand 22 states and 208 transitions. [2022-12-06 06:02:51,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 257 transitions, 2391 flow [2022-12-06 06:02:51,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 257 transitions, 2226 flow, removed 75 selfloop flow, removed 5 redundant places. [2022-12-06 06:02:51,556 INFO L231 Difference]: Finished difference. Result has 130 places, 160 transitions, 1586 flow [2022-12-06 06:02:51,556 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=900, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1586, PETRI_PLACES=130, PETRI_TRANSITIONS=160} [2022-12-06 06:02:51,557 INFO L294 CegarLoopForPetriNet]: 69 programPoint places, 61 predicate places. [2022-12-06 06:02:51,557 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:02:51,557 INFO L89 Accepts]: Start accepts. Operand has 130 places, 160 transitions, 1586 flow [2022-12-06 06:02:51,560 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:02:51,560 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:02:51,560 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 160 transitions, 1586 flow [2022-12-06 06:02:51,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 160 transitions, 1586 flow [2022-12-06 06:02:51,617 INFO L130 PetriNetUnfolder]: 154/504 cut-off events. [2022-12-06 06:02:51,617 INFO L131 PetriNetUnfolder]: For 1715/1721 co-relation queries the response was YES. [2022-12-06 06:02:51,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2058 conditions, 504 events. 154/504 cut-off events. For 1715/1721 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2925 event pairs, 5 based on Foata normal form. 1/489 useless extension candidates. Maximal degree in co-relation 1975. Up to 103 conditions per place. [2022-12-06 06:02:51,621 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 160 transitions, 1586 flow [2022-12-06 06:02:51,621 INFO L188 LiptonReduction]: Number of co-enabled transitions 652 [2022-12-06 06:02:51,632 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [920] $Ultimate##0-->L1037-6: Formula: (and (= |v_t2Thread1of1ForFork1_#in~arg#1.base_7| |v_t2Thread1of1ForFork1_~arg#1.base_7|) (= |v_t2Thread1of1ForFork1_~i~1#1_63| 0) (= |v_t2Thread1of1ForFork1_~arg#1.offset_7| |v_t2Thread1of1ForFork1_#in~arg#1.offset_7|)) InVars {t2Thread1of1ForFork1_#in~arg#1.base=|v_t2Thread1of1ForFork1_#in~arg#1.base_7|, t2Thread1of1ForFork1_#in~arg#1.offset=|v_t2Thread1of1ForFork1_#in~arg#1.offset_7|} OutVars{t2Thread1of1ForFork1_~arg#1.base=|v_t2Thread1of1ForFork1_~arg#1.base_7|, t2Thread1of1ForFork1_~arg#1.offset=|v_t2Thread1of1ForFork1_~arg#1.offset_7|, t2Thread1of1ForFork1_#in~arg#1.base=|v_t2Thread1of1ForFork1_#in~arg#1.base_7|, t2Thread1of1ForFork1_#in~arg#1.offset=|v_t2Thread1of1ForFork1_#in~arg#1.offset_7|, t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_63|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_~arg#1.base, t2Thread1of1ForFork1_~arg#1.offset, t2Thread1of1ForFork1_~i~1#1] and [1052] $Ultimate##0-->L981: Formula: (let ((.cse1 (select |v_#pthreadsMutex_514| |v_~#m~0.base_243|))) (and (= |v_#memory_int_2308| (store |v_#memory_int_2309| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_784| (let ((.cse0 (select |v_#memory_int_2309| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_784|))) (store .cse0 (+ (* (select .cse0 (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_784|)) 4) |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_784|) |v_t1Thread1of1ForFork0_enqueue_~x#1_214|)))) (= |v_t1Thread1of1ForFork0_~value~0#1_257| |v_t1Thread1of1ForFork0_enqueue_#in~x#1_89|) (= |v_t1Thread1of1ForFork0_~value~0#1_257| |v_t1Thread1of1ForFork0_#t~nondet50#1_60|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_89| |v_~#queue~0.base_335|) (= |v_t1Thread1of1ForFork0_enqueue_~q#1.base_784| |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_89|) (<= |v_t1Thread1of1ForFork0_#t~nondet50#1_60| 2147483647) (= (store |v_#pthreadsMutex_514| |v_~#m~0.base_243| (store .cse1 |v_~#m~0.offset_243| 1)) |v_#pthreadsMutex_513|) (= |v_t1Thread1of1ForFork0_#in~arg#1.offset_35| |v_t1Thread1of1ForFork0_~arg#1.offset_35|) (= |v_t1Thread1of1ForFork0_~arg#1.base_35| |v_t1Thread1of1ForFork0_#in~arg#1.base_35|) (= (select .cse1 |v_~#m~0.offset_243|) 0) (<= 0 (+ |v_t1Thread1of1ForFork0_#t~nondet50#1_60| 2147483648)) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_89| |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_784|) (= |v_t1Thread1of1ForFork0_enqueue_~x#1_214| |v_t1Thread1of1ForFork0_enqueue_#in~x#1_89|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_89| |v_~#queue~0.offset_332|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_514|, ~#m~0.base=|v_~#m~0.base_243|, ~#queue~0.base=|v_~#queue~0.base_335|, t1Thread1of1ForFork0_#t~nondet50#1=|v_t1Thread1of1ForFork0_#t~nondet50#1_60|, ~#m~0.offset=|v_~#m~0.offset_243|, #memory_int=|v_#memory_int_2309|, ~#queue~0.offset=|v_~#queue~0.offset_332|, t1Thread1of1ForFork0_#in~arg#1.offset=|v_t1Thread1of1ForFork0_#in~arg#1.offset_35|, t1Thread1of1ForFork0_#in~arg#1.base=|v_t1Thread1of1ForFork0_#in~arg#1.base_35|} OutVars{t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_249|, t1Thread1of1ForFork0_~arg#1.offset=|v_t1Thread1of1ForFork0_~arg#1.offset_35|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_784|, t1Thread1of1ForFork0_~value~0#1=|v_t1Thread1of1ForFork0_~value~0#1_257|, t1Thread1of1ForFork0_enqueue_#in~q#1.base=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_89|, ~#queue~0.base=|v_~#queue~0.base_335|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_784|, t1Thread1of1ForFork0_enqueue_#in~x#1=|v_t1Thread1of1ForFork0_enqueue_#in~x#1_89|, t1Thread1of1ForFork0_enqueue_#res#1=|v_t1Thread1of1ForFork0_enqueue_#res#1_329|, ~#queue~0.offset=|v_~#queue~0.offset_332|, t1Thread1of1ForFork0_~arg#1.base=|v_t1Thread1of1ForFork0_~arg#1.base_35|, t1Thread1of1ForFork0_enqueue_#t~mem39#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_509|, #pthreadsMutex=|v_#pthreadsMutex_513|, t1Thread1of1ForFork0_enqueue_#t~post41#1=|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_292|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_417|, t1Thread1of1ForFork0_#in~arg#1.base=|v_t1Thread1of1ForFork0_#in~arg#1.base_35|, t1Thread1of1ForFork0_enqueue_#t~mem36#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_340|, ~#m~0.base=|v_~#m~0.base_243|, ~#m~0.offset=|v_~#m~0.offset_243|, t1Thread1of1ForFork0_#t~nondet49#1=|v_t1Thread1of1ForFork0_#t~nondet49#1_65|, #memory_int=|v_#memory_int_2308|, t1Thread1of1ForFork0_enqueue_~x#1=|v_t1Thread1of1ForFork0_enqueue_~x#1_214|, t1Thread1of1ForFork0_enqueue_#in~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_89|, t1Thread1of1ForFork0_enqueue_#t~post38#1=|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_292|, t1Thread1of1ForFork0_#in~arg#1.offset=|v_t1Thread1of1ForFork0_#in~arg#1.offset_35|, t1Thread1of1ForFork0_enqueue_#t~mem37#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem37#1_296|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork0_~i~0#1, t1Thread1of1ForFork0_~arg#1.offset, t1Thread1of1ForFork0_enqueue_~q#1.base, t1Thread1of1ForFork0_~value~0#1, t1Thread1of1ForFork0_enqueue_#t~post41#1, t1Thread1of1ForFork0_enqueue_#t~mem40#1, t1Thread1of1ForFork0_enqueue_#t~mem36#1, t1Thread1of1ForFork0_enqueue_#in~q#1.base, t1Thread1of1ForFork0_#t~nondet50#1, t1Thread1of1ForFork0_enqueue_~q#1.offset, t1Thread1of1ForFork0_enqueue_#in~x#1, t1Thread1of1ForFork0_#t~nondet49#1, t1Thread1of1ForFork0_enqueue_#res#1, t1Thread1of1ForFork0_~arg#1.base, #memory_int, t1Thread1of1ForFork0_enqueue_~x#1, t1Thread1of1ForFork0_enqueue_#t~mem39#1, t1Thread1of1ForFork0_enqueue_#in~q#1.offset, t1Thread1of1ForFork0_enqueue_#t~post38#1, t1Thread1of1ForFork0_enqueue_#t~mem37#1] [2022-12-06 06:02:51,813 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [920] $Ultimate##0-->L1037-6: Formula: (and (= |v_t2Thread1of1ForFork1_#in~arg#1.base_7| |v_t2Thread1of1ForFork1_~arg#1.base_7|) (= |v_t2Thread1of1ForFork1_~i~1#1_63| 0) (= |v_t2Thread1of1ForFork1_~arg#1.offset_7| |v_t2Thread1of1ForFork1_#in~arg#1.offset_7|)) InVars {t2Thread1of1ForFork1_#in~arg#1.base=|v_t2Thread1of1ForFork1_#in~arg#1.base_7|, t2Thread1of1ForFork1_#in~arg#1.offset=|v_t2Thread1of1ForFork1_#in~arg#1.offset_7|} OutVars{t2Thread1of1ForFork1_~arg#1.base=|v_t2Thread1of1ForFork1_~arg#1.base_7|, t2Thread1of1ForFork1_~arg#1.offset=|v_t2Thread1of1ForFork1_~arg#1.offset_7|, t2Thread1of1ForFork1_#in~arg#1.base=|v_t2Thread1of1ForFork1_#in~arg#1.base_7|, t2Thread1of1ForFork1_#in~arg#1.offset=|v_t2Thread1of1ForFork1_#in~arg#1.offset_7|, t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_63|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_~arg#1.base, t2Thread1of1ForFork1_~arg#1.offset, t2Thread1of1ForFork1_~i~1#1] and [840] L980-1-->L981: Formula: (= (store |v_#memory_int_179| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_87| (store (select |v_#memory_int_179| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_87|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_34|) |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_87|) |v_t1Thread1of1ForFork0_enqueue_~x#1_27|)) |v_#memory_int_178|) InVars {t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_87|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_87|, #memory_int=|v_#memory_int_179|, t1Thread1of1ForFork0_enqueue_~x#1=|v_t1Thread1of1ForFork0_enqueue_~x#1_27|, t1Thread1of1ForFork0_enqueue_#t~mem36#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_34|} OutVars{t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_87|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_87|, #memory_int=|v_#memory_int_178|, t1Thread1of1ForFork0_enqueue_~x#1=|v_t1Thread1of1ForFork0_enqueue_~x#1_27|} AuxVars[] AssignedVars[#memory_int, t1Thread1of1ForFork0_enqueue_#t~mem36#1] [2022-12-06 06:02:51,854 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [920] $Ultimate##0-->L1037-6: Formula: (and (= |v_t2Thread1of1ForFork1_#in~arg#1.base_7| |v_t2Thread1of1ForFork1_~arg#1.base_7|) (= |v_t2Thread1of1ForFork1_~i~1#1_63| 0) (= |v_t2Thread1of1ForFork1_~arg#1.offset_7| |v_t2Thread1of1ForFork1_#in~arg#1.offset_7|)) InVars {t2Thread1of1ForFork1_#in~arg#1.base=|v_t2Thread1of1ForFork1_#in~arg#1.base_7|, t2Thread1of1ForFork1_#in~arg#1.offset=|v_t2Thread1of1ForFork1_#in~arg#1.offset_7|} OutVars{t2Thread1of1ForFork1_~arg#1.base=|v_t2Thread1of1ForFork1_~arg#1.base_7|, t2Thread1of1ForFork1_~arg#1.offset=|v_t2Thread1of1ForFork1_~arg#1.offset_7|, t2Thread1of1ForFork1_#in~arg#1.base=|v_t2Thread1of1ForFork1_#in~arg#1.base_7|, t2Thread1of1ForFork1_#in~arg#1.offset=|v_t2Thread1of1ForFork1_#in~arg#1.offset_7|, t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_63|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_~arg#1.base, t2Thread1of1ForFork1_~arg#1.offset, t2Thread1of1ForFork1_~i~1#1] and [1044] L1018-6-->L1018-6: Formula: (let ((.cse0 (select |v_#pthreadsMutex_473| |v_~#m~0.base_223|))) (and (= (mod v_~enqueue_flag~0_177 256) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_238| 19) (= |v_t1Thread1of1ForFork0_~i~0#1_237| (+ |v_t1Thread1of1ForFork0_~i~0#1_238| 1)) (= (store |v_#pthreadsMutex_473| |v_~#m~0.base_223| (store .cse0 |v_~#m~0.offset_223| 0)) |v_#pthreadsMutex_471|) (= 0 (select .cse0 |v_~#m~0.offset_223|)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_473|, ~#m~0.base=|v_~#m~0.base_223|, t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_238|, ~#m~0.offset=|v_~#m~0.offset_223|, ~enqueue_flag~0=v_~enqueue_flag~0_177} OutVars{#pthreadsMutex=|v_#pthreadsMutex_471|, ~#m~0.base=|v_~#m~0.base_223|, t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_237|, ~#m~0.offset=|v_~#m~0.offset_223|, ~enqueue_flag~0=v_~enqueue_flag~0_177, t1Thread1of1ForFork0_#t~post53#1=|v_t1Thread1of1ForFork0_#t~post53#1_29|, t1Thread1of1ForFork0_#t~nondet54#1=|v_t1Thread1of1ForFork0_#t~nondet54#1_103|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork0_~i~0#1, t1Thread1of1ForFork0_#t~post53#1, t1Thread1of1ForFork0_#t~nondet54#1] [2022-12-06 06:02:51,900 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [920] $Ultimate##0-->L1037-6: Formula: (and (= |v_t2Thread1of1ForFork1_#in~arg#1.base_7| |v_t2Thread1of1ForFork1_~arg#1.base_7|) (= |v_t2Thread1of1ForFork1_~i~1#1_63| 0) (= |v_t2Thread1of1ForFork1_~arg#1.offset_7| |v_t2Thread1of1ForFork1_#in~arg#1.offset_7|)) InVars {t2Thread1of1ForFork1_#in~arg#1.base=|v_t2Thread1of1ForFork1_#in~arg#1.base_7|, t2Thread1of1ForFork1_#in~arg#1.offset=|v_t2Thread1of1ForFork1_#in~arg#1.offset_7|} OutVars{t2Thread1of1ForFork1_~arg#1.base=|v_t2Thread1of1ForFork1_~arg#1.base_7|, t2Thread1of1ForFork1_~arg#1.offset=|v_t2Thread1of1ForFork1_~arg#1.offset_7|, t2Thread1of1ForFork1_#in~arg#1.base=|v_t2Thread1of1ForFork1_#in~arg#1.base_7|, t2Thread1of1ForFork1_#in~arg#1.offset=|v_t2Thread1of1ForFork1_#in~arg#1.offset_7|, t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_63|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_~arg#1.base, t2Thread1of1ForFork1_~arg#1.offset, t2Thread1of1ForFork1_~i~1#1] and [1053] L1018-6-->L980-4: Formula: (let ((.cse0 (select |v_#pthreadsMutex_518| |v_~#m~0.base_245|))) (and (= |v_t1Thread1of1ForFork0_enqueue_~q#1.base_786| |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_91|) (<= |v_t1Thread1of1ForFork0_#t~nondet55#1_94| 2147483647) (= (select .cse0 |v_~#m~0.offset_245|) 0) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_91| |v_~#queue~0.base_337|) (<= 0 (+ |v_t1Thread1of1ForFork0_#t~nondet55#1_94| 2147483648)) (= |v_t1Thread1of1ForFork0_enqueue_~x#1_216| |v_t1Thread1of1ForFork0_enqueue_#in~x#1_91|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_91| |v_~#queue~0.offset_334|) (= |v_t1Thread1of1ForFork0_~value~0#1_259| |v_t1Thread1of1ForFork0_#t~nondet55#1_94|) (= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_342| (select (select |v_#memory_int_2312| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_786|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_786|))) (< |v_t1Thread1of1ForFork0_~i~0#1_251| 19) (= |v_t1Thread1of1ForFork0_~value~0#1_259| |v_t1Thread1of1ForFork0_enqueue_#in~x#1_91|) (not (= (mod v_~enqueue_flag~0_183 256) 0)) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_91| |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_786|) (= (store |v_#pthreadsMutex_518| |v_~#m~0.base_245| (store .cse0 |v_~#m~0.offset_245| 1)) |v_#pthreadsMutex_517|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_518|, ~#m~0.base=|v_~#m~0.base_245|, ~#queue~0.base=|v_~#queue~0.base_337|, t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_251|, ~enqueue_flag~0=v_~enqueue_flag~0_183, ~#m~0.offset=|v_~#m~0.offset_245|, #memory_int=|v_#memory_int_2312|, ~#queue~0.offset=|v_~#queue~0.offset_334|, t1Thread1of1ForFork0_#t~nondet55#1=|v_t1Thread1of1ForFork0_#t~nondet55#1_94|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_517|, t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_251|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_786|, t1Thread1of1ForFork0_~value~0#1=|v_t1Thread1of1ForFork0_~value~0#1_259|, t1Thread1of1ForFork0_enqueue_#t~post41#1=|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_294|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_419|, t1Thread1of1ForFork0_enqueue_#t~mem36#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_342|, t1Thread1of1ForFork0_enqueue_#in~q#1.base=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_91|, ~#m~0.base=|v_~#m~0.base_245|, ~#queue~0.base=|v_~#queue~0.base_337|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_786|, t1Thread1of1ForFork0_enqueue_#in~x#1=|v_t1Thread1of1ForFork0_enqueue_#in~x#1_91|, ~enqueue_flag~0=v_~enqueue_flag~0_183, ~#m~0.offset=|v_~#m~0.offset_245|, #memory_int=|v_#memory_int_2312|, t1Thread1of1ForFork0_enqueue_~x#1=|v_t1Thread1of1ForFork0_enqueue_~x#1_216|, t1Thread1of1ForFork0_enqueue_#res#1=|v_t1Thread1of1ForFork0_enqueue_#res#1_331|, ~#queue~0.offset=|v_~#queue~0.offset_334|, t1Thread1of1ForFork0_enqueue_#t~mem39#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_511|, t1Thread1of1ForFork0_enqueue_#in~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_91|, t1Thread1of1ForFork0_enqueue_#t~post38#1=|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_294|, t1Thread1of1ForFork0_enqueue_#t~mem37#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem37#1_298|, t1Thread1of1ForFork0_#t~nondet54#1=|v_t1Thread1of1ForFork0_#t~nondet54#1_105|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork0_enqueue_~q#1.base, t1Thread1of1ForFork0_~value~0#1, t1Thread1of1ForFork0_enqueue_#t~post41#1, t1Thread1of1ForFork0_enqueue_#t~mem40#1, t1Thread1of1ForFork0_enqueue_#t~mem36#1, t1Thread1of1ForFork0_#t~nondet55#1, t1Thread1of1ForFork0_enqueue_#in~q#1.base, t1Thread1of1ForFork0_enqueue_~q#1.offset, t1Thread1of1ForFork0_enqueue_#in~x#1, t1Thread1of1ForFork0_enqueue_~x#1, t1Thread1of1ForFork0_enqueue_#res#1, t1Thread1of1ForFork0_enqueue_#t~mem39#1, t1Thread1of1ForFork0_enqueue_#in~q#1.offset, t1Thread1of1ForFork0_enqueue_#t~post38#1, t1Thread1of1ForFork0_enqueue_#t~mem37#1, t1Thread1of1ForFork0_#t~nondet54#1] [2022-12-06 06:02:52,060 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:02:52,061 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 504 [2022-12-06 06:02:52,061 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 159 transitions, 1602 flow [2022-12-06 06:02:52,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 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 06:02:52,061 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:02:52,061 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:02:52,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 06:02:52,061 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:02:52,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:02:52,061 INFO L85 PathProgramCache]: Analyzing trace with hash -2131712196, now seen corresponding path program 2 times [2022-12-06 06:02:52,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:02:52,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414537616] [2022-12-06 06:02:52,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:02:52,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:02:52,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2022-12-06 06:12:05,962 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 06:12:05,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 06:12:05,969 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkResolutionNode(Interpolator.java:275) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:152) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:260) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:237) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:848) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:776) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:352) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:284) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:165) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:327) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:350) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) 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 06:12:05,991 INFO L158 Benchmark]: Toolchain (without parser) took 628420.38ms. Allocated memory was 180.4MB in the beginning and 3.3GB in the end (delta: 3.1GB). Free memory was 154.5MB in the beginning and 366.6MB in the end (delta: -212.1MB). Peak memory consumption was 4.1GB. Max. memory is 8.0GB. [2022-12-06 06:12:05,991 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 180.4MB. Free memory is still 156.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:12:05,992 INFO L158 Benchmark]: CACSL2BoogieTranslator took 685.42ms. Allocated memory is still 180.4MB. Free memory was 154.1MB in the beginning and 124.0MB in the end (delta: 30.1MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-12-06 06:12:05,992 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.22ms. Allocated memory is still 180.4MB. Free memory was 124.0MB in the beginning and 121.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 06:12:05,992 INFO L158 Benchmark]: Boogie Preprocessor took 26.84ms. Allocated memory is still 180.4MB. Free memory was 121.0MB in the beginning and 118.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:12:05,992 INFO L158 Benchmark]: RCFGBuilder took 601.64ms. Allocated memory was 180.4MB in the beginning and 217.1MB in the end (delta: 36.7MB). Free memory was 118.4MB in the beginning and 173.3MB in the end (delta: -54.9MB). Peak memory consumption was 6.7MB. Max. memory is 8.0GB. [2022-12-06 06:12:05,992 INFO L158 Benchmark]: TraceAbstraction took 627034.86ms. Allocated memory was 217.1MB in the beginning and 3.3GB in the end (delta: 3.1GB). Free memory was 172.8MB in the beginning and 366.6MB in the end (delta: -193.7MB). Peak memory consumption was 4.1GB. Max. memory is 8.0GB. [2022-12-06 06:12:05,993 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.11ms. Allocated memory is still 180.4MB. Free memory is still 156.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 685.42ms. Allocated memory is still 180.4MB. Free memory was 154.1MB in the beginning and 124.0MB in the end (delta: 30.1MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.22ms. Allocated memory is still 180.4MB. Free memory was 124.0MB in the beginning and 121.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.84ms. Allocated memory is still 180.4MB. Free memory was 121.0MB in the beginning and 118.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 601.64ms. Allocated memory was 180.4MB in the beginning and 217.1MB in the end (delta: 36.7MB). Free memory was 118.4MB in the beginning and 173.3MB in the end (delta: -54.9MB). Peak memory consumption was 6.7MB. Max. memory is 8.0GB. * TraceAbstraction took 627034.86ms. Allocated memory was 217.1MB in the beginning and 3.3GB in the end (delta: 3.1GB). Free memory was 172.8MB in the beginning and 366.6MB in the end (delta: -193.7MB). Peak memory consumption was 4.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.3s, 245 PlacesBefore, 69 PlacesAfterwards, 253 TransitionsBefore, 75 TransitionsAfterwards, 15600 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 7 ConcurrentSequentialCompositions, 65 TrivialYvCompositions, 123 ConcurrentYvCompositions, 5 ChoiceCompositions, 200 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11916, independent: 11615, independent conditional: 11615, independent unconditional: 0, dependent: 301, dependent conditional: 301, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11916, independent: 11615, independent conditional: 0, independent unconditional: 11615, dependent: 301, dependent conditional: 0, dependent unconditional: 301, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11916, independent: 11615, independent conditional: 0, independent unconditional: 11615, dependent: 301, dependent conditional: 0, dependent unconditional: 301, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11916, independent: 11615, independent conditional: 0, independent unconditional: 11615, dependent: 301, dependent conditional: 0, dependent unconditional: 301, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9707, independent: 9566, independent conditional: 0, independent unconditional: 9566, dependent: 141, dependent conditional: 0, dependent unconditional: 141, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9707, independent: 9526, independent conditional: 0, independent unconditional: 9526, dependent: 181, dependent conditional: 0, dependent unconditional: 181, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 181, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 141, dependent conditional: 0, dependent unconditional: 141, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 279, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 239, dependent conditional: 0, dependent unconditional: 239, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11916, independent: 2049, independent conditional: 0, independent unconditional: 2049, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 9707, unknown conditional: 0, unknown unconditional: 9707] , Statistics on independence cache: Total cache size (in pairs): 16947, Positive cache size: 16806, Positive conditional cache size: 0, Positive unconditional cache size: 16806, Negative cache size: 141, Negative conditional cache size: 0, Negative unconditional cache size: 141, 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, 62 PlacesBefore, 61 PlacesAfterwards, 67 TransitionsBefore, 66 TransitionsAfterwards, 1998 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 802, independent: 617, independent conditional: 617, independent unconditional: 0, dependent: 185, dependent conditional: 185, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 802, independent: 617, independent conditional: 0, independent unconditional: 617, dependent: 185, dependent conditional: 0, dependent unconditional: 185, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 802, independent: 617, independent conditional: 0, independent unconditional: 617, dependent: 185, dependent conditional: 0, dependent unconditional: 185, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 802, independent: 617, independent conditional: 0, independent unconditional: 617, dependent: 185, dependent conditional: 0, dependent unconditional: 185, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 319, independent: 245, independent conditional: 0, independent unconditional: 245, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 319, independent: 236, independent conditional: 0, independent unconditional: 236, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 83, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 94, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 802, independent: 372, independent conditional: 0, independent unconditional: 372, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 319, unknown conditional: 0, unknown unconditional: 319] , Statistics on independence cache: Total cache size (in pairs): 321, Positive cache size: 247, Positive conditional cache size: 0, Positive unconditional cache size: 247, Negative cache size: 74, Negative conditional cache size: 0, Negative unconditional cache size: 74, 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, 72 PlacesBefore, 70 PlacesAfterwards, 76 TransitionsBefore, 74 TransitionsAfterwards, 1984 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 971, independent: 798, independent conditional: 798, independent unconditional: 0, dependent: 173, dependent conditional: 173, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 971, independent: 798, independent conditional: 7, independent unconditional: 791, dependent: 173, dependent conditional: 2, dependent unconditional: 171, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 971, independent: 798, independent conditional: 7, independent unconditional: 791, dependent: 173, dependent conditional: 2, dependent unconditional: 171, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 971, independent: 798, independent conditional: 7, independent unconditional: 791, dependent: 173, dependent conditional: 2, dependent unconditional: 171, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 159, independent: 108, independent conditional: 0, independent unconditional: 108, dependent: 51, dependent conditional: 1, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 159, independent: 106, independent conditional: 0, independent unconditional: 106, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 53, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 51, dependent conditional: 1, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 59, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 58, dependent conditional: 1, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 971, independent: 690, independent conditional: 7, independent unconditional: 683, dependent: 122, dependent conditional: 1, dependent unconditional: 121, unknown: 159, unknown conditional: 1, unknown unconditional: 158] , Statistics on independence cache: Total cache size (in pairs): 484, Positive cache size: 359, Positive conditional cache size: 0, Positive unconditional cache size: 359, Negative cache size: 125, Negative conditional cache size: 1, Negative unconditional cache size: 124, 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, 79 PlacesBefore, 79 PlacesAfterwards, 86 TransitionsBefore, 86 TransitionsAfterwards, 2144 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1165, independent: 991, independent conditional: 991, independent unconditional: 0, dependent: 174, dependent conditional: 174, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1165, independent: 991, independent conditional: 71, independent unconditional: 920, dependent: 174, dependent conditional: 22, dependent unconditional: 152, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1165, independent: 991, independent conditional: 71, independent unconditional: 920, dependent: 174, dependent conditional: 22, dependent unconditional: 152, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1165, independent: 991, independent conditional: 71, independent unconditional: 920, dependent: 174, dependent conditional: 22, dependent unconditional: 152, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 236, independent: 193, independent conditional: 23, independent unconditional: 170, dependent: 43, dependent conditional: 6, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 236, independent: 189, independent conditional: 0, independent unconditional: 189, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 47, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 43, dependent conditional: 6, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 47, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 42, dependent conditional: 7, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1165, independent: 798, independent conditional: 48, independent unconditional: 750, dependent: 131, dependent conditional: 16, dependent unconditional: 115, unknown: 236, unknown conditional: 29, unknown unconditional: 207] , Statistics on independence cache: Total cache size (in pairs): 720, Positive cache size: 552, Positive conditional cache size: 23, Positive unconditional cache size: 529, Negative cache size: 168, Negative conditional cache size: 7, Negative unconditional cache size: 161, 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, 86 PlacesAfterwards, 95 TransitionsBefore, 92 TransitionsAfterwards, 2126 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1010, independent: 848, independent conditional: 848, independent unconditional: 0, dependent: 162, dependent conditional: 162, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1010, independent: 848, independent conditional: 39, independent unconditional: 809, dependent: 162, dependent conditional: 3, dependent unconditional: 159, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1013, independent: 848, independent conditional: 39, independent unconditional: 809, dependent: 165, dependent conditional: 6, dependent unconditional: 159, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1013, independent: 848, independent conditional: 39, independent unconditional: 809, dependent: 165, dependent conditional: 6, dependent unconditional: 159, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 86, independent: 60, independent conditional: 5, independent unconditional: 55, dependent: 26, dependent conditional: 2, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 86, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 28, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 26, dependent conditional: 2, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 40, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 39, dependent conditional: 10, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1013, independent: 788, independent conditional: 34, independent unconditional: 754, dependent: 139, dependent conditional: 4, dependent unconditional: 135, unknown: 86, unknown conditional: 7, unknown unconditional: 79] , Statistics on independence cache: Total cache size (in pairs): 827, Positive cache size: 633, Positive conditional cache size: 28, Positive unconditional cache size: 605, Negative cache size: 194, Negative conditional cache size: 9, Negative unconditional cache size: 185, 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, 99 PlacesBefore, 97 PlacesAfterwards, 114 TransitionsBefore, 112 TransitionsAfterwards, 2500 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1483, independent: 1283, independent conditional: 1283, independent unconditional: 0, dependent: 200, dependent conditional: 200, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1483, independent: 1283, independent conditional: 205, independent unconditional: 1078, dependent: 200, dependent conditional: 42, dependent unconditional: 158, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1527, independent: 1283, independent conditional: 205, independent unconditional: 1078, dependent: 244, dependent conditional: 86, dependent unconditional: 158, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1527, independent: 1283, independent conditional: 205, independent unconditional: 1078, dependent: 244, dependent conditional: 86, dependent unconditional: 158, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 68, independent: 51, independent conditional: 30, independent unconditional: 21, dependent: 17, dependent conditional: 9, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 68, independent: 49, independent conditional: 0, independent unconditional: 49, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 19, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 17, dependent conditional: 9, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 22, dependent conditional: 13, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1527, independent: 1232, independent conditional: 175, independent unconditional: 1057, dependent: 227, dependent conditional: 77, dependent unconditional: 150, unknown: 68, unknown conditional: 39, unknown unconditional: 29] , Statistics on independence cache: Total cache size (in pairs): 934, Positive cache size: 723, Positive conditional cache size: 58, Positive unconditional cache size: 665, Negative cache size: 211, Negative conditional cache size: 18, Negative unconditional cache size: 193, 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, 103 PlacesBefore, 103 PlacesAfterwards, 119 TransitionsBefore, 119 TransitionsAfterwards, 2540 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 739, independent: 639, independent conditional: 639, independent unconditional: 0, dependent: 100, dependent conditional: 100, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 739, independent: 639, independent conditional: 82, independent unconditional: 557, dependent: 100, dependent conditional: 26, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 783, independent: 639, independent conditional: 82, independent unconditional: 557, dependent: 144, dependent conditional: 70, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 783, independent: 639, independent conditional: 82, independent unconditional: 557, dependent: 144, dependent conditional: 70, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, independent: 11, independent conditional: 6, independent unconditional: 5, dependent: 14, dependent conditional: 6, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 17, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 14, dependent conditional: 6, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 36, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 28, dependent conditional: 16, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 783, independent: 628, independent conditional: 76, independent unconditional: 552, dependent: 130, dependent conditional: 64, dependent unconditional: 66, unknown: 25, unknown conditional: 12, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 959, Positive cache size: 734, Positive conditional cache size: 64, Positive unconditional cache size: 670, Negative cache size: 225, Negative conditional cache size: 24, Negative unconditional cache size: 201, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 85 PlacesBefore, 82 PlacesAfterwards, 84 TransitionsBefore, 81 TransitionsAfterwards, 1430 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1358, independent: 1130, independent conditional: 1130, independent unconditional: 0, dependent: 228, dependent conditional: 228, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1358, independent: 1130, independent conditional: 179, independent unconditional: 951, dependent: 228, dependent conditional: 49, dependent unconditional: 179, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1373, independent: 1130, independent conditional: 179, independent unconditional: 951, dependent: 243, dependent conditional: 64, dependent unconditional: 179, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1373, independent: 1130, independent conditional: 179, independent unconditional: 951, dependent: 243, dependent conditional: 64, dependent unconditional: 179, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 115, independent: 89, independent conditional: 34, independent unconditional: 55, dependent: 26, dependent conditional: 11, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 115, independent: 89, independent conditional: 0, independent unconditional: 89, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 26, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 26, dependent conditional: 11, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 46, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 46, dependent conditional: 27, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1373, independent: 1041, independent conditional: 145, independent unconditional: 896, dependent: 217, dependent conditional: 53, dependent unconditional: 164, unknown: 115, unknown conditional: 45, unknown unconditional: 70] , Statistics on independence cache: Total cache size (in pairs): 1129, Positive cache size: 878, Positive conditional cache size: 98, Positive unconditional cache size: 780, Negative cache size: 251, Negative conditional cache size: 35, Negative unconditional cache size: 216, 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, 88 PlacesBefore, 87 PlacesAfterwards, 83 TransitionsBefore, 82 TransitionsAfterwards, 1380 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 954, independent: 794, independent conditional: 794, independent unconditional: 0, dependent: 160, dependent conditional: 160, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 954, independent: 794, independent conditional: 134, independent unconditional: 660, dependent: 160, dependent conditional: 40, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 988, independent: 794, independent conditional: 134, independent unconditional: 660, dependent: 194, dependent conditional: 74, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 988, independent: 794, independent conditional: 134, independent unconditional: 660, dependent: 194, dependent conditional: 74, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 35, independent: 29, independent conditional: 24, independent unconditional: 5, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 35, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 31, dependent conditional: 31, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 988, independent: 765, independent conditional: 110, independent unconditional: 655, dependent: 188, dependent conditional: 68, dependent unconditional: 120, unknown: 35, unknown conditional: 30, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 1169, Positive cache size: 912, Positive conditional cache size: 122, Positive unconditional cache size: 790, Negative cache size: 257, Negative conditional cache size: 41, Negative unconditional cache size: 216, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 82 PlacesBefore, 71 PlacesAfterwards, 79 TransitionsBefore, 68 TransitionsAfterwards, 622 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 0 ChoiceCompositions, 15 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 304, independent: 213, independent conditional: 213, independent unconditional: 0, dependent: 91, dependent conditional: 91, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 304, independent: 213, independent conditional: 85, independent unconditional: 128, dependent: 91, dependent conditional: 32, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 322, independent: 213, independent conditional: 85, independent unconditional: 128, dependent: 109, dependent conditional: 50, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 322, independent: 213, independent conditional: 85, independent unconditional: 128, dependent: 109, dependent conditional: 50, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 46, independent: 41, independent conditional: 4, independent unconditional: 37, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 46, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 322, independent: 172, independent conditional: 81, independent unconditional: 91, dependent: 104, dependent conditional: 50, dependent unconditional: 54, unknown: 46, unknown conditional: 4, unknown unconditional: 42] , Statistics on independence cache: Total cache size (in pairs): 1596, Positive cache size: 1334, Positive conditional cache size: 135, Positive unconditional cache size: 1199, Negative cache size: 262, Negative conditional cache size: 41, Negative unconditional cache size: 221, 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, 84 PlacesBefore, 80 PlacesAfterwards, 81 TransitionsBefore, 77 TransitionsAfterwards, 500 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 145, independent: 91, independent conditional: 91, independent unconditional: 0, dependent: 54, dependent conditional: 54, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 145, independent: 91, independent conditional: 37, independent unconditional: 54, dependent: 54, dependent conditional: 42, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 175, independent: 91, independent conditional: 37, independent unconditional: 54, dependent: 84, dependent conditional: 72, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 175, independent: 91, independent conditional: 37, independent unconditional: 54, dependent: 84, dependent conditional: 72, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 27, independent: 21, independent conditional: 10, independent unconditional: 11, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 27, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 175, independent: 70, independent conditional: 27, independent unconditional: 43, dependent: 78, dependent conditional: 66, dependent unconditional: 12, unknown: 27, unknown conditional: 16, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 1704, Positive cache size: 1436, Positive conditional cache size: 154, Positive unconditional cache size: 1282, Negative cache size: 268, Negative conditional cache size: 47, Negative unconditional cache size: 221, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 87 PlacesBefore, 86 PlacesAfterwards, 82 TransitionsBefore, 81 TransitionsAfterwards, 494 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 132, independent: 64, independent conditional: 64, independent unconditional: 0, dependent: 68, dependent conditional: 68, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 132, independent: 64, independent conditional: 28, independent unconditional: 36, dependent: 68, dependent conditional: 44, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 182, independent: 64, independent conditional: 28, independent unconditional: 36, dependent: 118, dependent conditional: 94, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 182, independent: 64, independent conditional: 28, independent unconditional: 36, dependent: 118, dependent conditional: 94, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 182, independent: 57, independent conditional: 21, independent unconditional: 36, dependent: 112, dependent conditional: 88, dependent unconditional: 24, unknown: 13, unknown conditional: 13, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1742, Positive cache size: 1468, Positive conditional cache size: 161, Positive unconditional cache size: 1307, Negative cache size: 274, Negative conditional cache size: 53, Negative unconditional cache size: 221, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 106 PlacesBefore, 103 PlacesAfterwards, 114 TransitionsBefore, 111 TransitionsAfterwards, 516 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 242, independent: 175, independent conditional: 175, independent unconditional: 0, dependent: 67, dependent conditional: 67, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 242, independent: 175, independent conditional: 29, independent unconditional: 146, dependent: 67, dependent conditional: 47, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 286, independent: 175, independent conditional: 29, independent unconditional: 146, dependent: 111, dependent conditional: 91, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 286, independent: 175, independent conditional: 29, independent unconditional: 146, dependent: 111, dependent conditional: 91, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 27, independent: 21, independent conditional: 17, independent unconditional: 4, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 27, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 3, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 286, independent: 154, independent conditional: 12, independent unconditional: 142, dependent: 105, dependent conditional: 89, dependent unconditional: 16, unknown: 27, unknown conditional: 19, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 1771, Positive cache size: 1491, Positive conditional cache size: 178, Positive unconditional cache size: 1313, Negative cache size: 280, Negative conditional cache size: 55, Negative unconditional cache size: 225, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 130 PlacesBefore, 129 PlacesAfterwards, 160 TransitionsBefore, 159 TransitionsAfterwards, 652 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 217, independent: 127, independent conditional: 127, independent unconditional: 0, dependent: 90, dependent conditional: 90, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 217, independent: 127, independent conditional: 39, independent unconditional: 88, dependent: 90, dependent conditional: 80, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 341, independent: 127, independent conditional: 39, independent unconditional: 88, dependent: 214, dependent conditional: 204, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 341, independent: 127, independent conditional: 39, independent unconditional: 88, dependent: 214, dependent conditional: 204, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 341, independent: 121, independent conditional: 33, independent unconditional: 88, dependent: 208, dependent conditional: 198, dependent unconditional: 10, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1821, Positive cache size: 1535, Positive conditional cache size: 200, Positive unconditional cache size: 1335, Negative cache size: 286, Negative conditional cache size: 61, Negative unconditional cache size: 225, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 3 - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkResolutionNode(Interpolator.java:275) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown