/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:17:23,748 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:17:23,750 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:17:23,814 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:17:23,815 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:17:23,817 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:17:23,819 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:17:23,822 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:17:23,825 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:17:23,829 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:17:23,830 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:17:23,831 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:17:23,831 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:17:23,833 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:17:23,834 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:17:23,835 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:17:23,835 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:17:23,836 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:17:23,838 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:17:23,842 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:17:23,844 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:17:23,844 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:17:23,845 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:17:23,846 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:17:23,851 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:17:23,851 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:17:23,852 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:17:23,853 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:17:23,853 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:17:23,854 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:17:23,854 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:17:23,858 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:17:23,860 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:17:23,860 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:17:23,861 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:17:23,861 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:17:23,861 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:17:23,861 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:17:23,861 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:17:23,862 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:17:23,862 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:17:23,863 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 00:17:23,887 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:17:23,887 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:17:23,889 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:17:23,889 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:17:23,889 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:17:23,890 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:17:23,890 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:17:23,890 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:17:23,890 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:17:23,890 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:17:23,891 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:17:23,891 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:17:23,891 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:17:23,891 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:17:23,892 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:17:23,892 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:17:23,892 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:17:23,892 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:17:23,892 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:17:23,892 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:17:23,892 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:17:23,892 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:17:23,893 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:17:23,893 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:17:23,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:17:23,893 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:17:23,893 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:17:23,893 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:17:23,893 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-13 00:17:24,207 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:17:24,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:17:24,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:17:24,246 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:17:24,246 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:17:24,248 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue.i [2022-12-13 00:17:25,208 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:17:25,458 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:17:25,459 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i [2022-12-13 00:17:25,473 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fc60eaae/d3c171cffb55427dbf1d05d54c6e58b3/FLAG18aa1fb85 [2022-12-13 00:17:25,489 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fc60eaae/d3c171cffb55427dbf1d05d54c6e58b3 [2022-12-13 00:17:25,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:17:25,492 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:17:25,494 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:17:25,494 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:17:25,496 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:17:25,497 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:17:25" (1/1) ... [2022-12-13 00:17:25,498 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36e012ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:17:25, skipping insertion in model container [2022-12-13 00:17:25,498 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:17:25" (1/1) ... [2022-12-13 00:17:25,503 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:17:25,542 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:17:25,863 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-13 00:17:25,876 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-13 00:17:25,884 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-13 00:17:25,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:17:25,902 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:17:25,964 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-13 00:17:25,966 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-13 00:17:25,968 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-13 00:17:25,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:17:26,030 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:17:26,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:17:26 WrapperNode [2022-12-13 00:17:26,031 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:17:26,032 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:17:26,032 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:17:26,032 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:17:26,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:17:26" (1/1) ... [2022-12-13 00:17:26,054 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:17:26" (1/1) ... [2022-12-13 00:17:26,088 INFO L138 Inliner]: procedures = 274, calls = 68, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 250 [2022-12-13 00:17:26,088 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:17:26,089 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:17:26,089 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:17:26,089 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:17:26,098 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:17:26" (1/1) ... [2022-12-13 00:17:26,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:17:26" (1/1) ... [2022-12-13 00:17:26,101 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:17:26" (1/1) ... [2022-12-13 00:17:26,102 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:17:26" (1/1) ... [2022-12-13 00:17:26,109 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:17:26" (1/1) ... [2022-12-13 00:17:26,112 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:17:26" (1/1) ... [2022-12-13 00:17:26,114 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:17:26" (1/1) ... [2022-12-13 00:17:26,115 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:17:26" (1/1) ... [2022-12-13 00:17:26,117 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:17:26,118 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:17:26,118 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:17:26,118 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:17:26,119 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:17:26" (1/1) ... [2022-12-13 00:17:26,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:17:26,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:17:26,145 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-13 00:17:26,150 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-13 00:17:26,172 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-13 00:17:26,172 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-13 00:17:26,172 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-13 00:17:26,172 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-13 00:17:26,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:17:26,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:17:26,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 00:17:26,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:17:26,173 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 00:17:26,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:17:26,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:17:26,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:17:26,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:17:26,174 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 00:17:26,280 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:17:26,282 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:17:26,648 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:17:26,655 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:17:26,655 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 00:17:26,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:17:26 BoogieIcfgContainer [2022-12-13 00:17:26,657 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:17:26,658 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:17:26,658 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:17:26,660 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:17:26,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:17:25" (1/3) ... [2022-12-13 00:17:26,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dac2c51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:17:26, skipping insertion in model container [2022-12-13 00:17:26,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:17:26" (2/3) ... [2022-12-13 00:17:26,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dac2c51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:17:26, skipping insertion in model container [2022-12-13 00:17:26,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:17:26" (3/3) ... [2022-12-13 00:17:26,662 INFO L112 eAbstractionObserver]: Analyzing ICFG queue.i [2022-12-13 00:17:26,674 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:17:26,674 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-12-13 00:17:26,674 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:17:26,785 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 00:17:26,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 256 places, 264 transitions, 544 flow [2022-12-13 00:17:26,923 INFO L130 PetriNetUnfolder]: 15/262 cut-off events. [2022-12-13 00:17:26,923 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 00:17:26,930 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-13 00:17:26,931 INFO L82 GeneralOperation]: Start removeDead. Operand has 256 places, 264 transitions, 544 flow [2022-12-13 00:17:26,937 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 245 places, 253 transitions, 515 flow [2022-12-13 00:17:26,939 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:17:26,970 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 245 places, 253 transitions, 515 flow [2022-12-13 00:17:26,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 245 places, 253 transitions, 515 flow [2022-12-13 00:17:27,019 INFO L130 PetriNetUnfolder]: 15/253 cut-off events. [2022-12-13 00:17:27,019 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 00:17:27,024 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-13 00:17:27,031 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 245 places, 253 transitions, 515 flow [2022-12-13 00:17:27,031 INFO L226 LiptonReduction]: Number of co-enabled transitions 15600 [2022-12-13 00:17:38,143 INFO L241 LiptonReduction]: Total number of compositions: 216 [2022-12-13 00:17:38,162 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:17:38,167 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;@61a493b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:17:38,168 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 00:17:38,169 INFO L130 PetriNetUnfolder]: 1/3 cut-off events. [2022-12-13 00:17:38,169 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:17:38,169 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:17:38,170 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1] [2022-12-13 00:17:38,171 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-13 00:17:38,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:17:38,175 INFO L85 PathProgramCache]: Analyzing trace with hash 35840, now seen corresponding path program 1 times [2022-12-13 00:17:38,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:17:38,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684649502] [2022-12-13 00:17:38,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:38,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:17:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:38,283 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-13 00:17:38,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:17:38,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684649502] [2022-12-13 00:17:38,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684649502] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:17:38,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:17:38,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:17:38,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274530565] [2022-12-13 00:17:38,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:17:38,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 00:17:38,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:17:38,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 00:17:38,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 00:17:38,311 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 192 [2022-12-13 00:17:38,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 192 transitions, 393 flow. Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:17:38,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:17:38,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 192 [2022-12-13 00:17:38,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:17:40,235 INFO L130 PetriNetUnfolder]: 23223/37858 cut-off events. [2022-12-13 00:17:40,235 INFO L131 PetriNetUnfolder]: For 126/126 co-relation queries the response was YES. [2022-12-13 00:17:40,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73984 conditions, 37858 events. 23223/37858 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 1029. Compared 281084 event pairs, 20831 based on Foata normal form. 143/13203 useless extension candidates. Maximal degree in co-relation 73502. Up to 35893 conditions per place. [2022-12-13 00:17:40,325 INFO L137 encePairwiseOnDemand]: 183/192 looper letters, 156 selfloop transitions, 0 changer transitions 0/181 dead transitions. [2022-12-13 00:17:40,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 181 transitions, 683 flow [2022-12-13 00:17:40,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 00:17:40,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 00:17:40,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 217 transitions. [2022-12-13 00:17:40,335 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5651041666666666 [2022-12-13 00:17:40,336 INFO L175 Difference]: Start difference. First operand has 181 places, 192 transitions, 393 flow. Second operand 2 states and 217 transitions. [2022-12-13 00:17:40,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 181 transitions, 683 flow [2022-12-13 00:17:40,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 181 transitions, 678 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 00:17:40,346 INFO L231 Difference]: Finished difference. Result has 173 places, 181 transitions, 366 flow [2022-12-13 00:17:40,348 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=366, PETRI_PLACES=173, PETRI_TRANSITIONS=181} [2022-12-13 00:17:40,350 INFO L295 CegarLoopForPetriNet]: 181 programPoint places, -8 predicate places. [2022-12-13 00:17:40,350 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:17:40,351 INFO L89 Accepts]: Start accepts. Operand has 173 places, 181 transitions, 366 flow [2022-12-13 00:17:40,354 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:17:40,354 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:17:40,354 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 181 transitions, 366 flow [2022-12-13 00:17:40,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 181 transitions, 366 flow [2022-12-13 00:17:40,382 INFO L130 PetriNetUnfolder]: 13/181 cut-off events. [2022-12-13 00:17:40,382 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:17:40,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 181 events. 13/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 901 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 173. Up to 2 conditions per place. [2022-12-13 00:17:40,388 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 181 transitions, 366 flow [2022-12-13 00:17:40,389 INFO L226 LiptonReduction]: Number of co-enabled transitions 15204 [2022-12-13 00:17:40,581 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:17:40,586 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 236 [2022-12-13 00:17:40,586 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 180 transitions, 364 flow [2022-12-13 00:17:40,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:17:40,586 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:17:40,586 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:17:40,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:17:40,587 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-13 00:17:40,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:17:40,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1409805938, now seen corresponding path program 1 times [2022-12-13 00:17:40,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:17:40,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148534412] [2022-12-13 00:17:40,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:40,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:17:40,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:41,489 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-13 00:17:41,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:17:41,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148534412] [2022-12-13 00:17:41,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148534412] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:17:41,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:17:41,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:17:41,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134963164] [2022-12-13 00:17:41,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:17:41,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:17:41,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:17:41,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:17:41,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:17:41,492 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 180 [2022-12-13 00:17:41,492 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 180 transitions, 364 flow. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:17:41,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:17:41,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 180 [2022-12-13 00:17:41,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:17:43,944 INFO L130 PetriNetUnfolder]: 26602/42305 cut-off events. [2022-12-13 00:17:43,944 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:17:43,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83611 conditions, 42305 events. 26602/42305 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1075. Compared 303053 event pairs, 21526 based on Foata normal form. 0/13554 useless extension candidates. Maximal degree in co-relation 70160. Up to 40418 conditions per place. [2022-12-13 00:17:44,052 INFO L137 encePairwiseOnDemand]: 163/180 looper letters, 247 selfloop transitions, 21 changer transitions 6/289 dead transitions. [2022-12-13 00:17:44,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 289 transitions, 1132 flow [2022-12-13 00:17:44,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 00:17:44,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 00:17:44,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 413 transitions. [2022-12-13 00:17:44,056 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25493827160493826 [2022-12-13 00:17:44,056 INFO L175 Difference]: Start difference. First operand has 171 places, 180 transitions, 364 flow. Second operand 9 states and 413 transitions. [2022-12-13 00:17:44,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 289 transitions, 1132 flow [2022-12-13 00:17:44,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 289 transitions, 1132 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 00:17:44,062 INFO L231 Difference]: Finished difference. Result has 184 places, 200 transitions, 506 flow [2022-12-13 00:17:44,062 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=506, PETRI_PLACES=184, PETRI_TRANSITIONS=200} [2022-12-13 00:17:44,063 INFO L295 CegarLoopForPetriNet]: 181 programPoint places, 3 predicate places. [2022-12-13 00:17:44,063 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:17:44,063 INFO L89 Accepts]: Start accepts. Operand has 184 places, 200 transitions, 506 flow [2022-12-13 00:17:44,064 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:17:44,064 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:17:44,065 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 184 places, 200 transitions, 506 flow [2022-12-13 00:17:44,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 184 places, 200 transitions, 506 flow [2022-12-13 00:17:44,100 INFO L130 PetriNetUnfolder]: 67/649 cut-off events. [2022-12-13 00:17:44,101 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-13 00:17:44,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 736 conditions, 649 events. 67/649 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5347 event pairs, 0 based on Foata normal form. 0/181 useless extension candidates. Maximal degree in co-relation 503. Up to 19 conditions per place. [2022-12-13 00:17:44,109 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 184 places, 200 transitions, 506 flow [2022-12-13 00:17:44,109 INFO L226 LiptonReduction]: Number of co-enabled transitions 15262 [2022-12-13 00:17:44,224 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [923] L1010-->L980-1: Formula: (and (= |v_t1Thread1of1ForFork0_enqueue_~x#1_53| |v_t1Thread1of1ForFork0_enqueue_#in~x#1_35|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_37| |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_173|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_37| |v_~#queue~0.base_39|) (= |v_t1Thread1of1ForFork0_enqueue_~q#1.base_173| |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_37|) (= (select (select |v_#memory_int_358| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_173|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_173|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) (= |v_t1Thread1of1ForFork0_enqueue_#in~x#1_35| |v_t1Thread1of1ForFork0_~value~0#1_41|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_37| |v_~#queue~0.offset_38|)) InVars {~#queue~0.base=|v_~#queue~0.base_39|, t1Thread1of1ForFork0_~value~0#1=|v_t1Thread1of1ForFork0_~value~0#1_41|, #memory_int=|v_#memory_int_358|, ~#queue~0.offset=|v_~#queue~0.offset_38|} OutVars{t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_173|, t1Thread1of1ForFork0_~value~0#1=|v_t1Thread1of1ForFork0_~value~0#1_41|, t1Thread1of1ForFork0_enqueue_#t~post41#1=|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_55|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_57|, t1Thread1of1ForFork0_enqueue_#t~mem36#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|, t1Thread1of1ForFork0_enqueue_#in~q#1.base=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_37|, ~#queue~0.base=|v_~#queue~0.base_39|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_173|, t1Thread1of1ForFork0_enqueue_#in~x#1=|v_t1Thread1of1ForFork0_enqueue_#in~x#1_35|, #memory_int=|v_#memory_int_358|, t1Thread1of1ForFork0_enqueue_~x#1=|v_t1Thread1of1ForFork0_enqueue_~x#1_53|, t1Thread1of1ForFork0_enqueue_#res#1=|v_t1Thread1of1ForFork0_enqueue_#res#1_67|, ~#queue~0.offset=|v_~#queue~0.offset_38|, t1Thread1of1ForFork0_enqueue_#t~mem39#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_149|, t1Thread1of1ForFork0_enqueue_#in~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_37|, t1Thread1of1ForFork0_enqueue_#t~post38#1=|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_73|, t1Thread1of1ForFork0_enqueue_#t~mem37#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem37#1_75|} 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 [1100] L1063-4-->L1064-3: Formula: (and (= |v_#memory_int_902| (store |v_#memory_int_903| |v_ULTIMATE.start_main_~#id2~0#1.base_29| (store (select |v_#memory_int_903| |v_ULTIMATE.start_main_~#id2~0#1.base_29|) |v_ULTIMATE.start_main_~#id2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre64#1_33|))) (= |v_#pthreadsForks_37| (+ |v_#pthreadsForks_38| 1)) (= |v_ULTIMATE.start_main_#t~pre64#1_33| |v_#pthreadsForks_38|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_29|, #pthreadsForks=|v_#pthreadsForks_38|, #memory_int=|v_#memory_int_903|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_29|} OutVars{ULTIMATE.start_main_#t~pre62#1=|v_ULTIMATE.start_main_#t~pre62#1_39|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_29|, #pthreadsForks=|v_#pthreadsForks_37|, ULTIMATE.start_main_#t~pre64#1=|v_ULTIMATE.start_main_#t~pre64#1_33|, #memory_int=|v_#memory_int_902|, ULTIMATE.start_main_#t~nondet63#1=|v_ULTIMATE.start_main_#t~nondet63#1_25|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_29|} 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-13 00:17:44,411 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1098] $Ultimate##0-->L978-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_328| |v_~#m~0.base_172|))) (and (= (select .cse0 |v_~#m~0.offset_172|) 0) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_67| |v_~#queue~0.offset_114|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_67| |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_335|) (= (store |v_#pthreadsMutex_328| |v_~#m~0.base_172| (store .cse0 |v_~#m~0.offset_172| 1)) |v_#pthreadsMutex_327|) (= |v_t1Thread1of1ForFork0_~value~0#1_129| |v_t1Thread1of1ForFork0_#t~nondet50#1_52|) (<= 0 (+ |v_t1Thread1of1ForFork0_#t~nondet50#1_52| 2147483648)) (<= |v_t1Thread1of1ForFork0_#t~nondet50#1_52| 2147483647) (= |v_t1Thread1of1ForFork0_~value~0#1_129| |v_t1Thread1of1ForFork0_enqueue_#in~x#1_65|) (= |v_t1Thread1of1ForFork0_#in~arg#1.offset_27| |v_t1Thread1of1ForFork0_~arg#1.offset_27|) (= |v_t1Thread1of1ForFork0_enqueue_~q#1.base_335| |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_67|) (= |v_t1Thread1of1ForFork0_~arg#1.base_27| |v_t1Thread1of1ForFork0_#in~arg#1.base_27|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_67| |v_~#queue~0.base_117|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_328|, ~#m~0.base=|v_~#m~0.base_172|, ~#queue~0.base=|v_~#queue~0.base_117|, t1Thread1of1ForFork0_#t~nondet50#1=|v_t1Thread1of1ForFork0_#t~nondet50#1_52|, ~#m~0.offset=|v_~#m~0.offset_172|, ~#queue~0.offset=|v_~#queue~0.offset_114|, t1Thread1of1ForFork0_#in~arg#1.offset=|v_t1Thread1of1ForFork0_#in~arg#1.offset_27|, t1Thread1of1ForFork0_#in~arg#1.base=|v_t1Thread1of1ForFork0_#in~arg#1.base_27|} OutVars{t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_105|, t1Thread1of1ForFork0_~arg#1.offset=|v_t1Thread1of1ForFork0_~arg#1.offset_27|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_335|, t1Thread1of1ForFork0_~value~0#1=|v_t1Thread1of1ForFork0_~value~0#1_129|, t1Thread1of1ForFork0_enqueue_#in~q#1.base=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_67|, ~#queue~0.base=|v_~#queue~0.base_117|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_335|, t1Thread1of1ForFork0_enqueue_#in~x#1=|v_t1Thread1of1ForFork0_enqueue_#in~x#1_65|, t1Thread1of1ForFork0_enqueue_#res#1=|v_t1Thread1of1ForFork0_enqueue_#res#1_109|, ~#queue~0.offset=|v_~#queue~0.offset_114|, t1Thread1of1ForFork0_~arg#1.base=|v_t1Thread1of1ForFork0_~arg#1.base_27|, t1Thread1of1ForFork0_enqueue_#t~mem39#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_299|, #pthreadsMutex=|v_#pthreadsMutex_327|, t1Thread1of1ForFork0_enqueue_#t~post41#1=|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_119|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_135|, t1Thread1of1ForFork0_#in~arg#1.base=|v_t1Thread1of1ForFork0_#in~arg#1.base_27|, t1Thread1of1ForFork0_enqueue_#t~mem36#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|, ~#m~0.base=|v_~#m~0.base_172|, ~#m~0.offset=|v_~#m~0.offset_172|, t1Thread1of1ForFork0_#t~nondet49#1=|v_t1Thread1of1ForFork0_#t~nondet49#1_65|, t1Thread1of1ForFork0_enqueue_~x#1=|v_t1Thread1of1ForFork0_enqueue_~x#1_85|, t1Thread1of1ForFork0_enqueue_#in~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_67|, t1Thread1of1ForFork0_enqueue_#t~post38#1=|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_143|, t1Thread1of1ForFork0_#in~arg#1.offset=|v_t1Thread1of1ForFork0_#in~arg#1.offset_27|, t1Thread1of1ForFork0_enqueue_#t~mem37#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem37#1_143|} 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, 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] and [1100] L1063-4-->L1064-3: Formula: (and (= |v_#memory_int_902| (store |v_#memory_int_903| |v_ULTIMATE.start_main_~#id2~0#1.base_29| (store (select |v_#memory_int_903| |v_ULTIMATE.start_main_~#id2~0#1.base_29|) |v_ULTIMATE.start_main_~#id2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre64#1_33|))) (= |v_#pthreadsForks_37| (+ |v_#pthreadsForks_38| 1)) (= |v_ULTIMATE.start_main_#t~pre64#1_33| |v_#pthreadsForks_38|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_29|, #pthreadsForks=|v_#pthreadsForks_38|, #memory_int=|v_#memory_int_903|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_29|} OutVars{ULTIMATE.start_main_#t~pre62#1=|v_ULTIMATE.start_main_#t~pre62#1_39|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_29|, #pthreadsForks=|v_#pthreadsForks_37|, ULTIMATE.start_main_#t~pre64#1=|v_ULTIMATE.start_main_#t~pre64#1_33|, #memory_int=|v_#memory_int_902|, ULTIMATE.start_main_#t~nondet63#1=|v_ULTIMATE.start_main_#t~nondet63#1_25|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_29|} 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-13 00:17:44,496 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1099] $Ultimate##0-->L980: Formula: (let ((.cse0 (select |v_#pthreadsMutex_332| |v_~#m~0.base_174|))) (and (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_69| |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_337|) (= (store |v_#pthreadsMutex_332| |v_~#m~0.base_174| (store .cse0 |v_~#m~0.offset_174| 1)) |v_#pthreadsMutex_331|) (= |v_t1Thread1of1ForFork0_#in~arg#1.offset_29| |v_t1Thread1of1ForFork0_~arg#1.offset_29|) (<= 0 (+ |v_t1Thread1of1ForFork0_#t~nondet50#1_56| 2147483648)) (= |v_t1Thread1of1ForFork0_enqueue_~x#1_87| |v_t1Thread1of1ForFork0_enqueue_#in~x#1_67|) (<= |v_t1Thread1of1ForFork0_#t~nondet50#1_56| 2147483647) (= |v_t1Thread1of1ForFork0_enqueue_~q#1.base_337| |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_69|) (= |v_t1Thread1of1ForFork0_~arg#1.base_29| |v_t1Thread1of1ForFork0_#in~arg#1.base_29|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_69| |v_~#queue~0.offset_116|) (= |v_t1Thread1of1ForFork0_~value~0#1_131| |v_t1Thread1of1ForFork0_#t~nondet50#1_56|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_69| |v_~#queue~0.base_119|) (= (select .cse0 |v_~#m~0.offset_174|) 0) (= |v_t1Thread1of1ForFork0_~value~0#1_131| |v_t1Thread1of1ForFork0_enqueue_#in~x#1_67|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_332|, ~#m~0.base=|v_~#m~0.base_174|, ~#queue~0.base=|v_~#queue~0.base_119|, t1Thread1of1ForFork0_#t~nondet50#1=|v_t1Thread1of1ForFork0_#t~nondet50#1_56|, ~#m~0.offset=|v_~#m~0.offset_174|, ~#queue~0.offset=|v_~#queue~0.offset_116|, t1Thread1of1ForFork0_#in~arg#1.offset=|v_t1Thread1of1ForFork0_#in~arg#1.offset_29|, t1Thread1of1ForFork0_#in~arg#1.base=|v_t1Thread1of1ForFork0_#in~arg#1.base_29|} OutVars{t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_107|, t1Thread1of1ForFork0_~arg#1.offset=|v_t1Thread1of1ForFork0_~arg#1.offset_29|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_337|, t1Thread1of1ForFork0_~value~0#1=|v_t1Thread1of1ForFork0_~value~0#1_131|, t1Thread1of1ForFork0_enqueue_#in~q#1.base=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_69|, ~#queue~0.base=|v_~#queue~0.base_119|, t1Thread1of1ForFork0_enqueue_#in~x#1=|v_t1Thread1of1ForFork0_enqueue_#in~x#1_67|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_337|, t1Thread1of1ForFork0_enqueue_#res#1=|v_t1Thread1of1ForFork0_enqueue_#res#1_111|, ~#queue~0.offset=|v_~#queue~0.offset_116|, t1Thread1of1ForFork0_~arg#1.base=|v_t1Thread1of1ForFork0_~arg#1.base_29|, t1Thread1of1ForFork0_enqueue_#t~mem39#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_301|, #pthreadsMutex=|v_#pthreadsMutex_331|, t1Thread1of1ForFork0_enqueue_#t~post41#1=|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_121|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_137|, t1Thread1of1ForFork0_#in~arg#1.base=|v_t1Thread1of1ForFork0_#in~arg#1.base_29|, t1Thread1of1ForFork0_enqueue_#t~mem36#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|, ~#m~0.base=|v_~#m~0.base_174|, ~#m~0.offset=|v_~#m~0.offset_174|, t1Thread1of1ForFork0_#t~nondet49#1=|v_t1Thread1of1ForFork0_#t~nondet49#1_67|, t1Thread1of1ForFork0_enqueue_~x#1=|v_t1Thread1of1ForFork0_enqueue_~x#1_87|, t1Thread1of1ForFork0_enqueue_#in~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_69|, t1Thread1of1ForFork0_enqueue_#t~post38#1=|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_145|, t1Thread1of1ForFork0_#in~arg#1.offset=|v_t1Thread1of1ForFork0_#in~arg#1.offset_29|, t1Thread1of1ForFork0_enqueue_#t~mem37#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem37#1_145|} 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_#in~x#1, t1Thread1of1ForFork0_enqueue_~q#1.offset, t1Thread1of1ForFork0_#t~nondet49#1, t1Thread1of1ForFork0_enqueue_#res#1, t1Thread1of1ForFork0_~arg#1.base, 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] and [1100] L1063-4-->L1064-3: Formula: (and (= |v_#memory_int_902| (store |v_#memory_int_903| |v_ULTIMATE.start_main_~#id2~0#1.base_29| (store (select |v_#memory_int_903| |v_ULTIMATE.start_main_~#id2~0#1.base_29|) |v_ULTIMATE.start_main_~#id2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre64#1_33|))) (= |v_#pthreadsForks_37| (+ |v_#pthreadsForks_38| 1)) (= |v_ULTIMATE.start_main_#t~pre64#1_33| |v_#pthreadsForks_38|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_29|, #pthreadsForks=|v_#pthreadsForks_38|, #memory_int=|v_#memory_int_903|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_29|} OutVars{ULTIMATE.start_main_#t~pre62#1=|v_ULTIMATE.start_main_#t~pre62#1_39|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_29|, #pthreadsForks=|v_#pthreadsForks_37|, ULTIMATE.start_main_#t~pre64#1=|v_ULTIMATE.start_main_#t~pre64#1_33|, #memory_int=|v_#memory_int_902|, ULTIMATE.start_main_#t~nondet63#1=|v_ULTIMATE.start_main_#t~nondet63#1_25|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_29|} 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-13 00:17:44,598 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1121] L1010-->L980-2: Formula: (let ((.cse0 (select |v_#memory_int_1983| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_725|))) (and (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_157| |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_725|) (= |v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_157| |v_~#queue~0.offset_240|) (= |v_t1Thread1of1ForFork0_enqueue_~x#1_223| |v_t1Thread1of1ForFork0_enqueue_#in~x#1_155|) (= (store |v_#memory_int_1983| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_725| (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_247| 4) |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_725|) |v_t1Thread1of1ForFork0_enqueue_~x#1_223|)) |v_#memory_int_1982|) (= |v_t1Thread1of1ForFork0_~value~0#1_255| |v_t1Thread1of1ForFork0_enqueue_#in~x#1_155|) (= |v_t1Thread1of1ForFork0_enqueue_~q#1.base_725| |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_157|) (= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_247| (select .cse0 (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_725|))) (= |v_~#queue~0.base_243| |v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_157|))) InVars {~#queue~0.base=|v_~#queue~0.base_243|, t1Thread1of1ForFork0_~value~0#1=|v_t1Thread1of1ForFork0_~value~0#1_255|, #memory_int=|v_#memory_int_1983|, ~#queue~0.offset=|v_~#queue~0.offset_240|} OutVars{t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_725|, t1Thread1of1ForFork0_~value~0#1=|v_t1Thread1of1ForFork0_~value~0#1_255|, t1Thread1of1ForFork0_enqueue_#t~post41#1=|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_246|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_317|, t1Thread1of1ForFork0_enqueue_#t~mem36#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_247|, t1Thread1of1ForFork0_enqueue_#in~q#1.base=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.base_157|, ~#queue~0.base=|v_~#queue~0.base_243|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_725|, t1Thread1of1ForFork0_enqueue_#in~x#1=|v_t1Thread1of1ForFork0_enqueue_#in~x#1_155|, #memory_int=|v_#memory_int_1982|, t1Thread1of1ForFork0_enqueue_~x#1=|v_t1Thread1of1ForFork0_enqueue_~x#1_223|, t1Thread1of1ForFork0_enqueue_#res#1=|v_t1Thread1of1ForFork0_enqueue_#res#1_227|, ~#queue~0.offset=|v_~#queue~0.offset_240|, t1Thread1of1ForFork0_enqueue_#t~mem39#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_625|, t1Thread1of1ForFork0_enqueue_#in~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_#in~q#1.offset_157|, t1Thread1of1ForFork0_enqueue_#t~post38#1=|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_325|, t1Thread1of1ForFork0_enqueue_#t~mem37#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem37#1_303|} 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, #memory_int, 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 [1100] L1063-4-->L1064-3: Formula: (and (= |v_#memory_int_902| (store |v_#memory_int_903| |v_ULTIMATE.start_main_~#id2~0#1.base_29| (store (select |v_#memory_int_903| |v_ULTIMATE.start_main_~#id2~0#1.base_29|) |v_ULTIMATE.start_main_~#id2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre64#1_33|))) (= |v_#pthreadsForks_37| (+ |v_#pthreadsForks_38| 1)) (= |v_ULTIMATE.start_main_#t~pre64#1_33| |v_#pthreadsForks_38|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_29|, #pthreadsForks=|v_#pthreadsForks_38|, #memory_int=|v_#memory_int_903|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_29|} OutVars{ULTIMATE.start_main_#t~pre62#1=|v_ULTIMATE.start_main_#t~pre62#1_39|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_29|, #pthreadsForks=|v_#pthreadsForks_37|, ULTIMATE.start_main_#t~pre64#1=|v_ULTIMATE.start_main_#t~pre64#1_33|, #memory_int=|v_#memory_int_902|, ULTIMATE.start_main_#t~nondet63#1=|v_ULTIMATE.start_main_#t~nondet63#1_25|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_29|} 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-13 00:17:44,668 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 00:17:44,671 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 608 [2022-12-13 00:17:44,671 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 197 transitions, 506 flow [2022-12-13 00:17:44,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:17:44,671 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:17:44,671 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:17:44,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:17:44,672 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-13 00:17:44,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:17:44,673 INFO L85 PathProgramCache]: Analyzing trace with hash -744096672, now seen corresponding path program 1 times [2022-12-13 00:17:44,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:17:44,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800602858] [2022-12-13 00:17:44,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:44,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:17:44,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:45,384 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-13 00:17:45,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:17:45,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800602858] [2022-12-13 00:17:45,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800602858] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:17:45,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:17:45,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 00:17:45,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340074594] [2022-12-13 00:17:45,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:17:45,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:17:45,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:17:45,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:17:45,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:17:45,387 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 185 [2022-12-13 00:17:45,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 197 transitions, 506 flow. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:17:45,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:17:45,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 185 [2022-12-13 00:17:45,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:17:48,230 INFO L130 PetriNetUnfolder]: 30766/48883 cut-off events. [2022-12-13 00:17:48,231 INFO L131 PetriNetUnfolder]: For 2102/2102 co-relation queries the response was YES. [2022-12-13 00:17:48,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100753 conditions, 48883 events. 30766/48883 cut-off events. For 2102/2102 co-relation queries the response was YES. Maximal size of possible extension queue 1461. Compared 362796 event pairs, 7264 based on Foata normal form. 205/16819 useless extension candidates. Maximal degree in co-relation 81472. Up to 41058 conditions per place. [2022-12-13 00:17:48,400 INFO L137 encePairwiseOnDemand]: 162/185 looper letters, 349 selfloop transitions, 42 changer transitions 0/406 dead transitions. [2022-12-13 00:17:48,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 406 transitions, 1748 flow [2022-12-13 00:17:48,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 00:17:48,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 00:17:48,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 489 transitions. [2022-12-13 00:17:48,403 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3776061776061776 [2022-12-13 00:17:48,403 INFO L175 Difference]: Start difference. First operand has 181 places, 197 transitions, 506 flow. Second operand 7 states and 489 transitions. [2022-12-13 00:17:48,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 406 transitions, 1748 flow [2022-12-13 00:17:48,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 406 transitions, 1734 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-13 00:17:48,434 INFO L231 Difference]: Finished difference. Result has 191 places, 227 transitions, 776 flow [2022-12-13 00:17:48,435 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=776, PETRI_PLACES=191, PETRI_TRANSITIONS=227} [2022-12-13 00:17:48,435 INFO L295 CegarLoopForPetriNet]: 181 programPoint places, 10 predicate places. [2022-12-13 00:17:48,435 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:17:48,435 INFO L89 Accepts]: Start accepts. Operand has 191 places, 227 transitions, 776 flow [2022-12-13 00:17:48,436 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:17:48,436 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:17:48,436 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 227 transitions, 776 flow [2022-12-13 00:17:48,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 191 places, 227 transitions, 776 flow [2022-12-13 00:17:48,654 INFO L130 PetriNetUnfolder]: 190/1512 cut-off events. [2022-12-13 00:17:48,654 INFO L131 PetriNetUnfolder]: For 79/79 co-relation queries the response was YES. [2022-12-13 00:17:48,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1900 conditions, 1512 events. 190/1512 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 14480 event pairs, 0 based on Foata normal form. 0/393 useless extension candidates. Maximal degree in co-relation 1664. Up to 82 conditions per place. [2022-12-13 00:17:48,676 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 191 places, 227 transitions, 776 flow [2022-12-13 00:17:48,676 INFO L226 LiptonReduction]: Number of co-enabled transitions 16298 [2022-12-13 00:17:48,744 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1100] L1063-4-->L1064-3: Formula: (and (= |v_#memory_int_902| (store |v_#memory_int_903| |v_ULTIMATE.start_main_~#id2~0#1.base_29| (store (select |v_#memory_int_903| |v_ULTIMATE.start_main_~#id2~0#1.base_29|) |v_ULTIMATE.start_main_~#id2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre64#1_33|))) (= |v_#pthreadsForks_37| (+ |v_#pthreadsForks_38| 1)) (= |v_ULTIMATE.start_main_#t~pre64#1_33| |v_#pthreadsForks_38|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_29|, #pthreadsForks=|v_#pthreadsForks_38|, #memory_int=|v_#memory_int_903|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_29|} OutVars{ULTIMATE.start_main_#t~pre62#1=|v_ULTIMATE.start_main_#t~pre62#1_39|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_29|, #pthreadsForks=|v_#pthreadsForks_37|, ULTIMATE.start_main_#t~pre64#1=|v_ULTIMATE.start_main_#t~pre64#1_33|, #memory_int=|v_#memory_int_902|, ULTIMATE.start_main_#t~nondet63#1=|v_ULTIMATE.start_main_#t~nondet63#1_25|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre62#1, #pthreadsForks, ULTIMATE.start_main_#t~pre64#1, #memory_int, ULTIMATE.start_main_#t~nondet63#1] and [882] L982-1-->L988-1: Formula: (and (= |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_45| (select (select |v_#memory_int_246| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_121|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_121|))) (not (= 20 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_96|))) InVars {t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_121|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_121|, #memory_int=|v_#memory_int_246|, t1Thread1of1ForFork0_enqueue_#t~mem39#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_96|} OutVars{t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_121|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_121|, #memory_int=|v_#memory_int_246|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_45|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1, t1Thread1of1ForFork0_enqueue_#t~mem39#1] [2022-12-13 00:17:48,768 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1100] L1063-4-->L1064-3: Formula: (and (= |v_#memory_int_902| (store |v_#memory_int_903| |v_ULTIMATE.start_main_~#id2~0#1.base_29| (store (select |v_#memory_int_903| |v_ULTIMATE.start_main_~#id2~0#1.base_29|) |v_ULTIMATE.start_main_~#id2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre64#1_33|))) (= |v_#pthreadsForks_37| (+ |v_#pthreadsForks_38| 1)) (= |v_ULTIMATE.start_main_#t~pre64#1_33| |v_#pthreadsForks_38|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_29|, #pthreadsForks=|v_#pthreadsForks_38|, #memory_int=|v_#memory_int_903|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_29|} OutVars{ULTIMATE.start_main_#t~pre62#1=|v_ULTIMATE.start_main_#t~pre62#1_39|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_29|, #pthreadsForks=|v_#pthreadsForks_37|, ULTIMATE.start_main_#t~pre64#1=|v_ULTIMATE.start_main_#t~pre64#1_33|, #memory_int=|v_#memory_int_902|, ULTIMATE.start_main_#t~nondet63#1=|v_ULTIMATE.start_main_#t~nondet63#1_25|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre62#1, #pthreadsForks, ULTIMATE.start_main_#t~pre64#1, #memory_int, ULTIMATE.start_main_#t~nondet63#1] and [1090] L982-1-->L988-2: Formula: (and (not (= 20 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_292|)) (= |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_113| |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_129|) (= (select (select |v_#memory_int_878| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_329|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_329|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_129|)) InVars {t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_329|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_329|, #memory_int=|v_#memory_int_878|, t1Thread1of1ForFork0_enqueue_#t~mem39#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_292|} OutVars{t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_329|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_329|, t1Thread1of1ForFork0_enqueue_#t~post41#1=|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_113|, #memory_int=|v_#memory_int_878|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_129|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~post41#1, t1Thread1of1ForFork0_enqueue_#t~mem40#1, t1Thread1of1ForFork0_enqueue_#t~mem39#1] [2022-12-13 00:17:48,869 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:17:48,870 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 435 [2022-12-13 00:17:48,870 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 227 transitions, 784 flow [2022-12-13 00:17:48,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:17:48,870 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:17:48,870 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:17:48,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:17:48,870 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-13 00:17:48,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:17:48,871 INFO L85 PathProgramCache]: Analyzing trace with hash -2092983384, now seen corresponding path program 1 times [2022-12-13 00:17:48,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:17:48,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177090115] [2022-12-13 00:17:48,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:48,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:17:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:49,444 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-13 00:17:49,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:17:49,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177090115] [2022-12-13 00:17:49,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177090115] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:17:49,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:17:49,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 00:17:49,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158488434] [2022-12-13 00:17:49,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:17:49,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 00:17:49,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:17:49,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 00:17:49,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 00:17:49,452 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 187 [2022-12-13 00:17:49,453 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 227 transitions, 784 flow. Second operand has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:17:49,453 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:17:49,453 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 187 [2022-12-13 00:17:49,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:17:52,635 INFO L130 PetriNetUnfolder]: 30684/48822 cut-off events. [2022-12-13 00:17:52,635 INFO L131 PetriNetUnfolder]: For 5370/5370 co-relation queries the response was YES. [2022-12-13 00:17:52,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106144 conditions, 48822 events. 30684/48822 cut-off events. For 5370/5370 co-relation queries the response was YES. Maximal size of possible extension queue 1460. Compared 364023 event pairs, 21842 based on Foata normal form. 0/16759 useless extension candidates. Maximal degree in co-relation 70486. Up to 46890 conditions per place. [2022-12-13 00:17:52,807 INFO L137 encePairwiseOnDemand]: 153/187 looper letters, 237 selfloop transitions, 35 changer transitions 24/311 dead transitions. [2022-12-13 00:17:52,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 311 transitions, 1555 flow [2022-12-13 00:17:52,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 00:17:52,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 00:17:52,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 406 transitions. [2022-12-13 00:17:52,812 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24123588829471182 [2022-12-13 00:17:52,812 INFO L175 Difference]: Start difference. First operand has 191 places, 227 transitions, 784 flow. Second operand 9 states and 406 transitions. [2022-12-13 00:17:52,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 311 transitions, 1555 flow [2022-12-13 00:17:52,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 311 transitions, 1522 flow, removed 13 selfloop flow, removed 1 redundant places. [2022-12-13 00:17:52,874 INFO L231 Difference]: Finished difference. Result has 201 places, 243 transitions, 937 flow [2022-12-13 00:17:52,875 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=751, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=937, PETRI_PLACES=201, PETRI_TRANSITIONS=243} [2022-12-13 00:17:52,875 INFO L295 CegarLoopForPetriNet]: 181 programPoint places, 20 predicate places. [2022-12-13 00:17:52,875 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:17:52,876 INFO L89 Accepts]: Start accepts. Operand has 201 places, 243 transitions, 937 flow [2022-12-13 00:17:52,876 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:17:52,876 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:17:52,877 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 201 places, 243 transitions, 937 flow [2022-12-13 00:17:52,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 243 transitions, 937 flow [2022-12-13 00:17:53,124 INFO L130 PetriNetUnfolder]: 221/1623 cut-off events. [2022-12-13 00:17:53,124 INFO L131 PetriNetUnfolder]: For 82/82 co-relation queries the response was YES. [2022-12-13 00:17:53,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2155 conditions, 1623 events. 221/1623 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 15490 event pairs, 0 based on Foata normal form. 0/443 useless extension candidates. Maximal degree in co-relation 1668. Up to 88 conditions per place. [2022-12-13 00:17:53,134 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 198 places, 243 transitions, 937 flow [2022-12-13 00:17:53,134 INFO L226 LiptonReduction]: Number of co-enabled transitions 15560 [2022-12-13 00:17:53,146 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1005] L988-1-->L988-3: Formula: (and (= |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_83|) (= |v_#memory_int_528| (store |v_#memory_int_529| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_227| (store (select |v_#memory_int_529| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_227|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_227|) (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79| 1))))) InVars {t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_227|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_227|, #memory_int=|v_#memory_int_529|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_83|} OutVars{t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_227|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_227|, t1Thread1of1ForFork0_enqueue_#t~post41#1=|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_79|, #memory_int=|v_#memory_int_528|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_83|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~post41#1, #memory_int] and [1100] L1063-4-->L1064-3: Formula: (and (= |v_#memory_int_902| (store |v_#memory_int_903| |v_ULTIMATE.start_main_~#id2~0#1.base_29| (store (select |v_#memory_int_903| |v_ULTIMATE.start_main_~#id2~0#1.base_29|) |v_ULTIMATE.start_main_~#id2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre64#1_33|))) (= |v_#pthreadsForks_37| (+ |v_#pthreadsForks_38| 1)) (= |v_ULTIMATE.start_main_#t~pre64#1_33| |v_#pthreadsForks_38|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_29|, #pthreadsForks=|v_#pthreadsForks_38|, #memory_int=|v_#memory_int_903|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_29|} OutVars{ULTIMATE.start_main_#t~pre62#1=|v_ULTIMATE.start_main_#t~pre62#1_39|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_29|, #pthreadsForks=|v_#pthreadsForks_37|, ULTIMATE.start_main_#t~pre64#1=|v_ULTIMATE.start_main_#t~pre64#1_33|, #memory_int=|v_#memory_int_902|, ULTIMATE.start_main_#t~nondet63#1=|v_ULTIMATE.start_main_#t~nondet63#1_25|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_29|} 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-13 00:17:53,566 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:17:53,570 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 695 [2022-12-13 00:17:53,570 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 242 transitions, 933 flow [2022-12-13 00:17:53,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:17:53,570 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:17:53,570 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:17:53,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:17:53,571 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-13 00:17:53,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:17:53,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1868567781, now seen corresponding path program 1 times [2022-12-13 00:17:53,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:17:53,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449386385] [2022-12-13 00:17:53,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:53,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:17:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:54,048 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-13 00:17:54,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:17:54,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449386385] [2022-12-13 00:17:54,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449386385] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:17:54,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:17:54,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 00:17:54,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488557583] [2022-12-13 00:17:54,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:17:54,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 00:17:54,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:17:54,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 00:17:54,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 00:17:54,051 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 192 [2022-12-13 00:17:54,051 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 242 transitions, 933 flow. Second operand has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:17:54,051 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:17:54,051 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 192 [2022-12-13 00:17:54,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:17:58,202 INFO L130 PetriNetUnfolder]: 37226/59233 cut-off events. [2022-12-13 00:17:58,202 INFO L131 PetriNetUnfolder]: For 4650/4650 co-relation queries the response was YES. [2022-12-13 00:17:58,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131268 conditions, 59233 events. 37226/59233 cut-off events. For 4650/4650 co-relation queries the response was YES. Maximal size of possible extension queue 1985. Compared 462527 event pairs, 13142 based on Foata normal form. 0/20832 useless extension candidates. Maximal degree in co-relation 121440. Up to 44472 conditions per place. [2022-12-13 00:17:58,406 INFO L137 encePairwiseOnDemand]: 149/192 looper letters, 345 selfloop transitions, 72 changer transitions 84/516 dead transitions. [2022-12-13 00:17:58,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 516 transitions, 2628 flow [2022-12-13 00:17:58,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 00:17:58,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 00:17:58,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 599 transitions. [2022-12-13 00:17:58,409 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34664351851851855 [2022-12-13 00:17:58,409 INFO L175 Difference]: Start difference. First operand has 197 places, 242 transitions, 933 flow. Second operand 9 states and 599 transitions. [2022-12-13 00:17:58,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 516 transitions, 2628 flow [2022-12-13 00:17:58,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 516 transitions, 2601 flow, removed 10 selfloop flow, removed 1 redundant places. [2022-12-13 00:17:58,502 INFO L231 Difference]: Finished difference. Result has 209 places, 282 transitions, 1404 flow [2022-12-13 00:17:58,503 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=906, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1404, PETRI_PLACES=209, PETRI_TRANSITIONS=282} [2022-12-13 00:17:58,503 INFO L295 CegarLoopForPetriNet]: 181 programPoint places, 28 predicate places. [2022-12-13 00:17:58,503 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:17:58,503 INFO L89 Accepts]: Start accepts. Operand has 209 places, 282 transitions, 1404 flow [2022-12-13 00:17:58,504 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:17:58,504 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:17:58,504 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 209 places, 282 transitions, 1404 flow [2022-12-13 00:17:58,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 282 transitions, 1404 flow [2022-12-13 00:17:58,586 INFO L130 PetriNetUnfolder]: 315/2069 cut-off events. [2022-12-13 00:17:58,587 INFO L131 PetriNetUnfolder]: For 215/247 co-relation queries the response was YES. [2022-12-13 00:17:58,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3162 conditions, 2069 events. 315/2069 cut-off events. For 215/247 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 21338 event pairs, 0 based on Foata normal form. 3/562 useless extension candidates. Maximal degree in co-relation 2772. Up to 166 conditions per place. [2022-12-13 00:17:58,605 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 209 places, 282 transitions, 1404 flow [2022-12-13 00:17:58,606 INFO L226 LiptonReduction]: Number of co-enabled transitions 17144 [2022-12-13 00:17:58,654 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:17:58,656 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 153 [2022-12-13 00:17:58,656 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 282 transitions, 1404 flow [2022-12-13 00:17:58,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:17:58,656 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:17:58,657 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:17:58,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:17:58,657 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:17:58,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:17:58,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1085635225, now seen corresponding path program 1 times [2022-12-13 00:17:58,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:17:58,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86193446] [2022-12-13 00:17:58,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:17:58,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:17:58,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:17:58,692 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-13 00:17:58,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:17:58,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86193446] [2022-12-13 00:17:58,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86193446] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:17:58,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:17:58,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:17:58,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183616267] [2022-12-13 00:17:58,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:17:58,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:17:58,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:17:58,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:17:58,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:17:58,693 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 192 [2022-12-13 00:17:58,693 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 282 transitions, 1404 flow. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:17:58,693 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:17:58,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 192 [2022-12-13 00:17:58,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:18:00,754 INFO L130 PetriNetUnfolder]: 18391/30201 cut-off events. [2022-12-13 00:18:00,754 INFO L131 PetriNetUnfolder]: For 3909/4217 co-relation queries the response was YES. [2022-12-13 00:18:00,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66225 conditions, 30201 events. 18391/30201 cut-off events. For 3909/4217 co-relation queries the response was YES. Maximal size of possible extension queue 735. Compared 206418 event pairs, 10924 based on Foata normal form. 430/11439 useless extension candidates. Maximal degree in co-relation 66203. Up to 15416 conditions per place. [2022-12-13 00:18:00,831 INFO L137 encePairwiseOnDemand]: 182/192 looper letters, 159 selfloop transitions, 3 changer transitions 102/288 dead transitions. [2022-12-13 00:18:00,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 288 transitions, 1712 flow [2022-12-13 00:18:00,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:18:00,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:18:00,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 300 transitions. [2022-12-13 00:18:00,833 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2022-12-13 00:18:00,833 INFO L175 Difference]: Start difference. First operand has 209 places, 282 transitions, 1404 flow. Second operand 3 states and 300 transitions. [2022-12-13 00:18:00,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 288 transitions, 1712 flow [2022-12-13 00:18:00,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 288 transitions, 1524 flow, removed 27 selfloop flow, removed 12 redundant places. [2022-12-13 00:18:00,860 INFO L231 Difference]: Finished difference. Result has 197 places, 134 transitions, 465 flow [2022-12-13 00:18:00,861 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=867, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=465, PETRI_PLACES=197, PETRI_TRANSITIONS=134} [2022-12-13 00:18:00,861 INFO L295 CegarLoopForPetriNet]: 181 programPoint places, 16 predicate places. [2022-12-13 00:18:00,861 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:18:00,861 INFO L89 Accepts]: Start accepts. Operand has 197 places, 134 transitions, 465 flow [2022-12-13 00:18:00,862 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:18:00,862 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:18:00,862 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 134 transitions, 465 flow [2022-12-13 00:18:00,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 134 transitions, 465 flow [2022-12-13 00:18:00,880 INFO L130 PetriNetUnfolder]: 49/433 cut-off events. [2022-12-13 00:18:00,880 INFO L131 PetriNetUnfolder]: For 33/34 co-relation queries the response was YES. [2022-12-13 00:18:00,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 580 conditions, 433 events. 49/433 cut-off events. For 33/34 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2229 event pairs, 0 based on Foata normal form. 1/158 useless extension candidates. Maximal degree in co-relation 520. Up to 18 conditions per place. [2022-12-13 00:18:00,883 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 134 transitions, 465 flow [2022-12-13 00:18:00,883 INFO L226 LiptonReduction]: Number of co-enabled transitions 5028 [2022-12-13 00:18:00,969 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [882] L982-1-->L988-1: Formula: (and (= |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_45| (select (select |v_#memory_int_246| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_121|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_121|))) (not (= 20 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_96|))) InVars {t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_121|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_121|, #memory_int=|v_#memory_int_246|, t1Thread1of1ForFork0_enqueue_#t~mem39#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_96|} OutVars{t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_121|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_121|, #memory_int=|v_#memory_int_246|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_45|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1, t1Thread1of1ForFork0_enqueue_#t~mem39#1] and [1100] L1063-4-->L1064-3: Formula: (and (= |v_#memory_int_902| (store |v_#memory_int_903| |v_ULTIMATE.start_main_~#id2~0#1.base_29| (store (select |v_#memory_int_903| |v_ULTIMATE.start_main_~#id2~0#1.base_29|) |v_ULTIMATE.start_main_~#id2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre64#1_33|))) (= |v_#pthreadsForks_37| (+ |v_#pthreadsForks_38| 1)) (= |v_ULTIMATE.start_main_#t~pre64#1_33| |v_#pthreadsForks_38|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_29|, #pthreadsForks=|v_#pthreadsForks_38|, #memory_int=|v_#memory_int_903|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_29|} OutVars{ULTIMATE.start_main_#t~pre62#1=|v_ULTIMATE.start_main_#t~pre62#1_39|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_29|, #pthreadsForks=|v_#pthreadsForks_37|, ULTIMATE.start_main_#t~pre64#1=|v_ULTIMATE.start_main_#t~pre64#1_33|, #memory_int=|v_#memory_int_902|, ULTIMATE.start_main_#t~nondet63#1=|v_ULTIMATE.start_main_#t~nondet63#1_25|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_29|} 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-13 00:18:01,044 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1010] L981-3-->L982-1: Formula: (= (select (select |v_#memory_int_556| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_235|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_235|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_209|) InVars {t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_235|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_235|, #memory_int=|v_#memory_int_556|} OutVars{t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_235|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_235|, #memory_int=|v_#memory_int_556|, t1Thread1of1ForFork0_enqueue_#t~mem39#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_209|, t1Thread1of1ForFork0_enqueue_#t~post38#1=|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_89|, t1Thread1of1ForFork0_enqueue_#t~mem37#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem37#1_95|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem39#1, t1Thread1of1ForFork0_enqueue_#t~post38#1, t1Thread1of1ForFork0_enqueue_#t~mem37#1] and [1125] L1063-4-->L988-1: Formula: (and (= (store |v_#memory_int_2153| |v_ULTIMATE.start_main_~#id2~0#1.base_199| (store (select |v_#memory_int_2153| |v_ULTIMATE.start_main_~#id2~0#1.base_199|) |v_ULTIMATE.start_main_~#id2~0#1.offset_199| |v_ULTIMATE.start_main_#t~pre64#1_203|)) |v_#memory_int_2152|) (= (+ |v_#pthreadsForks_374| 1) |v_#pthreadsForks_373|) (= |v_ULTIMATE.start_main_#t~pre64#1_203| |v_#pthreadsForks_374|) (= |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_333| (select (select |v_#memory_int_2152| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_793|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_793|))) (not (= 20 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_692|))) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_199|, #pthreadsForks=|v_#pthreadsForks_374|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_793|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_793|, #memory_int=|v_#memory_int_2153|, t1Thread1of1ForFork0_enqueue_#t~mem39#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_692|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_199|} OutVars{ULTIMATE.start_main_#t~pre62#1=|v_ULTIMATE.start_main_#t~pre62#1_211|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_199|, #pthreadsForks=|v_#pthreadsForks_373|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_793|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_793|, ULTIMATE.start_main_#t~pre64#1=|v_ULTIMATE.start_main_#t~pre64#1_203|, #memory_int=|v_#memory_int_2152|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_333|, ULTIMATE.start_main_#t~nondet63#1=|v_ULTIMATE.start_main_#t~nondet63#1_195|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_199|} 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-13 00:18:01,227 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 00:18:01,227 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 366 [2022-12-13 00:18:01,227 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 132 transitions, 472 flow [2022-12-13 00:18:01,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:18:01,228 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:18:01,228 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:18:01,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:18:01,228 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:18:01,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:18:01,228 INFO L85 PathProgramCache]: Analyzing trace with hash -870391143, now seen corresponding path program 1 times [2022-12-13 00:18:01,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:18:01,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339274093] [2022-12-13 00:18:01,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:18:01,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:18:01,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:18:01,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:18:01,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:18:01,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339274093] [2022-12-13 00:18:01,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339274093] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:18:01,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:18:01,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 00:18:01,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892778195] [2022-12-13 00:18:01,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:18:01,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 00:18:01,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:18:01,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 00:18:01,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 00:18:01,798 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 117 [2022-12-13 00:18:01,799 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 132 transitions, 472 flow. Second operand has 9 states, 9 states have (on average 15.333333333333334) internal successors, (138), 9 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:18:01,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:18:01,799 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 117 [2022-12-13 00:18:01,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:18:03,314 INFO L130 PetriNetUnfolder]: 12473/20258 cut-off events. [2022-12-13 00:18:03,314 INFO L131 PetriNetUnfolder]: For 1820/1820 co-relation queries the response was YES. [2022-12-13 00:18:03,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42196 conditions, 20258 events. 12473/20258 cut-off events. For 1820/1820 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 129980 event pairs, 7085 based on Foata normal form. 0/8444 useless extension candidates. Maximal degree in co-relation 37913. Up to 13494 conditions per place. [2022-12-13 00:18:03,353 INFO L137 encePairwiseOnDemand]: 98/117 looper letters, 143 selfloop transitions, 26 changer transitions 74/258 dead transitions. [2022-12-13 00:18:03,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 258 transitions, 1235 flow [2022-12-13 00:18:03,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 00:18:03,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 00:18:03,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 361 transitions. [2022-12-13 00:18:03,355 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34283000949667614 [2022-12-13 00:18:03,355 INFO L175 Difference]: Start difference. First operand has 129 places, 132 transitions, 472 flow. Second operand 9 states and 361 transitions. [2022-12-13 00:18:03,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 258 transitions, 1235 flow [2022-12-13 00:18:03,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 258 transitions, 1218 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-13 00:18:03,365 INFO L231 Difference]: Finished difference. Result has 139 places, 130 transitions, 535 flow [2022-12-13 00:18:03,365 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=535, PETRI_PLACES=139, PETRI_TRANSITIONS=130} [2022-12-13 00:18:03,365 INFO L295 CegarLoopForPetriNet]: 181 programPoint places, -42 predicate places. [2022-12-13 00:18:03,365 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:18:03,365 INFO L89 Accepts]: Start accepts. Operand has 139 places, 130 transitions, 535 flow [2022-12-13 00:18:03,366 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:18:03,366 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:18:03,366 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 130 transitions, 535 flow [2022-12-13 00:18:03,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 130 transitions, 535 flow [2022-12-13 00:18:03,385 INFO L130 PetriNetUnfolder]: 50/485 cut-off events. [2022-12-13 00:18:03,386 INFO L131 PetriNetUnfolder]: For 123/125 co-relation queries the response was YES. [2022-12-13 00:18:03,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 682 conditions, 485 events. 50/485 cut-off events. For 123/125 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2823 event pairs, 0 based on Foata normal form. 2/170 useless extension candidates. Maximal degree in co-relation 615. Up to 18 conditions per place. [2022-12-13 00:18:03,389 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 130 transitions, 535 flow [2022-12-13 00:18:03,389 INFO L226 LiptonReduction]: Number of co-enabled transitions 4978 [2022-12-13 00:18:03,442 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [996] L1014-->L960-1: Formula: (and (= |v_t1Thread1of1ForFork0_empty_#in~q#1.offset_11| |v_t1Thread1of1ForFork0_empty_~q#1.offset_19|) (= |v_t1Thread1of1ForFork0_empty_#in~q#1.base_11| |v_t1Thread1of1ForFork0_empty_~q#1.base_19|) (= |v_t1Thread1of1ForFork0_empty_#t~mem31#1_55| (select (select |v_#memory_int_480| |v_t1Thread1of1ForFork0_empty_~q#1.base_19|) (+ 80 |v_t1Thread1of1ForFork0_empty_~q#1.offset_19|)))) InVars {t1Thread1of1ForFork0_empty_#in~q#1.offset=|v_t1Thread1of1ForFork0_empty_#in~q#1.offset_11|, #memory_int=|v_#memory_int_480|, t1Thread1of1ForFork0_empty_#in~q#1.base=|v_t1Thread1of1ForFork0_empty_#in~q#1.base_11|} OutVars{t1Thread1of1ForFork0_empty_~q#1.offset=|v_t1Thread1of1ForFork0_empty_~q#1.offset_19|, t1Thread1of1ForFork0_empty_#in~q#1.offset=|v_t1Thread1of1ForFork0_empty_#in~q#1.offset_11|, t1Thread1of1ForFork0_empty_#t~nondet33#1=|v_t1Thread1of1ForFork0_empty_#t~nondet33#1_25|, t1Thread1of1ForFork0_empty_#t~mem32#1=|v_t1Thread1of1ForFork0_empty_#t~mem32#1_55|, t1Thread1of1ForFork0_empty_#t~mem31#1=|v_t1Thread1of1ForFork0_empty_#t~mem31#1_55|, #memory_int=|v_#memory_int_480|, t1Thread1of1ForFork0_empty_~q#1.base=|v_t1Thread1of1ForFork0_empty_~q#1.base_19|, t1Thread1of1ForFork0_empty_#in~q#1.base=|v_t1Thread1of1ForFork0_empty_#in~q#1.base_11|, t1Thread1of1ForFork0_empty_#res#1=|v_t1Thread1of1ForFork0_empty_#res#1_33|} 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 [1100] L1063-4-->L1064-3: Formula: (and (= |v_#memory_int_902| (store |v_#memory_int_903| |v_ULTIMATE.start_main_~#id2~0#1.base_29| (store (select |v_#memory_int_903| |v_ULTIMATE.start_main_~#id2~0#1.base_29|) |v_ULTIMATE.start_main_~#id2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre64#1_33|))) (= |v_#pthreadsForks_37| (+ |v_#pthreadsForks_38| 1)) (= |v_ULTIMATE.start_main_#t~pre64#1_33| |v_#pthreadsForks_38|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_29|, #pthreadsForks=|v_#pthreadsForks_38|, #memory_int=|v_#memory_int_903|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_29|} OutVars{ULTIMATE.start_main_#t~pre62#1=|v_ULTIMATE.start_main_#t~pre62#1_39|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_29|, #pthreadsForks=|v_#pthreadsForks_37|, ULTIMATE.start_main_#t~pre64#1=|v_ULTIMATE.start_main_#t~pre64#1_33|, #memory_int=|v_#memory_int_902|, ULTIMATE.start_main_#t~nondet63#1=|v_ULTIMATE.start_main_#t~nondet63#1_25|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_29|} 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-13 00:18:03,612 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 00:18:03,613 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 248 [2022-12-13 00:18:03,613 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 127 transitions, 513 flow [2022-12-13 00:18:03,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.333333333333334) internal successors, (138), 9 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:18:03,613 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:18:03,613 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:18:03,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:18:03,613 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-13 00:18:03,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:18:03,613 INFO L85 PathProgramCache]: Analyzing trace with hash -999212050, now seen corresponding path program 1 times [2022-12-13 00:18:03,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:18:03,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156130354] [2022-12-13 00:18:03,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:18:03,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:18:03,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:18:04,007 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-13 00:18:04,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:18:04,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156130354] [2022-12-13 00:18:04,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156130354] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:18:04,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:18:04,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 00:18:04,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401195810] [2022-12-13 00:18:04,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:18:04,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 00:18:04,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:18:04,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 00:18:04,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 00:18:04,009 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 116 [2022-12-13 00:18:04,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 127 transitions, 513 flow. Second operand has 8 states, 8 states have (on average 15.25) internal successors, (122), 8 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:18:04,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:18:04,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 116 [2022-12-13 00:18:04,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:18:05,710 INFO L130 PetriNetUnfolder]: 15462/25302 cut-off events. [2022-12-13 00:18:05,710 INFO L131 PetriNetUnfolder]: For 4105/4105 co-relation queries the response was YES. [2022-12-13 00:18:05,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53794 conditions, 25302 events. 15462/25302 cut-off events. For 4105/4105 co-relation queries the response was YES. Maximal size of possible extension queue 1214. Compared 172889 event pairs, 9230 based on Foata normal form. 0/10267 useless extension candidates. Maximal degree in co-relation 46528. Up to 17154 conditions per place. [2022-12-13 00:18:05,766 INFO L137 encePairwiseOnDemand]: 100/116 looper letters, 158 selfloop transitions, 17 changer transitions 79/269 dead transitions. [2022-12-13 00:18:05,767 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 269 transitions, 1393 flow [2022-12-13 00:18:05,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 00:18:05,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 00:18:05,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 360 transitions. [2022-12-13 00:18:05,768 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3879310344827586 [2022-12-13 00:18:05,768 INFO L175 Difference]: Start difference. First operand has 132 places, 127 transitions, 513 flow. Second operand 8 states and 360 transitions. [2022-12-13 00:18:05,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 269 transitions, 1393 flow [2022-12-13 00:18:05,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 269 transitions, 1285 flow, removed 32 selfloop flow, removed 10 redundant places. [2022-12-13 00:18:05,795 INFO L231 Difference]: Finished difference. Result has 133 places, 133 transitions, 538 flow [2022-12-13 00:18:05,795 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=538, PETRI_PLACES=133, PETRI_TRANSITIONS=133} [2022-12-13 00:18:05,795 INFO L295 CegarLoopForPetriNet]: 181 programPoint places, -48 predicate places. [2022-12-13 00:18:05,795 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:18:05,795 INFO L89 Accepts]: Start accepts. Operand has 133 places, 133 transitions, 538 flow [2022-12-13 00:18:05,796 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:18:05,796 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:18:05,796 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 133 transitions, 538 flow [2022-12-13 00:18:05,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 133 transitions, 538 flow [2022-12-13 00:18:05,818 INFO L130 PetriNetUnfolder]: 53/557 cut-off events. [2022-12-13 00:18:05,818 INFO L131 PetriNetUnfolder]: For 150/152 co-relation queries the response was YES. [2022-12-13 00:18:05,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 770 conditions, 557 events. 53/557 cut-off events. For 150/152 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3625 event pairs, 0 based on Foata normal form. 2/203 useless extension candidates. Maximal degree in co-relation 685. Up to 18 conditions per place. [2022-12-13 00:18:05,822 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 133 transitions, 538 flow [2022-12-13 00:18:05,822 INFO L226 LiptonReduction]: Number of co-enabled transitions 5118 [2022-12-13 00:18:05,904 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1147] L1014-->L1064-3: Formula: (and (= |v_t1Thread1of1ForFork0_empty_~q#1.offset_237| |v_t1Thread1of1ForFork0_empty_#in~q#1.offset_77|) (= (store |v_#memory_int_3043| |v_ULTIMATE.start_main_~#id2~0#1.base_275| (store (select |v_#memory_int_3043| |v_ULTIMATE.start_main_~#id2~0#1.base_275|) |v_ULTIMATE.start_main_~#id2~0#1.offset_243| |v_ULTIMATE.start_main_#t~pre64#1_289|)) |v_#memory_int_3042|) (= |v_ULTIMATE.start_main_#t~pre64#1_289| |v_#pthreadsForks_422|) (= |v_t1Thread1of1ForFork0_empty_~q#1.base_237| |v_t1Thread1of1ForFork0_empty_#in~q#1.base_77|) (= |v_t1Thread1of1ForFork0_empty_#t~mem31#1_415| (select (select |v_#memory_int_3043| |v_t1Thread1of1ForFork0_empty_~q#1.base_237|) (+ |v_t1Thread1of1ForFork0_empty_~q#1.offset_237| 80))) (= (+ |v_#pthreadsForks_422| 1) |v_#pthreadsForks_421|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_243|, t1Thread1of1ForFork0_empty_#in~q#1.offset=|v_t1Thread1of1ForFork0_empty_#in~q#1.offset_77|, #pthreadsForks=|v_#pthreadsForks_422|, #memory_int=|v_#memory_int_3043|, t1Thread1of1ForFork0_empty_#in~q#1.base=|v_t1Thread1of1ForFork0_empty_#in~q#1.base_77|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_275|} OutVars{t1Thread1of1ForFork0_empty_~q#1.offset=|v_t1Thread1of1ForFork0_empty_~q#1.offset_237|, ULTIMATE.start_main_#t~pre62#1=|v_ULTIMATE.start_main_#t~pre62#1_235|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_243|, t1Thread1of1ForFork0_empty_#in~q#1.offset=|v_t1Thread1of1ForFork0_empty_#in~q#1.offset_77|, ULTIMATE.start_main_#t~pre64#1=|v_ULTIMATE.start_main_#t~pre64#1_289|, t1Thread1of1ForFork0_empty_#t~mem31#1=|v_t1Thread1of1ForFork0_empty_#t~mem31#1_415|, t1Thread1of1ForFork0_empty_~q#1.base=|v_t1Thread1of1ForFork0_empty_~q#1.base_237|, #pthreadsForks=|v_#pthreadsForks_421|, t1Thread1of1ForFork0_empty_#t~nondet33#1=|v_t1Thread1of1ForFork0_empty_#t~nondet33#1_227|, t1Thread1of1ForFork0_empty_#t~mem32#1=|v_t1Thread1of1ForFork0_empty_#t~mem32#1_303|, #memory_int=|v_#memory_int_3042|, t1Thread1of1ForFork0_empty_#in~q#1.base=|v_t1Thread1of1ForFork0_empty_#in~q#1.base_77|, ULTIMATE.start_main_#t~nondet63#1=|v_ULTIMATE.start_main_#t~nondet63#1_219|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_275|, t1Thread1of1ForFork0_empty_#res#1=|v_t1Thread1of1ForFork0_empty_#res#1_179|} 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 [1101] L960-1-->L1014-3: Formula: (let ((.cse0 (= |v_t1Thread1of1ForFork0_#t~ret52#1_Out_2| |v_t1Thread1of1ForFork0_empty_#res#1_Out_2|)) (.cse1 (= |v_t1Thread1of1ForFork0_empty_#t~mem31#1_In_1| (select (select |v_#memory_int_In_1| |v_t1Thread1of1ForFork0_empty_~q#1.base_In_1|) (+ 84 |v_t1Thread1of1ForFork0_empty_~q#1.offset_In_1|))))) (or (and .cse0 (not .cse1) (= |v_t1Thread1of1ForFork0_empty_#res#1_Out_2| 0) (= |v_t1Thread1of1ForFork0_empty_#t~nondet33#1_In_1| |v_t1Thread1of1ForFork0_empty_#t~nondet33#1_Out_2|)) (and .cse0 (= (+ |v_t1Thread1of1ForFork0_empty_#res#1_Out_2| 1) 0) .cse1))) InVars {t1Thread1of1ForFork0_empty_~q#1.offset=|v_t1Thread1of1ForFork0_empty_~q#1.offset_In_1|, #memory_int=|v_#memory_int_In_1|, t1Thread1of1ForFork0_empty_~q#1.base=|v_t1Thread1of1ForFork0_empty_~q#1.base_In_1|, 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_1|} OutVars{t1Thread1of1ForFork0_empty_~q#1.offset=|v_t1Thread1of1ForFork0_empty_~q#1.offset_In_1|, t1Thread1of1ForFork0_empty_#t~nondet33#1=|v_t1Thread1of1ForFork0_empty_#t~nondet33#1_Out_2|, t1Thread1of1ForFork0_empty_#t~mem32#1=|v_t1Thread1of1ForFork0_empty_#t~mem32#1_Out_2|, t1Thread1of1ForFork0_#t~ret52#1=|v_t1Thread1of1ForFork0_#t~ret52#1_Out_2|, #memory_int=|v_#memory_int_In_1|, t1Thread1of1ForFork0_empty_~q#1.base=|v_t1Thread1of1ForFork0_empty_~q#1.base_In_1|, t1Thread1of1ForFork0_empty_#res#1=|v_t1Thread1of1ForFork0_empty_#res#1_Out_2|} 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-13 00:18:06,084 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:18:06,085 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 290 [2022-12-13 00:18:06,085 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 131 transitions, 534 flow [2022-12-13 00:18:06,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.25) internal successors, (122), 8 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:18:06,085 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:18:06,085 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:18:06,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:18:06,085 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:18:06,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:18:06,085 INFO L85 PathProgramCache]: Analyzing trace with hash -999149643, now seen corresponding path program 1 times [2022-12-13 00:18:06,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:18:06,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247611000] [2022-12-13 00:18:06,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:18:06,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:18:06,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:18:06,431 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-13 00:18:06,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:18:06,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247611000] [2022-12-13 00:18:06,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247611000] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:18:06,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:18:06,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:18:06,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878957803] [2022-12-13 00:18:06,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:18:06,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:18:06,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:18:06,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:18:06,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:18:06,432 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 116 [2022-12-13 00:18:06,432 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 131 transitions, 534 flow. Second operand has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:18:06,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:18:06,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 116 [2022-12-13 00:18:06,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:18:08,023 INFO L130 PetriNetUnfolder]: 15089/24746 cut-off events. [2022-12-13 00:18:08,024 INFO L131 PetriNetUnfolder]: For 4265/4265 co-relation queries the response was YES. [2022-12-13 00:18:08,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52607 conditions, 24746 events. 15089/24746 cut-off events. For 4265/4265 co-relation queries the response was YES. Maximal size of possible extension queue 1125. Compared 170378 event pairs, 8046 based on Foata normal form. 0/10344 useless extension candidates. Maximal degree in co-relation 45410. Up to 16992 conditions per place. [2022-12-13 00:18:08,103 INFO L137 encePairwiseOnDemand]: 102/116 looper letters, 140 selfloop transitions, 18 changer transitions 60/233 dead transitions. [2022-12-13 00:18:08,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 233 transitions, 1196 flow [2022-12-13 00:18:08,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:18:08,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:18:08,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 296 transitions. [2022-12-13 00:18:08,104 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42528735632183906 [2022-12-13 00:18:08,104 INFO L175 Difference]: Start difference. First operand has 130 places, 131 transitions, 534 flow. Second operand 6 states and 296 transitions. [2022-12-13 00:18:08,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 233 transitions, 1196 flow [2022-12-13 00:18:08,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 233 transitions, 1182 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-13 00:18:08,132 INFO L231 Difference]: Finished difference. Result has 133 places, 131 transitions, 569 flow [2022-12-13 00:18:08,132 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=569, PETRI_PLACES=133, PETRI_TRANSITIONS=131} [2022-12-13 00:18:08,133 INFO L295 CegarLoopForPetriNet]: 181 programPoint places, -48 predicate places. [2022-12-13 00:18:08,133 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:18:08,133 INFO L89 Accepts]: Start accepts. Operand has 133 places, 131 transitions, 569 flow [2022-12-13 00:18:08,137 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:18:08,137 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:18:08,137 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 131 transitions, 569 flow [2022-12-13 00:18:08,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 131 transitions, 569 flow [2022-12-13 00:18:08,167 INFO L130 PetriNetUnfolder]: 53/557 cut-off events. [2022-12-13 00:18:08,167 INFO L131 PetriNetUnfolder]: For 208/208 co-relation queries the response was YES. [2022-12-13 00:18:08,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 783 conditions, 557 events. 53/557 cut-off events. For 208/208 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3737 event pairs, 0 based on Foata normal form. 0/198 useless extension candidates. Maximal degree in co-relation 638. Up to 18 conditions per place. [2022-12-13 00:18:08,172 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 131 transitions, 569 flow [2022-12-13 00:18:08,172 INFO L226 LiptonReduction]: Number of co-enabled transitions 5046 [2022-12-13 00:18:08,184 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:18:08,185 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 52 [2022-12-13 00:18:08,185 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 131 transitions, 569 flow [2022-12-13 00:18:08,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:18:08,185 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:18:08,185 INFO L214 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-13 00:18:08,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:18:08,185 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-13 00:18:08,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:18:08,186 INFO L85 PathProgramCache]: Analyzing trace with hash -942841336, now seen corresponding path program 1 times [2022-12-13 00:18:08,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:18:08,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285895046] [2022-12-13 00:18:08,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:18:08,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:18:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:18:08,245 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-13 00:18:08,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:18:08,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285895046] [2022-12-13 00:18:08,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285895046] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:18:08,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:18:08,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:18:08,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506974372] [2022-12-13 00:18:08,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:18:08,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:18:08,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:18:08,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:18:08,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:18:08,246 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 115 [2022-12-13 00:18:08,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 131 transitions, 569 flow. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:18:08,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:18:08,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 115 [2022-12-13 00:18:08,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:18:09,105 INFO L130 PetriNetUnfolder]: 8555/15376 cut-off events. [2022-12-13 00:18:09,106 INFO L131 PetriNetUnfolder]: For 3424/3428 co-relation queries the response was YES. [2022-12-13 00:18:09,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33226 conditions, 15376 events. 8555/15376 cut-off events. For 3424/3428 co-relation queries the response was YES. Maximal size of possible extension queue 956. Compared 114472 event pairs, 2382 based on Foata normal form. 9/6451 useless extension candidates. Maximal degree in co-relation 27855. Up to 10826 conditions per place. [2022-12-13 00:18:09,134 INFO L137 encePairwiseOnDemand]: 99/115 looper letters, 83 selfloop transitions, 11 changer transitions 34/147 dead transitions. [2022-12-13 00:18:09,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 147 transitions, 878 flow [2022-12-13 00:18:09,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:18:09,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:18:09,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 172 transitions. [2022-12-13 00:18:09,135 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4985507246376812 [2022-12-13 00:18:09,135 INFO L175 Difference]: Start difference. First operand has 133 places, 131 transitions, 569 flow. Second operand 3 states and 172 transitions. [2022-12-13 00:18:09,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 147 transitions, 878 flow [2022-12-13 00:18:09,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 147 transitions, 855 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-13 00:18:09,147 INFO L231 Difference]: Finished difference. Result has 132 places, 101 transitions, 504 flow [2022-12-13 00:18:09,147 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=504, PETRI_PLACES=132, PETRI_TRANSITIONS=101} [2022-12-13 00:18:09,148 INFO L295 CegarLoopForPetriNet]: 181 programPoint places, -49 predicate places. [2022-12-13 00:18:09,148 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:18:09,148 INFO L89 Accepts]: Start accepts. Operand has 132 places, 101 transitions, 504 flow [2022-12-13 00:18:09,149 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:18:09,149 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:18:09,149 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 101 transitions, 504 flow [2022-12-13 00:18:09,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 101 transitions, 504 flow [2022-12-13 00:18:09,173 INFO L130 PetriNetUnfolder]: 121/609 cut-off events. [2022-12-13 00:18:09,173 INFO L131 PetriNetUnfolder]: For 190/190 co-relation queries the response was YES. [2022-12-13 00:18:09,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1072 conditions, 609 events. 121/609 cut-off events. For 190/190 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3843 event pairs, 19 based on Foata normal form. 0/349 useless extension candidates. Maximal degree in co-relation 879. Up to 137 conditions per place. [2022-12-13 00:18:09,176 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 101 transitions, 504 flow [2022-12-13 00:18:09,176 INFO L226 LiptonReduction]: Number of co-enabled transitions 1742 [2022-12-13 00:18:10,365 INFO L241 LiptonReduction]: Total number of compositions: 14 [2022-12-13 00:18:10,366 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1218 [2022-12-13 00:18:10,366 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 90 transitions, 506 flow [2022-12-13 00:18:10,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:18:10,367 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:18:10,367 INFO L214 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-13 00:18:10,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 00:18:10,367 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-13 00:18:10,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:18:10,367 INFO L85 PathProgramCache]: Analyzing trace with hash 132201701, now seen corresponding path program 1 times [2022-12-13 00:18:10,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:18:10,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184627072] [2022-12-13 00:18:10,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:18:10,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:18:10,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:18:10,895 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-13 00:18:10,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:18:10,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184627072] [2022-12-13 00:18:10,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184627072] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:18:10,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:18:10,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 00:18:10,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842825783] [2022-12-13 00:18:10,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:18:10,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 00:18:10,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:18:10,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 00:18:10,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 00:18:10,896 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 75 [2022-12-13 00:18:10,896 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 90 transitions, 506 flow. Second operand has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:18:10,896 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:18:10,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 75 [2022-12-13 00:18:10,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:18:11,570 INFO L130 PetriNetUnfolder]: 3868/6746 cut-off events. [2022-12-13 00:18:11,571 INFO L131 PetriNetUnfolder]: For 2773/2777 co-relation queries the response was YES. [2022-12-13 00:18:11,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16515 conditions, 6746 events. 3868/6746 cut-off events. For 2773/2777 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 43137 event pairs, 1659 based on Foata normal form. 0/4099 useless extension candidates. Maximal degree in co-relation 14537. Up to 4503 conditions per place. [2022-12-13 00:18:11,587 INFO L137 encePairwiseOnDemand]: 54/75 looper letters, 108 selfloop transitions, 30 changer transitions 54/203 dead transitions. [2022-12-13 00:18:11,588 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 203 transitions, 1192 flow [2022-12-13 00:18:11,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 00:18:11,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 00:18:11,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 305 transitions. [2022-12-13 00:18:11,589 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3696969696969697 [2022-12-13 00:18:11,589 INFO L175 Difference]: Start difference. First operand has 94 places, 90 transitions, 506 flow. Second operand 11 states and 305 transitions. [2022-12-13 00:18:11,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 203 transitions, 1192 flow [2022-12-13 00:18:11,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 203 transitions, 1156 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:18:11,599 INFO L231 Difference]: Finished difference. Result has 107 places, 98 transitions, 628 flow [2022-12-13 00:18:11,600 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=628, PETRI_PLACES=107, PETRI_TRANSITIONS=98} [2022-12-13 00:18:11,600 INFO L295 CegarLoopForPetriNet]: 181 programPoint places, -74 predicate places. [2022-12-13 00:18:11,600 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:18:11,600 INFO L89 Accepts]: Start accepts. Operand has 107 places, 98 transitions, 628 flow [2022-12-13 00:18:11,601 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:18:11,601 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:18:11,601 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 98 transitions, 628 flow [2022-12-13 00:18:11,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 98 transitions, 628 flow [2022-12-13 00:18:11,626 INFO L130 PetriNetUnfolder]: 107/589 cut-off events. [2022-12-13 00:18:11,626 INFO L131 PetriNetUnfolder]: For 318/318 co-relation queries the response was YES. [2022-12-13 00:18:11,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1072 conditions, 589 events. 107/589 cut-off events. For 318/318 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4121 event pairs, 12 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 947. Up to 97 conditions per place. [2022-12-13 00:18:11,629 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 98 transitions, 628 flow [2022-12-13 00:18:11,629 INFO L226 LiptonReduction]: Number of co-enabled transitions 1596 [2022-12-13 00:18:11,634 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [804] 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 [1100] L1063-4-->L1064-3: Formula: (and (= |v_#memory_int_902| (store |v_#memory_int_903| |v_ULTIMATE.start_main_~#id2~0#1.base_29| (store (select |v_#memory_int_903| |v_ULTIMATE.start_main_~#id2~0#1.base_29|) |v_ULTIMATE.start_main_~#id2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre64#1_33|))) (= |v_#pthreadsForks_37| (+ |v_#pthreadsForks_38| 1)) (= |v_ULTIMATE.start_main_#t~pre64#1_33| |v_#pthreadsForks_38|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_29|, #pthreadsForks=|v_#pthreadsForks_38|, #memory_int=|v_#memory_int_903|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_29|} OutVars{ULTIMATE.start_main_#t~pre62#1=|v_ULTIMATE.start_main_#t~pre62#1_39|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_29|, #pthreadsForks=|v_#pthreadsForks_37|, ULTIMATE.start_main_#t~pre64#1=|v_ULTIMATE.start_main_#t~pre64#1_33|, #memory_int=|v_#memory_int_902|, ULTIMATE.start_main_#t~nondet63#1=|v_ULTIMATE.start_main_#t~nondet63#1_25|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_29|} 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-13 00:18:11,666 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1180] L981-9-->L1064-3: Formula: (and (= |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_939| (select (select |v_#memory_int_3351| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_1235|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_1235|))) (= |v_ULTIMATE.start_main_#t~pre64#1_323| |v_#pthreadsForks_442|) (= (store |v_#memory_int_3351| |v_ULTIMATE.start_main_~#id2~0#1.base_307| (store (select |v_#memory_int_3351| |v_ULTIMATE.start_main_~#id2~0#1.base_307|) |v_ULTIMATE.start_main_~#id2~0#1.offset_267| |v_ULTIMATE.start_main_#t~pre64#1_323|)) |v_#memory_int_3350|) (= (+ |v_#pthreadsForks_442| 1) |v_#pthreadsForks_441|)) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_267|, #pthreadsForks=|v_#pthreadsForks_442|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_1235|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_1235|, #memory_int=|v_#memory_int_3351|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_307|} OutVars{ULTIMATE.start_main_#t~pre62#1=|v_ULTIMATE.start_main_#t~pre62#1_245|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_267|, #pthreadsForks=|v_#pthreadsForks_441|, t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_1235|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_1235|, ULTIMATE.start_main_#t~pre64#1=|v_ULTIMATE.start_main_#t~pre64#1_323|, #memory_int=|v_#memory_int_3350|, t1Thread1of1ForFork0_enqueue_#t~mem39#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_939|, ULTIMATE.start_main_#t~nondet63#1=|v_ULTIMATE.start_main_#t~nondet63#1_229|, t1Thread1of1ForFork0_enqueue_#t~post38#1=|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_531|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_307|} 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] and [887] L982-6-->L988-6: Formula: (and (= (select (select |v_#memory_int_252| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_123|) (+ 84 |v_t1Thread1of1ForFork0_enqueue_~q#1.offset_123|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_47|) (not (= 20 |v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_100|))) InVars {t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_123|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_123|, #memory_int=|v_#memory_int_252|, t1Thread1of1ForFork0_enqueue_#t~mem39#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem39#1_100|} OutVars{t1Thread1of1ForFork0_enqueue_~q#1.offset=|v_t1Thread1of1ForFork0_enqueue_~q#1.offset_123|, t1Thread1of1ForFork0_enqueue_~q#1.base=|v_t1Thread1of1ForFork0_enqueue_~q#1.base_123|, #memory_int=|v_#memory_int_252|, t1Thread1of1ForFork0_enqueue_#t~mem40#1=|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_47|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_enqueue_#t~mem40#1, t1Thread1of1ForFork0_enqueue_#t~mem39#1] [2022-12-13 00:18:11,814 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 00:18:11,814 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 214 [2022-12-13 00:18:11,814 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 93 transitions, 616 flow [2022-12-13 00:18:11,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:18:11,815 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:18:11,815 INFO L214 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-13 00:18:11,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 00:18:11,815 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-13 00:18:11,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:18:11,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1786485962, now seen corresponding path program 1 times [2022-12-13 00:18:11,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:18:11,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148690907] [2022-12-13 00:18:11,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:18:11,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:18:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:18:13,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-13 00:18:13,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:18:13,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148690907] [2022-12-13 00:18:13,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148690907] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:18:13,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:18:13,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 00:18:13,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906601898] [2022-12-13 00:18:13,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:18:13,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 00:18:13,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:18:13,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 00:18:13,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-12-13 00:18:13,328 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 69 [2022-12-13 00:18:13,328 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 93 transitions, 616 flow. Second operand has 13 states, 13 states have (on average 9.461538461538462) internal successors, (123), 13 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:18:13,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:18:13,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 69 [2022-12-13 00:18:13,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:18:15,616 INFO L130 PetriNetUnfolder]: 5488/9255 cut-off events. [2022-12-13 00:18:15,616 INFO L131 PetriNetUnfolder]: For 4653/4653 co-relation queries the response was YES. [2022-12-13 00:18:15,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23653 conditions, 9255 events. 5488/9255 cut-off events. For 4653/4653 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 61458 event pairs, 1884 based on Foata normal form. 26/5516 useless extension candidates. Maximal degree in co-relation 20304. Up to 5785 conditions per place. [2022-12-13 00:18:15,644 INFO L137 encePairwiseOnDemand]: 38/69 looper letters, 161 selfloop transitions, 62 changer transitions 103/334 dead transitions. [2022-12-13 00:18:15,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 334 transitions, 2069 flow [2022-12-13 00:18:15,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 00:18:15,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-13 00:18:15,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 505 transitions. [2022-12-13 00:18:15,647 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3326745718050066 [2022-12-13 00:18:15,647 INFO L175 Difference]: Start difference. First operand has 98 places, 93 transitions, 616 flow. Second operand 22 states and 505 transitions. [2022-12-13 00:18:15,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 334 transitions, 2069 flow [2022-12-13 00:18:15,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 334 transitions, 2000 flow, removed 27 selfloop flow, removed 5 redundant places. [2022-12-13 00:18:15,671 INFO L231 Difference]: Finished difference. Result has 127 places, 141 transitions, 1119 flow [2022-12-13 00:18:15,671 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=579, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1119, PETRI_PLACES=127, PETRI_TRANSITIONS=141} [2022-12-13 00:18:15,672 INFO L295 CegarLoopForPetriNet]: 181 programPoint places, -54 predicate places. [2022-12-13 00:18:15,672 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:18:15,672 INFO L89 Accepts]: Start accepts. Operand has 127 places, 141 transitions, 1119 flow [2022-12-13 00:18:15,674 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:18:15,674 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:18:15,674 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 141 transitions, 1119 flow [2022-12-13 00:18:15,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 141 transitions, 1119 flow [2022-12-13 00:18:15,713 INFO L130 PetriNetUnfolder]: 225/707 cut-off events. [2022-12-13 00:18:15,713 INFO L131 PetriNetUnfolder]: For 2570/2620 co-relation queries the response was YES. [2022-12-13 00:18:15,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2660 conditions, 707 events. 225/707 cut-off events. For 2570/2620 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4664 event pairs, 38 based on Foata normal form. 11/577 useless extension candidates. Maximal degree in co-relation 2435. Up to 235 conditions per place. [2022-12-13 00:18:15,717 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 141 transitions, 1119 flow [2022-12-13 00:18:15,717 INFO L226 LiptonReduction]: Number of co-enabled transitions 1328 [2022-12-13 00:18:15,824 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1105] L1018-6-->L1018-7: Formula: (not (< |v_t1Thread1of1ForFork0_~i~0#1_In_1| 19)) InVars {t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_In_1|} AuxVars[] AssignedVars[] and [1185] L1037-6-->L1037-6: Formula: (let ((.cse0 (select |v_#pthreadsMutex_643| |v_~#m~0.base_298|))) (and (= (store |v_#pthreadsMutex_643| |v_~#m~0.base_298| (store .cse0 |v_~#m~0.offset_298| 0)) |v_#pthreadsMutex_641|) (= (mod v_~dequeue_flag~0_250 256) 0) (< |v_t2Thread1of1ForFork1_~i~1#1_254| 20) (= (+ |v_t2Thread1of1ForFork1_~i~1#1_254| 1) |v_t2Thread1of1ForFork1_~i~1#1_253|) (= (select .cse0 |v_~#m~0.offset_298|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_643|, ~#m~0.base=|v_~#m~0.base_298|, ~#m~0.offset=|v_~#m~0.offset_298|, ~dequeue_flag~0=v_~dequeue_flag~0_250, t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_254|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_641|, ~#m~0.base=|v_~#m~0.base_298|, ~#m~0.offset=|v_~#m~0.offset_298|, ~dequeue_flag~0=v_~dequeue_flag~0_250, t2Thread1of1ForFork1_#t~nondet58#1=|v_t2Thread1of1ForFork1_#t~nondet58#1_125|, t2Thread1of1ForFork1_#t~post57#1=|v_t2Thread1of1ForFork1_#t~post57#1_41|, t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_253|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~nondet58#1, t2Thread1of1ForFork1_#t~post57#1, t2Thread1of1ForFork1_~i~1#1] [2022-12-13 00:18:15,875 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1116] L1018-6-->t1EXIT: Formula: (and (= |v_t1Thread1of1ForFork0_#res#1.base_7| 0) (= |v_t1Thread1of1ForFork0_#res#1.offset_7| 0) (not (< |v_t1Thread1of1ForFork0_~i~0#1_115| 19))) InVars {t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_115|} OutVars{t1Thread1of1ForFork0_#res#1.offset=|v_t1Thread1of1ForFork0_#res#1.offset_7|, t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_115|, t1Thread1of1ForFork0_#res#1.base=|v_t1Thread1of1ForFork0_#res#1.base_7|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_#res#1.offset, t1Thread1of1ForFork0_#res#1.base] and [1185] L1037-6-->L1037-6: Formula: (let ((.cse0 (select |v_#pthreadsMutex_643| |v_~#m~0.base_298|))) (and (= (store |v_#pthreadsMutex_643| |v_~#m~0.base_298| (store .cse0 |v_~#m~0.offset_298| 0)) |v_#pthreadsMutex_641|) (= (mod v_~dequeue_flag~0_250 256) 0) (< |v_t2Thread1of1ForFork1_~i~1#1_254| 20) (= (+ |v_t2Thread1of1ForFork1_~i~1#1_254| 1) |v_t2Thread1of1ForFork1_~i~1#1_253|) (= (select .cse0 |v_~#m~0.offset_298|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_643|, ~#m~0.base=|v_~#m~0.base_298|, ~#m~0.offset=|v_~#m~0.offset_298|, ~dequeue_flag~0=v_~dequeue_flag~0_250, t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_254|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_641|, ~#m~0.base=|v_~#m~0.base_298|, ~#m~0.offset=|v_~#m~0.offset_298|, ~dequeue_flag~0=v_~dequeue_flag~0_250, t2Thread1of1ForFork1_#t~nondet58#1=|v_t2Thread1of1ForFork1_#t~nondet58#1_125|, t2Thread1of1ForFork1_#t~post57#1=|v_t2Thread1of1ForFork1_#t~post57#1_41|, t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_253|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~nondet58#1, t2Thread1of1ForFork1_#t~post57#1, t2Thread1of1ForFork1_~i~1#1] [2022-12-13 00:18:15,938 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1117] L1018-6-->t1FINAL: Formula: (and (= |v_t1Thread1of1ForFork0_#res#1.offset_9| 0) (not (< |v_t1Thread1of1ForFork0_~i~0#1_117| 19)) (= |v_t1Thread1of1ForFork0_#res#1.base_9| 0)) InVars {t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_117|} OutVars{t1Thread1of1ForFork0_#res#1.offset=|v_t1Thread1of1ForFork0_#res#1.offset_9|, t1Thread1of1ForFork0_~i~0#1=|v_t1Thread1of1ForFork0_~i~0#1_117|, t1Thread1of1ForFork0_#res#1.base=|v_t1Thread1of1ForFork0_#res#1.base_9|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_#res#1.offset, t1Thread1of1ForFork0_#res#1.base] and [1185] L1037-6-->L1037-6: Formula: (let ((.cse0 (select |v_#pthreadsMutex_643| |v_~#m~0.base_298|))) (and (= (store |v_#pthreadsMutex_643| |v_~#m~0.base_298| (store .cse0 |v_~#m~0.offset_298| 0)) |v_#pthreadsMutex_641|) (= (mod v_~dequeue_flag~0_250 256) 0) (< |v_t2Thread1of1ForFork1_~i~1#1_254| 20) (= (+ |v_t2Thread1of1ForFork1_~i~1#1_254| 1) |v_t2Thread1of1ForFork1_~i~1#1_253|) (= (select .cse0 |v_~#m~0.offset_298|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_643|, ~#m~0.base=|v_~#m~0.base_298|, ~#m~0.offset=|v_~#m~0.offset_298|, ~dequeue_flag~0=v_~dequeue_flag~0_250, t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_254|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_641|, ~#m~0.base=|v_~#m~0.base_298|, ~#m~0.offset=|v_~#m~0.offset_298|, ~dequeue_flag~0=v_~dequeue_flag~0_250, t2Thread1of1ForFork1_#t~nondet58#1=|v_t2Thread1of1ForFork1_#t~nondet58#1_125|, t2Thread1of1ForFork1_#t~post57#1=|v_t2Thread1of1ForFork1_#t~post57#1_41|, t2Thread1of1ForFork1_~i~1#1=|v_t2Thread1of1ForFork1_~i~1#1_253|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~nondet58#1, t2Thread1of1ForFork1_#t~post57#1, t2Thread1of1ForFork1_~i~1#1] [2022-12-13 00:18:15,984 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:18:15,985 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 313 [2022-12-13 00:18:15,985 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 139 transitions, 1125 flow [2022-12-13 00:18:15,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.461538461538462) internal successors, (123), 13 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:18:15,985 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:18:15,985 INFO L214 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-13 00:18:15,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 00:18:15,985 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-13 00:18:15,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:18:15,985 INFO L85 PathProgramCache]: Analyzing trace with hash 591077336, now seen corresponding path program 1 times [2022-12-13 00:18:15,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:18:15,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879211279] [2022-12-13 00:18:15,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:18:15,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:18:16,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2022-12-13 00:29:33,246 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-13 00:29:33,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 00:29:33,258 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:337) 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-13 00:29:33,261 INFO L158 Benchmark]: Toolchain (without parser) took 727768.89ms. Allocated memory was 183.5MB in the beginning and 5.0GB in the end (delta: 4.8GB). Free memory was 157.8MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 6.1GB. Max. memory is 8.0GB. [2022-12-13 00:29:33,261 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 127.9MB. Free memory is still 108.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:29:33,261 INFO L158 Benchmark]: CACSL2BoogieTranslator took 537.07ms. Allocated memory is still 183.5MB. Free memory was 157.6MB in the beginning and 127.4MB in the end (delta: 30.2MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-12-13 00:29:33,261 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.80ms. Allocated memory is still 183.5MB. Free memory was 127.4MB in the beginning and 124.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 00:29:33,261 INFO L158 Benchmark]: Boogie Preprocessor took 28.46ms. Allocated memory is still 183.5MB. Free memory was 124.2MB in the beginning and 122.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:29:33,262 INFO L158 Benchmark]: RCFGBuilder took 538.73ms. Allocated memory is still 183.5MB. Free memory was 122.1MB in the beginning and 150.1MB in the end (delta: -28.0MB). Peak memory consumption was 18.2MB. Max. memory is 8.0GB. [2022-12-13 00:29:33,262 INFO L158 Benchmark]: TraceAbstraction took 726602.09ms. Allocated memory was 183.5MB in the beginning and 5.0GB in the end (delta: 4.8GB). Free memory was 149.1MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 6.1GB. Max. memory is 8.0GB. [2022-12-13 00:29:33,262 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.15ms. Allocated memory is still 127.9MB. Free memory is still 108.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 537.07ms. Allocated memory is still 183.5MB. Free memory was 157.6MB in the beginning and 127.4MB in the end (delta: 30.2MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.80ms. Allocated memory is still 183.5MB. Free memory was 127.4MB in the beginning and 124.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.46ms. Allocated memory is still 183.5MB. Free memory was 124.2MB in the beginning and 122.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 538.73ms. Allocated memory is still 183.5MB. Free memory was 122.1MB in the beginning and 150.1MB in the end (delta: -28.0MB). Peak memory consumption was 18.2MB. Max. memory is 8.0GB. * TraceAbstraction took 726602.09ms. Allocated memory was 183.5MB in the beginning and 5.0GB in the end (delta: 4.8GB). Free memory was 149.1MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 6.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.1s, 245 PlacesBefore, 181 PlacesAfterwards, 253 TransitionsBefore, 192 TransitionsAfterwards, 15600 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 19 ConcurrentSequentialCompositions, 65 TrivialYvCompositions, 123 ConcurrentYvCompositions, 9 ChoiceCompositions, 216 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31776, independent: 31143, independent conditional: 31143, independent unconditional: 0, dependent: 633, dependent conditional: 633, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 31776, independent: 31143, independent conditional: 0, independent unconditional: 31143, dependent: 633, dependent conditional: 0, dependent unconditional: 633, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 31776, independent: 31143, independent conditional: 0, independent unconditional: 31143, dependent: 633, dependent conditional: 0, dependent unconditional: 633, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 31776, independent: 31143, independent conditional: 0, independent unconditional: 31143, dependent: 633, dependent conditional: 0, dependent unconditional: 633, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16865, independent: 16662, independent conditional: 0, independent unconditional: 16662, dependent: 203, dependent conditional: 0, dependent unconditional: 203, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16865, independent: 16609, independent conditional: 0, independent unconditional: 16609, dependent: 256, dependent conditional: 0, dependent unconditional: 256, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 256, independent: 53, independent conditional: 0, independent unconditional: 53, dependent: 203, dependent conditional: 0, dependent unconditional: 203, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 368, independent: 62, independent conditional: 0, independent unconditional: 62, dependent: 306, dependent conditional: 0, dependent unconditional: 306, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 31776, independent: 14481, independent conditional: 0, independent unconditional: 14481, dependent: 430, dependent conditional: 0, dependent unconditional: 430, unknown: 16865, unknown conditional: 0, unknown unconditional: 16865] , Statistics on independence cache: Total cache size (in pairs): 42626, Positive cache size: 42423, Positive conditional cache size: 0, Positive unconditional cache size: 42423, Negative cache size: 203, Negative conditional cache size: 0, Negative unconditional cache size: 203, 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, 172 PlacesBefore, 171 PlacesAfterwards, 181 TransitionsBefore, 180 TransitionsAfterwards, 15204 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6593, independent: 6160, independent conditional: 6160, independent unconditional: 0, dependent: 433, dependent conditional: 433, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6593, independent: 6160, independent conditional: 0, independent unconditional: 6160, dependent: 433, dependent conditional: 0, dependent unconditional: 433, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6593, independent: 6160, independent conditional: 0, independent unconditional: 6160, dependent: 433, dependent conditional: 0, dependent unconditional: 433, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6593, independent: 6160, independent conditional: 0, independent unconditional: 6160, dependent: 433, dependent conditional: 0, dependent unconditional: 433, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2094, independent: 1956, independent conditional: 0, independent unconditional: 1956, dependent: 138, dependent conditional: 0, dependent unconditional: 138, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2094, independent: 1940, independent conditional: 0, independent unconditional: 1940, dependent: 154, dependent conditional: 0, dependent unconditional: 154, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 154, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 138, dependent conditional: 0, dependent unconditional: 138, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 157, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 147, dependent conditional: 0, dependent unconditional: 147, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6593, independent: 4204, independent conditional: 0, independent unconditional: 4204, dependent: 295, dependent conditional: 0, dependent unconditional: 295, unknown: 2094, unknown conditional: 0, unknown unconditional: 2094] , Statistics on independence cache: Total cache size (in pairs): 2106, Positive cache size: 1968, Positive conditional cache size: 0, Positive unconditional cache size: 1968, Negative cache size: 138, Negative conditional cache size: 0, Negative unconditional cache size: 138, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 184 PlacesBefore, 181 PlacesAfterwards, 200 TransitionsBefore, 197 TransitionsAfterwards, 15262 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6520, independent: 6124, independent conditional: 6124, independent unconditional: 0, dependent: 396, dependent conditional: 396, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6520, independent: 6124, independent conditional: 96, independent unconditional: 6028, dependent: 396, dependent conditional: 4, dependent unconditional: 392, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6520, independent: 6124, independent conditional: 96, independent unconditional: 6028, dependent: 396, dependent conditional: 4, dependent unconditional: 392, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6520, independent: 6124, independent conditional: 96, independent unconditional: 6028, dependent: 396, dependent conditional: 4, dependent unconditional: 392, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 294, independent: 234, independent conditional: 13, independent unconditional: 221, dependent: 60, dependent conditional: 2, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 294, independent: 234, independent conditional: 0, independent unconditional: 234, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 60, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 60, dependent conditional: 2, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 88, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 88, dependent conditional: 3, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6520, independent: 5890, independent conditional: 83, independent unconditional: 5807, dependent: 336, dependent conditional: 2, dependent unconditional: 334, unknown: 294, unknown conditional: 15, unknown unconditional: 279] , Statistics on independence cache: Total cache size (in pairs): 2429, Positive cache size: 2231, Positive conditional cache size: 13, Positive unconditional cache size: 2218, Negative cache size: 198, Negative conditional cache size: 2, Negative unconditional cache size: 196, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 191 PlacesBefore, 191 PlacesAfterwards, 227 TransitionsBefore, 227 TransitionsAfterwards, 16298 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9256, independent: 8860, independent conditional: 8860, independent unconditional: 0, dependent: 396, dependent conditional: 396, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9256, independent: 8860, independent conditional: 680, independent unconditional: 8180, dependent: 396, dependent conditional: 0, dependent unconditional: 396, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9256, independent: 8860, independent conditional: 680, independent unconditional: 8180, dependent: 396, dependent conditional: 0, dependent unconditional: 396, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9256, independent: 8860, independent conditional: 680, independent unconditional: 8180, dependent: 396, dependent conditional: 0, dependent unconditional: 396, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 720, independent: 665, independent conditional: 60, independent unconditional: 605, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 720, independent: 653, independent conditional: 0, independent unconditional: 653, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 67, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 110, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9256, independent: 8195, independent conditional: 620, independent unconditional: 7575, dependent: 341, dependent conditional: 0, dependent unconditional: 341, unknown: 720, unknown conditional: 60, unknown unconditional: 660] , Statistics on independence cache: Total cache size (in pairs): 3149, Positive cache size: 2896, Positive conditional cache size: 73, Positive unconditional cache size: 2823, Negative cache size: 253, Negative conditional cache size: 2, Negative unconditional cache size: 251, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 198 PlacesBefore, 197 PlacesAfterwards, 243 TransitionsBefore, 242 TransitionsAfterwards, 15560 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6856, independent: 6540, independent conditional: 6540, independent unconditional: 0, dependent: 316, dependent conditional: 316, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6856, independent: 6540, independent conditional: 546, independent unconditional: 5994, dependent: 316, dependent conditional: 46, dependent unconditional: 270, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6856, independent: 6540, independent conditional: 546, independent unconditional: 5994, dependent: 316, dependent conditional: 46, dependent unconditional: 270, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6856, independent: 6540, independent conditional: 546, independent unconditional: 5994, dependent: 316, dependent conditional: 46, dependent unconditional: 270, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 72, independent: 54, independent conditional: 3, independent unconditional: 51, dependent: 18, dependent conditional: 8, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 72, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 20, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 18, dependent conditional: 8, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 16, dependent conditional: 9, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6856, independent: 6486, independent conditional: 543, independent unconditional: 5943, dependent: 298, dependent conditional: 38, dependent unconditional: 260, unknown: 72, unknown conditional: 11, unknown unconditional: 61] , Statistics on independence cache: Total cache size (in pairs): 3363, Positive cache size: 3092, Positive conditional cache size: 76, Positive unconditional cache size: 3016, Negative cache size: 271, Negative conditional cache size: 10, Negative unconditional cache size: 261, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 209 PlacesBefore, 209 PlacesAfterwards, 282 TransitionsBefore, 282 TransitionsAfterwards, 17144 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2978, independent: 2799, independent conditional: 2799, independent unconditional: 0, dependent: 179, dependent conditional: 179, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2978, independent: 2799, independent conditional: 171, independent unconditional: 2628, dependent: 179, dependent conditional: 1, dependent unconditional: 178, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2979, independent: 2799, independent conditional: 171, independent unconditional: 2628, dependent: 180, dependent conditional: 2, dependent unconditional: 178, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2979, independent: 2799, independent conditional: 171, independent unconditional: 2628, dependent: 180, dependent conditional: 2, dependent unconditional: 178, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 396, independent: 349, independent conditional: 0, independent unconditional: 349, dependent: 47, dependent conditional: 2, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 396, independent: 349, independent conditional: 0, independent unconditional: 349, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 47, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 47, dependent conditional: 2, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 38, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 38, dependent conditional: 3, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2979, independent: 2450, independent conditional: 171, independent unconditional: 2279, dependent: 133, dependent conditional: 0, dependent unconditional: 133, unknown: 396, unknown conditional: 2, unknown unconditional: 394] , Statistics on independence cache: Total cache size (in pairs): 3759, Positive cache size: 3441, Positive conditional cache size: 76, Positive unconditional cache size: 3365, Negative cache size: 318, Negative conditional cache size: 12, Negative unconditional cache size: 306, 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, 131 PlacesBefore, 129 PlacesAfterwards, 134 TransitionsBefore, 132 TransitionsAfterwards, 5028 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1634, independent: 1430, independent conditional: 1430, independent unconditional: 0, dependent: 204, dependent conditional: 204, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1634, independent: 1430, independent conditional: 60, independent unconditional: 1370, dependent: 204, dependent conditional: 6, dependent unconditional: 198, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1636, independent: 1430, independent conditional: 60, independent unconditional: 1370, dependent: 206, dependent conditional: 8, dependent unconditional: 198, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1636, independent: 1430, independent conditional: 60, independent unconditional: 1370, dependent: 206, dependent conditional: 8, dependent unconditional: 198, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 254, independent: 209, independent conditional: 26, independent unconditional: 183, dependent: 45, dependent conditional: 3, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 254, independent: 208, independent conditional: 0, independent unconditional: 208, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 46, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 45, dependent conditional: 3, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 47, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 46, dependent conditional: 4, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1636, independent: 1221, independent conditional: 34, independent unconditional: 1187, dependent: 161, dependent conditional: 5, dependent unconditional: 156, unknown: 254, unknown conditional: 29, unknown unconditional: 225] , Statistics on independence cache: Total cache size (in pairs): 4111, Positive cache size: 3748, Positive conditional cache size: 102, Positive unconditional cache size: 3646, Negative cache size: 363, Negative conditional cache size: 15, Negative unconditional cache size: 348, 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, 135 PlacesBefore, 132 PlacesAfterwards, 130 TransitionsBefore, 127 TransitionsAfterwards, 4978 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3637, independent: 3320, independent conditional: 3320, independent unconditional: 0, dependent: 317, dependent conditional: 317, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3637, independent: 3320, independent conditional: 148, independent unconditional: 3172, dependent: 317, dependent conditional: 23, dependent unconditional: 294, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3660, independent: 3320, independent conditional: 148, independent unconditional: 3172, dependent: 340, dependent conditional: 46, dependent unconditional: 294, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3660, independent: 3320, independent conditional: 148, independent unconditional: 3172, dependent: 340, dependent conditional: 46, dependent unconditional: 294, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 222, independent: 201, independent conditional: 42, independent unconditional: 159, dependent: 21, dependent conditional: 5, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 222, independent: 200, independent conditional: 0, independent unconditional: 200, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 22, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 21, dependent conditional: 5, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 18, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 17, dependent conditional: 5, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3660, independent: 3119, independent conditional: 106, independent unconditional: 3013, dependent: 319, dependent conditional: 41, dependent unconditional: 278, unknown: 222, unknown conditional: 47, unknown unconditional: 175] , Statistics on independence cache: Total cache size (in pairs): 4405, Positive cache size: 4021, Positive conditional cache size: 144, Positive unconditional cache size: 3877, Negative cache size: 384, Negative conditional cache size: 20, Negative unconditional cache size: 364, 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, 132 PlacesBefore, 130 PlacesAfterwards, 133 TransitionsBefore, 131 TransitionsAfterwards, 5118 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3559, independent: 3236, independent conditional: 3236, independent unconditional: 0, dependent: 323, dependent conditional: 323, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3559, independent: 3236, independent conditional: 116, independent unconditional: 3120, dependent: 323, dependent conditional: 21, dependent unconditional: 302, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3574, independent: 3236, independent conditional: 116, independent unconditional: 3120, dependent: 338, dependent conditional: 36, dependent unconditional: 302, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3574, independent: 3236, independent conditional: 116, independent unconditional: 3120, dependent: 338, dependent conditional: 36, dependent unconditional: 302, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 117, independent: 91, independent conditional: 41, independent unconditional: 50, 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: 117, independent: 91, independent conditional: 0, independent unconditional: 91, 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: 2, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 21, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 21, dependent conditional: 2, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3574, independent: 3145, independent conditional: 75, independent unconditional: 3070, dependent: 312, dependent conditional: 34, dependent unconditional: 278, unknown: 117, unknown conditional: 43, unknown unconditional: 74] , Statistics on independence cache: Total cache size (in pairs): 4597, Positive cache size: 4187, Positive conditional cache size: 185, Positive unconditional cache size: 4002, Negative cache size: 410, Negative conditional cache size: 22, Negative unconditional cache size: 388, 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, 133 PlacesBefore, 133 PlacesAfterwards, 131 TransitionsBefore, 131 TransitionsAfterwards, 5046 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1287, independent: 1180, independent conditional: 1180, independent unconditional: 0, dependent: 107, dependent conditional: 107, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1287, independent: 1180, independent conditional: 26, independent unconditional: 1154, dependent: 107, dependent conditional: 7, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1295, independent: 1180, independent conditional: 26, independent unconditional: 1154, dependent: 115, dependent conditional: 15, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1295, independent: 1180, independent conditional: 26, independent unconditional: 1154, dependent: 115, dependent conditional: 15, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 38, independent: 28, independent conditional: 6, independent unconditional: 22, dependent: 10, dependent conditional: 2, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 38, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 2, dependent unconditional: 8, 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: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1295, independent: 1152, independent conditional: 20, independent unconditional: 1132, dependent: 105, dependent conditional: 13, dependent unconditional: 92, unknown: 38, unknown conditional: 8, unknown unconditional: 30] , Statistics on independence cache: Total cache size (in pairs): 4635, Positive cache size: 4215, Positive conditional cache size: 191, Positive unconditional cache size: 4024, Negative cache size: 420, Negative conditional cache size: 24, Negative unconditional cache size: 396, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 105 PlacesBefore, 94 PlacesAfterwards, 101 TransitionsBefore, 90 TransitionsAfterwards, 1742 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 0 ChoiceCompositions, 14 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 705, independent: 611, independent conditional: 611, independent unconditional: 0, dependent: 94, dependent conditional: 94, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 705, independent: 611, independent conditional: 153, independent unconditional: 458, dependent: 94, dependent conditional: 14, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 715, independent: 611, independent conditional: 140, independent unconditional: 471, dependent: 104, dependent conditional: 24, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 715, independent: 611, independent conditional: 140, independent unconditional: 471, dependent: 104, dependent conditional: 24, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 67, independent: 59, independent conditional: 19, independent unconditional: 40, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 67, independent: 59, independent conditional: 0, independent unconditional: 59, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 28, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 715, independent: 552, independent conditional: 121, independent unconditional: 431, dependent: 96, dependent conditional: 24, dependent unconditional: 72, unknown: 67, unknown conditional: 19, unknown unconditional: 48] , Statistics on independence cache: Total cache size (in pairs): 5416, Positive cache size: 4988, Positive conditional cache size: 210, Positive unconditional cache size: 4778, Negative cache size: 428, Negative conditional cache size: 24, Negative unconditional cache size: 404, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 13, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 103 PlacesBefore, 98 PlacesAfterwards, 98 TransitionsBefore, 93 TransitionsAfterwards, 1596 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 206, independent: 145, independent conditional: 145, independent unconditional: 0, dependent: 61, dependent conditional: 61, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 206, independent: 145, independent conditional: 44, independent unconditional: 101, dependent: 61, dependent conditional: 48, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 226, independent: 145, independent conditional: 44, independent unconditional: 101, dependent: 81, dependent conditional: 68, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 226, independent: 145, independent conditional: 44, independent unconditional: 101, dependent: 81, dependent conditional: 68, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 33, independent: 23, independent conditional: 8, independent unconditional: 15, dependent: 10, dependent conditional: 6, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 33, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 6, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 7, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 226, independent: 122, independent conditional: 36, independent unconditional: 86, dependent: 71, dependent conditional: 62, dependent unconditional: 9, unknown: 33, unknown conditional: 14, unknown unconditional: 19] , Statistics on independence cache: Total cache size (in pairs): 5539, Positive cache size: 5101, Positive conditional cache size: 225, Positive unconditional cache size: 4876, Negative cache size: 438, Negative conditional cache size: 30, Negative unconditional cache size: 408, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 119 PlacesBefore, 117 PlacesAfterwards, 141 TransitionsBefore, 139 TransitionsAfterwards, 1328 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 356, independent: 290, independent conditional: 290, independent unconditional: 0, dependent: 66, dependent conditional: 66, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 356, independent: 290, independent conditional: 104, independent unconditional: 186, dependent: 66, dependent conditional: 42, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 392, independent: 290, independent conditional: 104, independent unconditional: 186, dependent: 102, dependent conditional: 78, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 392, independent: 290, independent conditional: 104, independent unconditional: 186, dependent: 102, dependent conditional: 78, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, independent: 21, independent conditional: 20, independent unconditional: 1, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 26, independent: 21, independent conditional: 0, independent unconditional: 21, 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: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 392, independent: 269, independent conditional: 84, independent unconditional: 185, dependent: 97, dependent conditional: 73, dependent unconditional: 24, unknown: 26, unknown conditional: 25, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 5567, Positive cache size: 5124, Positive conditional cache size: 245, Positive unconditional cache size: 4879, Negative cache size: 443, Negative conditional cache size: 35, Negative unconditional cache size: 408, 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