/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/unroll-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 02:25:17,948 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 02:25:17,951 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 02:25:17,981 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 02:25:17,982 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 02:25:17,984 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 02:25:17,987 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 02:25:17,990 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 02:25:17,994 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 02:25:17,997 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 02:25:17,998 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 02:25:18,000 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 02:25:18,000 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 02:25:18,002 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 02:25:18,003 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 02:25:18,006 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 02:25:18,006 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 02:25:18,007 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 02:25:18,009 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 02:25:18,012 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 02:25:18,013 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 02:25:18,014 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 02:25:18,015 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 02:25:18,015 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 02:25:18,018 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 02:25:18,018 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 02:25:18,018 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 02:25:18,019 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 02:25:18,019 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 02:25:18,020 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 02:25:18,020 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 02:25:18,021 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 02:25:18,022 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 02:25:18,022 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 02:25:18,034 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 02:25:18,035 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 02:25:18,036 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 02:25:18,036 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 02:25:18,036 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 02:25:18,037 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 02:25:18,037 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 02:25:18,038 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 02:25:18,072 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 02:25:18,072 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 02:25:18,074 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 02:25:18,075 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 02:25:18,075 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 02:25:18,075 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 02:25:18,076 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 02:25:18,076 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 02:25:18,076 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 02:25:18,076 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 02:25:18,077 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 02:25:18,077 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 02:25:18,077 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 02:25:18,077 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 02:25:18,077 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 02:25:18,077 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 02:25:18,078 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 02:25:18,078 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 02:25:18,078 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 02:25:18,078 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 02:25:18,078 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 02:25:18,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 02:25:18,078 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 02:25:18,079 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 02:25:18,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 02:25:18,079 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 02:25:18,079 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 02:25:18,079 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 02:25:18,079 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 02:25:18,397 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 02:25:18,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 02:25:18,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 02:25:18,422 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 02:25:18,422 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 02:25:18,423 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-3.wvr.c [2022-12-13 02:25:19,501 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 02:25:19,716 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 02:25:19,716 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c [2022-12-13 02:25:19,723 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ac67234f/6dc7e1ebde824751ac937d5174a1fb6f/FLAG689d09ef3 [2022-12-13 02:25:19,742 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ac67234f/6dc7e1ebde824751ac937d5174a1fb6f [2022-12-13 02:25:19,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 02:25:19,745 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 02:25:19,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 02:25:19,746 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 02:25:19,748 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 02:25:19,748 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:25:19" (1/1) ... [2022-12-13 02:25:19,749 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a1ab8c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:25:19, skipping insertion in model container [2022-12-13 02:25:19,749 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:25:19" (1/1) ... [2022-12-13 02:25:19,754 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 02:25:19,769 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 02:25:19,889 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c[2500,2513] [2022-12-13 02:25:19,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 02:25:19,912 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 02:25:19,948 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c[2500,2513] [2022-12-13 02:25:19,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 02:25:19,965 INFO L208 MainTranslator]: Completed translation [2022-12-13 02:25:19,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:25:19 WrapperNode [2022-12-13 02:25:19,965 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 02:25:19,968 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 02:25:19,968 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 02:25:19,969 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 02:25:19,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:25:19" (1/1) ... [2022-12-13 02:25:19,989 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:25:19" (1/1) ... [2022-12-13 02:25:20,019 INFO L138 Inliner]: procedures = 24, calls = 34, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 144 [2022-12-13 02:25:20,020 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 02:25:20,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 02:25:20,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 02:25:20,021 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 02:25:20,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:25:19" (1/1) ... [2022-12-13 02:25:20,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:25:19" (1/1) ... [2022-12-13 02:25:20,032 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:25:19" (1/1) ... [2022-12-13 02:25:20,032 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:25:19" (1/1) ... [2022-12-13 02:25:20,046 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:25:19" (1/1) ... [2022-12-13 02:25:20,050 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:25:19" (1/1) ... [2022-12-13 02:25:20,051 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:25:19" (1/1) ... [2022-12-13 02:25:20,052 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:25:19" (1/1) ... [2022-12-13 02:25:20,054 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 02:25:20,054 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 02:25:20,054 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 02:25:20,055 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 02:25:20,055 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:25:19" (1/1) ... [2022-12-13 02:25:20,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 02:25:20,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:25:20,088 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 02:25:20,115 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 02:25:20,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 02:25:20,140 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 02:25:20,142 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 02:25:20,142 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 02:25:20,142 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 02:25:20,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 02:25:20,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 02:25:20,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 02:25:20,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 02:25:20,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 02:25:20,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 02:25:20,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 02:25:20,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 02:25:20,145 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 02:25:20,274 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 02:25:20,275 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 02:25:20,550 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 02:25:20,559 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 02:25:20,559 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-13 02:25:20,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:25:20 BoogieIcfgContainer [2022-12-13 02:25:20,561 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 02:25:20,580 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 02:25:20,580 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 02:25:20,583 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 02:25:20,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 02:25:19" (1/3) ... [2022-12-13 02:25:20,584 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24125364 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:25:20, skipping insertion in model container [2022-12-13 02:25:20,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:25:19" (2/3) ... [2022-12-13 02:25:20,584 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24125364 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:25:20, skipping insertion in model container [2022-12-13 02:25:20,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:25:20" (3/3) ... [2022-12-13 02:25:20,585 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-3.wvr.c [2022-12-13 02:25:20,618 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 02:25:20,618 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 02:25:20,618 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 02:25:20,736 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 02:25:20,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 167 transitions, 350 flow [2022-12-13 02:25:20,881 INFO L130 PetriNetUnfolder]: 15/165 cut-off events. [2022-12-13 02:25:20,881 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 02:25:20,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 165 events. 15/165 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 165 event pairs, 0 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2022-12-13 02:25:20,887 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 167 transitions, 350 flow [2022-12-13 02:25:20,896 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 157 transitions, 326 flow [2022-12-13 02:25:20,898 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:20,925 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 157 transitions, 326 flow [2022-12-13 02:25:20,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 157 transitions, 326 flow [2022-12-13 02:25:20,985 INFO L130 PetriNetUnfolder]: 15/157 cut-off events. [2022-12-13 02:25:20,985 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 02:25:20,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 157 events. 15/157 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 146 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2022-12-13 02:25:20,991 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 157 transitions, 326 flow [2022-12-13 02:25:20,991 INFO L226 LiptonReduction]: Number of co-enabled transitions 2592 [2022-12-13 02:25:25,853 INFO L241 LiptonReduction]: Total number of compositions: 140 [2022-12-13 02:25:25,867 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 02:25:25,873 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;@6136c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 02:25:25,873 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 02:25:25,877 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-13 02:25:25,877 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 02:25:25,877 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:25,878 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:25,878 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:25:25,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:25,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1887355417, now seen corresponding path program 1 times [2022-12-13 02:25:25,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:25,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988368190] [2022-12-13 02:25:25,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:25,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:26,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:26,231 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 02:25:26,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:26,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988368190] [2022-12-13 02:25:26,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988368190] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:26,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:26,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 02:25:26,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876064409] [2022-12-13 02:25:26,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:26,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 02:25:26,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:26,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 02:25:26,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 02:25:26,257 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-13 02:25:26,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:26,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:26,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-13 02:25:26,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:26,324 INFO L130 PetriNetUnfolder]: 49/84 cut-off events. [2022-12-13 02:25:26,324 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-13 02:25:26,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 84 events. 49/84 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 19 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 129. Up to 81 conditions per place. [2022-12-13 02:25:26,325 INFO L137 encePairwiseOnDemand]: 14/17 looper letters, 14 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2022-12-13 02:25:26,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 18 transitions, 80 flow [2022-12-13 02:25:26,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 02:25:26,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 02:25:26,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-13 02:25:26,335 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2022-12-13 02:25:26,336 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 3 states and 23 transitions. [2022-12-13 02:25:26,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 18 transitions, 80 flow [2022-12-13 02:25:26,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 18 transitions, 72 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:26,340 INFO L231 Difference]: Finished difference. Result has 20 places, 18 transitions, 50 flow [2022-12-13 02:25:26,342 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=20, PETRI_TRANSITIONS=18} [2022-12-13 02:25:26,345 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2022-12-13 02:25:26,345 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:26,346 INFO L89 Accepts]: Start accepts. Operand has 20 places, 18 transitions, 50 flow [2022-12-13 02:25:26,348 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:26,348 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:26,349 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-13 02:25:26,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 18 transitions, 50 flow [2022-12-13 02:25:26,352 INFO L130 PetriNetUnfolder]: 3/18 cut-off events. [2022-12-13 02:25:26,353 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 02:25:26,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 18 events. 3/18 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 20. Up to 4 conditions per place. [2022-12-13 02:25:26,354 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-13 02:25:26,355 INFO L226 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-13 02:25:27,047 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:27,049 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 704 [2022-12-13 02:25:27,049 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 17 transitions, 46 flow [2022-12-13 02:25:27,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:27,049 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:27,049 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:27,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 02:25:27,050 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:25:27,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:27,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1661137616, now seen corresponding path program 1 times [2022-12-13 02:25:27,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:27,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468901621] [2022-12-13 02:25:27,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:27,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:27,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:27,250 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 02:25:27,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:27,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468901621] [2022-12-13 02:25:27,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468901621] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:27,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:27,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 02:25:27,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161772015] [2022-12-13 02:25:27,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:27,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 02:25:27,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:27,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 02:25:27,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 02:25:27,253 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-13 02:25:27,254 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:27,254 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:27,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-13 02:25:27,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:27,299 INFO L130 PetriNetUnfolder]: 66/116 cut-off events. [2022-12-13 02:25:27,300 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 02:25:27,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 116 events. 66/116 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 320 event pairs, 9 based on Foata normal form. 1/77 useless extension candidates. Maximal degree in co-relation 234. Up to 85 conditions per place. [2022-12-13 02:25:27,306 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 21 selfloop transitions, 3 changer transitions 1/27 dead transitions. [2022-12-13 02:25:27,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 27 transitions, 119 flow [2022-12-13 02:25:27,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 02:25:27,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 02:25:27,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-13 02:25:27,307 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6274509803921569 [2022-12-13 02:25:27,307 INFO L175 Difference]: Start difference. First operand has 19 places, 17 transitions, 46 flow. Second operand 3 states and 32 transitions. [2022-12-13 02:25:27,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 27 transitions, 119 flow [2022-12-13 02:25:27,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 27 transitions, 111 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 02:25:27,309 INFO L231 Difference]: Finished difference. Result has 20 places, 19 transitions, 57 flow [2022-12-13 02:25:27,309 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=57, PETRI_PLACES=20, PETRI_TRANSITIONS=19} [2022-12-13 02:25:27,310 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2022-12-13 02:25:27,310 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:27,310 INFO L89 Accepts]: Start accepts. Operand has 20 places, 19 transitions, 57 flow [2022-12-13 02:25:27,311 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:27,311 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:27,312 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 19 transitions, 57 flow [2022-12-13 02:25:27,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 19 transitions, 57 flow [2022-12-13 02:25:27,316 INFO L130 PetriNetUnfolder]: 8/31 cut-off events. [2022-12-13 02:25:27,316 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 02:25:27,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 31 events. 8/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 52 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 25. Up to 10 conditions per place. [2022-12-13 02:25:27,318 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 19 transitions, 57 flow [2022-12-13 02:25:27,318 INFO L226 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-13 02:25:27,318 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:25:27,319 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 02:25:27,320 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 19 transitions, 57 flow [2022-12-13 02:25:27,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:27,321 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:27,321 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:27,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 02:25:27,321 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:25:27,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:27,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1402005448, now seen corresponding path program 1 times [2022-12-13 02:25:27,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:27,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542207043] [2022-12-13 02:25:27,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:27,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:27,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:27,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:27,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:27,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542207043] [2022-12-13 02:25:27,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542207043] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:27,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:27,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 02:25:27,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562077121] [2022-12-13 02:25:27,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:27,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:27,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:27,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:27,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:27,591 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 02:25:27,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 19 transitions, 57 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:27,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:27,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 02:25:27,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:27,711 INFO L130 PetriNetUnfolder]: 85/169 cut-off events. [2022-12-13 02:25:27,711 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-12-13 02:25:27,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 397 conditions, 169 events. 85/169 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 578 event pairs, 26 based on Foata normal form. 12/180 useless extension candidates. Maximal degree in co-relation 140. Up to 86 conditions per place. [2022-12-13 02:25:27,714 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 30 selfloop transitions, 4 changer transitions 8/42 dead transitions. [2022-12-13 02:25:27,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 42 transitions, 202 flow [2022-12-13 02:25:27,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:27,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:27,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-12-13 02:25:27,715 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4823529411764706 [2022-12-13 02:25:27,716 INFO L175 Difference]: Start difference. First operand has 20 places, 19 transitions, 57 flow. Second operand 5 states and 41 transitions. [2022-12-13 02:25:27,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 42 transitions, 202 flow [2022-12-13 02:25:27,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 42 transitions, 198 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 02:25:27,718 INFO L231 Difference]: Finished difference. Result has 26 places, 21 transitions, 85 flow [2022-12-13 02:25:27,718 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=85, PETRI_PLACES=26, PETRI_TRANSITIONS=21} [2022-12-13 02:25:27,719 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2022-12-13 02:25:27,719 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:27,719 INFO L89 Accepts]: Start accepts. Operand has 26 places, 21 transitions, 85 flow [2022-12-13 02:25:27,721 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:27,721 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:27,721 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 21 transitions, 85 flow [2022-12-13 02:25:27,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 85 flow [2022-12-13 02:25:27,728 INFO L130 PetriNetUnfolder]: 7/38 cut-off events. [2022-12-13 02:25:27,728 INFO L131 PetriNetUnfolder]: For 6/9 co-relation queries the response was YES. [2022-12-13 02:25:27,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 38 events. 7/38 cut-off events. For 6/9 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 86 event pairs, 0 based on Foata normal form. 1/37 useless extension candidates. Maximal degree in co-relation 51. Up to 11 conditions per place. [2022-12-13 02:25:27,729 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 21 transitions, 85 flow [2022-12-13 02:25:27,729 INFO L226 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-13 02:25:27,952 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:27,953 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 234 [2022-12-13 02:25:27,953 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 20 transitions, 83 flow [2022-12-13 02:25:27,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:27,954 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:27,954 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:27,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 02:25:27,954 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:25:27,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:27,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1672318876, now seen corresponding path program 1 times [2022-12-13 02:25:27,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:27,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006311446] [2022-12-13 02:25:27,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:27,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:28,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:28,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:28,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006311446] [2022-12-13 02:25:28,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006311446] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:28,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:28,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:28,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475381939] [2022-12-13 02:25:28,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:28,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 02:25:28,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:28,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 02:25:28,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 02:25:28,020 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-13 02:25:28,020 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 20 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:28,020 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:28,021 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-13 02:25:28,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:28,066 INFO L130 PetriNetUnfolder]: 59/111 cut-off events. [2022-12-13 02:25:28,067 INFO L131 PetriNetUnfolder]: For 152/165 co-relation queries the response was YES. [2022-12-13 02:25:28,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 340 conditions, 111 events. 59/111 cut-off events. For 152/165 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 326 event pairs, 14 based on Foata normal form. 7/116 useless extension candidates. Maximal degree in co-relation 287. Up to 76 conditions per place. [2022-12-13 02:25:28,068 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 20 selfloop transitions, 2 changer transitions 4/27 dead transitions. [2022-12-13 02:25:28,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 27 transitions, 152 flow [2022-12-13 02:25:28,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 02:25:28,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 02:25:28,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-13 02:25:28,070 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2022-12-13 02:25:28,071 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 83 flow. Second operand 3 states and 30 transitions. [2022-12-13 02:25:28,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 27 transitions, 152 flow [2022-12-13 02:25:28,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 27 transitions, 135 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-13 02:25:28,072 INFO L231 Difference]: Finished difference. Result has 23 places, 19 transitions, 66 flow [2022-12-13 02:25:28,072 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=23, PETRI_TRANSITIONS=19} [2022-12-13 02:25:28,073 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 2 predicate places. [2022-12-13 02:25:28,073 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:28,073 INFO L89 Accepts]: Start accepts. Operand has 23 places, 19 transitions, 66 flow [2022-12-13 02:25:28,074 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:28,074 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:28,074 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 19 transitions, 66 flow [2022-12-13 02:25:28,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 19 transitions, 66 flow [2022-12-13 02:25:28,078 INFO L130 PetriNetUnfolder]: 7/25 cut-off events. [2022-12-13 02:25:28,078 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 02:25:28,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 25 events. 7/25 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 28. Up to 10 conditions per place. [2022-12-13 02:25:28,078 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 19 transitions, 66 flow [2022-12-13 02:25:28,079 INFO L226 LiptonReduction]: Number of co-enabled transitions 56 [2022-12-13 02:25:28,079 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:25:28,080 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 02:25:28,080 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 19 transitions, 66 flow [2022-12-13 02:25:28,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:28,080 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:28,080 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:28,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 02:25:28,081 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:25:28,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:28,081 INFO L85 PathProgramCache]: Analyzing trace with hash 526664714, now seen corresponding path program 1 times [2022-12-13 02:25:28,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:28,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694382310] [2022-12-13 02:25:28,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:28,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:28,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:28,141 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 02:25:28,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:28,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694382310] [2022-12-13 02:25:28,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694382310] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:28,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:28,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:28,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305756683] [2022-12-13 02:25:28,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:28,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:25:28,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:28,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:25:28,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:25:28,143 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 02:25:28,143 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 19 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:28,143 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:28,143 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 02:25:28,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:28,215 INFO L130 PetriNetUnfolder]: 59/111 cut-off events. [2022-12-13 02:25:28,215 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2022-12-13 02:25:28,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302 conditions, 111 events. 59/111 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 265 event pairs, 20 based on Foata normal form. 4/114 useless extension candidates. Maximal degree in co-relation 204. Up to 76 conditions per place. [2022-12-13 02:25:28,216 INFO L137 encePairwiseOnDemand]: 13/18 looper letters, 29 selfloop transitions, 4 changer transitions 0/33 dead transitions. [2022-12-13 02:25:28,217 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 33 transitions, 175 flow [2022-12-13 02:25:28,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:25:28,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:25:28,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-12-13 02:25:28,218 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2022-12-13 02:25:28,218 INFO L175 Difference]: Start difference. First operand has 22 places, 19 transitions, 66 flow. Second operand 4 states and 34 transitions. [2022-12-13 02:25:28,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 33 transitions, 175 flow [2022-12-13 02:25:28,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 33 transitions, 160 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-13 02:25:28,219 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 83 flow [2022-12-13 02:25:28,219 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=83, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2022-12-13 02:25:28,220 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 4 predicate places. [2022-12-13 02:25:28,220 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:28,220 INFO L89 Accepts]: Start accepts. Operand has 25 places, 21 transitions, 83 flow [2022-12-13 02:25:28,221 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:28,221 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:28,221 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 21 transitions, 83 flow [2022-12-13 02:25:28,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 83 flow [2022-12-13 02:25:28,225 INFO L130 PetriNetUnfolder]: 6/27 cut-off events. [2022-12-13 02:25:28,225 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 02:25:28,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 27 events. 6/27 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 32 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 40. Up to 9 conditions per place. [2022-12-13 02:25:28,226 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 21 transitions, 83 flow [2022-12-13 02:25:28,226 INFO L226 LiptonReduction]: Number of co-enabled transitions 70 [2022-12-13 02:25:28,474 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:28,475 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 255 [2022-12-13 02:25:28,475 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 20 transitions, 81 flow [2022-12-13 02:25:28,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:28,475 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:28,475 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:28,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 02:25:28,476 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:25:28,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:28,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1844971348, now seen corresponding path program 1 times [2022-12-13 02:25:28,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:28,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076804832] [2022-12-13 02:25:28,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:28,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:28,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:28,562 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 02:25:28,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:28,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076804832] [2022-12-13 02:25:28,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076804832] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:28,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:28,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:28,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718613188] [2022-12-13 02:25:28,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:28,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 02:25:28,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:28,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 02:25:28,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 02:25:28,565 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 02:25:28,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 20 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:28,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:28,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 02:25:28,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:28,615 INFO L130 PetriNetUnfolder]: 42/78 cut-off events. [2022-12-13 02:25:28,615 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-13 02:25:28,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 78 events. 42/78 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 149 event pairs, 9 based on Foata normal form. 6/83 useless extension candidates. Maximal degree in co-relation 82. Up to 68 conditions per place. [2022-12-13 02:25:28,616 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 20 selfloop transitions, 2 changer transitions 1/23 dead transitions. [2022-12-13 02:25:28,616 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 23 transitions, 134 flow [2022-12-13 02:25:28,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 02:25:28,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 02:25:28,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-12-13 02:25:28,617 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-13 02:25:28,617 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 81 flow. Second operand 3 states and 24 transitions. [2022-12-13 02:25:28,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 23 transitions, 134 flow [2022-12-13 02:25:28,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 23 transitions, 117 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-13 02:25:28,620 INFO L231 Difference]: Finished difference. Result has 24 places, 19 transitions, 64 flow [2022-12-13 02:25:28,620 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=24, PETRI_TRANSITIONS=19} [2022-12-13 02:25:28,623 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 3 predicate places. [2022-12-13 02:25:28,627 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:28,627 INFO L89 Accepts]: Start accepts. Operand has 24 places, 19 transitions, 64 flow [2022-12-13 02:25:28,628 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:28,628 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:28,628 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 19 transitions, 64 flow [2022-12-13 02:25:28,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 19 transitions, 64 flow [2022-12-13 02:25:28,632 INFO L130 PetriNetUnfolder]: 6/22 cut-off events. [2022-12-13 02:25:28,632 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 02:25:28,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 22 events. 6/22 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 24. Up to 9 conditions per place. [2022-12-13 02:25:28,632 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 19 transitions, 64 flow [2022-12-13 02:25:28,632 INFO L226 LiptonReduction]: Number of co-enabled transitions 50 [2022-12-13 02:25:28,633 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:25:28,633 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 02:25:28,633 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 19 transitions, 64 flow [2022-12-13 02:25:28,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:28,634 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:28,634 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:28,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 02:25:28,634 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:25:28,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:28,635 INFO L85 PathProgramCache]: Analyzing trace with hash -854334181, now seen corresponding path program 1 times [2022-12-13 02:25:28,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:28,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178331212] [2022-12-13 02:25:28,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:28,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:28,791 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 02:25:28,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:28,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178331212] [2022-12-13 02:25:28,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178331212] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:28,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:28,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:28,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347461722] [2022-12-13 02:25:28,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:28,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:25:28,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:28,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:25:28,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:25:28,793 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 02:25:28,793 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 19 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:28,793 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:28,793 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 02:25:28,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:28,894 INFO L130 PetriNetUnfolder]: 52/94 cut-off events. [2022-12-13 02:25:28,895 INFO L131 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2022-12-13 02:25:28,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 94 events. 52/94 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 194 event pairs, 16 based on Foata normal form. 8/101 useless extension candidates. Maximal degree in co-relation 93. Up to 73 conditions per place. [2022-12-13 02:25:28,896 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 22 selfloop transitions, 4 changer transitions 0/26 dead transitions. [2022-12-13 02:25:28,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 26 transitions, 137 flow [2022-12-13 02:25:28,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:25:28,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:25:28,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-12-13 02:25:28,897 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35526315789473684 [2022-12-13 02:25:28,897 INFO L175 Difference]: Start difference. First operand has 23 places, 19 transitions, 64 flow. Second operand 4 states and 27 transitions. [2022-12-13 02:25:28,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 26 transitions, 137 flow [2022-12-13 02:25:28,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 26 transitions, 133 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 02:25:28,898 INFO L231 Difference]: Finished difference. Result has 25 places, 20 transitions, 79 flow [2022-12-13 02:25:28,898 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=79, PETRI_PLACES=25, PETRI_TRANSITIONS=20} [2022-12-13 02:25:28,899 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 4 predicate places. [2022-12-13 02:25:28,899 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:28,899 INFO L89 Accepts]: Start accepts. Operand has 25 places, 20 transitions, 79 flow [2022-12-13 02:25:28,900 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:28,900 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:28,900 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 20 transitions, 79 flow [2022-12-13 02:25:28,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 20 transitions, 79 flow [2022-12-13 02:25:28,904 INFO L130 PetriNetUnfolder]: 8/29 cut-off events. [2022-12-13 02:25:28,904 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-13 02:25:28,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 29 events. 8/29 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 42 event pairs, 1 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 42. Up to 13 conditions per place. [2022-12-13 02:25:28,905 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 20 transitions, 79 flow [2022-12-13 02:25:28,905 INFO L226 LiptonReduction]: Number of co-enabled transitions 58 [2022-12-13 02:25:28,911 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:25:28,912 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 02:25:28,912 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 20 transitions, 79 flow [2022-12-13 02:25:28,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:28,912 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:28,912 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:28,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 02:25:28,913 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:25:28,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:28,913 INFO L85 PathProgramCache]: Analyzing trace with hash -503744373, now seen corresponding path program 1 times [2022-12-13 02:25:28,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:28,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101857773] [2022-12-13 02:25:28,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:28,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:28,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:29,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:29,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:29,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101857773] [2022-12-13 02:25:29,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101857773] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:25:29,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830468262] [2022-12-13 02:25:29,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:29,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:25:29,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:25:29,409 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:25:29,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 02:25:29,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:29,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-13 02:25:29,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:25:29,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 02:25:29,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 02:25:29,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 02:25:29,787 INFO L321 Elim1Store]: treesize reduction 29, result has 58.0 percent of original size [2022-12-13 02:25:29,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 66 [2022-12-13 02:25:29,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:29,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:25:30,001 WARN L837 $PredicateComparison]: unable to prove that (forall ((~x1~0 Int) (~x2~0 Int) (v_ArrVal_137 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) c_~f~0.base))) (let ((.cse0 (select .cse1 (+ (* 4 (select .cse1 (+ c_~f~0.offset (* ~x2~0 4)))) c_~f~0.offset)))) (or (< .cse0 0) (< ~x1~0 0) (<= c_~size~0 .cse0) (<= c_~size~0 ~x1~0) (= (select .cse1 (+ (* .cse0 4) c_~f~0.offset)) (select .cse1 (+ (* ~x1~0 4) c_~f~0.offset))))))) is different from false [2022-12-13 02:25:30,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:30,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830468262] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:25:30,486 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:25:30,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 16 [2022-12-13 02:25:30,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131763877] [2022-12-13 02:25:30,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:25:30,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 02:25:30,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:30,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 02:25:30,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=169, Unknown=2, NotChecked=26, Total=240 [2022-12-13 02:25:30,488 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 02:25:30,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 20 transitions, 79 flow. Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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 02:25:30,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:30,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 02:25:30,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:31,527 INFO L130 PetriNetUnfolder]: 143/256 cut-off events. [2022-12-13 02:25:31,528 INFO L131 PetriNetUnfolder]: For 138/138 co-relation queries the response was YES. [2022-12-13 02:25:31,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 788 conditions, 256 events. 143/256 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 822 event pairs, 14 based on Foata normal form. 9/265 useless extension candidates. Maximal degree in co-relation 136. Up to 123 conditions per place. [2022-12-13 02:25:31,529 INFO L137 encePairwiseOnDemand]: 9/19 looper letters, 50 selfloop transitions, 14 changer transitions 24/88 dead transitions. [2022-12-13 02:25:31,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 88 transitions, 488 flow [2022-12-13 02:25:31,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 02:25:31,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 02:25:31,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 91 transitions. [2022-12-13 02:25:31,531 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28173374613003094 [2022-12-13 02:25:31,531 INFO L175 Difference]: Start difference. First operand has 25 places, 20 transitions, 79 flow. Second operand 17 states and 91 transitions. [2022-12-13 02:25:31,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 88 transitions, 488 flow [2022-12-13 02:25:31,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 88 transitions, 465 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-13 02:25:31,533 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 156 flow [2022-12-13 02:25:31,534 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=156, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2022-12-13 02:25:31,534 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 23 predicate places. [2022-12-13 02:25:31,534 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:31,534 INFO L89 Accepts]: Start accepts. Operand has 44 places, 28 transitions, 156 flow [2022-12-13 02:25:31,535 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:31,535 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:31,535 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 28 transitions, 156 flow [2022-12-13 02:25:31,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 28 transitions, 156 flow [2022-12-13 02:25:31,546 INFO L130 PetriNetUnfolder]: 12/48 cut-off events. [2022-12-13 02:25:31,546 INFO L131 PetriNetUnfolder]: For 43/46 co-relation queries the response was YES. [2022-12-13 02:25:31,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 48 events. 12/48 cut-off events. For 43/46 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 109 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 120. Up to 22 conditions per place. [2022-12-13 02:25:31,547 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 28 transitions, 156 flow [2022-12-13 02:25:31,547 INFO L226 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-13 02:25:34,070 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 02:25:34,071 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2537 [2022-12-13 02:25:34,071 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 156 flow [2022-12-13 02:25:34,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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 02:25:34,071 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:34,072 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:34,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 02:25:34,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:25:34,273 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:25:34,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:34,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1982835261, now seen corresponding path program 1 times [2022-12-13 02:25:34,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:34,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666534357] [2022-12-13 02:25:34,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:34,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:34,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:34,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:34,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:34,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666534357] [2022-12-13 02:25:34,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666534357] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:34,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:34,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:34,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408446178] [2022-12-13 02:25:34,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:34,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:34,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:34,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:34,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:34,552 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 02:25:34,552 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 156 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:34,552 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:34,552 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 02:25:34,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:34,652 INFO L130 PetriNetUnfolder]: 99/187 cut-off events. [2022-12-13 02:25:34,652 INFO L131 PetriNetUnfolder]: For 357/357 co-relation queries the response was YES. [2022-12-13 02:25:34,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 688 conditions, 187 events. 99/187 cut-off events. For 357/357 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 545 event pairs, 51 based on Foata normal form. 8/193 useless extension candidates. Maximal degree in co-relation 672. Up to 169 conditions per place. [2022-12-13 02:25:34,654 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 26 selfloop transitions, 4 changer transitions 4/34 dead transitions. [2022-12-13 02:25:34,654 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 34 transitions, 256 flow [2022-12-13 02:25:34,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:25:34,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:25:34,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-12-13 02:25:34,655 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3409090909090909 [2022-12-13 02:25:34,655 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 156 flow. Second operand 4 states and 30 transitions. [2022-12-13 02:25:34,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 34 transitions, 256 flow [2022-12-13 02:25:34,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 34 transitions, 225 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-13 02:25:34,659 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 146 flow [2022-12-13 02:25:34,659 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2022-12-13 02:25:34,660 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 17 predicate places. [2022-12-13 02:25:34,660 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:34,660 INFO L89 Accepts]: Start accepts. Operand has 38 places, 27 transitions, 146 flow [2022-12-13 02:25:34,662 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:34,662 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:34,662 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 27 transitions, 146 flow [2022-12-13 02:25:34,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 27 transitions, 146 flow [2022-12-13 02:25:34,669 INFO L130 PetriNetUnfolder]: 13/50 cut-off events. [2022-12-13 02:25:34,669 INFO L131 PetriNetUnfolder]: For 36/39 co-relation queries the response was YES. [2022-12-13 02:25:34,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 50 events. 13/50 cut-off events. For 36/39 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 123. Up to 24 conditions per place. [2022-12-13 02:25:34,695 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 27 transitions, 146 flow [2022-12-13 02:25:34,696 INFO L226 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-13 02:25:34,722 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [641] L101-6-->L85-2: Formula: (and (= |v_#pthreadsForks_55| (+ |v_#pthreadsForks_56| 1)) (= v_~f~0.offset_85 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_24|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_24| v_~f~0.base_85) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101| (ite (< (mod v_~n~0_68 4294967296) 1431655765) 1 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_133| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_24| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|) (= |v_ULTIMATE.start_main_#t~pre12#1_43| |v_#pthreadsForks_56|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_42| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_24| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_133|) (= (store |v_#memory_int_124| |v_ULTIMATE.start_main_~#t1~0#1.base_35| (store (select |v_#memory_int_124| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre12#1_43|)) |v_#memory_int_123|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|, #pthreadsForks=|v_#pthreadsForks_56|, #memory_int=|v_#memory_int_124|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_42|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ~n~0=v_~n~0_68, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|, ~f~0.base=v_~f~0.base_85, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_24|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ~f~0.offset=v_~f~0.offset_85, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_43|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_24|, #pthreadsForks=|v_#pthreadsForks_55|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_133|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_31|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_31|, #memory_int=|v_#memory_int_123|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_42|, ~n~0=v_~n~0_68, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ~f~0.base, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base, #memory_int, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~f~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [656] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_182| v_~f~0.base_122))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_121 (* v_~x1~0_121 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|) (= |v_thread1Thread1of1ForFork0_~i~0#1_73| 2) (= (ite (and (< .cse0 v_~size~0_125) (<= 0 .cse0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|) (= v_~x1~0_119 (select .cse1 (+ v_~f~0.offset_121 (* 4 .cse0)))) (not (= (ite (and (<= 0 v_~x1~0_121) (< v_~x1~0_121 v_~size~0_125)) 1 0) 0)) (< 1 (mod (* 3 v_~n~0_107) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| 0))))) InVars {~size~0=v_~size~0_125, ~f~0.base=v_~f~0.base_122, #memory_int=|v_#memory_int_182|, ~n~0=v_~n~0_107, ~x1~0=v_~x1~0_121, ~f~0.offset=v_~f~0.offset_121} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_43|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|, ~size~0=v_~size~0_125, ~f~0.base=v_~f~0.base_122, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_73|, #memory_int=|v_#memory_int_182|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51|, ~n~0=v_~n~0_107, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_53|, ~x1~0=v_~x1~0_119, ~f~0.offset=v_~f~0.offset_121} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:25:35,143 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 02:25:35,144 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 484 [2022-12-13 02:25:35,144 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 153 flow [2022-12-13 02:25:35,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:35,145 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:35,145 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:35,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 02:25:35,145 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:25:35,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:35,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1626137748, now seen corresponding path program 1 times [2022-12-13 02:25:35,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:35,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146731412] [2022-12-13 02:25:35,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:35,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:35,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:35,719 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 02:25:35,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:35,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146731412] [2022-12-13 02:25:35,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146731412] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:35,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:35,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:35,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295738140] [2022-12-13 02:25:35,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:35,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:35,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:35,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:35,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:35,721 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-13 02:25:35,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 153 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:35,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:35,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-13 02:25:35,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:35,899 INFO L130 PetriNetUnfolder]: 138/261 cut-off events. [2022-12-13 02:25:35,899 INFO L131 PetriNetUnfolder]: For 513/513 co-relation queries the response was YES. [2022-12-13 02:25:35,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 922 conditions, 261 events. 138/261 cut-off events. For 513/513 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 915 event pairs, 38 based on Foata normal form. 2/263 useless extension candidates. Maximal degree in co-relation 910. Up to 154 conditions per place. [2022-12-13 02:25:35,901 INFO L137 encePairwiseOnDemand]: 13/21 looper letters, 28 selfloop transitions, 6 changer transitions 22/56 dead transitions. [2022-12-13 02:25:35,901 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 56 transitions, 373 flow [2022-12-13 02:25:35,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:25:35,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:25:35,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-12-13 02:25:35,904 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42063492063492064 [2022-12-13 02:25:35,904 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 153 flow. Second operand 6 states and 53 transitions. [2022-12-13 02:25:35,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 56 transitions, 373 flow [2022-12-13 02:25:35,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 56 transitions, 343 flow, removed 12 selfloop flow, removed 5 redundant places. [2022-12-13 02:25:35,907 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 158 flow [2022-12-13 02:25:35,908 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=158, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2022-12-13 02:25:35,909 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 19 predicate places. [2022-12-13 02:25:35,909 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:35,909 INFO L89 Accepts]: Start accepts. Operand has 40 places, 28 transitions, 158 flow [2022-12-13 02:25:35,911 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:35,911 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:35,911 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 28 transitions, 158 flow [2022-12-13 02:25:35,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 28 transitions, 158 flow [2022-12-13 02:25:35,919 INFO L130 PetriNetUnfolder]: 14/62 cut-off events. [2022-12-13 02:25:35,919 INFO L131 PetriNetUnfolder]: For 64/66 co-relation queries the response was YES. [2022-12-13 02:25:35,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 62 events. 14/62 cut-off events. For 64/66 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 206 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 156. Up to 26 conditions per place. [2022-12-13 02:25:35,920 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 28 transitions, 158 flow [2022-12-13 02:25:35,920 INFO L226 LiptonReduction]: Number of co-enabled transitions 90 [2022-12-13 02:25:35,921 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:25:35,921 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 02:25:35,922 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 158 flow [2022-12-13 02:25:35,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:35,922 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:35,922 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:35,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 02:25:35,922 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:25:35,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:35,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1747909610, now seen corresponding path program 1 times [2022-12-13 02:25:35,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:35,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862062563] [2022-12-13 02:25:35,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:35,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:35,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:36,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:36,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:36,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862062563] [2022-12-13 02:25:36,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862062563] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:25:36,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847265570] [2022-12-13 02:25:36,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:36,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:25:36,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:25:36,012 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:25:36,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 02:25:36,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:36,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-13 02:25:36,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:25:36,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-13 02:25:36,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 02:25:36,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:25:36,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 02:25:36,295 INFO L321 Elim1Store]: treesize reduction 29, result has 58.0 percent of original size [2022-12-13 02:25:36,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 66 [2022-12-13 02:25:36,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:36,333 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 02:25:36,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847265570] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:36,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 02:25:36,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 9 [2022-12-13 02:25:36,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52054444] [2022-12-13 02:25:36,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:36,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:36,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:36,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:36,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 02:25:36,335 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-13 02:25:36,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 158 flow. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:36,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:36,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-13 02:25:36,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:36,491 INFO L130 PetriNetUnfolder]: 120/229 cut-off events. [2022-12-13 02:25:36,491 INFO L131 PetriNetUnfolder]: For 393/393 co-relation queries the response was YES. [2022-12-13 02:25:36,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 820 conditions, 229 events. 120/229 cut-off events. For 393/393 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 770 event pairs, 35 based on Foata normal form. 1/229 useless extension candidates. Maximal degree in co-relation 806. Up to 110 conditions per place. [2022-12-13 02:25:36,493 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 23 selfloop transitions, 3 changer transitions 19/45 dead transitions. [2022-12-13 02:25:36,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 45 transitions, 310 flow [2022-12-13 02:25:36,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:36,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:36,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-12-13 02:25:36,494 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2022-12-13 02:25:36,495 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 158 flow. Second operand 5 states and 40 transitions. [2022-12-13 02:25:36,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 45 transitions, 310 flow [2022-12-13 02:25:36,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 45 transitions, 300 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-13 02:25:36,496 INFO L231 Difference]: Finished difference. Result has 41 places, 23 transitions, 115 flow [2022-12-13 02:25:36,496 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=41, PETRI_TRANSITIONS=23} [2022-12-13 02:25:36,497 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 20 predicate places. [2022-12-13 02:25:36,497 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:36,497 INFO L89 Accepts]: Start accepts. Operand has 41 places, 23 transitions, 115 flow [2022-12-13 02:25:36,498 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:36,498 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:36,498 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 23 transitions, 115 flow [2022-12-13 02:25:36,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 23 transitions, 115 flow [2022-12-13 02:25:36,502 INFO L130 PetriNetUnfolder]: 10/31 cut-off events. [2022-12-13 02:25:36,502 INFO L131 PetriNetUnfolder]: For 30/32 co-relation queries the response was YES. [2022-12-13 02:25:36,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 31 events. 10/31 cut-off events. For 30/32 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 49 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 77. Up to 17 conditions per place. [2022-12-13 02:25:36,503 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 23 transitions, 115 flow [2022-12-13 02:25:36,503 INFO L226 LiptonReduction]: Number of co-enabled transitions 68 [2022-12-13 02:25:36,503 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:25:36,506 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 02:25:36,506 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 115 flow [2022-12-13 02:25:36,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:36,506 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:36,506 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:36,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 02:25:36,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-13 02:25:36,728 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:25:36,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:36,729 INFO L85 PathProgramCache]: Analyzing trace with hash 113095055, now seen corresponding path program 1 times [2022-12-13 02:25:36,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:36,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147401161] [2022-12-13 02:25:36,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:36,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:36,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:36,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:36,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147401161] [2022-12-13 02:25:36,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147401161] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:25:36,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596883276] [2022-12-13 02:25:36,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:36,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:25:36,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:25:36,943 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:25:36,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 02:25:37,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:37,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 02:25:37,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:25:37,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:37,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:25:37,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:37,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596883276] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:25:37,296 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:25:37,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-13 02:25:37,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951554670] [2022-12-13 02:25:37,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:25:37,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 02:25:37,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:37,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 02:25:37,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-12-13 02:25:37,297 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 02:25:37,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 115 flow. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:37,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:37,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 02:25:37,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:37,665 INFO L130 PetriNetUnfolder]: 149/265 cut-off events. [2022-12-13 02:25:37,665 INFO L131 PetriNetUnfolder]: For 540/540 co-relation queries the response was YES. [2022-12-13 02:25:37,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 975 conditions, 265 events. 149/265 cut-off events. For 540/540 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 881 event pairs, 32 based on Foata normal form. 16/279 useless extension candidates. Maximal degree in co-relation 957. Up to 137 conditions per place. [2022-12-13 02:25:37,668 INFO L137 encePairwiseOnDemand]: 12/19 looper letters, 53 selfloop transitions, 16 changer transitions 0/69 dead transitions. [2022-12-13 02:25:37,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 69 transitions, 459 flow [2022-12-13 02:25:37,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 02:25:37,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 02:25:37,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 67 transitions. [2022-12-13 02:25:37,669 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.391812865497076 [2022-12-13 02:25:37,669 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 115 flow. Second operand 9 states and 67 transitions. [2022-12-13 02:25:37,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 69 transitions, 459 flow [2022-12-13 02:25:37,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 69 transitions, 413 flow, removed 18 selfloop flow, removed 6 redundant places. [2022-12-13 02:25:37,672 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 205 flow [2022-12-13 02:25:37,672 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=205, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2022-12-13 02:25:37,672 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 18 predicate places. [2022-12-13 02:25:37,672 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:37,673 INFO L89 Accepts]: Start accepts. Operand has 39 places, 32 transitions, 205 flow [2022-12-13 02:25:37,673 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:37,673 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:37,673 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 32 transitions, 205 flow [2022-12-13 02:25:37,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 32 transitions, 205 flow [2022-12-13 02:25:37,682 INFO L130 PetriNetUnfolder]: 23/71 cut-off events. [2022-12-13 02:25:37,682 INFO L131 PetriNetUnfolder]: For 60/74 co-relation queries the response was YES. [2022-12-13 02:25:37,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 71 events. 23/71 cut-off events. For 60/74 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 208 event pairs, 2 based on Foata normal form. 0/70 useless extension candidates. Maximal degree in co-relation 123. Up to 41 conditions per place. [2022-12-13 02:25:37,683 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 32 transitions, 205 flow [2022-12-13 02:25:37,683 INFO L226 LiptonReduction]: Number of co-enabled transitions 110 [2022-12-13 02:25:39,869 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:39,870 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2198 [2022-12-13 02:25:39,870 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 203 flow [2022-12-13 02:25:39,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:39,870 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:39,871 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:39,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 02:25:40,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:25:40,080 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:25:40,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:40,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1772810879, now seen corresponding path program 1 times [2022-12-13 02:25:40,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:40,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652926505] [2022-12-13 02:25:40,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:40,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:41,550 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:41,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:41,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652926505] [2022-12-13 02:25:41,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652926505] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:25:41,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036534039] [2022-12-13 02:25:41,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:41,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:25:41,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:25:41,552 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:25:41,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 02:25:41,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:41,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 02:25:41,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:25:41,720 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:25:41,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 45 [2022-12-13 02:25:41,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:41,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:25:41,902 INFO L321 Elim1Store]: treesize reduction 15, result has 90.4 percent of original size [2022-12-13 02:25:41,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 177 [2022-12-13 02:25:42,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:42,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036534039] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:25:42,161 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:25:42,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 13 [2022-12-13 02:25:42,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57053737] [2022-12-13 02:25:42,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:25:42,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 02:25:42,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:42,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 02:25:42,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-12-13 02:25:42,163 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 02:25:42,164 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 203 flow. Second operand has 15 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:42,164 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:42,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 02:25:42,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:42,803 INFO L130 PetriNetUnfolder]: 403/719 cut-off events. [2022-12-13 02:25:42,803 INFO L131 PetriNetUnfolder]: For 1253/1253 co-relation queries the response was YES. [2022-12-13 02:25:42,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2671 conditions, 719 events. 403/719 cut-off events. For 1253/1253 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3128 event pairs, 48 based on Foata normal form. 3/721 useless extension candidates. Maximal degree in co-relation 1628. Up to 335 conditions per place. [2022-12-13 02:25:42,809 INFO L137 encePairwiseOnDemand]: 10/20 looper letters, 85 selfloop transitions, 46 changer transitions 2/133 dead transitions. [2022-12-13 02:25:42,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 133 transitions, 965 flow [2022-12-13 02:25:42,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 02:25:42,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 02:25:42,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 115 transitions. [2022-12-13 02:25:42,811 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3382352941176471 [2022-12-13 02:25:42,811 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 203 flow. Second operand 17 states and 115 transitions. [2022-12-13 02:25:42,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 133 transitions, 965 flow [2022-12-13 02:25:42,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 133 transitions, 919 flow, removed 22 selfloop flow, removed 2 redundant places. [2022-12-13 02:25:42,819 INFO L231 Difference]: Finished difference. Result has 56 places, 74 transitions, 617 flow [2022-12-13 02:25:42,819 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=617, PETRI_PLACES=56, PETRI_TRANSITIONS=74} [2022-12-13 02:25:42,820 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 35 predicate places. [2022-12-13 02:25:42,820 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:42,820 INFO L89 Accepts]: Start accepts. Operand has 56 places, 74 transitions, 617 flow [2022-12-13 02:25:42,821 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:42,821 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:42,821 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 74 transitions, 617 flow [2022-12-13 02:25:42,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 74 transitions, 617 flow [2022-12-13 02:25:42,868 INFO L130 PetriNetUnfolder]: 58/201 cut-off events. [2022-12-13 02:25:42,868 INFO L131 PetriNetUnfolder]: For 245/260 co-relation queries the response was YES. [2022-12-13 02:25:42,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 698 conditions, 201 events. 58/201 cut-off events. For 245/260 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 951 event pairs, 2 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 607. Up to 103 conditions per place. [2022-12-13 02:25:42,870 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 74 transitions, 617 flow [2022-12-13 02:25:42,870 INFO L226 LiptonReduction]: Number of co-enabled transitions 252 [2022-12-13 02:25:42,888 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [650] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_143| v_~f~0.base_101))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_101 (* v_~x2~0_153 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_101 (* .cse2 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103| 0)) (= v_~x2~0_152 (select .cse0 (+ v_~f~0.offset_101 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_153 v_~size~0_107) (<= 0 v_~x2~0_153)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_107)) 1 0) 0)) (< (mod (+ 4294967293 |v_thread2Thread1of1ForFork1_~i~1#1_93|) 4294967296) (mod (* v_~n~0_86 3) 4294967296)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_107)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_93|))))) InVars {~x2~0=v_~x2~0_153, ~size~0=v_~size~0_107, ~f~0.base=v_~f~0.base_101, #memory_int=|v_#memory_int_143|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_101} OutVars{~x2~0=v_~x2~0_152, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_63|, ~size~0=v_~size~0_107, ~f~0.base=v_~f~0.base_101, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_93|, ~f~0.offset=v_~f~0.offset_101, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_27|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_25|, #memory_int=|v_#memory_int_143|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_35|, ~n~0=v_~n~0_86, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_39|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [649] $Ultimate##0-->L49-2: Formula: (and (= (ite (and (< v_~x1~0_89 v_~size~0_105) (<= 0 v_~x1~0_89)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_~i~0#1_53| 1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_53| 4294967295) 4294967296) (mod (* v_~n~0_84 3) 4294967296)) (= (select (select |v_#memory_int_141| v_~f~0.base_99) (+ v_~f~0.offset_99 (* v_~x1~0_89 4))) v_~x1~0_88)) InVars {~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, #memory_int=|v_#memory_int_141|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_89, ~f~0.offset=v_~f~0.offset_99} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_29|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_53|, #memory_int=|v_#memory_int_141|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, ~n~0=v_~n~0_84, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_39|, ~x1~0=v_~x1~0_88, ~f~0.offset=v_~f~0.offset_99} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:25:43,682 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [652] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_145| v_~f~0.base_103))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_103 (* v_~x2~0_157 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse2))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (= (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse1))) v_~x2~0_156) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_109)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_99|) (not (= (ite (and (<= 0 v_~x2~0_157) (< v_~x2~0_157 v_~size~0_109)) 1 0) 0)) (< (mod (+ 4294967293 |v_thread2Thread1of1ForFork1_~i~1#1_99|) 4294967296) (mod (* v_~n~0_90 3) 4294967296)) (not (= 0 (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_109)) 1 0))))))) InVars {~x2~0=v_~x2~0_157, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, #memory_int=|v_#memory_int_145|, ~n~0=v_~n~0_90, ~f~0.offset=v_~f~0.offset_103} OutVars{~x2~0=v_~x2~0_156, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_65|, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_99|, ~f~0.offset=v_~f~0.offset_103, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_29|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_90, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_41|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:25:44,240 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] and [626] L85-3-->L86-3: Formula: (and (= |v_#memory_int_115| (store |v_#memory_int_116| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_116| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre14#1_29|))) (= |v_ULTIMATE.start_main_#t~pre14#1_29| |v_#pthreadsForks_52|) (= |v_#pthreadsForks_51| (+ |v_#pthreadsForks_52| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_52|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #memory_int=|v_#memory_int_116|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_37|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_29|, #pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #memory_int=|v_#memory_int_115|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] [2022-12-13 02:25:44,317 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] and [652] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_145| v_~f~0.base_103))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_103 (* v_~x2~0_157 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse2))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (= (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse1))) v_~x2~0_156) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_109)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_99|) (not (= (ite (and (<= 0 v_~x2~0_157) (< v_~x2~0_157 v_~size~0_109)) 1 0) 0)) (< (mod (+ 4294967293 |v_thread2Thread1of1ForFork1_~i~1#1_99|) 4294967296) (mod (* v_~n~0_90 3) 4294967296)) (not (= 0 (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_109)) 1 0))))))) InVars {~x2~0=v_~x2~0_157, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, #memory_int=|v_#memory_int_145|, ~n~0=v_~n~0_90, ~f~0.offset=v_~f~0.offset_103} OutVars{~x2~0=v_~x2~0_156, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_65|, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_99|, ~f~0.offset=v_~f~0.offset_103, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_29|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_90, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_41|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:25:44,531 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] and [666] $Ultimate##0-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_247| v_~f~0.base_159))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_156 (* v_~x2~0_194 4))))) (let ((.cse0 (select .cse3 (+ v_~f~0.offset_156 (* .cse2 4))))) (let ((.cse5 (select .cse3 (+ v_~f~0.offset_156 (* .cse0 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_156 (* 4 .cse5))))) (let ((.cse1 (select .cse3 (+ (* .cse4 4) v_~f~0.offset_156)))) (and (not (= (ite (and (< .cse0 v_~size~0_159) (<= 0 .cse0)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_159)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_87|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_119| 0)) (not (= (ite (and (< v_~x2~0_194 v_~size~0_159) (<= 0 v_~x2~0_194)) 1 0) 0)) (< 3 (mod (* 3 v_~n~0_145) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_119| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_87|) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_159)) 1 0) 0)) (= (select .cse3 (+ v_~f~0.offset_156 (* .cse1 4))) v_~x2~0_192) (not (= (ite (and (< .cse4 v_~size~0_159) (<= 0 .cse4)) 1 0) 0)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_115|) (not (= (ite (and (< .cse5 v_~size~0_159) (<= 0 .cse5)) 1 0) 0))))))))) InVars {~x2~0=v_~x2~0_194, ~size~0=v_~size~0_159, ~f~0.base=v_~f~0.base_159, #memory_int=|v_#memory_int_247|, ~n~0=v_~n~0_145, ~f~0.offset=v_~f~0.offset_156} OutVars{~x2~0=v_~x2~0_192, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_79|, ~size~0=v_~size~0_159, ~f~0.base=v_~f~0.base_159, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_51|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_87|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_115|, ~f~0.offset=v_~f~0.offset_156, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_119|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_43|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, #memory_int=|v_#memory_int_247|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_51|, ~n~0=v_~n~0_145, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_55|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:25:44,857 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] and [667] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_249| v_~f~0.base_161))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_158 (* v_~x2~0_199 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_158 (* .cse2 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_123| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_88| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_72|) (= |v_thread1Thread1of1ForFork0_~i~0#1_119| (+ |v_thread1Thread1of1ForFork0_~i~0#1_120| 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_88| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_123| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_91|) (= v_~x2~0_198 (select .cse0 (+ v_~f~0.offset_158 (* 4 .cse1)))) (not (= (ite (and (<= 0 v_~x2~0_199) (< v_~x2~0_199 v_~size~0_161)) 1 0) 0)) (= (select .cse0 (+ v_~f~0.offset_158 (* v_~x1~0_191 4))) v_~x1~0_190) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_120| 4294967296) (mod (* 3 v_~n~0_147) 4294967296)) (not (= (ite (and (< .cse2 v_~size~0_161) (<= 0 .cse2)) 1 0) 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_119|) (= (ite (and (<= 0 v_~x1~0_191) (< v_~x1~0_191 v_~size~0_161)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_72|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_161)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_91|))))) InVars {~x2~0=v_~x2~0_199, ~size~0=v_~size~0_161, ~f~0.base=v_~f~0.base_161, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_120|, #memory_int=|v_#memory_int_249|, ~n~0=v_~n~0_147, ~x1~0=v_~x1~0_191, ~f~0.offset=v_~f~0.offset_158} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_80|, ~x2~0=v_~x2~0_198, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_83|, ~size~0=v_~size~0_161, ~f~0.base=v_~f~0.base_161, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_55|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_91|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_119|, ~x1~0=v_~x1~0_190, ~f~0.offset=v_~f~0.offset_158, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_123|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_72|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_47|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_119|, #memory_int=|v_#memory_int_249|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_88|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_45|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_55|, ~n~0=v_~n~0_147, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_90|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_59|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:25:45,194 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [648] $Ultimate##0-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_49| 1) (= v_~x1~0_84 (select (select |v_#memory_int_139| v_~f~0.base_97) (+ v_~f~0.offset_97 (* v_~x1~0_85 4)))) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_49| 4294967295) 4294967296) (mod (* v_~n~0_82 3) 4294967296)) (= (ite (and (<= 0 v_~x1~0_85) (< v_~x1~0_85 v_~size~0_103)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|)) InVars {~size~0=v_~size~0_103, ~f~0.base=v_~f~0.base_97, #memory_int=|v_#memory_int_139|, ~n~0=v_~n~0_82, ~x1~0=v_~x1~0_85, ~f~0.offset=v_~f~0.offset_97} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_27|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|, ~size~0=v_~size~0_103, ~f~0.base=v_~f~0.base_97, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_49|, #memory_int=|v_#memory_int_139|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35|, ~n~0=v_~n~0_82, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_37|, ~x1~0=v_~x1~0_84, ~f~0.offset=v_~f~0.offset_97} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] and [652] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_145| v_~f~0.base_103))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_103 (* v_~x2~0_157 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse2))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (= (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse1))) v_~x2~0_156) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_109)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_99|) (not (= (ite (and (<= 0 v_~x2~0_157) (< v_~x2~0_157 v_~size~0_109)) 1 0) 0)) (< (mod (+ 4294967293 |v_thread2Thread1of1ForFork1_~i~1#1_99|) 4294967296) (mod (* v_~n~0_90 3) 4294967296)) (not (= 0 (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_109)) 1 0))))))) InVars {~x2~0=v_~x2~0_157, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, #memory_int=|v_#memory_int_145|, ~n~0=v_~n~0_90, ~f~0.offset=v_~f~0.offset_103} OutVars{~x2~0=v_~x2~0_156, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_65|, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_99|, ~f~0.offset=v_~f~0.offset_103, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_29|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_90, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_41|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:25:45,485 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [648] $Ultimate##0-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_49| 1) (= v_~x1~0_84 (select (select |v_#memory_int_139| v_~f~0.base_97) (+ v_~f~0.offset_97 (* v_~x1~0_85 4)))) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_49| 4294967295) 4294967296) (mod (* v_~n~0_82 3) 4294967296)) (= (ite (and (<= 0 v_~x1~0_85) (< v_~x1~0_85 v_~size~0_103)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|)) InVars {~size~0=v_~size~0_103, ~f~0.base=v_~f~0.base_97, #memory_int=|v_#memory_int_139|, ~n~0=v_~n~0_82, ~x1~0=v_~x1~0_85, ~f~0.offset=v_~f~0.offset_97} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_27|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|, ~size~0=v_~size~0_103, ~f~0.base=v_~f~0.base_97, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_49|, #memory_int=|v_#memory_int_139|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35|, ~n~0=v_~n~0_82, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_37|, ~x1~0=v_~x1~0_84, ~f~0.offset=v_~f~0.offset_97} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] and [626] L85-3-->L86-3: Formula: (and (= |v_#memory_int_115| (store |v_#memory_int_116| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_116| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre14#1_29|))) (= |v_ULTIMATE.start_main_#t~pre14#1_29| |v_#pthreadsForks_52|) (= |v_#pthreadsForks_51| (+ |v_#pthreadsForks_52| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_52|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #memory_int=|v_#memory_int_116|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_37|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_29|, #pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #memory_int=|v_#memory_int_115|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] [2022-12-13 02:25:46,024 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [652] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_145| v_~f~0.base_103))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_103 (* v_~x2~0_157 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse2))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (= (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse1))) v_~x2~0_156) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_109)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_99|) (not (= (ite (and (<= 0 v_~x2~0_157) (< v_~x2~0_157 v_~size~0_109)) 1 0) 0)) (< (mod (+ 4294967293 |v_thread2Thread1of1ForFork1_~i~1#1_99|) 4294967296) (mod (* v_~n~0_90 3) 4294967296)) (not (= 0 (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_109)) 1 0))))))) InVars {~x2~0=v_~x2~0_157, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, #memory_int=|v_#memory_int_145|, ~n~0=v_~n~0_90, ~f~0.offset=v_~f~0.offset_103} OutVars{~x2~0=v_~x2~0_156, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_65|, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_99|, ~f~0.offset=v_~f~0.offset_103, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_29|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_90, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_41|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:25:46,376 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [648] $Ultimate##0-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_49| 1) (= v_~x1~0_84 (select (select |v_#memory_int_139| v_~f~0.base_97) (+ v_~f~0.offset_97 (* v_~x1~0_85 4)))) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_49| 4294967295) 4294967296) (mod (* v_~n~0_82 3) 4294967296)) (= (ite (and (<= 0 v_~x1~0_85) (< v_~x1~0_85 v_~size~0_103)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|)) InVars {~size~0=v_~size~0_103, ~f~0.base=v_~f~0.base_97, #memory_int=|v_#memory_int_139|, ~n~0=v_~n~0_82, ~x1~0=v_~x1~0_85, ~f~0.offset=v_~f~0.offset_97} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_27|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|, ~size~0=v_~size~0_103, ~f~0.base=v_~f~0.base_97, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_49|, #memory_int=|v_#memory_int_139|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35|, ~n~0=v_~n~0_82, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_37|, ~x1~0=v_~x1~0_84, ~f~0.offset=v_~f~0.offset_97} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] and [652] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_145| v_~f~0.base_103))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_103 (* v_~x2~0_157 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse2))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (= (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse1))) v_~x2~0_156) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_109)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_99|) (not (= (ite (and (<= 0 v_~x2~0_157) (< v_~x2~0_157 v_~size~0_109)) 1 0) 0)) (< (mod (+ 4294967293 |v_thread2Thread1of1ForFork1_~i~1#1_99|) 4294967296) (mod (* v_~n~0_90 3) 4294967296)) (not (= 0 (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_109)) 1 0))))))) InVars {~x2~0=v_~x2~0_157, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, #memory_int=|v_#memory_int_145|, ~n~0=v_~n~0_90, ~f~0.offset=v_~f~0.offset_103} OutVars{~x2~0=v_~x2~0_156, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_65|, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_99|, ~f~0.offset=v_~f~0.offset_103, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_29|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_90, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_41|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:25:47,707 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [648] $Ultimate##0-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_49| 1) (= v_~x1~0_84 (select (select |v_#memory_int_139| v_~f~0.base_97) (+ v_~f~0.offset_97 (* v_~x1~0_85 4)))) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_49| 4294967295) 4294967296) (mod (* v_~n~0_82 3) 4294967296)) (= (ite (and (<= 0 v_~x1~0_85) (< v_~x1~0_85 v_~size~0_103)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|)) InVars {~size~0=v_~size~0_103, ~f~0.base=v_~f~0.base_97, #memory_int=|v_#memory_int_139|, ~n~0=v_~n~0_82, ~x1~0=v_~x1~0_85, ~f~0.offset=v_~f~0.offset_97} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_27|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|, ~size~0=v_~size~0_103, ~f~0.base=v_~f~0.base_97, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_49|, #memory_int=|v_#memory_int_139|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35|, ~n~0=v_~n~0_82, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_37|, ~x1~0=v_~x1~0_84, ~f~0.offset=v_~f~0.offset_97} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] and [626] L85-3-->L86-3: Formula: (and (= |v_#memory_int_115| (store |v_#memory_int_116| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_116| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre14#1_29|))) (= |v_ULTIMATE.start_main_#t~pre14#1_29| |v_#pthreadsForks_52|) (= |v_#pthreadsForks_51| (+ |v_#pthreadsForks_52| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_52|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #memory_int=|v_#memory_int_116|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_37|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_29|, #pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #memory_int=|v_#memory_int_115|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] [2022-12-13 02:25:47,822 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [679] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_267| v_~f~0.base_177))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_174 (* v_~x1~0_224 4))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_149| 2) (= (select .cse0 (+ v_~f~0.offset_174 (* .cse1 4))) v_~x1~0_222) (< 1 (mod (* 3 v_~n~0_163) 4294967296)) (not (= (ite (and (< v_~x1~0_224 v_~size~0_177) (<= 0 v_~x1~0_224)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_106| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_90|) (= (ite (and (< .cse1 v_~size~0_177) (<= 0 .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_90|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_106| 0))))) InVars {~size~0=v_~size~0_177, ~f~0.base=v_~f~0.base_177, #memory_int=|v_#memory_int_267|, ~n~0=v_~n~0_163, ~x1~0=v_~x1~0_224, ~f~0.offset=v_~f~0.offset_174} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_98|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_90|, ~size~0=v_~size~0_177, ~f~0.base=v_~f~0.base_177, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_149|, #memory_int=|v_#memory_int_267|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_106|, ~n~0=v_~n~0_163, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_108|, ~x1~0=v_~x1~0_222, ~f~0.offset=v_~f~0.offset_174} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] and [626] L85-3-->L86-3: Formula: (and (= |v_#memory_int_115| (store |v_#memory_int_116| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_116| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre14#1_29|))) (= |v_ULTIMATE.start_main_#t~pre14#1_29| |v_#pthreadsForks_52|) (= |v_#pthreadsForks_51| (+ |v_#pthreadsForks_52| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_52|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #memory_int=|v_#memory_int_116|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_37|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_29|, #pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #memory_int=|v_#memory_int_115|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] [2022-12-13 02:25:47,898 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [679] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_267| v_~f~0.base_177))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_174 (* v_~x1~0_224 4))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_149| 2) (= (select .cse0 (+ v_~f~0.offset_174 (* .cse1 4))) v_~x1~0_222) (< 1 (mod (* 3 v_~n~0_163) 4294967296)) (not (= (ite (and (< v_~x1~0_224 v_~size~0_177) (<= 0 v_~x1~0_224)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_106| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_90|) (= (ite (and (< .cse1 v_~size~0_177) (<= 0 .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_90|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_106| 0))))) InVars {~size~0=v_~size~0_177, ~f~0.base=v_~f~0.base_177, #memory_int=|v_#memory_int_267|, ~n~0=v_~n~0_163, ~x1~0=v_~x1~0_224, ~f~0.offset=v_~f~0.offset_174} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_98|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_90|, ~size~0=v_~size~0_177, ~f~0.base=v_~f~0.base_177, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_149|, #memory_int=|v_#memory_int_267|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_106|, ~n~0=v_~n~0_163, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_108|, ~x1~0=v_~x1~0_222, ~f~0.offset=v_~f~0.offset_174} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] and [652] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_145| v_~f~0.base_103))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_103 (* v_~x2~0_157 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse2))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (= (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse1))) v_~x2~0_156) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_109)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_99|) (not (= (ite (and (<= 0 v_~x2~0_157) (< v_~x2~0_157 v_~size~0_109)) 1 0) 0)) (< (mod (+ 4294967293 |v_thread2Thread1of1ForFork1_~i~1#1_99|) 4294967296) (mod (* v_~n~0_90 3) 4294967296)) (not (= 0 (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_109)) 1 0))))))) InVars {~x2~0=v_~x2~0_157, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, #memory_int=|v_#memory_int_145|, ~n~0=v_~n~0_90, ~f~0.offset=v_~f~0.offset_103} OutVars{~x2~0=v_~x2~0_156, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_65|, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_99|, ~f~0.offset=v_~f~0.offset_103, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_29|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_90, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_41|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:25:48,123 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [679] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_267| v_~f~0.base_177))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_174 (* v_~x1~0_224 4))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_149| 2) (= (select .cse0 (+ v_~f~0.offset_174 (* .cse1 4))) v_~x1~0_222) (< 1 (mod (* 3 v_~n~0_163) 4294967296)) (not (= (ite (and (< v_~x1~0_224 v_~size~0_177) (<= 0 v_~x1~0_224)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_106| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_90|) (= (ite (and (< .cse1 v_~size~0_177) (<= 0 .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_90|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_106| 0))))) InVars {~size~0=v_~size~0_177, ~f~0.base=v_~f~0.base_177, #memory_int=|v_#memory_int_267|, ~n~0=v_~n~0_163, ~x1~0=v_~x1~0_224, ~f~0.offset=v_~f~0.offset_174} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_98|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_90|, ~size~0=v_~size~0_177, ~f~0.base=v_~f~0.base_177, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_149|, #memory_int=|v_#memory_int_267|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_106|, ~n~0=v_~n~0_163, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_108|, ~x1~0=v_~x1~0_222, ~f~0.offset=v_~f~0.offset_174} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] and [684] $Ultimate##0-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_275| v_~f~0.base_183))) (let ((.cse4 (select .cse2 (+ v_~f~0.offset_180 (* v_~x2~0_232 4))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_180 (* 4 .cse4))))) (let ((.cse5 (select .cse2 (+ v_~f~0.offset_180 (* .cse1 4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_180 (* .cse5 4))))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_180 (* .cse0 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_183)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_141| 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_183)) 1 0) 0)) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_141| 4294967293) 4294967296) (mod (* 3 v_~n~0_169) 4294967296)) (= v_~x2~0_230 (select .cse2 (+ v_~f~0.offset_180 (* .cse3 4)))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_109| (ite (and (< .cse3 v_~size~0_183) (<= 0 .cse3)) 1 0)) (not (= (ite (and (<= 0 v_~x2~0_232) (< v_~x2~0_232 v_~size~0_183)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_109| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_141|) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_183)) 1 0) 0)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_141|) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_183)) 1 0) 0))))))))) InVars {~x2~0=v_~x2~0_232, ~size~0=v_~size~0_183, ~f~0.base=v_~f~0.base_183, #memory_int=|v_#memory_int_275|, ~n~0=v_~n~0_169, ~f~0.offset=v_~f~0.offset_180} OutVars{~x2~0=v_~x2~0_230, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_101|, ~size~0=v_~size~0_183, ~f~0.base=v_~f~0.base_183, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_73|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_109|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_141|, ~f~0.offset=v_~f~0.offset_180, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_141|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_65|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_63|, #memory_int=|v_#memory_int_275|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_73|, ~n~0=v_~n~0_169, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_77|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:25:48,496 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [679] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_267| v_~f~0.base_177))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_174 (* v_~x1~0_224 4))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_149| 2) (= (select .cse0 (+ v_~f~0.offset_174 (* .cse1 4))) v_~x1~0_222) (< 1 (mod (* 3 v_~n~0_163) 4294967296)) (not (= (ite (and (< v_~x1~0_224 v_~size~0_177) (<= 0 v_~x1~0_224)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_106| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_90|) (= (ite (and (< .cse1 v_~size~0_177) (<= 0 .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_90|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_106| 0))))) InVars {~size~0=v_~size~0_177, ~f~0.base=v_~f~0.base_177, #memory_int=|v_#memory_int_267|, ~n~0=v_~n~0_163, ~x1~0=v_~x1~0_224, ~f~0.offset=v_~f~0.offset_174} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_98|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_90|, ~size~0=v_~size~0_177, ~f~0.base=v_~f~0.base_177, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_149|, #memory_int=|v_#memory_int_267|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_106|, ~n~0=v_~n~0_163, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_108|, ~x1~0=v_~x1~0_222, ~f~0.offset=v_~f~0.offset_174} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] and [685] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_277| v_~f~0.base_185))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_182 (* v_~x2~0_237 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_182 (* .cse2 4))))) (and (= (select .cse0 (+ v_~f~0.offset_182 (* v_~x1~0_233 4))) v_~x1~0_232) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_113| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_145|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_156| 4294967296) (mod (* 3 v_~n~0_171) 4294967296)) (= (select .cse0 (+ v_~f~0.offset_182 (* .cse1 4))) v_~x2~0_236) (= (ite (and (<= 0 v_~x1~0_233) (< v_~x1~0_233 v_~size~0_185)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_96|) (= |v_thread1Thread1of1ForFork0_~i~0#1_155| (+ |v_thread1Thread1of1ForFork0_~i~0#1_156| 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_145| 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_185)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_237 v_~size~0_185) (<= 0 v_~x2~0_237)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_112| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_113| (ite (and (< .cse1 v_~size~0_185) (<= 0 .cse1)) 1 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_145|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_112| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_96|))))) InVars {~x2~0=v_~x2~0_237, ~size~0=v_~size~0_185, ~f~0.base=v_~f~0.base_185, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_156|, #memory_int=|v_#memory_int_277|, ~n~0=v_~n~0_171, ~x1~0=v_~x1~0_233, ~f~0.offset=v_~f~0.offset_182} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_104|, ~x2~0=v_~x2~0_236, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_105|, ~size~0=v_~size~0_185, ~f~0.base=v_~f~0.base_185, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_77|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_113|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_145|, ~x1~0=v_~x1~0_232, ~f~0.offset=v_~f~0.offset_182, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_145|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_96|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_69|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_155|, #memory_int=|v_#memory_int_277|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_112|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_67|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_77|, ~n~0=v_~n~0_171, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_114|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_81|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:25:48,946 INFO L241 LiptonReduction]: Total number of compositions: 9 [2022-12-13 02:25:48,947 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6127 [2022-12-13 02:25:48,947 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 70 transitions, 720 flow [2022-12-13 02:25:48,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:48,947 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:48,947 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:48,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 02:25:49,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:25:49,152 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:25:49,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:49,152 INFO L85 PathProgramCache]: Analyzing trace with hash -722086580, now seen corresponding path program 1 times [2022-12-13 02:25:49,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:49,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298797201] [2022-12-13 02:25:49,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:49,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:49,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:50,305 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 02:25:50,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:50,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298797201] [2022-12-13 02:25:50,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298797201] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:50,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:50,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:50,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389440341] [2022-12-13 02:25:50,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:50,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:50,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:50,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:50,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:50,308 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 02:25:50,308 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 70 transitions, 720 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:50,308 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:50,308 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 02:25:50,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:50,608 INFO L130 PetriNetUnfolder]: 461/814 cut-off events. [2022-12-13 02:25:50,608 INFO L131 PetriNetUnfolder]: For 2573/2573 co-relation queries the response was YES. [2022-12-13 02:25:50,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3544 conditions, 814 events. 461/814 cut-off events. For 2573/2573 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3762 event pairs, 191 based on Foata normal form. 1/775 useless extension candidates. Maximal degree in co-relation 3178. Up to 704 conditions per place. [2022-12-13 02:25:50,614 INFO L137 encePairwiseOnDemand]: 13/37 looper letters, 63 selfloop transitions, 29 changer transitions 4/96 dead transitions. [2022-12-13 02:25:50,614 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 96 transitions, 1071 flow [2022-12-13 02:25:50,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:50,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:50,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-12-13 02:25:50,615 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33513513513513515 [2022-12-13 02:25:50,615 INFO L175 Difference]: Start difference. First operand has 52 places, 70 transitions, 720 flow. Second operand 5 states and 62 transitions. [2022-12-13 02:25:50,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 96 transitions, 1071 flow [2022-12-13 02:25:50,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 96 transitions, 957 flow, removed 57 selfloop flow, removed 1 redundant places. [2022-12-13 02:25:50,625 INFO L231 Difference]: Finished difference. Result has 57 places, 78 transitions, 780 flow [2022-12-13 02:25:50,625 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=780, PETRI_PLACES=57, PETRI_TRANSITIONS=78} [2022-12-13 02:25:50,626 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 36 predicate places. [2022-12-13 02:25:50,626 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:50,626 INFO L89 Accepts]: Start accepts. Operand has 57 places, 78 transitions, 780 flow [2022-12-13 02:25:50,627 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:50,627 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:50,627 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 78 transitions, 780 flow [2022-12-13 02:25:50,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 78 transitions, 780 flow [2022-12-13 02:25:50,654 INFO L130 PetriNetUnfolder]: 65/218 cut-off events. [2022-12-13 02:25:50,654 INFO L131 PetriNetUnfolder]: For 457/478 co-relation queries the response was YES. [2022-12-13 02:25:50,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 855 conditions, 218 events. 65/218 cut-off events. For 457/478 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1113 event pairs, 2 based on Foata normal form. 1/206 useless extension candidates. Maximal degree in co-relation 828. Up to 73 conditions per place. [2022-12-13 02:25:50,656 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 78 transitions, 780 flow [2022-12-13 02:25:50,656 INFO L226 LiptonReduction]: Number of co-enabled transitions 286 [2022-12-13 02:25:50,856 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:50,857 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 231 [2022-12-13 02:25:50,857 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 78 transitions, 784 flow [2022-12-13 02:25:50,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:50,857 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:50,857 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:50,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 02:25:50,858 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:25:50,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:50,858 INFO L85 PathProgramCache]: Analyzing trace with hash 245427857, now seen corresponding path program 1 times [2022-12-13 02:25:50,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:50,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059262949] [2022-12-13 02:25:50,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:50,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:50,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:51,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:51,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:51,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059262949] [2022-12-13 02:25:51,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059262949] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:25:51,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330409617] [2022-12-13 02:25:51,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:51,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:25:51,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:25:51,792 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:25:51,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 02:25:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:51,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-13 02:25:51,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:25:51,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:25:51,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2022-12-13 02:25:51,944 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:25:51,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 45 [2022-12-13 02:25:51,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:51,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:25:52,078 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:25:52,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 104 treesize of output 228 [2022-12-13 02:25:52,129 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:25:52,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 100 [2022-12-13 02:25:52,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:52,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330409617] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:25:52,853 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:25:52,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-13 02:25:52,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747371346] [2022-12-13 02:25:52,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:25:52,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 02:25:52,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:52,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 02:25:52,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-13 02:25:52,855 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 02:25:52,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 78 transitions, 784 flow. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:52,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:52,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 02:25:52,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:53,523 INFO L130 PetriNetUnfolder]: 629/1107 cut-off events. [2022-12-13 02:25:53,524 INFO L131 PetriNetUnfolder]: For 3589/3589 co-relation queries the response was YES. [2022-12-13 02:25:53,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4912 conditions, 1107 events. 629/1107 cut-off events. For 3589/3589 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 5600 event pairs, 176 based on Foata normal form. 2/1074 useless extension candidates. Maximal degree in co-relation 4724. Up to 729 conditions per place. [2022-12-13 02:25:53,533 INFO L137 encePairwiseOnDemand]: 11/36 looper letters, 85 selfloop transitions, 59 changer transitions 2/146 dead transitions. [2022-12-13 02:25:53,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 146 transitions, 1516 flow [2022-12-13 02:25:53,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 02:25:53,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 02:25:53,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 98 transitions. [2022-12-13 02:25:53,534 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2722222222222222 [2022-12-13 02:25:53,534 INFO L175 Difference]: Start difference. First operand has 54 places, 78 transitions, 784 flow. Second operand 10 states and 98 transitions. [2022-12-13 02:25:53,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 146 transitions, 1516 flow [2022-12-13 02:25:53,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 146 transitions, 1484 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-13 02:25:53,544 INFO L231 Difference]: Finished difference. Result has 64 places, 105 transitions, 1224 flow [2022-12-13 02:25:53,544 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1224, PETRI_PLACES=64, PETRI_TRANSITIONS=105} [2022-12-13 02:25:53,545 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 43 predicate places. [2022-12-13 02:25:53,545 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:53,545 INFO L89 Accepts]: Start accepts. Operand has 64 places, 105 transitions, 1224 flow [2022-12-13 02:25:53,546 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:53,546 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:53,547 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 105 transitions, 1224 flow [2022-12-13 02:25:53,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 105 transitions, 1224 flow [2022-12-13 02:25:53,593 INFO L130 PetriNetUnfolder]: 86/294 cut-off events. [2022-12-13 02:25:53,593 INFO L131 PetriNetUnfolder]: For 837/886 co-relation queries the response was YES. [2022-12-13 02:25:53,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1317 conditions, 294 events. 86/294 cut-off events. For 837/886 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1732 event pairs, 1 based on Foata normal form. 1/284 useless extension candidates. Maximal degree in co-relation 1116. Up to 111 conditions per place. [2022-12-13 02:25:53,596 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 105 transitions, 1224 flow [2022-12-13 02:25:53,596 INFO L226 LiptonReduction]: Number of co-enabled transitions 416 [2022-12-13 02:25:53,597 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:25:53,598 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-13 02:25:53,598 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 105 transitions, 1224 flow [2022-12-13 02:25:53,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:53,598 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:53,598 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:53,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 02:25:53,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 02:25:53,803 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:25:53,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:53,804 INFO L85 PathProgramCache]: Analyzing trace with hash -641387875, now seen corresponding path program 1 times [2022-12-13 02:25:53,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:53,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142283620] [2022-12-13 02:25:53,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:53,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:53,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:53,863 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 02:25:53,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:53,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142283620] [2022-12-13 02:25:53,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142283620] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:53,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:53,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:53,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430147045] [2022-12-13 02:25:53,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:53,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:25:53,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:53,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:25:53,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:25:53,866 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 02:25:53,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 105 transitions, 1224 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:53,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:53,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 02:25:53,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:54,142 INFO L130 PetriNetUnfolder]: 749/1320 cut-off events. [2022-12-13 02:25:54,142 INFO L131 PetriNetUnfolder]: For 5753/5753 co-relation queries the response was YES. [2022-12-13 02:25:54,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6502 conditions, 1320 events. 749/1320 cut-off events. For 5753/5753 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 6967 event pairs, 310 based on Foata normal form. 12/1308 useless extension candidates. Maximal degree in co-relation 5655. Up to 876 conditions per place. [2022-12-13 02:25:54,153 INFO L137 encePairwiseOnDemand]: 27/36 looper letters, 126 selfloop transitions, 12 changer transitions 0/138 dead transitions. [2022-12-13 02:25:54,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 138 transitions, 1836 flow [2022-12-13 02:25:54,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:25:54,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:25:54,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-12-13 02:25:54,154 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2022-12-13 02:25:54,154 INFO L175 Difference]: Start difference. First operand has 64 places, 105 transitions, 1224 flow. Second operand 4 states and 56 transitions. [2022-12-13 02:25:54,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 138 transitions, 1836 flow [2022-12-13 02:25:54,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 138 transitions, 1710 flow, removed 57 selfloop flow, removed 2 redundant places. [2022-12-13 02:25:54,171 INFO L231 Difference]: Finished difference. Result has 67 places, 110 transitions, 1223 flow [2022-12-13 02:25:54,171 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1128, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1223, PETRI_PLACES=67, PETRI_TRANSITIONS=110} [2022-12-13 02:25:54,172 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 46 predicate places. [2022-12-13 02:25:54,172 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:54,172 INFO L89 Accepts]: Start accepts. Operand has 67 places, 110 transitions, 1223 flow [2022-12-13 02:25:54,173 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:54,173 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:54,174 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 110 transitions, 1223 flow [2022-12-13 02:25:54,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 110 transitions, 1223 flow [2022-12-13 02:25:54,212 INFO L130 PetriNetUnfolder]: 99/346 cut-off events. [2022-12-13 02:25:54,213 INFO L131 PetriNetUnfolder]: For 1126/1200 co-relation queries the response was YES. [2022-12-13 02:25:54,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1551 conditions, 346 events. 99/346 cut-off events. For 1126/1200 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2196 event pairs, 1 based on Foata normal form. 3/342 useless extension candidates. Maximal degree in co-relation 1406. Up to 118 conditions per place. [2022-12-13 02:25:54,216 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 110 transitions, 1223 flow [2022-12-13 02:25:54,216 INFO L226 LiptonReduction]: Number of co-enabled transitions 450 [2022-12-13 02:25:54,216 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:25:54,217 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-13 02:25:54,217 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 110 transitions, 1223 flow [2022-12-13 02:25:54,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:54,217 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:54,217 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:54,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 02:25:54,218 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:25:54,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:54,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1398935321, now seen corresponding path program 1 times [2022-12-13 02:25:54,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:54,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229610481] [2022-12-13 02:25:54,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:54,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:54,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:54,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:54,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:54,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229610481] [2022-12-13 02:25:54,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229610481] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:25:54,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946898462] [2022-12-13 02:25:54,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:54,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:25:54,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:25:54,292 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:25:54,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 02:25:54,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:54,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 02:25:54,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:25:54,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:54,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:25:54,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:54,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946898462] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:25:54,460 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:25:54,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-13 02:25:54,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082456766] [2022-12-13 02:25:54,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:25:54,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 02:25:54,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:54,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 02:25:54,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 02:25:54,462 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 02:25:54,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 110 transitions, 1223 flow. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:54,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:54,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 02:25:54,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:54,744 INFO L130 PetriNetUnfolder]: 779/1370 cut-off events. [2022-12-13 02:25:54,744 INFO L131 PetriNetUnfolder]: For 6159/6159 co-relation queries the response was YES. [2022-12-13 02:25:54,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6943 conditions, 1370 events. 779/1370 cut-off events. For 6159/6159 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 7232 event pairs, 380 based on Foata normal form. 16/1384 useless extension candidates. Maximal degree in co-relation 6086. Up to 1313 conditions per place. [2022-12-13 02:25:54,755 INFO L137 encePairwiseOnDemand]: 32/36 looper letters, 115 selfloop transitions, 8 changer transitions 0/123 dead transitions. [2022-12-13 02:25:54,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 123 transitions, 1600 flow [2022-12-13 02:25:54,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:25:54,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:25:54,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-12-13 02:25:54,756 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3125 [2022-12-13 02:25:54,756 INFO L175 Difference]: Start difference. First operand has 67 places, 110 transitions, 1223 flow. Second operand 4 states and 45 transitions. [2022-12-13 02:25:54,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 123 transitions, 1600 flow [2022-12-13 02:25:54,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 123 transitions, 1585 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-13 02:25:54,775 INFO L231 Difference]: Finished difference. Result has 71 places, 115 transitions, 1319 flow [2022-12-13 02:25:54,775 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1208, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1319, PETRI_PLACES=71, PETRI_TRANSITIONS=115} [2022-12-13 02:25:54,776 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 50 predicate places. [2022-12-13 02:25:54,776 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:54,776 INFO L89 Accepts]: Start accepts. Operand has 71 places, 115 transitions, 1319 flow [2022-12-13 02:25:54,776 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:54,776 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:54,777 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 115 transitions, 1319 flow [2022-12-13 02:25:54,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 115 transitions, 1319 flow [2022-12-13 02:25:54,816 INFO L130 PetriNetUnfolder]: 104/355 cut-off events. [2022-12-13 02:25:54,816 INFO L131 PetriNetUnfolder]: For 1310/1394 co-relation queries the response was YES. [2022-12-13 02:25:54,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1680 conditions, 355 events. 104/355 cut-off events. For 1310/1394 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2243 event pairs, 1 based on Foata normal form. 3/351 useless extension candidates. Maximal degree in co-relation 1507. Up to 128 conditions per place. [2022-12-13 02:25:54,820 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 115 transitions, 1319 flow [2022-12-13 02:25:54,820 INFO L226 LiptonReduction]: Number of co-enabled transitions 470 [2022-12-13 02:25:54,821 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:25:54,821 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-13 02:25:54,822 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 115 transitions, 1319 flow [2022-12-13 02:25:54,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:54,822 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:54,822 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:54,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 02:25:55,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 02:25:55,027 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:25:55,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:55,027 INFO L85 PathProgramCache]: Analyzing trace with hash 2000683110, now seen corresponding path program 2 times [2022-12-13 02:25:55,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:55,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652329777] [2022-12-13 02:25:55,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:55,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:55,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:56,321 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 02:25:56,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:56,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652329777] [2022-12-13 02:25:56,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652329777] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:56,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:56,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:56,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751848639] [2022-12-13 02:25:56,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:56,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:25:56,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:56,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:25:56,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:25:56,323 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 02:25:56,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 115 transitions, 1319 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:56,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:56,323 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 02:25:56,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:56,693 INFO L130 PetriNetUnfolder]: 805/1417 cut-off events. [2022-12-13 02:25:56,693 INFO L131 PetriNetUnfolder]: For 7287/7287 co-relation queries the response was YES. [2022-12-13 02:25:56,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7429 conditions, 1417 events. 805/1417 cut-off events. For 7287/7287 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 7575 event pairs, 228 based on Foata normal form. 1/1416 useless extension candidates. Maximal degree in co-relation 6737. Up to 1271 conditions per place. [2022-12-13 02:25:56,704 INFO L137 encePairwiseOnDemand]: 14/36 looper letters, 100 selfloop transitions, 33 changer transitions 1/134 dead transitions. [2022-12-13 02:25:56,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 134 transitions, 1706 flow [2022-12-13 02:25:56,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:56,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:56,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-12-13 02:25:56,705 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-13 02:25:56,705 INFO L175 Difference]: Start difference. First operand has 71 places, 115 transitions, 1319 flow. Second operand 5 states and 60 transitions. [2022-12-13 02:25:56,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 134 transitions, 1706 flow [2022-12-13 02:25:56,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 134 transitions, 1663 flow, removed 19 selfloop flow, removed 1 redundant places. [2022-12-13 02:25:56,728 INFO L231 Difference]: Finished difference. Result has 76 places, 119 transitions, 1440 flow [2022-12-13 02:25:56,728 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1276, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1440, PETRI_PLACES=76, PETRI_TRANSITIONS=119} [2022-12-13 02:25:56,729 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 55 predicate places. [2022-12-13 02:25:56,729 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:56,729 INFO L89 Accepts]: Start accepts. Operand has 76 places, 119 transitions, 1440 flow [2022-12-13 02:25:56,731 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:56,731 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:56,731 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 119 transitions, 1440 flow [2022-12-13 02:25:56,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 119 transitions, 1440 flow [2022-12-13 02:25:56,772 INFO L130 PetriNetUnfolder]: 106/366 cut-off events. [2022-12-13 02:25:56,772 INFO L131 PetriNetUnfolder]: For 1618/1710 co-relation queries the response was YES. [2022-12-13 02:25:56,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1817 conditions, 366 events. 106/366 cut-off events. For 1618/1710 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2354 event pairs, 1 based on Foata normal form. 3/361 useless extension candidates. Maximal degree in co-relation 1606. Up to 132 conditions per place. [2022-12-13 02:25:56,777 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 119 transitions, 1440 flow [2022-12-13 02:25:56,777 INFO L226 LiptonReduction]: Number of co-enabled transitions 494 [2022-12-13 02:25:56,778 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:25:56,778 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-13 02:25:56,779 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 119 transitions, 1440 flow [2022-12-13 02:25:56,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:56,779 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:56,779 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:56,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 02:25:56,779 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:25:56,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:56,779 INFO L85 PathProgramCache]: Analyzing trace with hash -935410247, now seen corresponding path program 1 times [2022-12-13 02:25:56,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:56,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123946046] [2022-12-13 02:25:56,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:56,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:56,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:56,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:56,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:56,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123946046] [2022-12-13 02:25:56,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123946046] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:56,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:56,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:56,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965636897] [2022-12-13 02:25:56,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:56,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:25:56,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:56,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:25:56,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:25:56,852 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 02:25:56,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 119 transitions, 1440 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:56,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:56,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 02:25:56,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:57,186 INFO L130 PetriNetUnfolder]: 881/1563 cut-off events. [2022-12-13 02:25:57,187 INFO L131 PetriNetUnfolder]: For 9242/9242 co-relation queries the response was YES. [2022-12-13 02:25:57,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8223 conditions, 1563 events. 881/1563 cut-off events. For 9242/9242 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 8458 event pairs, 208 based on Foata normal form. 16/1577 useless extension candidates. Maximal degree in co-relation 7412. Up to 801 conditions per place. [2022-12-13 02:25:57,199 INFO L137 encePairwiseOnDemand]: 28/36 looper letters, 156 selfloop transitions, 21 changer transitions 0/177 dead transitions. [2022-12-13 02:25:57,200 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 177 transitions, 2312 flow [2022-12-13 02:25:57,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:25:57,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:25:57,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-12-13 02:25:57,202 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34444444444444444 [2022-12-13 02:25:57,202 INFO L175 Difference]: Start difference. First operand has 76 places, 119 transitions, 1440 flow. Second operand 5 states and 62 transitions. [2022-12-13 02:25:57,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 177 transitions, 2312 flow [2022-12-13 02:25:57,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 177 transitions, 2282 flow, removed 10 selfloop flow, removed 1 redundant places. [2022-12-13 02:25:57,229 INFO L231 Difference]: Finished difference. Result has 81 places, 137 transitions, 1696 flow [2022-12-13 02:25:57,229 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1418, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1696, PETRI_PLACES=81, PETRI_TRANSITIONS=137} [2022-12-13 02:25:57,229 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 60 predicate places. [2022-12-13 02:25:57,229 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:57,229 INFO L89 Accepts]: Start accepts. Operand has 81 places, 137 transitions, 1696 flow [2022-12-13 02:25:57,230 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:57,230 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:57,231 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 137 transitions, 1696 flow [2022-12-13 02:25:57,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 137 transitions, 1696 flow [2022-12-13 02:25:57,287 INFO L130 PetriNetUnfolder]: 136/451 cut-off events. [2022-12-13 02:25:57,288 INFO L131 PetriNetUnfolder]: For 2424/2517 co-relation queries the response was YES. [2022-12-13 02:25:57,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2389 conditions, 451 events. 136/451 cut-off events. For 2424/2517 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2940 event pairs, 0 based on Foata normal form. 3/444 useless extension candidates. Maximal degree in co-relation 2206. Up to 150 conditions per place. [2022-12-13 02:25:57,293 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 137 transitions, 1696 flow [2022-12-13 02:25:57,293 INFO L226 LiptonReduction]: Number of co-enabled transitions 532 [2022-12-13 02:25:57,299 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:25:57,523 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:57,524 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 295 [2022-12-13 02:25:57,524 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 138 transitions, 1714 flow [2022-12-13 02:25:57,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:57,524 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:57,524 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:57,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 02:25:57,525 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:25:57,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:57,525 INFO L85 PathProgramCache]: Analyzing trace with hash 323677751, now seen corresponding path program 1 times [2022-12-13 02:25:57,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:57,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564343407] [2022-12-13 02:25:57,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:57,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:57,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:57,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:57,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:57,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564343407] [2022-12-13 02:25:57,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564343407] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:25:57,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305578226] [2022-12-13 02:25:57,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:57,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:25:57,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:25:57,592 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:25:57,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 02:25:57,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:57,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 02:25:57,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:25:57,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:57,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:25:57,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:57,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305578226] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:25:57,733 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:25:57,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-13 02:25:57,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137023811] [2022-12-13 02:25:57,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:25:57,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 02:25:57,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:57,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 02:25:57,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 02:25:57,734 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 02:25:57,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 138 transitions, 1714 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:57,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:57,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 02:25:57,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:58,241 INFO L130 PetriNetUnfolder]: 959/1741 cut-off events. [2022-12-13 02:25:58,242 INFO L131 PetriNetUnfolder]: For 12580/12580 co-relation queries the response was YES. [2022-12-13 02:25:58,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9975 conditions, 1741 events. 959/1741 cut-off events. For 12580/12580 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 9956 event pairs, 371 based on Foata normal form. 20/1759 useless extension candidates. Maximal degree in co-relation 9012. Up to 1484 conditions per place. [2022-12-13 02:25:58,261 INFO L137 encePairwiseOnDemand]: 25/37 looper letters, 137 selfloop transitions, 52 changer transitions 4/193 dead transitions. [2022-12-13 02:25:58,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 193 transitions, 2580 flow [2022-12-13 02:25:58,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 02:25:58,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 02:25:58,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 84 transitions. [2022-12-13 02:25:58,264 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22702702702702704 [2022-12-13 02:25:58,264 INFO L175 Difference]: Start difference. First operand has 82 places, 138 transitions, 1714 flow. Second operand 10 states and 84 transitions. [2022-12-13 02:25:58,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 193 transitions, 2580 flow [2022-12-13 02:25:58,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 193 transitions, 2528 flow, removed 26 selfloop flow, removed 0 redundant places. [2022-12-13 02:25:58,299 INFO L231 Difference]: Finished difference. Result has 97 places, 162 transitions, 2159 flow [2022-12-13 02:25:58,300 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1674, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2159, PETRI_PLACES=97, PETRI_TRANSITIONS=162} [2022-12-13 02:25:58,300 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 76 predicate places. [2022-12-13 02:25:58,300 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:58,300 INFO L89 Accepts]: Start accepts. Operand has 97 places, 162 transitions, 2159 flow [2022-12-13 02:25:58,301 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:58,301 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:58,301 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 162 transitions, 2159 flow [2022-12-13 02:25:58,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 162 transitions, 2159 flow [2022-12-13 02:25:58,372 INFO L130 PetriNetUnfolder]: 187/598 cut-off events. [2022-12-13 02:25:58,373 INFO L131 PetriNetUnfolder]: For 5127/5238 co-relation queries the response was YES. [2022-12-13 02:25:58,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3588 conditions, 598 events. 187/598 cut-off events. For 5127/5238 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4203 event pairs, 20 based on Foata normal form. 4/578 useless extension candidates. Maximal degree in co-relation 3330. Up to 184 conditions per place. [2022-12-13 02:25:58,380 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 162 transitions, 2159 flow [2022-12-13 02:25:58,380 INFO L226 LiptonReduction]: Number of co-enabled transitions 580 [2022-12-13 02:25:58,388 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:25:58,501 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:25:58,599 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:25:58,685 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:25:58,770 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:25:58,873 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:25:58,959 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:25:59,045 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:25:59,132 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:25:59,226 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:25:59,312 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 02:25:59,313 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1013 [2022-12-13 02:25:59,313 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 162 transitions, 2230 flow [2022-12-13 02:25:59,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:59,313 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:59,313 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:59,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 02:25:59,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:25:59,513 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:25:59,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:59,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1217588901, now seen corresponding path program 2 times [2022-12-13 02:25:59,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:59,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834130850] [2022-12-13 02:25:59,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:59,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:59,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:59,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:59,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834130850] [2022-12-13 02:25:59,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834130850] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:25:59,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288613935] [2022-12-13 02:25:59,589 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 02:25:59,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:25:59,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:25:59,591 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:25:59,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 02:25:59,724 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 02:25:59,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 02:25:59,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 02:25:59,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:25:59,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:59,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:25:59,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:59,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288613935] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:25:59,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:25:59,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-13 02:25:59,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235466704] [2022-12-13 02:25:59,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:25:59,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 02:25:59,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:59,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 02:25:59,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 02:25:59,783 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 02:25:59,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 162 transitions, 2230 flow. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:59,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:59,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 02:25:59,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:00,311 INFO L130 PetriNetUnfolder]: 923/1657 cut-off events. [2022-12-13 02:26:00,311 INFO L131 PetriNetUnfolder]: For 17621/17621 co-relation queries the response was YES. [2022-12-13 02:26:00,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11039 conditions, 1657 events. 923/1657 cut-off events. For 17621/17621 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 9194 event pairs, 413 based on Foata normal form. 36/1691 useless extension candidates. Maximal degree in co-relation 9970. Up to 1564 conditions per place. [2022-12-13 02:26:00,325 INFO L137 encePairwiseOnDemand]: 39/47 looper letters, 148 selfloop transitions, 21 changer transitions 5/174 dead transitions. [2022-12-13 02:26:00,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 174 transitions, 2675 flow [2022-12-13 02:26:00,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:26:00,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:26:00,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-12-13 02:26:00,327 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3404255319148936 [2022-12-13 02:26:00,327 INFO L175 Difference]: Start difference. First operand has 97 places, 162 transitions, 2230 flow. Second operand 4 states and 64 transitions. [2022-12-13 02:26:00,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 174 transitions, 2675 flow [2022-12-13 02:26:00,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 174 transitions, 2595 flow, removed 40 selfloop flow, removed 0 redundant places. [2022-12-13 02:26:00,385 INFO L231 Difference]: Finished difference. Result has 101 places, 159 transitions, 2188 flow [2022-12-13 02:26:00,385 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2150, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2188, PETRI_PLACES=101, PETRI_TRANSITIONS=159} [2022-12-13 02:26:00,385 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 80 predicate places. [2022-12-13 02:26:00,385 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:00,386 INFO L89 Accepts]: Start accepts. Operand has 101 places, 159 transitions, 2188 flow [2022-12-13 02:26:00,387 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:00,387 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:00,387 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 159 transitions, 2188 flow [2022-12-13 02:26:00,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 159 transitions, 2188 flow [2022-12-13 02:26:00,455 INFO L130 PetriNetUnfolder]: 179/555 cut-off events. [2022-12-13 02:26:00,455 INFO L131 PetriNetUnfolder]: For 5362/5483 co-relation queries the response was YES. [2022-12-13 02:26:00,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3541 conditions, 555 events. 179/555 cut-off events. For 5362/5483 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3773 event pairs, 20 based on Foata normal form. 4/536 useless extension candidates. Maximal degree in co-relation 3275. Up to 180 conditions per place. [2022-12-13 02:26:00,461 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 159 transitions, 2188 flow [2022-12-13 02:26:00,462 INFO L226 LiptonReduction]: Number of co-enabled transitions 574 [2022-12-13 02:26:00,488 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [631] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_5) 4294967296)))) InVars {~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:26:00,653 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [631] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_5) 4294967296)))) InVars {~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:26:00,791 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [631] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_5) 4294967296)))) InVars {~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:26:00,920 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [631] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_5) 4294967296)))) InVars {~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [682] L59-2-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_273| v_~f~0.base_181))) (let ((.cse6 (select .cse1 (+ v_~f~0.offset_178 (* v_~x2~0_226 4))))) (let ((.cse5 (select .cse1 (+ v_~f~0.offset_178 (* .cse6 4))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_178 (* .cse5 4))))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_178 (* 4 .cse0))))) (let ((.cse4 (mod (* 3 v_~n~0_167) 4294967296)) (.cse2 (select .cse1 (+ v_~f~0.offset_178 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_181)) 1 0) 0)) (= v_~x2~0_224 (select .cse1 (+ (* .cse2 4) v_~f~0.offset_178))) (not (= 0 (ite (and (< .cse3 v_~size~0_181) (<= 0 .cse3)) 1 0))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_137| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_105| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_137|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_137| 4294967296) .cse4) (not (= (ite (and (< .cse5 v_~size~0_181) (<= 0 .cse5)) 1 0) 0)) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_135| 4294967293) 4294967296) .cse4) (not (= (ite (and (< .cse6 v_~size~0_181) (<= 0 .cse6)) 1 0) 0)) (= (+ 6 |v_thread2Thread1of1ForFork1_~i~1#1_137|) |v_thread2Thread1of1ForFork1_~i~1#1_135|) (not (= (ite (and (<= 0 v_~x2~0_226) (< v_~x2~0_226 v_~size~0_181)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_105| (ite (and (< .cse2 v_~size~0_181) (<= 0 .cse2)) 1 0))))))))) InVars {~x2~0=v_~x2~0_226, ~size~0=v_~size~0_181, ~f~0.base=v_~f~0.base_181, #memory_int=|v_#memory_int_273|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_137|, ~n~0=v_~n~0_167, ~f~0.offset=v_~f~0.offset_178} OutVars{~x2~0=v_~x2~0_224, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_97|, ~size~0=v_~size~0_181, ~f~0.base=v_~f~0.base_181, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_69|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_105|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_135|, ~f~0.offset=v_~f~0.offset_178, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_137|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_61|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_59|, #memory_int=|v_#memory_int_273|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_69|, ~n~0=v_~n~0_167, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_73|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:26:01,233 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [631] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_5) 4294967296)))) InVars {~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:26:01,369 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [631] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_5) 4294967296)))) InVars {~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [669] L59-2-->L59-2: Formula: (let ((.cse5 (select |v_#memory_int_251| v_~f~0.base_163))) (let ((.cse4 (select .cse5 (+ v_~f~0.offset_160 (* v_~x2~0_204 4))))) (let ((.cse3 (select .cse5 (+ v_~f~0.offset_160 (* .cse4 4))))) (let ((.cse0 (select .cse5 (+ v_~f~0.offset_160 (* 4 .cse3))))) (let ((.cse6 (select .cse5 (+ v_~f~0.offset_160 (* .cse0 4))))) (let ((.cse1 (mod (* 3 v_~n~0_149) 4294967296)) (.cse2 (select .cse5 (+ v_~f~0.offset_160 (* .cse6 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_163) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_123| 4294967296) .cse1) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_163)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (< v_~x2~0_204 v_~size~0_163) (<= 0 v_~x2~0_204)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_163)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_163)) 1 0) 0)) (< (mod (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_123|) 4294967296) .cse1) (= |v_thread2Thread1of1ForFork1_~i~1#1_121| (+ 6 |v_thread2Thread1of1ForFork1_~i~1#1_123|)) (= v_~x2~0_202 (select .cse5 (+ v_~f~0.offset_160 (* 4 .cse2)))) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_163)) 1 0) 0))))))))) InVars {~x2~0=v_~x2~0_204, ~size~0=v_~size~0_163, ~f~0.base=v_~f~0.base_163, #memory_int=|v_#memory_int_251|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_123|, ~n~0=v_~n~0_149, ~f~0.offset=v_~f~0.offset_160} OutVars{~x2~0=v_~x2~0_202, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_85|, ~size~0=v_~size~0_163, ~f~0.base=v_~f~0.base_163, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_57|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_121|, ~f~0.offset=v_~f~0.offset_160, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_49|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_47|, #memory_int=|v_#memory_int_251|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_57|, ~n~0=v_~n~0_149, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_61|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:26:01,698 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [631] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_5) 4294967296)))) InVars {~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:26:01,840 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [631] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_5) 4294967296)))) InVars {~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:26:01,993 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 02:26:01,995 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1610 [2022-12-13 02:26:01,995 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 159 transitions, 2300 flow [2022-12-13 02:26:01,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:26:01,996 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:01,997 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:02,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-13 02:26:02,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-12-13 02:26:02,202 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:02,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:02,202 INFO L85 PathProgramCache]: Analyzing trace with hash 2100115512, now seen corresponding path program 1 times [2022-12-13 02:26:02,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:02,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472714376] [2022-12-13 02:26:02,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:02,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:02,255 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 02:26:02,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:02,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472714376] [2022-12-13 02:26:02,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472714376] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:02,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:02,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:02,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006348609] [2022-12-13 02:26:02,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:02,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 02:26:02,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:02,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 02:26:02,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 02:26:02,256 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-13 02:26:02,257 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 159 transitions, 2300 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:26:02,257 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:02,257 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-13 02:26:02,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:02,581 INFO L130 PetriNetUnfolder]: 858/1540 cut-off events. [2022-12-13 02:26:02,581 INFO L131 PetriNetUnfolder]: For 17594/17594 co-relation queries the response was YES. [2022-12-13 02:26:02,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10590 conditions, 1540 events. 858/1540 cut-off events. For 17594/17594 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 8373 event pairs, 368 based on Foata normal form. 6/1544 useless extension candidates. Maximal degree in co-relation 9575. Up to 1479 conditions per place. [2022-12-13 02:26:02,592 INFO L137 encePairwiseOnDemand]: 42/55 looper letters, 134 selfloop transitions, 22 changer transitions 6/162 dead transitions. [2022-12-13 02:26:02,593 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 162 transitions, 2553 flow [2022-12-13 02:26:02,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 02:26:02,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 02:26:02,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2022-12-13 02:26:02,594 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3878787878787879 [2022-12-13 02:26:02,594 INFO L175 Difference]: Start difference. First operand has 101 places, 159 transitions, 2300 flow. Second operand 3 states and 64 transitions. [2022-12-13 02:26:02,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 162 transitions, 2553 flow [2022-12-13 02:26:02,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 162 transitions, 2492 flow, removed 19 selfloop flow, removed 2 redundant places. [2022-12-13 02:26:02,646 INFO L231 Difference]: Finished difference. Result has 101 places, 154 transitions, 2148 flow [2022-12-13 02:26:02,646 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=2130, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2148, PETRI_PLACES=101, PETRI_TRANSITIONS=154} [2022-12-13 02:26:02,646 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 80 predicate places. [2022-12-13 02:26:02,647 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:02,647 INFO L89 Accepts]: Start accepts. Operand has 101 places, 154 transitions, 2148 flow [2022-12-13 02:26:02,648 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:02,648 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:02,648 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 154 transitions, 2148 flow [2022-12-13 02:26:02,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 154 transitions, 2148 flow [2022-12-13 02:26:02,705 INFO L130 PetriNetUnfolder]: 175/517 cut-off events. [2022-12-13 02:26:02,706 INFO L131 PetriNetUnfolder]: For 5213/5333 co-relation queries the response was YES. [2022-12-13 02:26:02,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3347 conditions, 517 events. 175/517 cut-off events. For 5213/5333 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3322 event pairs, 20 based on Foata normal form. 3/500 useless extension candidates. Maximal degree in co-relation 3084. Up to 175 conditions per place. [2022-12-13 02:26:02,709 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 154 transitions, 2148 flow [2022-12-13 02:26:02,709 INFO L226 LiptonReduction]: Number of co-enabled transitions 520 [2022-12-13 02:26:02,710 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:26:02,711 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 64 [2022-12-13 02:26:02,711 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 154 transitions, 2148 flow [2022-12-13 02:26:02,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:26:02,711 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:02,711 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:02,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 02:26:02,711 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:02,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:02,712 INFO L85 PathProgramCache]: Analyzing trace with hash -2120391997, now seen corresponding path program 2 times [2022-12-13 02:26:02,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:02,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979509697] [2022-12-13 02:26:02,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:02,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:02,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:03,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:26:03,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:03,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979509697] [2022-12-13 02:26:03,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979509697] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:26:03,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67648212] [2022-12-13 02:26:03,829 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 02:26:03,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:26:03,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:26:03,831 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:26:03,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 02:26:03,931 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 02:26:03,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 02:26:03,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-13 02:26:03,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:26:03,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:26:03,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-13 02:26:03,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 02:26:03,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:26:03,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2022-12-13 02:26:04,047 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:26:04,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 47 [2022-12-13 02:26:04,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:26:04,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:26:04,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:26:04,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67648212] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:26:04,150 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:26:04,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-13 02:26:04,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951160316] [2022-12-13 02:26:04,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:26:04,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 02:26:04,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:04,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 02:26:04,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-12-13 02:26:04,151 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-13 02:26:04,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 154 transitions, 2148 flow. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:26:04,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:04,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-13 02:26:04,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:06,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 02:26:08,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 02:26:09,352 INFO L130 PetriNetUnfolder]: 1017/1778 cut-off events. [2022-12-13 02:26:09,352 INFO L131 PetriNetUnfolder]: For 20292/20292 co-relation queries the response was YES. [2022-12-13 02:26:09,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12548 conditions, 1778 events. 1017/1778 cut-off events. For 20292/20292 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 9716 event pairs, 219 based on Foata normal form. 3/1779 useless extension candidates. Maximal degree in co-relation 11292. Up to 1469 conditions per place. [2022-12-13 02:26:09,366 INFO L137 encePairwiseOnDemand]: 23/52 looper letters, 149 selfloop transitions, 78 changer transitions 2/229 dead transitions. [2022-12-13 02:26:09,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 229 transitions, 3432 flow [2022-12-13 02:26:09,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 02:26:09,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 02:26:09,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 123 transitions. [2022-12-13 02:26:09,368 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1819526627218935 [2022-12-13 02:26:09,368 INFO L175 Difference]: Start difference. First operand has 99 places, 154 transitions, 2148 flow. Second operand 13 states and 123 transitions. [2022-12-13 02:26:09,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 229 transitions, 3432 flow [2022-12-13 02:26:09,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 229 transitions, 3251 flow, removed 51 selfloop flow, removed 6 redundant places. [2022-12-13 02:26:09,431 INFO L231 Difference]: Finished difference. Result has 112 places, 193 transitions, 2901 flow [2022-12-13 02:26:09,431 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2017, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2901, PETRI_PLACES=112, PETRI_TRANSITIONS=193} [2022-12-13 02:26:09,432 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 91 predicate places. [2022-12-13 02:26:09,432 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:09,432 INFO L89 Accepts]: Start accepts. Operand has 112 places, 193 transitions, 2901 flow [2022-12-13 02:26:09,433 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:09,433 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:09,433 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 193 transitions, 2901 flow [2022-12-13 02:26:09,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 193 transitions, 2901 flow [2022-12-13 02:26:09,517 INFO L130 PetriNetUnfolder]: 225/639 cut-off events. [2022-12-13 02:26:09,517 INFO L131 PetriNetUnfolder]: For 7811/7947 co-relation queries the response was YES. [2022-12-13 02:26:09,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4579 conditions, 639 events. 225/639 cut-off events. For 7811/7947 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4301 event pairs, 24 based on Foata normal form. 2/616 useless extension candidates. Maximal degree in co-relation 4223. Up to 227 conditions per place. [2022-12-13 02:26:09,525 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 193 transitions, 2901 flow [2022-12-13 02:26:09,526 INFO L226 LiptonReduction]: Number of co-enabled transitions 640 [2022-12-13 02:26:12,139 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [690] $Ultimate##0-->L86-3: Formula: (let ((.cse0 (select |v_#memory_int_284| v_~f~0.base_191))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_188 (* v_~x1~0_248 4))))) (and (= (+ |v_#pthreadsForks_139| 1) |v_#pthreadsForks_138|) (not (= (ite (and (< v_~x1~0_248 v_~size~0_191) (<= 0 v_~x1~0_248)) 1 0) 0)) (= v_~x1~0_246 (select .cse0 (+ v_~f~0.offset_188 (* .cse1 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_120| 0)) (< 1 (mod (* 3 v_~n~0_177) 4294967296)) (= (store |v_#memory_int_284| |v_ULTIMATE.start_main_~#t2~0#1.base_85| (store (select |v_#memory_int_284| |v_ULTIMATE.start_main_~#t2~0#1.base_85|) |v_ULTIMATE.start_main_~#t2~0#1.offset_82| |v_ULTIMATE.start_main_#t~pre14#1_86|)) |v_#memory_int_283|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_191)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_104|) (= |v_ULTIMATE.start_main_#t~pre14#1_86| |v_#pthreadsForks_139|) (= |v_thread1Thread1of1ForFork0_~i~0#1_165| 2) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_104| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_120|)))) InVars {~size~0=v_~size~0_191, #pthreadsForks=|v_#pthreadsForks_139|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_82|, ~f~0.base=v_~f~0.base_191, #memory_int=|v_#memory_int_284|, ~n~0=v_~n~0_177, ~x1~0=v_~x1~0_248, ~f~0.offset=v_~f~0.offset_188, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_85|} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_112|, ~size~0=v_~size~0_191, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_82|, ~f~0.base=v_~f~0.base_191, ~x1~0=v_~x1~0_246, ~f~0.offset=v_~f~0.offset_188, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_101|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_104|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_86|, #pthreadsForks=|v_#pthreadsForks_138|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_165|, #memory_int=|v_#memory_int_283|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_71|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_120|, ~n~0=v_~n~0_177, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_85|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, thread1Thread1of1ForFork0_~i~0#1, #memory_int, ULTIMATE.start_main_#t~nondet13#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:26:12,808 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] $Ultimate##0-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_245| v_~f~0.base_157))) (let ((.cse5 (select .cse2 (+ v_~f~0.offset_154 (* v_~x2~0_188 4))))) (let ((.cse0 (select .cse2 (+ (* .cse5 4) v_~f~0.offset_154)))) (let ((.cse4 (select .cse2 (+ v_~f~0.offset_154 (* .cse0 4))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_154 (* .cse4 4))))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_154 (* .cse1 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_157)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_157)) 1 0) 0)) (= (select .cse2 (+ v_~f~0.offset_154 (* .cse3 4))) v_~x2~0_186) (not (= (ite (and (< v_~x2~0_188 v_~size~0_157) (<= 0 v_~x2~0_188)) 1 0) 0)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_111|) (= (ite (and (< .cse3 v_~size~0_157) (<= 0 .cse3)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_83|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_115| 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_157)) 1 0) 0)) (< 3 (mod (* 3 v_~n~0_143) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_115| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_83|) (not (= (ite (and (< .cse5 v_~size~0_157) (<= 0 .cse5)) 1 0) 0))))))))) InVars {~x2~0=v_~x2~0_188, ~size~0=v_~size~0_157, ~f~0.base=v_~f~0.base_157, #memory_int=|v_#memory_int_245|, ~n~0=v_~n~0_143, ~f~0.offset=v_~f~0.offset_154} OutVars{~x2~0=v_~x2~0_186, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_75|, ~size~0=v_~size~0_157, ~f~0.base=v_~f~0.base_157, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_47|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_83|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_111|, ~f~0.offset=v_~f~0.offset_154, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_115|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_39|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_37|, #memory_int=|v_#memory_int_245|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_47|, ~n~0=v_~n~0_143, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_51|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [649] $Ultimate##0-->L49-2: Formula: (and (= (ite (and (< v_~x1~0_89 v_~size~0_105) (<= 0 v_~x1~0_89)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_~i~0#1_53| 1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_53| 4294967295) 4294967296) (mod (* v_~n~0_84 3) 4294967296)) (= (select (select |v_#memory_int_141| v_~f~0.base_99) (+ v_~f~0.offset_99 (* v_~x1~0_89 4))) v_~x1~0_88)) InVars {~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, #memory_int=|v_#memory_int_141|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_89, ~f~0.offset=v_~f~0.offset_99} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_29|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_53|, #memory_int=|v_#memory_int_141|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, ~n~0=v_~n~0_84, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_39|, ~x1~0=v_~x1~0_88, ~f~0.offset=v_~f~0.offset_99} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:26:13,410 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 02:26:13,411 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3979 [2022-12-13 02:26:13,411 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 193 transitions, 2984 flow [2022-12-13 02:26:13,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:26:13,411 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:13,411 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:13,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-13 02:26:13,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:26:13,615 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:13,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:13,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1265922371, now seen corresponding path program 1 times [2022-12-13 02:26:13,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:13,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171201358] [2022-12-13 02:26:13,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:13,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:13,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:13,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:26:13,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:13,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171201358] [2022-12-13 02:26:13,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171201358] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:26:13,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359929547] [2022-12-13 02:26:13,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:13,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:26:13,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:26:13,827 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:26:13,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 02:26:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:13,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-13 02:26:13,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:26:14,227 INFO L321 Elim1Store]: treesize reduction 87, result has 28.1 percent of original size [2022-12-13 02:26:14,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 15 case distinctions, treesize of input 153 treesize of output 83 [2022-12-13 02:26:14,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:26:14,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:26:15,263 INFO L321 Elim1Store]: treesize reduction 20, result has 95.3 percent of original size [2022-12-13 02:26:15,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 18 new quantified variables, introduced 45 case distinctions, treesize of input 336 treesize of output 520 [2022-12-13 02:26:19,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:26:19,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359929547] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:26:19,793 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:26:19,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-13 02:26:19,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640283841] [2022-12-13 02:26:19,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:26:19,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 02:26:19,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:19,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 02:26:19,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-12-13 02:26:19,795 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-13 02:26:19,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 193 transitions, 2984 flow. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:26:19,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:19,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-13 02:26:19,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:21,832 INFO L130 PetriNetUnfolder]: 1077/1876 cut-off events. [2022-12-13 02:26:21,833 INFO L131 PetriNetUnfolder]: For 29033/29033 co-relation queries the response was YES. [2022-12-13 02:26:21,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14575 conditions, 1876 events. 1077/1876 cut-off events. For 29033/29033 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 10373 event pairs, 308 based on Foata normal form. 28/1902 useless extension candidates. Maximal degree in co-relation 13132. Up to 1548 conditions per place. [2022-12-13 02:26:21,849 INFO L137 encePairwiseOnDemand]: 18/59 looper letters, 152 selfloop transitions, 106 changer transitions 3/261 dead transitions. [2022-12-13 02:26:21,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 261 transitions, 4397 flow [2022-12-13 02:26:21,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 02:26:21,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 02:26:21,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 134 transitions. [2022-12-13 02:26:21,850 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.15141242937853108 [2022-12-13 02:26:21,850 INFO L175 Difference]: Start difference. First operand has 112 places, 193 transitions, 2984 flow. Second operand 15 states and 134 transitions. [2022-12-13 02:26:21,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 261 transitions, 4397 flow [2022-12-13 02:26:21,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 261 transitions, 4127 flow, removed 125 selfloop flow, removed 2 redundant places. [2022-12-13 02:26:21,942 INFO L231 Difference]: Finished difference. Result has 133 places, 221 transitions, 3677 flow [2022-12-13 02:26:21,942 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=2752, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3677, PETRI_PLACES=133, PETRI_TRANSITIONS=221} [2022-12-13 02:26:21,943 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 112 predicate places. [2022-12-13 02:26:21,943 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:21,943 INFO L89 Accepts]: Start accepts. Operand has 133 places, 221 transitions, 3677 flow [2022-12-13 02:26:21,945 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:21,945 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:21,945 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 221 transitions, 3677 flow [2022-12-13 02:26:21,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 221 transitions, 3677 flow [2022-12-13 02:26:22,044 INFO L130 PetriNetUnfolder]: 242/675 cut-off events. [2022-12-13 02:26:22,044 INFO L131 PetriNetUnfolder]: For 12591/12725 co-relation queries the response was YES. [2022-12-13 02:26:22,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5536 conditions, 675 events. 242/675 cut-off events. For 12591/12725 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4563 event pairs, 28 based on Foata normal form. 1/648 useless extension candidates. Maximal degree in co-relation 5485. Up to 250 conditions per place. [2022-12-13 02:26:22,054 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 221 transitions, 3677 flow [2022-12-13 02:26:22,054 INFO L226 LiptonReduction]: Number of co-enabled transitions 712 [2022-12-13 02:26:22,060 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [706] $Ultimate##0-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_309| v_~f~0.base_211))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_208 (* v_~x1~0_300 4))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_208 (* .cse0 4))))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_208 (* .cse1 4))))) (and (not (= (ite (and (< v_~x1~0_300 v_~size~0_211) (<= 0 v_~x1~0_300)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_136| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_152|) (< 3 (mod (* 3 v_~n~0_197) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_152| 0)) (not (= (ite (and (< .cse0 v_~size~0_211) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_211)) 1 0) 0)) (= (select .cse2 (+ v_~f~0.offset_208 (* 4 .cse3))) v_~x1~0_298) (= |v_thread1Thread1of1ForFork0_~i~0#1_197| 4) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_136| (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_211)) 1 0))))))) InVars {~size~0=v_~size~0_211, ~f~0.base=v_~f~0.base_211, #memory_int=|v_#memory_int_309|, ~n~0=v_~n~0_197, ~x1~0=v_~x1~0_300, ~f~0.offset=v_~f~0.offset_208} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_144|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_136|, ~size~0=v_~size~0_211, ~f~0.base=v_~f~0.base_211, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_197|, #memory_int=|v_#memory_int_309|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_152|, ~n~0=v_~n~0_197, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_154|, ~x1~0=v_~x1~0_298, ~f~0.offset=v_~f~0.offset_208} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] and [626] L85-3-->L86-3: Formula: (and (= |v_#memory_int_115| (store |v_#memory_int_116| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_116| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre14#1_29|))) (= |v_ULTIMATE.start_main_#t~pre14#1_29| |v_#pthreadsForks_52|) (= |v_#pthreadsForks_51| (+ |v_#pthreadsForks_52| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_52|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #memory_int=|v_#memory_int_116|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_37|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_29|, #pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #memory_int=|v_#memory_int_115|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] [2022-12-13 02:26:22,222 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [706] $Ultimate##0-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_309| v_~f~0.base_211))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_208 (* v_~x1~0_300 4))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_208 (* .cse0 4))))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_208 (* .cse1 4))))) (and (not (= (ite (and (< v_~x1~0_300 v_~size~0_211) (<= 0 v_~x1~0_300)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_136| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_152|) (< 3 (mod (* 3 v_~n~0_197) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_152| 0)) (not (= (ite (and (< .cse0 v_~size~0_211) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_211)) 1 0) 0)) (= (select .cse2 (+ v_~f~0.offset_208 (* 4 .cse3))) v_~x1~0_298) (= |v_thread1Thread1of1ForFork0_~i~0#1_197| 4) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_136| (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_211)) 1 0))))))) InVars {~size~0=v_~size~0_211, ~f~0.base=v_~f~0.base_211, #memory_int=|v_#memory_int_309|, ~n~0=v_~n~0_197, ~x1~0=v_~x1~0_300, ~f~0.offset=v_~f~0.offset_208} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_144|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_136|, ~size~0=v_~size~0_211, ~f~0.base=v_~f~0.base_211, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_197|, #memory_int=|v_#memory_int_309|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_152|, ~n~0=v_~n~0_197, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_154|, ~x1~0=v_~x1~0_298, ~f~0.offset=v_~f~0.offset_208} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] and [652] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_145| v_~f~0.base_103))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_103 (* v_~x2~0_157 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse2))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (= (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse1))) v_~x2~0_156) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_109)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_99|) (not (= (ite (and (<= 0 v_~x2~0_157) (< v_~x2~0_157 v_~size~0_109)) 1 0) 0)) (< (mod (+ 4294967293 |v_thread2Thread1of1ForFork1_~i~1#1_99|) 4294967296) (mod (* v_~n~0_90 3) 4294967296)) (not (= 0 (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_109)) 1 0))))))) InVars {~x2~0=v_~x2~0_157, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, #memory_int=|v_#memory_int_145|, ~n~0=v_~n~0_90, ~f~0.offset=v_~f~0.offset_103} OutVars{~x2~0=v_~x2~0_156, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_65|, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_99|, ~f~0.offset=v_~f~0.offset_103, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_29|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_90, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_41|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:26:23,169 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [737] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_383| v_~f~0.base_269))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_266 (* v_~x1~0_388 4))))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_266 (* .cse0 4)))) (.cse5 (select .cse1 (+ v_~f~0.offset_266 (* v_~x2~0_335 4))))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_266 (* .cse5 4)))) (.cse2 (select .cse1 (+ v_~f~0.offset_266 (* .cse4 4))))) (and (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_236|) (= |v_thread1Thread1of1ForFork0_~i~0#1_287| 4) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_203| 0)) (not (= (ite (and (< .cse0 v_~size~0_267) (<= 0 .cse0)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_166| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_198|) (= (select .cse1 (+ v_~f~0.offset_266 (* 4 .cse2))) v_~x1~0_387) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_187| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_203|) (< 3 (mod (* 3 v_~n~0_253) 4294967296)) (not (= (ite (and (< v_~x2~0_335 v_~size~0_267) (<= 0 v_~x2~0_335)) 1 0) 0)) (= v_~x2~0_334 (select .cse1 (+ v_~f~0.offset_266 (* 4 .cse3)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_198| 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_267)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_388) (< v_~x1~0_388 v_~size~0_267)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_166| (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_267)) 1 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_267)) 1 0) 0)) (= (ite (and (< .cse2 v_~size~0_267) (<= 0 .cse2)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_187|)))))) InVars {~x2~0=v_~x2~0_335, ~size~0=v_~size~0_267, ~f~0.base=v_~f~0.base_269, #memory_int=|v_#memory_int_383|, ~n~0=v_~n~0_253, ~x1~0=v_~x1~0_388, ~f~0.offset=v_~f~0.offset_266} OutVars{~x2~0=v_~x2~0_334, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_195|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_158|, ~size~0=v_~size~0_267, ~f~0.base=v_~f~0.base_269, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_130|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_166|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_236|, ~x1~0=v_~x1~0_387, ~f~0.offset=v_~f~0.offset_266, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_198|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_187|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_122|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_287|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_120|, #memory_int=|v_#memory_int_383|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_203|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_130|, ~n~0=v_~n~0_253, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_134|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_205|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:26:23,548 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 02:26:23,549 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1606 [2022-12-13 02:26:23,549 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 220 transitions, 3720 flow [2022-12-13 02:26:23,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:26:23,549 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:23,549 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:23,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 02:26:23,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-12-13 02:26:23,755 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:23,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:23,755 INFO L85 PathProgramCache]: Analyzing trace with hash 458012204, now seen corresponding path program 1 times [2022-12-13 02:26:23,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:23,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270705623] [2022-12-13 02:26:23,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:23,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:23,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:23,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:26:23,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:23,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270705623] [2022-12-13 02:26:23,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270705623] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:26:23,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320646847] [2022-12-13 02:26:23,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:23,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:26:23,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:26:23,823 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:26:23,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 02:26:23,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:23,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 02:26:23,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:26:23,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:26:23,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:26:24,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:26:24,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320646847] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:26:24,004 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:26:24,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-12-13 02:26:24,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523278312] [2022-12-13 02:26:24,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:26:24,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 02:26:24,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:24,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 02:26:24,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 02:26:24,005 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 60 [2022-12-13 02:26:24,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 220 transitions, 3720 flow. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:26:24,005 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:24,005 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 60 [2022-12-13 02:26:24,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:25,057 INFO L130 PetriNetUnfolder]: 1322/2319 cut-off events. [2022-12-13 02:26:25,058 INFO L131 PetriNetUnfolder]: For 48838/48838 co-relation queries the response was YES. [2022-12-13 02:26:25,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19741 conditions, 2319 events. 1322/2319 cut-off events. For 48838/48838 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 13482 event pairs, 364 based on Foata normal form. 12/2329 useless extension candidates. Maximal degree in co-relation 19688. Up to 967 conditions per place. [2022-12-13 02:26:25,080 INFO L137 encePairwiseOnDemand]: 37/60 looper letters, 248 selfloop transitions, 49 changer transitions 1/298 dead transitions. [2022-12-13 02:26:25,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 298 transitions, 5499 flow [2022-12-13 02:26:25,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 02:26:25,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 02:26:25,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2022-12-13 02:26:25,081 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25952380952380955 [2022-12-13 02:26:25,081 INFO L175 Difference]: Start difference. First operand has 129 places, 220 transitions, 3720 flow. Second operand 7 states and 109 transitions. [2022-12-13 02:26:25,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 298 transitions, 5499 flow [2022-12-13 02:26:25,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 298 transitions, 5161 flow, removed 145 selfloop flow, removed 7 redundant places. [2022-12-13 02:26:25,216 INFO L231 Difference]: Finished difference. Result has 133 places, 230 transitions, 3833 flow [2022-12-13 02:26:25,216 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=3442, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3833, PETRI_PLACES=133, PETRI_TRANSITIONS=230} [2022-12-13 02:26:25,217 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 112 predicate places. [2022-12-13 02:26:25,217 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:25,217 INFO L89 Accepts]: Start accepts. Operand has 133 places, 230 transitions, 3833 flow [2022-12-13 02:26:25,218 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:25,218 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:25,218 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 230 transitions, 3833 flow [2022-12-13 02:26:25,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 230 transitions, 3833 flow [2022-12-13 02:26:25,329 INFO L130 PetriNetUnfolder]: 286/811 cut-off events. [2022-12-13 02:26:25,329 INFO L131 PetriNetUnfolder]: For 17063/17229 co-relation queries the response was YES. [2022-12-13 02:26:25,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6846 conditions, 811 events. 286/811 cut-off events. For 17063/17229 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 5862 event pairs, 40 based on Foata normal form. 2/774 useless extension candidates. Maximal degree in co-relation 6283. Up to 277 conditions per place. [2022-12-13 02:26:25,337 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 230 transitions, 3833 flow [2022-12-13 02:26:25,337 INFO L226 LiptonReduction]: Number of co-enabled transitions 752 [2022-12-13 02:26:25,342 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [733] $Ultimate##0-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_372| v_~f~0.base_261))) (let ((.cse4 (select .cse2 (+ v_~f~0.offset_258 (* v_~x2~0_318 4))))) (let ((.cse8 (select .cse2 (+ v_~f~0.offset_258 (* 4 .cse4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_258 (* .cse8 4))))) (let ((.cse6 (select .cse2 (+ v_~f~0.offset_258 (* .cse0 4))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_258 (* .cse6 4))))) (let ((.cse5 (select .cse2 (+ v_~f~0.offset_258 (* 4 .cse1))))) (let ((.cse7 (select .cse2 (+ (* .cse5 4) v_~f~0.offset_258)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_258 (* 4 .cse7))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_187| 0)) (not (= (ite (and (< v_~x2~0_318 v_~size~0_259) (<= 0 v_~x2~0_318)) 1 0) 0)) (< 6 (mod (* 3 v_~n~0_245) 4294967296)) (not (= (ite (and (< .cse0 v_~size~0_259) (<= 0 .cse0)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_155| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_187|) (not (= (ite (and (< .cse1 v_~size~0_259) (<= 0 .cse1)) 1 0) 0)) (= (select .cse2 (+ v_~f~0.offset_258 (* .cse3 4))) v_~x2~0_316) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_259)) 1 0) 0)) (not (= (ite (and (< .cse5 v_~size~0_259) (<= 0 .cse5)) 1 0) 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_259)) 1 0) 0)) (not (= (ite (and (< .cse7 v_~size~0_259) (<= 0 .cse7)) 1 0) 0)) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_259)) 1 0) 0)) (= 9 |v_thread2Thread1of1ForFork1_~i~1#1_225|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_155| (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_259)) 1 0)))))))))))) InVars {~x2~0=v_~x2~0_318, ~size~0=v_~size~0_259, ~f~0.base=v_~f~0.base_261, #memory_int=|v_#memory_int_372|, ~n~0=v_~n~0_245, ~f~0.offset=v_~f~0.offset_258} OutVars{~x2~0=v_~x2~0_316, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_147|, ~size~0=v_~size~0_259, ~f~0.base=v_~f~0.base_261, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_119|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_155|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_225|, ~f~0.offset=v_~f~0.offset_258, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_187|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_111|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_109|, #memory_int=|v_#memory_int_372|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_119|, ~n~0=v_~n~0_245, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_123|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [631] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_5) 4294967296)))) InVars {~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] [2022-12-13 02:26:25,734 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [682] L59-2-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_273| v_~f~0.base_181))) (let ((.cse6 (select .cse1 (+ v_~f~0.offset_178 (* v_~x2~0_226 4))))) (let ((.cse5 (select .cse1 (+ v_~f~0.offset_178 (* .cse6 4))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_178 (* .cse5 4))))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_178 (* 4 .cse0))))) (let ((.cse4 (mod (* 3 v_~n~0_167) 4294967296)) (.cse2 (select .cse1 (+ v_~f~0.offset_178 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_181)) 1 0) 0)) (= v_~x2~0_224 (select .cse1 (+ (* .cse2 4) v_~f~0.offset_178))) (not (= 0 (ite (and (< .cse3 v_~size~0_181) (<= 0 .cse3)) 1 0))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_137| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_105| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_137|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_137| 4294967296) .cse4) (not (= (ite (and (< .cse5 v_~size~0_181) (<= 0 .cse5)) 1 0) 0)) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_135| 4294967293) 4294967296) .cse4) (not (= (ite (and (< .cse6 v_~size~0_181) (<= 0 .cse6)) 1 0) 0)) (= (+ 6 |v_thread2Thread1of1ForFork1_~i~1#1_137|) |v_thread2Thread1of1ForFork1_~i~1#1_135|) (not (= (ite (and (<= 0 v_~x2~0_226) (< v_~x2~0_226 v_~size~0_181)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_105| (ite (and (< .cse2 v_~size~0_181) (<= 0 .cse2)) 1 0))))))))) InVars {~x2~0=v_~x2~0_226, ~size~0=v_~size~0_181, ~f~0.base=v_~f~0.base_181, #memory_int=|v_#memory_int_273|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_137|, ~n~0=v_~n~0_167, ~f~0.offset=v_~f~0.offset_178} OutVars{~x2~0=v_~x2~0_224, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_97|, ~size~0=v_~size~0_181, ~f~0.base=v_~f~0.base_181, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_69|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_105|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_135|, ~f~0.offset=v_~f~0.offset_178, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_137|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_61|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_59|, #memory_int=|v_#memory_int_273|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_69|, ~n~0=v_~n~0_167, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_73|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [631] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_5) 4294967296)))) InVars {~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] [2022-12-13 02:26:26,105 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [669] L59-2-->L59-2: Formula: (let ((.cse5 (select |v_#memory_int_251| v_~f~0.base_163))) (let ((.cse4 (select .cse5 (+ v_~f~0.offset_160 (* v_~x2~0_204 4))))) (let ((.cse3 (select .cse5 (+ v_~f~0.offset_160 (* .cse4 4))))) (let ((.cse0 (select .cse5 (+ v_~f~0.offset_160 (* 4 .cse3))))) (let ((.cse6 (select .cse5 (+ v_~f~0.offset_160 (* .cse0 4))))) (let ((.cse1 (mod (* 3 v_~n~0_149) 4294967296)) (.cse2 (select .cse5 (+ v_~f~0.offset_160 (* .cse6 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_163) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_123| 4294967296) .cse1) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_163)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (< v_~x2~0_204 v_~size~0_163) (<= 0 v_~x2~0_204)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_163)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_163)) 1 0) 0)) (< (mod (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_123|) 4294967296) .cse1) (= |v_thread2Thread1of1ForFork1_~i~1#1_121| (+ 6 |v_thread2Thread1of1ForFork1_~i~1#1_123|)) (= v_~x2~0_202 (select .cse5 (+ v_~f~0.offset_160 (* 4 .cse2)))) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_163)) 1 0) 0))))))))) InVars {~x2~0=v_~x2~0_204, ~size~0=v_~size~0_163, ~f~0.base=v_~f~0.base_163, #memory_int=|v_#memory_int_251|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_123|, ~n~0=v_~n~0_149, ~f~0.offset=v_~f~0.offset_160} OutVars{~x2~0=v_~x2~0_202, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_85|, ~size~0=v_~size~0_163, ~f~0.base=v_~f~0.base_163, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_57|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_121|, ~f~0.offset=v_~f~0.offset_160, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_49|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_47|, #memory_int=|v_#memory_int_251|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_57|, ~n~0=v_~n~0_149, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_61|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [631] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_5) 4294967296)))) InVars {~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n~0=v_~n~0_In_5, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] [2022-12-13 02:26:26,445 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [669] L59-2-->L59-2: Formula: (let ((.cse5 (select |v_#memory_int_251| v_~f~0.base_163))) (let ((.cse4 (select .cse5 (+ v_~f~0.offset_160 (* v_~x2~0_204 4))))) (let ((.cse3 (select .cse5 (+ v_~f~0.offset_160 (* .cse4 4))))) (let ((.cse0 (select .cse5 (+ v_~f~0.offset_160 (* 4 .cse3))))) (let ((.cse6 (select .cse5 (+ v_~f~0.offset_160 (* .cse0 4))))) (let ((.cse1 (mod (* 3 v_~n~0_149) 4294967296)) (.cse2 (select .cse5 (+ v_~f~0.offset_160 (* .cse6 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_163) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_123| 4294967296) .cse1) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_163)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (< v_~x2~0_204 v_~size~0_163) (<= 0 v_~x2~0_204)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_163)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_163)) 1 0) 0)) (< (mod (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_123|) 4294967296) .cse1) (= |v_thread2Thread1of1ForFork1_~i~1#1_121| (+ 6 |v_thread2Thread1of1ForFork1_~i~1#1_123|)) (= v_~x2~0_202 (select .cse5 (+ v_~f~0.offset_160 (* 4 .cse2)))) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_163)) 1 0) 0))))))))) InVars {~x2~0=v_~x2~0_204, ~size~0=v_~size~0_163, ~f~0.base=v_~f~0.base_163, #memory_int=|v_#memory_int_251|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_123|, ~n~0=v_~n~0_149, ~f~0.offset=v_~f~0.offset_160} OutVars{~x2~0=v_~x2~0_202, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_85|, ~size~0=v_~size~0_163, ~f~0.base=v_~f~0.base_163, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_57|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_121|, ~f~0.offset=v_~f~0.offset_160, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_49|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_47|, #memory_int=|v_#memory_int_251|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_57|, ~n~0=v_~n~0_149, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_61|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:26:27,093 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 02:26:27,094 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1877 [2022-12-13 02:26:27,094 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 232 transitions, 3974 flow [2022-12-13 02:26:27,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:26:27,094 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:27,094 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:27,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-13 02:26:27,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-13 02:26:27,299 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:27,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:27,300 INFO L85 PathProgramCache]: Analyzing trace with hash 660803200, now seen corresponding path program 1 times [2022-12-13 02:26:27,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:27,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722195453] [2022-12-13 02:26:27,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:27,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:27,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:27,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:26:27,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:27,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722195453] [2022-12-13 02:26:27,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722195453] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:27,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:27,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 02:26:27,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952173025] [2022-12-13 02:26:27,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:27,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:26:27,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:27,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:26:27,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:26:27,371 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 64 [2022-12-13 02:26:27,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 232 transitions, 3974 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:26:27,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:27,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 64 [2022-12-13 02:26:27,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:28,047 INFO L130 PetriNetUnfolder]: 1349/2376 cut-off events. [2022-12-13 02:26:28,047 INFO L131 PetriNetUnfolder]: For 56577/56577 co-relation queries the response was YES. [2022-12-13 02:26:28,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20420 conditions, 2376 events. 1349/2376 cut-off events. For 56577/56577 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 14206 event pairs, 242 based on Foata normal form. 24/2398 useless extension candidates. Maximal degree in co-relation 18233. Up to 1180 conditions per place. [2022-12-13 02:26:28,066 INFO L137 encePairwiseOnDemand]: 42/64 looper letters, 253 selfloop transitions, 64 changer transitions 13/330 dead transitions. [2022-12-13 02:26:28,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 330 transitions, 5992 flow [2022-12-13 02:26:28,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 02:26:28,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 02:26:28,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2022-12-13 02:26:28,072 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21428571428571427 [2022-12-13 02:26:28,072 INFO L175 Difference]: Start difference. First operand has 133 places, 232 transitions, 3974 flow. Second operand 7 states and 96 transitions. [2022-12-13 02:26:28,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 330 transitions, 5992 flow [2022-12-13 02:26:28,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 330 transitions, 5948 flow, removed 22 selfloop flow, removed 1 redundant places. [2022-12-13 02:26:28,223 INFO L231 Difference]: Finished difference. Result has 142 places, 245 transitions, 4425 flow [2022-12-13 02:26:28,224 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=3888, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4425, PETRI_PLACES=142, PETRI_TRANSITIONS=245} [2022-12-13 02:26:28,224 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 121 predicate places. [2022-12-13 02:26:28,224 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:28,224 INFO L89 Accepts]: Start accepts. Operand has 142 places, 245 transitions, 4425 flow [2022-12-13 02:26:28,226 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:28,226 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:28,226 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 245 transitions, 4425 flow [2022-12-13 02:26:28,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 245 transitions, 4425 flow [2022-12-13 02:26:28,337 INFO L130 PetriNetUnfolder]: 292/821 cut-off events. [2022-12-13 02:26:28,337 INFO L131 PetriNetUnfolder]: For 21322/21429 co-relation queries the response was YES. [2022-12-13 02:26:28,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7407 conditions, 821 events. 292/821 cut-off events. For 21322/21429 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5901 event pairs, 34 based on Foata normal form. 1/794 useless extension candidates. Maximal degree in co-relation 6700. Up to 282 conditions per place. [2022-12-13 02:26:28,346 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 245 transitions, 4425 flow [2022-12-13 02:26:28,346 INFO L226 LiptonReduction]: Number of co-enabled transitions 748 [2022-12-13 02:26:28,347 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [687] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_279| v_~f~0.base_187))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_184 (* v_~x1~0_238 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_184 (* .cse2 4))))) (and (< 2 (mod (* 3 v_~n~0_173) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_114| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_98|) (= v_~x1~0_236 (select .cse0 (+ v_~f~0.offset_184 (* .cse1 4)))) (= (ite (and (< .cse1 v_~size~0_187) (<= 0 .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_98|) (= |v_thread1Thread1of1ForFork0_~i~0#1_159| 3) (not (= (ite (and (< .cse2 v_~size~0_187) (<= 0 .cse2)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_114| 0)) (not (= (ite (and (< v_~x1~0_238 v_~size~0_187) (<= 0 v_~x1~0_238)) 1 0) 0)))))) InVars {~size~0=v_~size~0_187, ~f~0.base=v_~f~0.base_187, #memory_int=|v_#memory_int_279|, ~n~0=v_~n~0_173, ~x1~0=v_~x1~0_238, ~f~0.offset=v_~f~0.offset_184} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_106|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_98|, ~size~0=v_~size~0_187, ~f~0.base=v_~f~0.base_187, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_159|, #memory_int=|v_#memory_int_279|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_114|, ~n~0=v_~n~0_173, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_116|, ~x1~0=v_~x1~0_236, ~f~0.offset=v_~f~0.offset_184} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] and [652] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_145| v_~f~0.base_103))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_103 (* v_~x2~0_157 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse2))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (= (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse1))) v_~x2~0_156) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_109)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_99|) (not (= (ite (and (<= 0 v_~x2~0_157) (< v_~x2~0_157 v_~size~0_109)) 1 0) 0)) (< (mod (+ 4294967293 |v_thread2Thread1of1ForFork1_~i~1#1_99|) 4294967296) (mod (* v_~n~0_90 3) 4294967296)) (not (= 0 (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_109)) 1 0))))))) InVars {~x2~0=v_~x2~0_157, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, #memory_int=|v_#memory_int_145|, ~n~0=v_~n~0_90, ~f~0.offset=v_~f~0.offset_103} OutVars{~x2~0=v_~x2~0_156, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_65|, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_99|, ~f~0.offset=v_~f~0.offset_103, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_29|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_90, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_41|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:26:28,628 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:28,629 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 405 [2022-12-13 02:26:28,629 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 245 transitions, 4440 flow [2022-12-13 02:26:28,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:26:28,629 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:28,629 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:28,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 02:26:28,630 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:28,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:28,630 INFO L85 PathProgramCache]: Analyzing trace with hash 414834004, now seen corresponding path program 1 times [2022-12-13 02:26:28,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:28,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830329268] [2022-12-13 02:26:28,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:28,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:30,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:26:30,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:30,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830329268] [2022-12-13 02:26:30,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830329268] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:26:30,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481863111] [2022-12-13 02:26:30,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:30,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:26:30,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:26:30,545 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:26:30,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 02:26:30,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:30,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 02:26:30,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:26:30,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:26:30,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2022-12-13 02:26:30,699 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:26:30,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 45 [2022-12-13 02:26:30,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:26:30,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:26:30,808 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:26:30,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 104 treesize of output 228 [2022-12-13 02:26:30,852 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:26:30,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 116 [2022-12-13 02:26:31,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:26:31,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481863111] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:26:31,474 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:26:31,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-13 02:26:31,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112102832] [2022-12-13 02:26:31,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:26:31,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 02:26:31,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:31,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 02:26:31,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-13 02:26:31,475 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-13 02:26:31,475 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 245 transitions, 4440 flow. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:26:31,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:31,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-13 02:26:31,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:32,688 INFO L130 PetriNetUnfolder]: 1401/2477 cut-off events. [2022-12-13 02:26:32,689 INFO L131 PetriNetUnfolder]: For 68707/68707 co-relation queries the response was YES. [2022-12-13 02:26:32,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22656 conditions, 2477 events. 1401/2477 cut-off events. For 68707/68707 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 14835 event pairs, 479 based on Foata normal form. 2/2475 useless extension candidates. Maximal degree in co-relation 20817. Up to 2192 conditions per place. [2022-12-13 02:26:32,707 INFO L137 encePairwiseOnDemand]: 29/63 looper letters, 228 selfloop transitions, 91 changer transitions 6/325 dead transitions. [2022-12-13 02:26:32,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 325 transitions, 6432 flow [2022-12-13 02:26:32,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 02:26:32,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 02:26:32,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2022-12-13 02:26:32,709 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19682539682539682 [2022-12-13 02:26:32,709 INFO L175 Difference]: Start difference. First operand has 142 places, 245 transitions, 4440 flow. Second operand 10 states and 124 transitions. [2022-12-13 02:26:32,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 325 transitions, 6432 flow [2022-12-13 02:26:32,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 325 transitions, 5952 flow, removed 240 selfloop flow, removed 0 redundant places. [2022-12-13 02:26:32,907 INFO L231 Difference]: Finished difference. Result has 157 places, 279 transitions, 5179 flow [2022-12-13 02:26:32,908 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=4162, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5179, PETRI_PLACES=157, PETRI_TRANSITIONS=279} [2022-12-13 02:26:32,908 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 136 predicate places. [2022-12-13 02:26:32,908 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:32,908 INFO L89 Accepts]: Start accepts. Operand has 157 places, 279 transitions, 5179 flow [2022-12-13 02:26:32,910 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:32,910 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:32,910 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 279 transitions, 5179 flow [2022-12-13 02:26:32,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 279 transitions, 5179 flow [2022-12-13 02:26:33,012 INFO L130 PetriNetUnfolder]: 319/895 cut-off events. [2022-12-13 02:26:33,012 INFO L131 PetriNetUnfolder]: For 22098/22215 co-relation queries the response was YES. [2022-12-13 02:26:33,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7992 conditions, 895 events. 319/895 cut-off events. For 22098/22215 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 6598 event pairs, 36 based on Foata normal form. 2/865 useless extension candidates. Maximal degree in co-relation 7486. Up to 315 conditions per place. [2022-12-13 02:26:33,022 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 279 transitions, 5179 flow [2022-12-13 02:26:33,022 INFO L226 LiptonReduction]: Number of co-enabled transitions 854 [2022-12-13 02:26:33,029 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:26:33,030 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:26:33,030 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 279 transitions, 5179 flow [2022-12-13 02:26:33,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:26:33,030 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:33,030 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:33,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-13 02:26:33,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-13 02:26:33,236 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:33,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:33,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1651590028, now seen corresponding path program 1 times [2022-12-13 02:26:33,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:33,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659283395] [2022-12-13 02:26:33,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:33,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:33,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:34,317 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 02:26:34,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:34,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659283395] [2022-12-13 02:26:34,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659283395] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:34,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:34,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:26:34,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078758538] [2022-12-13 02:26:34,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:34,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:26:34,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:34,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:26:34,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:26:34,319 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-13 02:26:34,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 279 transitions, 5179 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:26:34,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:34,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-13 02:26:34,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:34,982 INFO L130 PetriNetUnfolder]: 1447/2558 cut-off events. [2022-12-13 02:26:34,982 INFO L131 PetriNetUnfolder]: For 64685/64685 co-relation queries the response was YES. [2022-12-13 02:26:34,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22801 conditions, 2558 events. 1447/2558 cut-off events. For 64685/64685 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 15393 event pairs, 577 based on Foata normal form. 1/2555 useless extension candidates. Maximal degree in co-relation 21382. Up to 2357 conditions per place. [2022-12-13 02:26:35,000 INFO L137 encePairwiseOnDemand]: 32/63 looper letters, 228 selfloop transitions, 66 changer transitions 11/305 dead transitions. [2022-12-13 02:26:35,001 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 305 transitions, 6031 flow [2022-12-13 02:26:35,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:35,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:35,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2022-12-13 02:26:35,001 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2984126984126984 [2022-12-13 02:26:35,001 INFO L175 Difference]: Start difference. First operand has 158 places, 279 transitions, 5179 flow. Second operand 5 states and 94 transitions. [2022-12-13 02:26:35,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 305 transitions, 6031 flow [2022-12-13 02:26:35,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 305 transitions, 5905 flow, removed 62 selfloop flow, removed 1 redundant places. [2022-12-13 02:26:35,148 INFO L231 Difference]: Finished difference. Result has 163 places, 282 transitions, 5310 flow [2022-12-13 02:26:35,148 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=5053, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5310, PETRI_PLACES=163, PETRI_TRANSITIONS=282} [2022-12-13 02:26:35,148 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 142 predicate places. [2022-12-13 02:26:35,149 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:35,151 INFO L89 Accepts]: Start accepts. Operand has 163 places, 282 transitions, 5310 flow [2022-12-13 02:26:35,152 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:35,152 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:35,153 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 282 transitions, 5310 flow [2022-12-13 02:26:35,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 282 transitions, 5310 flow [2022-12-13 02:26:35,257 INFO L130 PetriNetUnfolder]: 324/918 cut-off events. [2022-12-13 02:26:35,258 INFO L131 PetriNetUnfolder]: For 23719/23832 co-relation queries the response was YES. [2022-12-13 02:26:35,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8203 conditions, 918 events. 324/918 cut-off events. For 23719/23832 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 6829 event pairs, 33 based on Foata normal form. 2/890 useless extension candidates. Maximal degree in co-relation 7665. Up to 304 conditions per place. [2022-12-13 02:26:35,269 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 282 transitions, 5310 flow [2022-12-13 02:26:35,269 INFO L226 LiptonReduction]: Number of co-enabled transitions 864 [2022-12-13 02:26:35,270 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:26:35,271 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:26:35,271 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 282 transitions, 5310 flow [2022-12-13 02:26:35,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:26:35,271 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:35,271 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:35,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 02:26:35,272 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:35,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:35,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1514013612, now seen corresponding path program 2 times [2022-12-13 02:26:35,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:35,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594292042] [2022-12-13 02:26:35,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:35,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:35,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:26:35,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:35,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594292042] [2022-12-13 02:26:35,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594292042] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:26:35,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139741411] [2022-12-13 02:26:35,344 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 02:26:35,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:26:35,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:26:35,348 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:26:35,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 02:26:35,550 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 02:26:35,550 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 02:26:35,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 02:26:35,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:26:35,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:26:35,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:26:35,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:26:35,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139741411] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:26:35,665 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:26:35,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-13 02:26:35,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958093370] [2022-12-13 02:26:35,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:26:35,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 02:26:35,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:35,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 02:26:35,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-13 02:26:35,666 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-13 02:26:35,666 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 282 transitions, 5310 flow. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states 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 02:26:35,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:35,666 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-13 02:26:35,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:36,746 INFO L130 PetriNetUnfolder]: 1498/2681 cut-off events. [2022-12-13 02:26:36,746 INFO L131 PetriNetUnfolder]: For 72019/72019 co-relation queries the response was YES. [2022-12-13 02:26:36,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24135 conditions, 2681 events. 1498/2681 cut-off events. For 72019/72019 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 16613 event pairs, 520 based on Foata normal form. 12/2689 useless extension candidates. Maximal degree in co-relation 23229. Up to 1083 conditions per place. [2022-12-13 02:26:36,770 INFO L137 encePairwiseOnDemand]: 37/63 looper letters, 257 selfloop transitions, 103 changer transitions 0/360 dead transitions. [2022-12-13 02:26:36,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 360 transitions, 7187 flow [2022-12-13 02:26:36,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 02:26:36,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 02:26:36,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2022-12-13 02:26:36,771 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2400793650793651 [2022-12-13 02:26:36,771 INFO L175 Difference]: Start difference. First operand has 162 places, 282 transitions, 5310 flow. Second operand 8 states and 121 transitions. [2022-12-13 02:26:36,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 360 transitions, 7187 flow [2022-12-13 02:26:36,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 360 transitions, 7137 flow, removed 20 selfloop flow, removed 1 redundant places. [2022-12-13 02:26:36,958 INFO L231 Difference]: Finished difference. Result has 172 places, 293 transitions, 5877 flow [2022-12-13 02:26:36,958 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=5262, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5877, PETRI_PLACES=172, PETRI_TRANSITIONS=293} [2022-12-13 02:26:36,958 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 151 predicate places. [2022-12-13 02:26:36,958 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:36,959 INFO L89 Accepts]: Start accepts. Operand has 172 places, 293 transitions, 5877 flow [2022-12-13 02:26:36,960 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:36,960 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:36,960 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 293 transitions, 5877 flow [2022-12-13 02:26:36,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 293 transitions, 5877 flow [2022-12-13 02:26:37,081 INFO L130 PetriNetUnfolder]: 336/972 cut-off events. [2022-12-13 02:26:37,081 INFO L131 PetriNetUnfolder]: For 28215/28352 co-relation queries the response was YES. [2022-12-13 02:26:37,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9154 conditions, 972 events. 336/972 cut-off events. For 28215/28352 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 7451 event pairs, 37 based on Foata normal form. 2/941 useless extension candidates. Maximal degree in co-relation 8794. Up to 314 conditions per place. [2022-12-13 02:26:37,092 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 293 transitions, 5877 flow [2022-12-13 02:26:37,093 INFO L226 LiptonReduction]: Number of co-enabled transitions 910 [2022-12-13 02:26:37,094 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:26:37,094 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:26:37,094 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 293 transitions, 5877 flow [2022-12-13 02:26:37,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states 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 02:26:37,094 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:37,095 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:37,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-13 02:26:37,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-13 02:26:37,295 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:37,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:37,296 INFO L85 PathProgramCache]: Analyzing trace with hash 406053525, now seen corresponding path program 1 times [2022-12-13 02:26:37,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:37,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282614924] [2022-12-13 02:26:37,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:37,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:37,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:26:37,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:37,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282614924] [2022-12-13 02:26:37,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282614924] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:37,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:37,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:26:37,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696925031] [2022-12-13 02:26:37,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:37,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:26:37,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:37,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:26:37,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:26:37,379 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-13 02:26:37,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 293 transitions, 5877 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:26:37,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:37,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-13 02:26:37,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:38,097 INFO L130 PetriNetUnfolder]: 1512/2713 cut-off events. [2022-12-13 02:26:38,097 INFO L131 PetriNetUnfolder]: For 80302/80302 co-relation queries the response was YES. [2022-12-13 02:26:38,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25520 conditions, 2713 events. 1512/2713 cut-off events. For 80302/80302 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 16924 event pairs, 612 based on Foata normal form. 4/2713 useless extension candidates. Maximal degree in co-relation 23957. Up to 2491 conditions per place. [2022-12-13 02:26:38,120 INFO L137 encePairwiseOnDemand]: 38/63 looper letters, 226 selfloop transitions, 91 changer transitions 3/320 dead transitions. [2022-12-13 02:26:38,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 320 transitions, 6882 flow [2022-12-13 02:26:38,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:38,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:38,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2022-12-13 02:26:38,121 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2698412698412698 [2022-12-13 02:26:38,121 INFO L175 Difference]: Start difference. First operand has 172 places, 293 transitions, 5877 flow. Second operand 5 states and 85 transitions. [2022-12-13 02:26:38,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 320 transitions, 6882 flow [2022-12-13 02:26:38,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 320 transitions, 6723 flow, removed 38 selfloop flow, removed 3 redundant places. [2022-12-13 02:26:38,294 INFO L231 Difference]: Finished difference. Result has 174 places, 296 transitions, 6044 flow [2022-12-13 02:26:38,294 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=5720, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6044, PETRI_PLACES=174, PETRI_TRANSITIONS=296} [2022-12-13 02:26:38,294 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 153 predicate places. [2022-12-13 02:26:38,295 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:38,295 INFO L89 Accepts]: Start accepts. Operand has 174 places, 296 transitions, 6044 flow [2022-12-13 02:26:38,296 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:38,296 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:38,296 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 296 transitions, 6044 flow [2022-12-13 02:26:38,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 296 transitions, 6044 flow [2022-12-13 02:26:38,407 INFO L130 PetriNetUnfolder]: 338/985 cut-off events. [2022-12-13 02:26:38,408 INFO L131 PetriNetUnfolder]: For 28781/28904 co-relation queries the response was YES. [2022-12-13 02:26:38,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9266 conditions, 985 events. 338/985 cut-off events. For 28781/28904 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 7602 event pairs, 36 based on Foata normal form. 3/954 useless extension candidates. Maximal degree in co-relation 8768. Up to 307 conditions per place. [2022-12-13 02:26:38,420 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 174 places, 296 transitions, 6044 flow [2022-12-13 02:26:38,420 INFO L226 LiptonReduction]: Number of co-enabled transitions 918 [2022-12-13 02:26:38,422 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:26:38,422 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:26:38,422 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 296 transitions, 6044 flow [2022-12-13 02:26:38,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:26:38,422 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:38,422 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:38,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-13 02:26:38,423 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:38,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:38,423 INFO L85 PathProgramCache]: Analyzing trace with hash -503586043, now seen corresponding path program 1 times [2022-12-13 02:26:38,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:38,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273560594] [2022-12-13 02:26:38,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:38,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:38,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:26:38,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:38,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273560594] [2022-12-13 02:26:38,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273560594] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:38,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:38,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:26:38,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101405462] [2022-12-13 02:26:38,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:38,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:26:38,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:38,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:26:38,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:26:38,492 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-13 02:26:38,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 296 transitions, 6044 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:26:38,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:38,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-13 02:26:38,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:39,122 INFO L130 PetriNetUnfolder]: 1566/2850 cut-off events. [2022-12-13 02:26:39,122 INFO L131 PetriNetUnfolder]: For 84308/84308 co-relation queries the response was YES. [2022-12-13 02:26:39,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26731 conditions, 2850 events. 1566/2850 cut-off events. For 84308/84308 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 18284 event pairs, 666 based on Foata normal form. 2/2848 useless extension candidates. Maximal degree in co-relation 25244. Up to 2564 conditions per place. [2022-12-13 02:26:39,145 INFO L137 encePairwiseOnDemand]: 46/63 looper letters, 288 selfloop transitions, 33 changer transitions 4/325 dead transitions. [2022-12-13 02:26:39,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 325 transitions, 7121 flow [2022-12-13 02:26:39,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:39,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:39,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2022-12-13 02:26:39,146 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2698412698412698 [2022-12-13 02:26:39,146 INFO L175 Difference]: Start difference. First operand has 174 places, 296 transitions, 6044 flow. Second operand 5 states and 85 transitions. [2022-12-13 02:26:39,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 325 transitions, 7121 flow [2022-12-13 02:26:39,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 325 transitions, 7026 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-12-13 02:26:39,343 INFO L231 Difference]: Finished difference. Result has 178 places, 302 transitions, 6180 flow [2022-12-13 02:26:39,344 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=5917, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6180, PETRI_PLACES=178, PETRI_TRANSITIONS=302} [2022-12-13 02:26:39,344 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 157 predicate places. [2022-12-13 02:26:39,344 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:39,344 INFO L89 Accepts]: Start accepts. Operand has 178 places, 302 transitions, 6180 flow [2022-12-13 02:26:39,345 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:39,346 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:39,346 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 302 transitions, 6180 flow [2022-12-13 02:26:39,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 178 places, 302 transitions, 6180 flow [2022-12-13 02:26:39,481 INFO L130 PetriNetUnfolder]: 340/1026 cut-off events. [2022-12-13 02:26:39,482 INFO L131 PetriNetUnfolder]: For 31647/31762 co-relation queries the response was YES. [2022-12-13 02:26:39,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9766 conditions, 1026 events. 340/1026 cut-off events. For 31647/31762 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 8187 event pairs, 39 based on Foata normal form. 3/998 useless extension candidates. Maximal degree in co-relation 9190. Up to 317 conditions per place. [2022-12-13 02:26:39,495 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 178 places, 302 transitions, 6180 flow [2022-12-13 02:26:39,495 INFO L226 LiptonReduction]: Number of co-enabled transitions 928 [2022-12-13 02:26:39,496 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:26:39,497 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 153 [2022-12-13 02:26:39,497 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 302 transitions, 6180 flow [2022-12-13 02:26:39,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:26:39,497 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:39,497 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:39,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-13 02:26:39,497 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:39,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:39,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1246792088, now seen corresponding path program 1 times [2022-12-13 02:26:39,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:39,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761464435] [2022-12-13 02:26:39,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:39,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:39,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:26:39,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:39,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761464435] [2022-12-13 02:26:39,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761464435] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:39,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:39,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:26:39,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392797537] [2022-12-13 02:26:39,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:39,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:26:39,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:39,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:26:39,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:26:39,643 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-13 02:26:39,643 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 302 transitions, 6180 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:26:39,643 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:39,643 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-13 02:26:39,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:40,448 INFO L130 PetriNetUnfolder]: 1527/2766 cut-off events. [2022-12-13 02:26:40,449 INFO L131 PetriNetUnfolder]: For 87859/87859 co-relation queries the response was YES. [2022-12-13 02:26:40,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26284 conditions, 2766 events. 1527/2766 cut-off events. For 87859/87859 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 17515 event pairs, 675 based on Foata normal form. 25/2787 useless extension candidates. Maximal degree in co-relation 24650. Up to 2722 conditions per place. [2022-12-13 02:26:40,469 INFO L137 encePairwiseOnDemand]: 56/63 looper letters, 299 selfloop transitions, 12 changer transitions 0/311 dead transitions. [2022-12-13 02:26:40,469 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 311 transitions, 6967 flow [2022-12-13 02:26:40,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:26:40,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:26:40,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-12-13 02:26:40,470 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28174603174603174 [2022-12-13 02:26:40,470 INFO L175 Difference]: Start difference. First operand has 178 places, 302 transitions, 6180 flow. Second operand 4 states and 71 transitions. [2022-12-13 02:26:40,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 311 transitions, 6967 flow [2022-12-13 02:26:40,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 311 transitions, 6861 flow, removed 53 selfloop flow, removed 0 redundant places. [2022-12-13 02:26:40,670 INFO L231 Difference]: Finished difference. Result has 182 places, 303 transitions, 6149 flow [2022-12-13 02:26:40,670 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=6057, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=6149, PETRI_PLACES=182, PETRI_TRANSITIONS=303} [2022-12-13 02:26:40,670 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 161 predicate places. [2022-12-13 02:26:40,670 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:40,671 INFO L89 Accepts]: Start accepts. Operand has 182 places, 303 transitions, 6149 flow [2022-12-13 02:26:40,672 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:40,672 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:40,672 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 303 transitions, 6149 flow [2022-12-13 02:26:40,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 303 transitions, 6149 flow [2022-12-13 02:26:40,791 INFO L130 PetriNetUnfolder]: 338/1009 cut-off events. [2022-12-13 02:26:40,791 INFO L131 PetriNetUnfolder]: For 32146/32258 co-relation queries the response was YES. [2022-12-13 02:26:40,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9677 conditions, 1009 events. 338/1009 cut-off events. For 32146/32258 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 7961 event pairs, 36 based on Foata normal form. 3/982 useless extension candidates. Maximal degree in co-relation 9098. Up to 315 conditions per place. [2022-12-13 02:26:40,802 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 182 places, 303 transitions, 6149 flow [2022-12-13 02:26:40,802 INFO L226 LiptonReduction]: Number of co-enabled transitions 908 [2022-12-13 02:26:40,803 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:26:40,804 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:26:40,804 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 303 transitions, 6149 flow [2022-12-13 02:26:40,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:26:40,804 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:40,804 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:40,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-13 02:26:40,804 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:40,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:40,804 INFO L85 PathProgramCache]: Analyzing trace with hash -426703094, now seen corresponding path program 1 times [2022-12-13 02:26:40,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:40,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435420250] [2022-12-13 02:26:40,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:40,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:40,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:40,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:26:40,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:40,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435420250] [2022-12-13 02:26:40,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435420250] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:40,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:40,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:26:40,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275124457] [2022-12-13 02:26:40,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:40,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:26:40,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:40,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:26:40,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:26:40,878 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-13 02:26:40,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 303 transitions, 6149 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:26:40,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:40,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-13 02:26:40,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:41,529 INFO L130 PetriNetUnfolder]: 1515/2747 cut-off events. [2022-12-13 02:26:41,529 INFO L131 PetriNetUnfolder]: For 89124/89124 co-relation queries the response was YES. [2022-12-13 02:26:41,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26278 conditions, 2747 events. 1515/2747 cut-off events. For 89124/89124 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 17393 event pairs, 646 based on Foata normal form. 12/2755 useless extension candidates. Maximal degree in co-relation 24638. Up to 2666 conditions per place. [2022-12-13 02:26:41,552 INFO L137 encePairwiseOnDemand]: 53/63 looper letters, 288 selfloop transitions, 29 changer transitions 2/319 dead transitions. [2022-12-13 02:26:41,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 319 transitions, 7036 flow [2022-12-13 02:26:41,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:26:41,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:26:41,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-12-13 02:26:41,553 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30952380952380953 [2022-12-13 02:26:41,553 INFO L175 Difference]: Start difference. First operand has 182 places, 303 transitions, 6149 flow. Second operand 4 states and 78 transitions. [2022-12-13 02:26:41,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 319 transitions, 7036 flow [2022-12-13 02:26:41,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 319 transitions, 6967 flow, removed 27 selfloop flow, removed 2 redundant places. [2022-12-13 02:26:41,762 INFO L231 Difference]: Finished difference. Result has 184 places, 306 transitions, 6240 flow [2022-12-13 02:26:41,763 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=6080, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=6240, PETRI_PLACES=184, PETRI_TRANSITIONS=306} [2022-12-13 02:26:41,763 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 163 predicate places. [2022-12-13 02:26:41,763 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:41,763 INFO L89 Accepts]: Start accepts. Operand has 184 places, 306 transitions, 6240 flow [2022-12-13 02:26:41,765 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:41,765 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:41,765 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 184 places, 306 transitions, 6240 flow [2022-12-13 02:26:41,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 184 places, 306 transitions, 6240 flow [2022-12-13 02:26:41,897 INFO L130 PetriNetUnfolder]: 335/1005 cut-off events. [2022-12-13 02:26:41,897 INFO L131 PetriNetUnfolder]: For 33287/33399 co-relation queries the response was YES. [2022-12-13 02:26:41,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9747 conditions, 1005 events. 335/1005 cut-off events. For 33287/33399 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 7947 event pairs, 33 based on Foata normal form. 3/979 useless extension candidates. Maximal degree in co-relation 9166. Up to 316 conditions per place. [2022-12-13 02:26:41,915 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 184 places, 306 transitions, 6240 flow [2022-12-13 02:26:41,915 INFO L226 LiptonReduction]: Number of co-enabled transitions 914 [2022-12-13 02:26:41,916 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:26:41,917 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 154 [2022-12-13 02:26:41,917 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 306 transitions, 6240 flow [2022-12-13 02:26:41,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:26:41,917 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:41,917 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:41,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-13 02:26:41,917 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:41,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:41,918 INFO L85 PathProgramCache]: Analyzing trace with hash 990990126, now seen corresponding path program 1 times [2022-12-13 02:26:41,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:41,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70228242] [2022-12-13 02:26:41,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:41,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:41,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:42,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:26:42,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:42,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70228242] [2022-12-13 02:26:42,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70228242] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:26:42,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117696991] [2022-12-13 02:26:42,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:42,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:26:42,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:26:42,304 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:26:42,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 02:26:42,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:42,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 02:26:42,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:26:42,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:26:42,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:26:44,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:26:44,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117696991] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:26:44,677 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:26:44,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-12-13 02:26:44,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265550587] [2022-12-13 02:26:44,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:26:44,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 02:26:44,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:44,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 02:26:44,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=65, Unknown=1, NotChecked=0, Total=90 [2022-12-13 02:26:44,679 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-13 02:26:44,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 306 transitions, 6240 flow. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:26:44,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:44,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-13 02:26:44,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:47,322 INFO L130 PetriNetUnfolder]: 1593/2866 cut-off events. [2022-12-13 02:26:47,323 INFO L131 PetriNetUnfolder]: For 106438/106438 co-relation queries the response was YES. [2022-12-13 02:26:47,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28223 conditions, 2866 events. 1593/2866 cut-off events. For 106438/106438 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 18151 event pairs, 200 based on Foata normal form. 76/2938 useless extension candidates. Maximal degree in co-relation 26578. Up to 1426 conditions per place. [2022-12-13 02:26:47,344 INFO L137 encePairwiseOnDemand]: 17/63 looper letters, 200 selfloop transitions, 182 changer transitions 2/384 dead transitions. [2022-12-13 02:26:47,344 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 384 transitions, 8335 flow [2022-12-13 02:26:47,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 02:26:47,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 02:26:47,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2022-12-13 02:26:47,345 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.173015873015873 [2022-12-13 02:26:47,345 INFO L175 Difference]: Start difference. First operand has 184 places, 306 transitions, 6240 flow. Second operand 10 states and 109 transitions. [2022-12-13 02:26:47,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 384 transitions, 8335 flow [2022-12-13 02:26:47,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 384 transitions, 8218 flow, removed 26 selfloop flow, removed 2 redundant places. [2022-12-13 02:26:47,542 INFO L231 Difference]: Finished difference. Result has 195 places, 318 transitions, 7025 flow [2022-12-13 02:26:47,542 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=6071, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=171, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7025, PETRI_PLACES=195, PETRI_TRANSITIONS=318} [2022-12-13 02:26:47,543 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 174 predicate places. [2022-12-13 02:26:47,543 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:47,543 INFO L89 Accepts]: Start accepts. Operand has 195 places, 318 transitions, 7025 flow [2022-12-13 02:26:47,544 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:47,544 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:47,544 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 195 places, 318 transitions, 7025 flow [2022-12-13 02:26:47,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 195 places, 318 transitions, 7025 flow [2022-12-13 02:26:47,678 INFO L130 PetriNetUnfolder]: 364/1045 cut-off events. [2022-12-13 02:26:47,679 INFO L131 PetriNetUnfolder]: For 37449/37600 co-relation queries the response was YES. [2022-12-13 02:26:47,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11115 conditions, 1045 events. 364/1045 cut-off events. For 37449/37600 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 8060 event pairs, 31 based on Foata normal form. 9/1026 useless extension candidates. Maximal degree in co-relation 10515. Up to 372 conditions per place. [2022-12-13 02:26:47,691 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 195 places, 318 transitions, 7025 flow [2022-12-13 02:26:47,691 INFO L226 LiptonReduction]: Number of co-enabled transitions 946 [2022-12-13 02:26:47,712 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [739] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_385| v_~f~0.base_271))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_268 (* v_~x2~0_340 4))))) (let ((.cse7 (select .cse0 (+ v_~f~0.offset_268 (* .cse2 4))))) (let ((.cse8 (select .cse0 (+ v_~f~0.offset_268 (* v_~x1~0_392 4)))) (.cse6 (select .cse0 (+ v_~f~0.offset_268 (* .cse7 4))))) (let ((.cse4 (select .cse0 (+ v_~f~0.offset_268 (* .cse6 4)))) (.cse3 (select .cse0 (+ v_~f~0.offset_268 (* .cse8 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_268 (* .cse3 4)))) (.cse5 (select .cse0 (+ v_~f~0.offset_268 (* .cse4 4))))) (and (< 3 (mod (* 3 v_~n~0_255) 4294967296)) (= (select .cse0 (+ v_~f~0.offset_268 (* .cse1 4))) v_~x1~0_391) (not (= (ite (and (< .cse2 v_~size~0_269) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_392 v_~size~0_269) (<= 0 v_~x1~0_392)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_205| 0)) (not (= (ite (and (< .cse3 v_~size~0_269) (<= 0 .cse3)) 1 0) 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_269)) 1 0) 0)) (= v_~x2~0_338 (select .cse0 (+ v_~f~0.offset_268 (* .cse5 4)))) (not (= (ite (and (< .cse6 v_~size~0_269) (<= 0 .cse6)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_340) (< v_~x2~0_340 v_~size~0_269)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_289| 4) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_200| 0)) (= (ite (and (< .cse1 v_~size~0_269) (<= 0 .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_189|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_168| (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_269)) 1 0)) (not (= (ite (and (< .cse7 v_~size~0_269) (<= 0 .cse7)) 1 0) 0)) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_269)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_168| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_200|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_189| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_205|) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_238|)))))))) InVars {~x2~0=v_~x2~0_340, ~size~0=v_~size~0_269, ~f~0.base=v_~f~0.base_271, #memory_int=|v_#memory_int_385|, ~n~0=v_~n~0_255, ~x1~0=v_~x1~0_392, ~f~0.offset=v_~f~0.offset_268} OutVars{~x2~0=v_~x2~0_338, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_197|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_160|, ~size~0=v_~size~0_269, ~f~0.base=v_~f~0.base_271, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_132|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_168|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_238|, ~x1~0=v_~x1~0_391, ~f~0.offset=v_~f~0.offset_268, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_200|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_189|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_124|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_289|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_122|, #memory_int=|v_#memory_int_385|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_205|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_132|, ~n~0=v_~n~0_255, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_136|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_207|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:26:49,557 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [752] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse4 (select |v_#memory_int_410| v_~f~0.base_291))) (let ((.cse1 (select .cse4 (+ v_~f~0.offset_288 (* v_~x2~0_390 4))))) (let ((.cse9 (select .cse4 (+ v_~f~0.offset_288 (* 4 .cse1))))) (let ((.cse8 (select .cse4 (+ v_~f~0.offset_288 (* v_~x1~0_430 4)))) (.cse3 (select .cse4 (+ v_~f~0.offset_288 (* .cse9 4))))) (let ((.cse6 (select .cse4 (+ v_~f~0.offset_288 (* .cse3 4)))) (.cse0 (select .cse4 (+ v_~f~0.offset_288 (* .cse8 4))))) (let ((.cse5 (select .cse4 (+ v_~f~0.offset_288 (* .cse0 4)))) (.cse2 (mod (* 3 v_~n~0_275) 4294967296)) (.cse7 (select .cse4 (+ v_~f~0.offset_288 (* .cse6 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_289)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_289) (<= 0 .cse1)) 1 0) 0)) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_58|) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_278|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_215| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_231|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_202| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_234|) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_278| 4294967296) .cse2)) (not (= (ite (and (< .cse3 v_~size~0_289) (<= 0 .cse3)) 1 0) 0)) (= (select .cse4 (+ v_~f~0.offset_288 (* .cse5 4))) v_~x1~0_429) (not (= 0 (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_289)) 1 0))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_202| (ite (and (< .cse7 v_~size~0_289) (<= 0 .cse7)) 1 0)) (not (= (ite (and (< .cse8 v_~size~0_289) (<= 0 .cse8)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_234| 0)) (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_289)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_215|) (not (= (ite (and (< .cse9 v_~size~0_289) (<= 0 .cse9)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_324| 4) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_231| 0)) (not (= (ite (and (<= 0 v_~x1~0_430) (< v_~x1~0_430 v_~size~0_289)) 1 0) 0)) (< 3 .cse2) (= |v_thread2Thread1of1ForFork1_#res#1.offset_58| 0) (= (select .cse4 (+ v_~f~0.offset_288 (* .cse7 4))) v_~x2~0_389) (not (= (ite (and (<= 0 v_~x2~0_390) (< v_~x2~0_390 v_~size~0_289)) 1 0) 0))))))))) InVars {~x2~0=v_~x2~0_390, ~size~0=v_~size~0_289, ~f~0.base=v_~f~0.base_291, #memory_int=|v_#memory_int_410|, ~n~0=v_~n~0_275, ~x1~0=v_~x1~0_430, ~f~0.offset=v_~f~0.offset_288} OutVars{~x2~0=v_~x2~0_389, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_223|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_194|, ~size~0=v_~size~0_289, ~f~0.base=v_~f~0.base_291, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_58|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_166|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_202|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_278|, ~x1~0=v_~x1~0_429, ~f~0.offset=v_~f~0.offset_288, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_234|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_215|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_58|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_158|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_324|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_156|, #memory_int=|v_#memory_int_410|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_231|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_166|, ~n~0=v_~n~0_275, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_170|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_233|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:26:50,294 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 02:26:50,294 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2751 [2022-12-13 02:26:50,295 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 317 transitions, 7081 flow [2022-12-13 02:26:50,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:26:50,295 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:50,295 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:50,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-13 02:26:50,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:26:50,503 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:50,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:50,504 INFO L85 PathProgramCache]: Analyzing trace with hash 2125586523, now seen corresponding path program 2 times [2022-12-13 02:26:50,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:50,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823172002] [2022-12-13 02:26:50,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:50,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:50,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:26:50,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:50,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823172002] [2022-12-13 02:26:50,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823172002] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:26:50,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:26:50,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:26:50,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027943468] [2022-12-13 02:26:50,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:26:50,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:26:50,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:50,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:26:50,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:26:50,572 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 64 [2022-12-13 02:26:50,573 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 317 transitions, 7081 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:26:50,573 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:50,573 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 64 [2022-12-13 02:26:50,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:51,321 INFO L130 PetriNetUnfolder]: 1614/2943 cut-off events. [2022-12-13 02:26:51,321 INFO L131 PetriNetUnfolder]: For 108263/108263 co-relation queries the response was YES. [2022-12-13 02:26:51,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30723 conditions, 2943 events. 1614/2943 cut-off events. For 108263/108263 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 18871 event pairs, 654 based on Foata normal form. 4/2943 useless extension candidates. Maximal degree in co-relation 29037. Up to 2754 conditions per place. [2022-12-13 02:26:51,347 INFO L137 encePairwiseOnDemand]: 43/64 looper letters, 298 selfloop transitions, 44 changer transitions 3/345 dead transitions. [2022-12-13 02:26:51,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 345 transitions, 8325 flow [2022-12-13 02:26:51,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:26:51,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:26:51,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-12-13 02:26:51,348 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.253125 [2022-12-13 02:26:51,348 INFO L175 Difference]: Start difference. First operand has 194 places, 317 transitions, 7081 flow. Second operand 5 states and 81 transitions. [2022-12-13 02:26:51,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 345 transitions, 8325 flow [2022-12-13 02:26:51,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 345 transitions, 7897 flow, removed 161 selfloop flow, removed 4 redundant places. [2022-12-13 02:26:51,627 INFO L231 Difference]: Finished difference. Result has 195 places, 321 transitions, 6956 flow [2022-12-13 02:26:51,627 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=6713, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6956, PETRI_PLACES=195, PETRI_TRANSITIONS=321} [2022-12-13 02:26:51,627 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 174 predicate places. [2022-12-13 02:26:51,627 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:51,627 INFO L89 Accepts]: Start accepts. Operand has 195 places, 321 transitions, 6956 flow [2022-12-13 02:26:51,629 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:51,629 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:51,629 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 195 places, 321 transitions, 6956 flow [2022-12-13 02:26:51,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 194 places, 321 transitions, 6956 flow [2022-12-13 02:26:51,774 INFO L130 PetriNetUnfolder]: 373/1100 cut-off events. [2022-12-13 02:26:51,775 INFO L131 PetriNetUnfolder]: For 34084/34214 co-relation queries the response was YES. [2022-12-13 02:26:51,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10934 conditions, 1100 events. 373/1100 cut-off events. For 34084/34214 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 8652 event pairs, 30 based on Foata normal form. 10/1086 useless extension candidates. Maximal degree in co-relation 10340. Up to 387 conditions per place. [2022-12-13 02:26:51,790 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 194 places, 321 transitions, 6956 flow [2022-12-13 02:26:51,790 INFO L226 LiptonReduction]: Number of co-enabled transitions 938 [2022-12-13 02:26:52,472 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [694] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_289| v_~f~0.base_195))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_192 (* v_~x2~0_249 4))))) (let ((.cse6 (select .cse0 (+ v_~f~0.offset_192 (* .cse3 4))))) (let ((.cse2 (select .cse0 (+ (* .cse6 4) v_~f~0.offset_192)))) (let ((.cse5 (select .cse0 (+ v_~f~0.offset_192 (* .cse2 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_192 (* v_~x1~0_260 4)))) (.cse4 (select .cse0 (+ v_~f~0.offset_192 (* .cse5 4))))) (and (= v_~x1~0_258 (select .cse0 (+ v_~f~0.offset_192 (* .cse1 4)))) (< 3 (mod (* 3 v_~n~0_181) 4294967296)) (not (= (ite (and (<= 0 v_~x1~0_260) (< v_~x1~0_260 v_~size~0_195)) 1 0) 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_195)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_112| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_128|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_119| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_151|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_128| 0)) (not (= (ite (and (< .cse3 v_~size~0_195) (<= 0 .cse3)) 1 0) 0)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_151|) (= (select .cse0 (+ (* 4 .cse4) v_~f~0.offset_192)) v_~x2~0_248) (not (= (ite (and (< .cse5 v_~size~0_195) (<= 0 .cse5)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_195)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_112|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_151| 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_195)) 1 0) 0)) (not (= 0 (ite (and (<= 0 v_~x2~0_249) (< v_~x2~0_249 v_~size~0_195)) 1 0))) (= |v_thread1Thread1of1ForFork0_~i~0#1_173| 2) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_119| (ite (and (< .cse4 v_~size~0_195) (<= 0 .cse4)) 1 0))))))))) InVars {~x2~0=v_~x2~0_249, ~size~0=v_~size~0_195, ~f~0.base=v_~f~0.base_195, #memory_int=|v_#memory_int_289|, ~n~0=v_~n~0_181, ~x1~0=v_~x1~0_260, ~f~0.offset=v_~f~0.offset_192} OutVars{~x2~0=v_~x2~0_248, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_120|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_111|, ~size~0=v_~size~0_195, ~f~0.base=v_~f~0.base_195, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_83|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_119|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_151|, ~x1~0=v_~x1~0_258, ~f~0.offset=v_~f~0.offset_192, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_151|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_112|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_75|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_173|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_73|, #memory_int=|v_#memory_int_289|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_128|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_83|, ~n~0=v_~n~0_181, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_87|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_130|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:26:52,933 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [735] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse0 (select |v_#memory_int_376| v_~f~0.base_265))) (let ((.cse5 (select .cse0 (+ v_~f~0.offset_262 (* v_~x2~0_327 4))))) (let ((.cse4 (select .cse0 (+ v_~f~0.offset_262 (* .cse5 4))))) (let ((.cse6 (select .cse0 (+ v_~f~0.offset_262 (* 4 .cse4))))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_262 (* .cse6 4))))) (let ((.cse3 (mod (* 3 v_~n~0_249) 4294967296)) (.cse1 (select .cse0 (+ v_~f~0.offset_262 (* .cse2 4))))) (and (= (select .cse0 (+ v_~f~0.offset_262 (* .cse1 4))) v_~x2~0_326) (not (= (ite (and (< .cse2 v_~size~0_263) (<= 0 .cse2)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_161| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_193|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_193| 0)) (< 3 .cse3) (not (= (ite (and (<= 0 v_~x2~0_327) (< v_~x2~0_327 v_~size~0_263)) 1 0) 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_263)) 1 0) 0)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_231|) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_231| 4294967296) .cse3)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_161| (ite (and (< .cse1 v_~size~0_263) (<= 0 .cse1)) 1 0)) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_46|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_46| 0) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_263)) 1 0) 0)) (not (= 0 (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_263)) 1 0)))))))))) InVars {~x2~0=v_~x2~0_327, ~size~0=v_~size~0_263, ~f~0.base=v_~f~0.base_265, #memory_int=|v_#memory_int_376|, ~n~0=v_~n~0_249, ~f~0.offset=v_~f~0.offset_262} OutVars{~x2~0=v_~x2~0_326, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_153|, ~size~0=v_~size~0_263, ~f~0.base=v_~f~0.base_265, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_46|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_125|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_161|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_231|, ~f~0.offset=v_~f~0.offset_262, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_193|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_46|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_117|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_115|, #memory_int=|v_#memory_int_376|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_125|, ~n~0=v_~n~0_249, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [649] $Ultimate##0-->L49-2: Formula: (and (= (ite (and (< v_~x1~0_89 v_~size~0_105) (<= 0 v_~x1~0_89)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_~i~0#1_53| 1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_53| 4294967295) 4294967296) (mod (* v_~n~0_84 3) 4294967296)) (= (select (select |v_#memory_int_141| v_~f~0.base_99) (+ v_~f~0.offset_99 (* v_~x1~0_89 4))) v_~x1~0_88)) InVars {~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, #memory_int=|v_#memory_int_141|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_89, ~f~0.offset=v_~f~0.offset_99} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_29|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_53|, #memory_int=|v_#memory_int_141|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, ~n~0=v_~n~0_84, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_39|, ~x1~0=v_~x1~0_88, ~f~0.offset=v_~f~0.offset_99} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:26:53,347 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 02:26:53,348 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1721 [2022-12-13 02:26:53,348 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 320 transitions, 6998 flow [2022-12-13 02:26:53,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:26:53,348 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:53,348 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:53,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-13 02:26:53,349 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:53,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:53,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1492128762, now seen corresponding path program 1 times [2022-12-13 02:26:53,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:53,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388448751] [2022-12-13 02:26:53,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:53,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:53,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:55,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:26:55,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:55,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388448751] [2022-12-13 02:26:55,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388448751] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:26:55,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508535367] [2022-12-13 02:26:55,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:55,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:26:55,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:26:55,675 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:26:55,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 02:26:55,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:55,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 02:26:55,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:26:55,876 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:26:55,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 15 case distinctions, treesize of input 95 treesize of output 162 [2022-12-13 02:26:56,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:26:56,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:26:57,658 INFO L321 Elim1Store]: treesize reduction 30, result has 95.1 percent of original size [2022-12-13 02:26:57,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 22 new quantified variables, introduced 66 case distinctions, treesize of input 99 treesize of output 666 [2022-12-13 02:27:09,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:27:09,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508535367] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:27:09,560 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:27:09,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 2] total 7 [2022-12-13 02:27:09,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277146475] [2022-12-13 02:27:09,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:27:09,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 02:27:09,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:27:09,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 02:27:09,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-13 02:27:09,560 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 65 [2022-12-13 02:27:09,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 320 transitions, 6998 flow. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states 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 02:27:09,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:27:09,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 65 [2022-12-13 02:27:09,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:27:10,578 INFO L130 PetriNetUnfolder]: 1655/3014 cut-off events. [2022-12-13 02:27:10,578 INFO L131 PetriNetUnfolder]: For 103365/103365 co-relation queries the response was YES. [2022-12-13 02:27:10,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30237 conditions, 3014 events. 1655/3014 cut-off events. For 103365/103365 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 19457 event pairs, 625 based on Foata normal form. 3/3013 useless extension candidates. Maximal degree in co-relation 28577. Up to 2852 conditions per place. [2022-12-13 02:27:10,686 INFO L137 encePairwiseOnDemand]: 30/65 looper letters, 268 selfloop transitions, 76 changer transitions 1/345 dead transitions. [2022-12-13 02:27:10,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 345 transitions, 8102 flow [2022-12-13 02:27:10,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 02:27:10,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 02:27:10,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2022-12-13 02:27:10,687 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2 [2022-12-13 02:27:10,687 INFO L175 Difference]: Start difference. First operand has 193 places, 320 transitions, 6998 flow. Second operand 7 states and 91 transitions. [2022-12-13 02:27:10,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 345 transitions, 8102 flow [2022-12-13 02:27:10,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 345 transitions, 7867 flow, removed 81 selfloop flow, removed 4 redundant places. [2022-12-13 02:27:10,920 INFO L231 Difference]: Finished difference. Result has 197 places, 328 transitions, 7240 flow [2022-12-13 02:27:10,921 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=6802, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7240, PETRI_PLACES=197, PETRI_TRANSITIONS=328} [2022-12-13 02:27:10,921 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 176 predicate places. [2022-12-13 02:27:10,921 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:27:10,921 INFO L89 Accepts]: Start accepts. Operand has 197 places, 328 transitions, 7240 flow [2022-12-13 02:27:10,924 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:27:10,924 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:27:10,924 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 328 transitions, 7240 flow [2022-12-13 02:27:10,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 197 places, 328 transitions, 7240 flow [2022-12-13 02:27:11,073 INFO L130 PetriNetUnfolder]: 383/1136 cut-off events. [2022-12-13 02:27:11,073 INFO L131 PetriNetUnfolder]: For 36148/36279 co-relation queries the response was YES. [2022-12-13 02:27:11,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11329 conditions, 1136 events. 383/1136 cut-off events. For 36148/36279 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 9049 event pairs, 32 based on Foata normal form. 10/1122 useless extension candidates. Maximal degree in co-relation 10738. Up to 398 conditions per place. [2022-12-13 02:27:11,089 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 197 places, 328 transitions, 7240 flow [2022-12-13 02:27:11,089 INFO L226 LiptonReduction]: Number of co-enabled transitions 962 [2022-12-13 02:27:11,091 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:27:11,091 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-13 02:27:11,091 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 328 transitions, 7240 flow [2022-12-13 02:27:11,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states 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 02:27:11,092 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:27:11,092 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:27:11,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-13 02:27:11,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:27:11,297 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:27:11,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:27:11,297 INFO L85 PathProgramCache]: Analyzing trace with hash -520552696, now seen corresponding path program 2 times [2022-12-13 02:27:11,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:27:11,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538640674] [2022-12-13 02:27:11,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:27:11,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:27:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:27:11,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:27:11,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:27:11,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538640674] [2022-12-13 02:27:11,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538640674] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:27:11,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:27:11,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 02:27:11,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515694686] [2022-12-13 02:27:11,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:27:11,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:27:11,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:27:11,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:27:11,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:27:11,372 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 65 [2022-12-13 02:27:11,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 328 transitions, 7240 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:27:11,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:27:11,372 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 65 [2022-12-13 02:27:11,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:27:12,207 INFO L130 PetriNetUnfolder]: 1646/3007 cut-off events. [2022-12-13 02:27:12,207 INFO L131 PetriNetUnfolder]: For 99142/99142 co-relation queries the response was YES. [2022-12-13 02:27:12,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30131 conditions, 3007 events. 1646/3007 cut-off events. For 99142/99142 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 19397 event pairs, 595 based on Foata normal form. 8/3011 useless extension candidates. Maximal degree in co-relation 28485. Up to 2468 conditions per place. [2022-12-13 02:27:12,232 INFO L137 encePairwiseOnDemand]: 31/65 looper letters, 214 selfloop transitions, 152 changer transitions 0/366 dead transitions. [2022-12-13 02:27:12,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 366 transitions, 8480 flow [2022-12-13 02:27:12,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 02:27:12,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 02:27:12,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2022-12-13 02:27:12,233 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.18803418803418803 [2022-12-13 02:27:12,234 INFO L175 Difference]: Start difference. First operand has 197 places, 328 transitions, 7240 flow. Second operand 9 states and 110 transitions. [2022-12-13 02:27:12,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 366 transitions, 8480 flow [2022-12-13 02:27:12,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 366 transitions, 8369 flow, removed 38 selfloop flow, removed 2 redundant places. [2022-12-13 02:27:12,475 INFO L231 Difference]: Finished difference. Result has 206 places, 331 transitions, 7616 flow [2022-12-13 02:27:12,476 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=7115, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7616, PETRI_PLACES=206, PETRI_TRANSITIONS=331} [2022-12-13 02:27:12,476 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 185 predicate places. [2022-12-13 02:27:12,476 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:27:12,476 INFO L89 Accepts]: Start accepts. Operand has 206 places, 331 transitions, 7616 flow [2022-12-13 02:27:12,478 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:27:12,478 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:27:12,478 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 206 places, 331 transitions, 7616 flow [2022-12-13 02:27:12,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 206 places, 331 transitions, 7616 flow [2022-12-13 02:27:12,620 INFO L130 PetriNetUnfolder]: 376/1118 cut-off events. [2022-12-13 02:27:12,620 INFO L131 PetriNetUnfolder]: For 37296/37447 co-relation queries the response was YES. [2022-12-13 02:27:12,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11487 conditions, 1118 events. 376/1118 cut-off events. For 37296/37447 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 8906 event pairs, 35 based on Foata normal form. 7/1095 useless extension candidates. Maximal degree in co-relation 10865. Up to 396 conditions per place. [2022-12-13 02:27:12,635 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 206 places, 331 transitions, 7616 flow [2022-12-13 02:27:12,635 INFO L226 LiptonReduction]: Number of co-enabled transitions 966 [2022-12-13 02:27:12,652 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [757] $Ultimate##0-->L49-2: Formula: (let ((.cse5 (select |v_#memory_int_416| v_~f~0.base_297))) (let ((.cse1 (select .cse5 (+ v_~f~0.offset_294 (* v_~x2~0_404 4))))) (let ((.cse2 (select .cse5 (+ v_~f~0.offset_294 (* .cse1 4))))) (let ((.cse6 (select .cse5 (+ v_~f~0.offset_294 (* .cse2 4))))) (let ((.cse4 (select .cse5 (+ v_~f~0.offset_294 (* v_~x1~0_445 4)))) (.cse7 (select .cse5 (+ v_~f~0.offset_294 (* .cse6 4))))) (let ((.cse3 (select .cse5 (+ v_~f~0.offset_294 (* .cse7 4)))) (.cse0 (select .cse5 (+ (* .cse4 4) v_~f~0.offset_294)))) (and (not (= (ite (and (<= 0 v_~x2~0_404) (< v_~x2~0_404 v_~size~0_295)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_223| (ite (and (< .cse0 v_~size~0_295) (<= 0 .cse0)) 1 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_295)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_332| 3) (not (= (ite (and (< .cse2 v_~size~0_295) (<= 0 .cse2)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_210| (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_295)) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_239| 0)) (not (= (ite (and (<= 0 v_~x1~0_445) (< v_~x1~0_445 v_~size~0_295)) 1 0) 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_295)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_210| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_242|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_242| 0)) (< 3 (mod (* 3 v_~n~0_281) 4294967296)) (= v_~x2~0_403 (select .cse5 (+ v_~f~0.offset_294 (* .cse3 4)))) (= v_~x1~0_443 (select .cse5 (+ v_~f~0.offset_294 (* .cse0 4)))) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_295)) 1 0) 0)) (not (= (ite (and (< .cse7 v_~size~0_295) (<= 0 .cse7)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_223| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_239|) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_286|)))))))) InVars {~x2~0=v_~x2~0_404, ~size~0=v_~size~0_295, ~f~0.base=v_~f~0.base_297, #memory_int=|v_#memory_int_416|, ~n~0=v_~n~0_281, ~x1~0=v_~x1~0_445, ~f~0.offset=v_~f~0.offset_294} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_231|, ~x2~0=v_~x2~0_403, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_202|, ~size~0=v_~size~0_295, ~f~0.base=v_~f~0.base_297, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_174|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_210|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_286|, ~x1~0=v_~x1~0_443, ~f~0.offset=v_~f~0.offset_294, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_242|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_223|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_166|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_332|, #memory_int=|v_#memory_int_416|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_239|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_164|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_174|, ~n~0=v_~n~0_281, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_241|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_178|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:27:13,979 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:27:13,980 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1504 [2022-12-13 02:27:13,980 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 331 transitions, 7668 flow [2022-12-13 02:27:13,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:27:13,980 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:27:13,980 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:27:13,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-13 02:27:13,980 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:27:13,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:27:13,981 INFO L85 PathProgramCache]: Analyzing trace with hash 237832580, now seen corresponding path program 1 times [2022-12-13 02:27:13,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:27:13,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136441461] [2022-12-13 02:27:13,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:27:13,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:27:13,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:27:14,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:27:14,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:27:14,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136441461] [2022-12-13 02:27:14,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136441461] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:27:14,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427628225] [2022-12-13 02:27:14,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:27:14,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:27:14,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:27:14,052 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:27:14,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 02:27:14,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:27:14,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 02:27:14,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:27:14,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:27:14,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:27:14,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:27:14,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427628225] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:27:14,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:27:14,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-13 02:27:14,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250679345] [2022-12-13 02:27:14,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:27:14,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 02:27:14,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:27:14,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 02:27:14,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-12-13 02:27:14,243 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 67 [2022-12-13 02:27:14,243 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 331 transitions, 7668 flow. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:27:14,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:27:14,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 67 [2022-12-13 02:27:14,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:27:15,791 INFO L130 PetriNetUnfolder]: 1696/3092 cut-off events. [2022-12-13 02:27:15,791 INFO L131 PetriNetUnfolder]: For 103508/103508 co-relation queries the response was YES. [2022-12-13 02:27:15,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31686 conditions, 3092 events. 1696/3092 cut-off events. For 103508/103508 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 20073 event pairs, 534 based on Foata normal form. 8/3096 useless extension candidates. Maximal degree in co-relation 29869. Up to 2666 conditions per place. [2022-12-13 02:27:15,822 INFO L137 encePairwiseOnDemand]: 38/67 looper letters, 288 selfloop transitions, 98 changer transitions 1/387 dead transitions. [2022-12-13 02:27:15,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 387 transitions, 9573 flow [2022-12-13 02:27:15,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 02:27:15,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 02:27:15,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 113 transitions. [2022-12-13 02:27:15,830 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.14054726368159204 [2022-12-13 02:27:15,830 INFO L175 Difference]: Start difference. First operand has 206 places, 331 transitions, 7668 flow. Second operand 12 states and 113 transitions. [2022-12-13 02:27:15,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 387 transitions, 9573 flow [2022-12-13 02:27:16,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 387 transitions, 9359 flow, removed 26 selfloop flow, removed 2 redundant places. [2022-12-13 02:27:16,127 INFO L231 Difference]: Finished difference. Result has 219 places, 340 transitions, 7919 flow [2022-12-13 02:27:16,128 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=7454, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7919, PETRI_PLACES=219, PETRI_TRANSITIONS=340} [2022-12-13 02:27:16,128 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 198 predicate places. [2022-12-13 02:27:16,128 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:27:16,128 INFO L89 Accepts]: Start accepts. Operand has 219 places, 340 transitions, 7919 flow [2022-12-13 02:27:16,130 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:27:16,130 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:27:16,131 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 219 places, 340 transitions, 7919 flow [2022-12-13 02:27:16,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 218 places, 340 transitions, 7919 flow [2022-12-13 02:27:16,346 INFO L130 PetriNetUnfolder]: 389/1146 cut-off events. [2022-12-13 02:27:16,346 INFO L131 PetriNetUnfolder]: For 39748/39900 co-relation queries the response was YES. [2022-12-13 02:27:16,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12055 conditions, 1146 events. 389/1146 cut-off events. For 39748/39900 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 9178 event pairs, 37 based on Foata normal form. 9/1127 useless extension candidates. Maximal degree in co-relation 11343. Up to 415 conditions per place. [2022-12-13 02:27:16,364 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 218 places, 340 transitions, 7919 flow [2022-12-13 02:27:16,364 INFO L226 LiptonReduction]: Number of co-enabled transitions 1002 [2022-12-13 02:27:16,923 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [669] L59-2-->L59-2: Formula: (let ((.cse5 (select |v_#memory_int_251| v_~f~0.base_163))) (let ((.cse4 (select .cse5 (+ v_~f~0.offset_160 (* v_~x2~0_204 4))))) (let ((.cse3 (select .cse5 (+ v_~f~0.offset_160 (* .cse4 4))))) (let ((.cse0 (select .cse5 (+ v_~f~0.offset_160 (* 4 .cse3))))) (let ((.cse6 (select .cse5 (+ v_~f~0.offset_160 (* .cse0 4))))) (let ((.cse1 (mod (* 3 v_~n~0_149) 4294967296)) (.cse2 (select .cse5 (+ v_~f~0.offset_160 (* .cse6 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_163) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_123| 4294967296) .cse1) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_163)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (< v_~x2~0_204 v_~size~0_163) (<= 0 v_~x2~0_204)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_163)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_163)) 1 0) 0)) (< (mod (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_123|) 4294967296) .cse1) (= |v_thread2Thread1of1ForFork1_~i~1#1_121| (+ 6 |v_thread2Thread1of1ForFork1_~i~1#1_123|)) (= v_~x2~0_202 (select .cse5 (+ v_~f~0.offset_160 (* 4 .cse2)))) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_163)) 1 0) 0))))))))) InVars {~x2~0=v_~x2~0_204, ~size~0=v_~size~0_163, ~f~0.base=v_~f~0.base_163, #memory_int=|v_#memory_int_251|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_123|, ~n~0=v_~n~0_149, ~f~0.offset=v_~f~0.offset_160} OutVars{~x2~0=v_~x2~0_202, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_85|, ~size~0=v_~size~0_163, ~f~0.base=v_~f~0.base_163, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_57|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_121|, ~f~0.offset=v_~f~0.offset_160, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_49|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_47|, #memory_int=|v_#memory_int_251|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_57|, ~n~0=v_~n~0_149, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_61|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:27:17,370 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [669] L59-2-->L59-2: Formula: (let ((.cse5 (select |v_#memory_int_251| v_~f~0.base_163))) (let ((.cse4 (select .cse5 (+ v_~f~0.offset_160 (* v_~x2~0_204 4))))) (let ((.cse3 (select .cse5 (+ v_~f~0.offset_160 (* .cse4 4))))) (let ((.cse0 (select .cse5 (+ v_~f~0.offset_160 (* 4 .cse3))))) (let ((.cse6 (select .cse5 (+ v_~f~0.offset_160 (* .cse0 4))))) (let ((.cse1 (mod (* 3 v_~n~0_149) 4294967296)) (.cse2 (select .cse5 (+ v_~f~0.offset_160 (* .cse6 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_163) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_123| 4294967296) .cse1) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_163)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (< v_~x2~0_204 v_~size~0_163) (<= 0 v_~x2~0_204)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_163)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_163)) 1 0) 0)) (< (mod (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_123|) 4294967296) .cse1) (= |v_thread2Thread1of1ForFork1_~i~1#1_121| (+ 6 |v_thread2Thread1of1ForFork1_~i~1#1_123|)) (= v_~x2~0_202 (select .cse5 (+ v_~f~0.offset_160 (* 4 .cse2)))) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_163)) 1 0) 0))))))))) InVars {~x2~0=v_~x2~0_204, ~size~0=v_~size~0_163, ~f~0.base=v_~f~0.base_163, #memory_int=|v_#memory_int_251|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_123|, ~n~0=v_~n~0_149, ~f~0.offset=v_~f~0.offset_160} OutVars{~x2~0=v_~x2~0_202, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_85|, ~size~0=v_~size~0_163, ~f~0.base=v_~f~0.base_163, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_57|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_121|, ~f~0.offset=v_~f~0.offset_160, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_49|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_47|, #memory_int=|v_#memory_int_251|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_57|, ~n~0=v_~n~0_149, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_61|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:27:18,246 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [759] $Ultimate##0-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_421| v_~f~0.base_301))) (let ((.cse10 (select .cse2 (+ v_~f~0.offset_298 (* v_~x2~0_415 4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_298 (* 4 .cse10))))) (let ((.cse5 (select .cse2 (+ v_~f~0.offset_298 (* .cse0 4))))) (let ((.cse6 (select .cse2 (+ v_~f~0.offset_298 (* .cse5 4))))) (let ((.cse9 (select .cse2 (+ v_~f~0.offset_298 (* .cse6 4))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_298 (* .cse9 4))))) (let ((.cse4 (select .cse2 (+ v_~f~0.offset_298 (* .cse1 4)))) (.cse8 (select .cse2 (+ v_~f~0.offset_298 (* v_~x1~0_458 4))))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_298 (* .cse8 4)))) (.cse7 (select .cse2 (+ v_~f~0.offset_298 (* .cse4 4))))) (and (< 6 (mod (* 3 v_~n~0_285) 4294967296)) (not (= (ite (and (< .cse0 v_~size~0_299) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_415 v_~size~0_299) (<= 0 v_~x2~0_415)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_299)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_248| 0)) (= v_~x1~0_457 (select .cse2 (+ v_~f~0.offset_298 (* .cse3 4)))) (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_299)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_232|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_248| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_232| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_248|) (not (= (ite (and (< .cse4 v_~size~0_299) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_299)) 1 0) 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_299)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_216| (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_299)) 1 0)) (not (= (ite (and (< v_~x1~0_458 v_~size~0_299) (<= 0 v_~x1~0_458)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_341| 3) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_299)) 1 0) 0)) (= (select .cse2 (+ v_~f~0.offset_298 (* .cse7 4))) v_~x2~0_413) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_216| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_248|) (not (= (ite (and (< .cse9 v_~size~0_299) (<= 0 .cse9)) 1 0) 0)) (= 9 |v_thread2Thread1of1ForFork1_~i~1#1_292|) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_299)) 1 0) 0)))))))))))) InVars {~x2~0=v_~x2~0_415, ~size~0=v_~size~0_299, ~f~0.base=v_~f~0.base_301, #memory_int=|v_#memory_int_421|, ~n~0=v_~n~0_285, ~x1~0=v_~x1~0_458, ~f~0.offset=v_~f~0.offset_298} OutVars{~x2~0=v_~x2~0_413, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_240|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_208|, ~size~0=v_~size~0_299, ~f~0.base=v_~f~0.base_301, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_180|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_216|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_292|, ~x1~0=v_~x1~0_457, ~f~0.offset=v_~f~0.offset_298, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_248|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_232|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_172|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_341|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_170|, #memory_int=|v_#memory_int_421|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_248|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_180|, ~n~0=v_~n~0_285, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_184|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_250|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:27:19,202 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [751] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_408| v_~f~0.base_289))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_286 (* v_~x2~0_385 4))))) (let ((.cse5 (select .cse1 (+ v_~f~0.offset_286 (* 4 .cse4))))) (let ((.cse8 (select .cse1 (+ v_~f~0.offset_286 (* .cse5 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_286 (* 4 .cse8))))) (let ((.cse6 (select .cse1 (+ v_~f~0.offset_286 (* .cse2 4))))) (let ((.cse10 (select .cse1 (+ v_~f~0.offset_286 (* v_~x1~0_426 4)))) (.cse9 (select .cse1 (+ v_~f~0.offset_286 (* .cse6 4))))) (let ((.cse11 (select .cse1 (+ v_~f~0.offset_286 (* .cse9 4)))) (.cse3 (select .cse1 (+ v_~f~0.offset_286 (* .cse10 4))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_286 (* 4 .cse3)))) (.cse7 (select .cse1 (+ v_~f~0.offset_286 (* .cse11 4))))) (and (= (ite (and (< .cse0 v_~size~0_287) (<= 0 .cse0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_213|) (= (select .cse1 (+ v_~f~0.offset_286 (* 4 .cse0))) v_~x1~0_425) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_287)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_287)) 1 0) 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_287)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_322| 4) (< 6 (mod (* 3 v_~n~0_273) 4294967296)) (= 9 |v_thread2Thread1of1ForFork1_~i~1#1_274|) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_287)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_229| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_230| 0)) (not (= (ite (and (< v_~x2~0_385 v_~size~0_287) (<= 0 v_~x2~0_385)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_426 v_~size~0_287) (<= 0 v_~x1~0_426)) 1 0) 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_287)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_198| (ite (and (< .cse7 v_~size~0_287) (<= 0 .cse7)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_198| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_230|) (not (= (ite (and (< .cse8 v_~size~0_287) (<= 0 .cse8)) 1 0) 0)) (= v_~x2~0_383 (select .cse1 (+ v_~f~0.offset_286 (* .cse7 4)))) (not (= (ite (and (< .cse9 v_~size~0_287) (<= 0 .cse9)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_213| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_229|) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_287)) 1 0) 0)) (not (= (ite (and (< .cse11 v_~size~0_287) (<= 0 .cse11)) 1 0) 0)))))))))))) InVars {~x2~0=v_~x2~0_385, ~size~0=v_~size~0_287, ~f~0.base=v_~f~0.base_289, #memory_int=|v_#memory_int_408|, ~n~0=v_~n~0_273, ~x1~0=v_~x1~0_426, ~f~0.offset=v_~f~0.offset_286} OutVars{~x2~0=v_~x2~0_383, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_221|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_190|, ~size~0=v_~size~0_287, ~f~0.base=v_~f~0.base_289, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_162|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_198|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_274|, ~x1~0=v_~x1~0_425, ~f~0.offset=v_~f~0.offset_286, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_230|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_213|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_154|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_322|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_152|, #memory_int=|v_#memory_int_408|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_229|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_162|, ~n~0=v_~n~0_273, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_166|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_231|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:27:20,151 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 02:27:20,152 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4024 [2022-12-13 02:27:20,152 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 340 transitions, 8066 flow [2022-12-13 02:27:20,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:27:20,153 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:27:20,153 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:27:20,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-13 02:27:20,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-13 02:27:20,360 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:27:20,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:27:20,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1924930272, now seen corresponding path program 3 times [2022-12-13 02:27:20,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:27:20,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978614754] [2022-12-13 02:27:20,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:27:20,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:27:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:27:20,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:27:20,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:27:20,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978614754] [2022-12-13 02:27:20,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978614754] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:27:20,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:27:20,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 02:27:20,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682063006] [2022-12-13 02:27:20,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:27:20,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:27:20,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:27:20,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:27:20,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:27:20,438 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 70 [2022-12-13 02:27:20,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 340 transitions, 8066 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:27:20,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:27:20,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 70 [2022-12-13 02:27:20,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:27:21,437 INFO L130 PetriNetUnfolder]: 1676/3076 cut-off events. [2022-12-13 02:27:21,437 INFO L131 PetriNetUnfolder]: For 111993/111993 co-relation queries the response was YES. [2022-12-13 02:27:21,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32168 conditions, 3076 events. 1676/3076 cut-off events. For 111993/111993 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 20274 event pairs, 273 based on Foata normal form. 28/3102 useless extension candidates. Maximal degree in co-relation 30511. Up to 1526 conditions per place. [2022-12-13 02:27:21,528 INFO L137 encePairwiseOnDemand]: 30/70 looper letters, 324 selfloop transitions, 133 changer transitions 3/460 dead transitions. [2022-12-13 02:27:21,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 460 transitions, 11268 flow [2022-12-13 02:27:21,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 02:27:21,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 02:27:21,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 121 transitions. [2022-12-13 02:27:21,529 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19206349206349208 [2022-12-13 02:27:21,529 INFO L175 Difference]: Start difference. First operand has 218 places, 340 transitions, 8066 flow. Second operand 9 states and 121 transitions. [2022-12-13 02:27:21,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 460 transitions, 11268 flow [2022-12-13 02:27:21,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 460 transitions, 11037 flow, removed 110 selfloop flow, removed 1 redundant places. [2022-12-13 02:27:21,804 INFO L231 Difference]: Finished difference. Result has 228 places, 344 transitions, 8442 flow [2022-12-13 02:27:21,804 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=7804, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8442, PETRI_PLACES=228, PETRI_TRANSITIONS=344} [2022-12-13 02:27:21,805 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 207 predicate places. [2022-12-13 02:27:21,805 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:27:21,805 INFO L89 Accepts]: Start accepts. Operand has 228 places, 344 transitions, 8442 flow [2022-12-13 02:27:21,807 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:27:21,807 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:27:21,807 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 228 places, 344 transitions, 8442 flow [2022-12-13 02:27:21,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 228 places, 344 transitions, 8442 flow [2022-12-13 02:27:21,979 INFO L130 PetriNetUnfolder]: 384/1158 cut-off events. [2022-12-13 02:27:21,979 INFO L131 PetriNetUnfolder]: For 43056/43192 co-relation queries the response was YES. [2022-12-13 02:27:21,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12603 conditions, 1158 events. 384/1158 cut-off events. For 43056/43192 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 9393 event pairs, 32 based on Foata normal form. 8/1143 useless extension candidates. Maximal degree in co-relation 11877. Up to 421 conditions per place. [2022-12-13 02:27:21,999 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 228 places, 344 transitions, 8442 flow [2022-12-13 02:27:21,999 INFO L226 LiptonReduction]: Number of co-enabled transitions 980 [2022-12-13 02:27:22,009 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:27:22,010 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 205 [2022-12-13 02:27:22,010 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 344 transitions, 8442 flow [2022-12-13 02:27:22,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:27:22,010 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:27:22,010 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:27:22,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-13 02:27:22,010 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:27:22,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:27:22,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1361161351, now seen corresponding path program 1 times [2022-12-13 02:27:22,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:27:22,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567129050] [2022-12-13 02:27:22,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:27:22,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:27:22,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:27:22,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:27:22,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:27:22,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567129050] [2022-12-13 02:27:22,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567129050] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:27:22,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642290256] [2022-12-13 02:27:22,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:27:22,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:27:22,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:27:22,073 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:27:22,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 02:27:22,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:27:22,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 02:27:22,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:27:22,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:27:22,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:27:22,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:27:22,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642290256] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:27:22,234 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:27:22,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-13 02:27:22,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367315669] [2022-12-13 02:27:22,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:27:22,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 02:27:22,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:27:22,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 02:27:22,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-13 02:27:22,235 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 70 [2022-12-13 02:27:22,235 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 344 transitions, 8442 flow. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:27:22,235 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:27:22,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 70 [2022-12-13 02:27:22,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:27:23,138 INFO L130 PetriNetUnfolder]: 1699/3115 cut-off events. [2022-12-13 02:27:23,138 INFO L131 PetriNetUnfolder]: For 119665/119665 co-relation queries the response was YES. [2022-12-13 02:27:23,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33605 conditions, 3115 events. 1699/3115 cut-off events. For 119665/119665 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 20410 event pairs, 703 based on Foata normal form. 12/3125 useless extension candidates. Maximal degree in co-relation 31978. Up to 2867 conditions per place. [2022-12-13 02:27:23,171 INFO L137 encePairwiseOnDemand]: 57/70 looper letters, 319 selfloop transitions, 44 changer transitions 6/369 dead transitions. [2022-12-13 02:27:23,172 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 369 transitions, 9845 flow [2022-12-13 02:27:23,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:27:23,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:27:23,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2022-12-13 02:27:23,172 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.20952380952380953 [2022-12-13 02:27:23,172 INFO L175 Difference]: Start difference. First operand has 229 places, 344 transitions, 8442 flow. Second operand 6 states and 88 transitions. [2022-12-13 02:27:23,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 369 transitions, 9845 flow [2022-12-13 02:27:23,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 369 transitions, 9581 flow, removed 123 selfloop flow, removed 1 redundant places. [2022-12-13 02:27:23,538 INFO L231 Difference]: Finished difference. Result has 235 places, 343 transitions, 8379 flow [2022-12-13 02:27:23,539 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=8240, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8379, PETRI_PLACES=235, PETRI_TRANSITIONS=343} [2022-12-13 02:27:23,539 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 214 predicate places. [2022-12-13 02:27:23,539 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:27:23,539 INFO L89 Accepts]: Start accepts. Operand has 235 places, 343 transitions, 8379 flow [2022-12-13 02:27:23,541 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:27:23,541 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:27:23,541 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 235 places, 343 transitions, 8379 flow [2022-12-13 02:27:23,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 343 transitions, 8379 flow [2022-12-13 02:27:23,719 INFO L130 PetriNetUnfolder]: 383/1153 cut-off events. [2022-12-13 02:27:23,719 INFO L131 PetriNetUnfolder]: For 42959/43112 co-relation queries the response was YES. [2022-12-13 02:27:23,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12498 conditions, 1153 events. 383/1153 cut-off events. For 42959/43112 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 9349 event pairs, 36 based on Foata normal form. 14/1141 useless extension candidates. Maximal degree in co-relation 11816. Up to 419 conditions per place. [2022-12-13 02:27:23,734 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 233 places, 343 transitions, 8379 flow [2022-12-13 02:27:23,735 INFO L226 LiptonReduction]: Number of co-enabled transitions 982 [2022-12-13 02:27:25,003 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 02:27:25,003 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1464 [2022-12-13 02:27:25,004 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 343 transitions, 8455 flow [2022-12-13 02:27:25,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:27:25,004 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:27:25,004 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:27:25,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-13 02:27:25,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-13 02:27:25,208 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:27:25,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:27:25,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1897917112, now seen corresponding path program 1 times [2022-12-13 02:27:25,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:27:25,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627867684] [2022-12-13 02:27:25,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:27:25,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:27:25,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:27:25,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:27:25,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:27:25,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627867684] [2022-12-13 02:27:25,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627867684] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:27:25,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397893950] [2022-12-13 02:27:25,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:27:25,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:27:25,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:27:25,580 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:27:25,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 02:27:25,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:27:25,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 02:27:25,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:27:25,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:27:25,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:27:26,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:27:26,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397893950] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:27:26,033 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:27:26,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-12-13 02:27:26,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131855439] [2022-12-13 02:27:26,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:27:26,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 02:27:26,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:27:26,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 02:27:26,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-13 02:27:26,034 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 72 [2022-12-13 02:27:26,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 343 transitions, 8455 flow. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:27:26,034 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:27:26,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 72 [2022-12-13 02:27:26,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:27:28,615 INFO L130 PetriNetUnfolder]: 1720/3147 cut-off events. [2022-12-13 02:27:28,615 INFO L131 PetriNetUnfolder]: For 121547/121547 co-relation queries the response was YES. [2022-12-13 02:27:28,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33956 conditions, 3147 events. 1720/3147 cut-off events. For 121547/121547 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 20628 event pairs, 541 based on Foata normal form. 18/3163 useless extension candidates. Maximal degree in co-relation 32333. Up to 2398 conditions per place. [2022-12-13 02:27:28,649 INFO L137 encePairwiseOnDemand]: 28/72 looper letters, 244 selfloop transitions, 157 changer transitions 0/401 dead transitions. [2022-12-13 02:27:28,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 401 transitions, 10431 flow [2022-12-13 02:27:28,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 02:27:28,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 02:27:28,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 119 transitions. [2022-12-13 02:27:28,650 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.13773148148148148 [2022-12-13 02:27:28,650 INFO L175 Difference]: Start difference. First operand has 233 places, 343 transitions, 8455 flow. Second operand 12 states and 119 transitions. [2022-12-13 02:27:28,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 401 transitions, 10431 flow [2022-12-13 02:27:29,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 401 transitions, 10122 flow, removed 68 selfloop flow, removed 4 redundant places. [2022-12-13 02:27:29,021 INFO L231 Difference]: Finished difference. Result has 245 places, 357 transitions, 9078 flow [2022-12-13 02:27:29,021 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=8181, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=9078, PETRI_PLACES=245, PETRI_TRANSITIONS=357} [2022-12-13 02:27:29,022 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 224 predicate places. [2022-12-13 02:27:29,022 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:27:29,022 INFO L89 Accepts]: Start accepts. Operand has 245 places, 357 transitions, 9078 flow [2022-12-13 02:27:29,023 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:27:29,023 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:27:29,024 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 245 places, 357 transitions, 9078 flow [2022-12-13 02:27:29,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 245 places, 357 transitions, 9078 flow [2022-12-13 02:27:29,196 INFO L130 PetriNetUnfolder]: 391/1176 cut-off events. [2022-12-13 02:27:29,196 INFO L131 PetriNetUnfolder]: For 45289/45447 co-relation queries the response was YES. [2022-12-13 02:27:29,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13328 conditions, 1176 events. 391/1176 cut-off events. For 45289/45447 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 9583 event pairs, 36 based on Foata normal form. 12/1160 useless extension candidates. Maximal degree in co-relation 12647. Up to 436 conditions per place. [2022-12-13 02:27:29,213 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 245 places, 357 transitions, 9078 flow [2022-12-13 02:27:29,213 INFO L226 LiptonReduction]: Number of co-enabled transitions 1024 [2022-12-13 02:27:29,814 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [761] $Ultimate##0-->L49-2: Formula: (let ((.cse5 (select |v_#memory_int_423| v_~f~0.base_303))) (let ((.cse1 (select .cse5 (+ v_~f~0.offset_300 (* v_~x2~0_420 4))))) (let ((.cse0 (select .cse5 (+ v_~f~0.offset_300 (* .cse1 4))))) (let ((.cse4 (select .cse5 (+ v_~f~0.offset_300 (* v_~x1~0_463 4)))) (.cse3 (select .cse5 (+ v_~f~0.offset_300 (* .cse0 4))))) (let ((.cse2 (select .cse5 (+ v_~f~0.offset_300 (* .cse3 4)))) (.cse7 (select .cse5 (+ v_~f~0.offset_300 (* .cse4 4))))) (let ((.cse6 (select .cse5 (+ v_~f~0.offset_300 (* 4 .cse7)))) (.cse8 (select .cse5 (+ v_~f~0.offset_300 (* .cse2 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_301) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_301) (<= 0 .cse1)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_250| 0)) (< 3 (mod (* 3 v_~n~0_287) 4294967296)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_296|) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_301)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_220| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_252|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_301)) 1 0) 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_301)) 1 0) 0)) (= v_~x1~0_461 (select .cse5 (+ v_~f~0.offset_300 (* .cse6 4)))) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_301)) 1 0) 0)) (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_301)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_234|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_220| (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_301)) 1 0)) (= (select .cse5 (+ v_~f~0.offset_300 (* .cse8 4))) v_~x2~0_419) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_234| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_250|) (not (= (ite (and (<= 0 v_~x2~0_420) (< v_~x2~0_420 v_~size~0_301)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_463 v_~size~0_301) (<= 0 v_~x1~0_463)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_252| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_343| 4)))))))) InVars {~x2~0=v_~x2~0_420, ~size~0=v_~size~0_301, ~f~0.base=v_~f~0.base_303, #memory_int=|v_#memory_int_423|, ~n~0=v_~n~0_287, ~x1~0=v_~x1~0_463, ~f~0.offset=v_~f~0.offset_300} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_242|, ~x2~0=v_~x2~0_419, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_212|, ~size~0=v_~size~0_301, ~f~0.base=v_~f~0.base_303, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_184|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_220|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_296|, ~x1~0=v_~x1~0_461, ~f~0.offset=v_~f~0.offset_300, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_252|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_234|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_176|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_343|, #memory_int=|v_#memory_int_423|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_250|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_174|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_184|, ~n~0=v_~n~0_287, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_252|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_188|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:27:30,670 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [736] $Ultimate##0-->L86-3: Formula: (let ((.cse1 (select |v_#memory_int_380| v_~f~0.base_267))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_264 (* v_~x1~0_384 4))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_264 (* 4 .cse3))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_264 (* .cse0 4))))) (and (< 3 (mod (* 3 v_~n~0_251) 4294967296)) (not (= 0 (ite (and (< .cse0 v_~size~0_265) (<= 0 .cse0)) 1 0))) (= |v_thread1Thread1of1ForFork0_~i~0#1_285| 4) (= (select .cse1 (+ v_~f~0.offset_264 (* .cse2 4))) v_~x1~0_383) (= (+ |v_#pthreadsForks_162| 1) |v_#pthreadsForks_161|) (= (ite (and (< .cse2 v_~size~0_265) (<= 0 .cse2)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_185|) (not (= (ite (and (<= 0 v_~x1~0_384) (< v_~x1~0_384 v_~size~0_265)) 1 0) 0)) (= (store |v_#memory_int_380| |v_ULTIMATE.start_main_~#t2~0#1.base_97| (store (select |v_#memory_int_380| |v_ULTIMATE.start_main_~#t2~0#1.base_97|) |v_ULTIMATE.start_main_~#t2~0#1.offset_94| |v_ULTIMATE.start_main_#t~pre14#1_105|)) |v_#memory_int_379|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_265)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_201| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_185| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_201|) (= |v_ULTIMATE.start_main_#t~pre14#1_105| |v_#pthreadsForks_162|)))))) InVars {#pthreadsForks=|v_#pthreadsForks_162|, ~size~0=v_~size~0_265, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_94|, ~f~0.base=v_~f~0.base_267, #memory_int=|v_#memory_int_380|, ~n~0=v_~n~0_251, ~x1~0=v_~x1~0_384, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_97|, ~f~0.offset=v_~f~0.offset_264} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_193|, ~size~0=v_~size~0_265, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_94|, ~f~0.base=v_~f~0.base_267, ~x1~0=v_~x1~0_383, ~f~0.offset=v_~f~0.offset_264, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_118|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_185|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_105|, #pthreadsForks=|v_#pthreadsForks_161|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_285|, #memory_int=|v_#memory_int_379|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_86|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_201|, ~n~0=v_~n~0_251, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_203|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_97|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, thread1Thread1of1ForFork0_~i~0#1, #memory_int, ULTIMATE.start_main_#t~nondet13#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:27:31,953 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 02:27:31,954 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2932 [2022-12-13 02:27:31,954 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 357 transitions, 9150 flow [2022-12-13 02:27:31,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:27:31,954 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:27:31,954 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:27:31,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-13 02:27:32,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:27:32,159 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:27:32,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:27:32,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1713059994, now seen corresponding path program 1 times [2022-12-13 02:27:32,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:27:32,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237527551] [2022-12-13 02:27:32,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:27:32,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:27:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:27:32,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:27:32,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:27:32,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237527551] [2022-12-13 02:27:32,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237527551] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:27:32,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921429267] [2022-12-13 02:27:32,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:27:32,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:27:32,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:27:32,270 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:27:32,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 02:27:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:27:32,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 02:27:32,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:27:32,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:27:32,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:27:32,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:27:32,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921429267] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:27:32,491 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:27:32,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-13 02:27:32,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181974989] [2022-12-13 02:27:32,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:27:32,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 02:27:32,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:27:32,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 02:27:32,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2022-12-13 02:27:32,492 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 76 [2022-12-13 02:27:32,492 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 357 transitions, 9150 flow. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:27:32,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:27:32,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 76 [2022-12-13 02:27:32,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:27:33,606 INFO L130 PetriNetUnfolder]: 1760/3223 cut-off events. [2022-12-13 02:27:33,606 INFO L131 PetriNetUnfolder]: For 127575/127575 co-relation queries the response was YES. [2022-12-13 02:27:33,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36196 conditions, 3223 events. 1760/3223 cut-off events. For 127575/127575 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 21227 event pairs, 693 based on Foata normal form. 26/3247 useless extension candidates. Maximal degree in co-relation 34644. Up to 2896 conditions per place. [2022-12-13 02:27:33,641 INFO L137 encePairwiseOnDemand]: 59/76 looper letters, 340 selfloop transitions, 50 changer transitions 3/393 dead transitions. [2022-12-13 02:27:33,642 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 393 transitions, 10774 flow [2022-12-13 02:27:33,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 02:27:33,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 02:27:33,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2022-12-13 02:27:33,643 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.15497076023391812 [2022-12-13 02:27:33,643 INFO L175 Difference]: Start difference. First operand has 246 places, 357 transitions, 9150 flow. Second operand 9 states and 106 transitions. [2022-12-13 02:27:33,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 393 transitions, 10774 flow [2022-12-13 02:27:34,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 393 transitions, 10532 flow, removed 118 selfloop flow, removed 2 redundant places. [2022-12-13 02:27:34,066 INFO L231 Difference]: Finished difference. Result has 255 places, 360 transitions, 9248 flow [2022-12-13 02:27:34,067 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=8938, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9248, PETRI_PLACES=255, PETRI_TRANSITIONS=360} [2022-12-13 02:27:34,067 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 234 predicate places. [2022-12-13 02:27:34,067 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:27:34,067 INFO L89 Accepts]: Start accepts. Operand has 255 places, 360 transitions, 9248 flow [2022-12-13 02:27:34,070 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:27:34,070 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:27:34,070 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 255 places, 360 transitions, 9248 flow [2022-12-13 02:27:34,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 254 places, 360 transitions, 9248 flow [2022-12-13 02:27:34,256 INFO L130 PetriNetUnfolder]: 392/1190 cut-off events. [2022-12-13 02:27:34,256 INFO L131 PetriNetUnfolder]: For 48390/48585 co-relation queries the response was YES. [2022-12-13 02:27:34,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13675 conditions, 1190 events. 392/1190 cut-off events. For 48390/48585 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 9755 event pairs, 34 based on Foata normal form. 9/1172 useless extension candidates. Maximal degree in co-relation 12991. Up to 446 conditions per place. [2022-12-13 02:27:34,276 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 254 places, 360 transitions, 9248 flow [2022-12-13 02:27:34,276 INFO L226 LiptonReduction]: Number of co-enabled transitions 1032 [2022-12-13 02:27:34,508 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:27:34,801 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [755] $Ultimate##0-->L59-2: Formula: (let ((.cse4 (select |v_#memory_int_414| v_~f~0.base_295))) (let ((.cse0 (select .cse4 (+ v_~f~0.offset_292 (* v_~x2~0_399 4))))) (let ((.cse2 (select .cse4 (+ v_~f~0.offset_292 (* 4 .cse0))))) (let ((.cse6 (select .cse4 (+ v_~f~0.offset_292 (* 4 .cse2))))) (let ((.cse8 (select .cse4 (+ v_~f~0.offset_292 (* 4 .cse6))))) (let ((.cse5 (select .cse4 (+ v_~f~0.offset_292 (* 4 .cse8))))) (let ((.cse7 (select .cse4 (+ v_~f~0.offset_292 (* .cse5 4))))) (let ((.cse9 (select .cse4 (+ v_~f~0.offset_292 (* .cse7 4))))) (let ((.cse3 (select .cse4 (+ (* .cse9 4) v_~f~0.offset_292))) (.cse1 (select .cse4 (+ v_~f~0.offset_292 (* v_~x1~0_440 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_293) (<= 0 .cse0)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_221| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_237|) (= |v_thread1Thread1of1ForFork0_~i~0#1_330| 2) (= 9 |v_thread2Thread1of1ForFork1_~i~1#1_282|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_221| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_293)) 1 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_293)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_206| (ite (and (< .cse3 v_~size~0_293) (<= 0 .cse3)) 1 0)) (= (select .cse4 (+ v_~f~0.offset_292 (* 4 .cse3))) v_~x2~0_397) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_238| 0)) (not (= (ite (and (< v_~x1~0_440 v_~size~0_293) (<= 0 v_~x1~0_440)) 1 0) 0)) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_282| 4294967293) 4294967296) (mod (* 3 v_~n~0_279) 4294967296)) (not (= (ite (and (< .cse5 v_~size~0_293) (<= 0 .cse5)) 1 0) 0)) (= (select .cse4 (+ v_~f~0.offset_292 (* .cse1 4))) v_~x1~0_439) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_206| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_238|) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_293)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_237| 0)) (not (= (ite (and (< v_~x2~0_399 v_~size~0_293) (<= 0 v_~x2~0_399)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_293)) 1 0) 0)) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_293)) 1 0) 0)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_293)) 1 0) 0)))))))))))) InVars {~x2~0=v_~x2~0_399, ~size~0=v_~size~0_293, ~f~0.base=v_~f~0.base_295, #memory_int=|v_#memory_int_414|, ~n~0=v_~n~0_279, ~x1~0=v_~x1~0_440, ~f~0.offset=v_~f~0.offset_292} OutVars{~x2~0=v_~x2~0_397, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_229|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_198|, ~size~0=v_~size~0_293, ~f~0.base=v_~f~0.base_295, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_170|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_206|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_282|, ~x1~0=v_~x1~0_439, ~f~0.offset=v_~f~0.offset_292, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_238|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_221|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_162|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_330|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_160|, #memory_int=|v_#memory_int_414|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_237|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_170|, ~n~0=v_~n~0_279, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_174|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_239|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:27:40,328 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 02:27:40,329 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6262 [2022-12-13 02:27:40,329 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 359 transitions, 9334 flow [2022-12-13 02:27:40,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:27:40,329 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:27:40,329 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:27:40,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-13 02:27:40,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:27:40,536 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:27:40,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:27:40,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1680112745, now seen corresponding path program 1 times [2022-12-13 02:27:40,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:27:40,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775211842] [2022-12-13 02:27:40,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:27:40,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:27:40,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:27:40,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:27:40,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:27:40,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775211842] [2022-12-13 02:27:40,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775211842] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:27:40,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451608291] [2022-12-13 02:27:40,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:27:40,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:27:40,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:27:40,628 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:27:40,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-13 02:27:40,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:27:40,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 02:27:40,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:27:40,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:27:40,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:27:40,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:27:40,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451608291] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:27:40,850 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:27:40,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-13 02:27:40,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129750701] [2022-12-13 02:27:40,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:27:40,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 02:27:40,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:27:40,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 02:27:40,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 02:27:40,851 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 79 [2022-12-13 02:27:40,851 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 359 transitions, 9334 flow. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:27:40,851 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:27:40,851 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 79 [2022-12-13 02:27:40,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:27:42,495 INFO L130 PetriNetUnfolder]: 1802/3301 cut-off events. [2022-12-13 02:27:42,495 INFO L131 PetriNetUnfolder]: For 134743/134743 co-relation queries the response was YES. [2022-12-13 02:27:42,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37606 conditions, 3301 events. 1802/3301 cut-off events. For 134743/134743 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 21865 event pairs, 662 based on Foata normal form. 6/3305 useless extension candidates. Maximal degree in co-relation 36089. Up to 2789 conditions per place. [2022-12-13 02:27:42,542 INFO L137 encePairwiseOnDemand]: 43/79 looper letters, 289 selfloop transitions, 124 changer transitions 12/425 dead transitions. [2022-12-13 02:27:42,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 425 transitions, 11689 flow [2022-12-13 02:27:42,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 02:27:42,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 02:27:42,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 127 transitions. [2022-12-13 02:27:42,543 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.12366114897760468 [2022-12-13 02:27:42,543 INFO L175 Difference]: Start difference. First operand has 255 places, 359 transitions, 9334 flow. Second operand 13 states and 127 transitions. [2022-12-13 02:27:42,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 425 transitions, 11689 flow [2022-12-13 02:27:43,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 425 transitions, 11462 flow, removed 109 selfloop flow, removed 1 redundant places. [2022-12-13 02:27:43,135 INFO L231 Difference]: Finished difference. Result has 275 places, 381 transitions, 10133 flow [2022-12-13 02:27:43,136 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=9147, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=10133, PETRI_PLACES=275, PETRI_TRANSITIONS=381} [2022-12-13 02:27:43,136 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 254 predicate places. [2022-12-13 02:27:43,136 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:27:43,136 INFO L89 Accepts]: Start accepts. Operand has 275 places, 381 transitions, 10133 flow [2022-12-13 02:27:43,138 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:27:43,138 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:27:43,138 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 275 places, 381 transitions, 10133 flow [2022-12-13 02:27:43,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 272 places, 381 transitions, 10133 flow [2022-12-13 02:27:43,355 INFO L130 PetriNetUnfolder]: 409/1216 cut-off events. [2022-12-13 02:27:43,355 INFO L131 PetriNetUnfolder]: For 57542/57721 co-relation queries the response was YES. [2022-12-13 02:27:43,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14770 conditions, 1216 events. 409/1216 cut-off events. For 57542/57721 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 9922 event pairs, 32 based on Foata normal form. 9/1199 useless extension candidates. Maximal degree in co-relation 14511. Up to 467 conditions per place. [2022-12-13 02:27:43,375 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 272 places, 381 transitions, 10133 flow [2022-12-13 02:27:43,375 INFO L226 LiptonReduction]: Number of co-enabled transitions 1068 [2022-12-13 02:27:43,383 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [770] $Ultimate##0-->L49-2: Formula: (let ((.cse5 (select |v_#memory_int_438| v_~f~0.base_317))) (let ((.cse11 (select .cse5 (+ v_~f~0.offset_314 (* v_~x2~0_450 4))))) (let ((.cse10 (select .cse5 (+ v_~f~0.offset_314 (* .cse11 4))))) (let ((.cse7 (select .cse5 (+ v_~f~0.offset_314 (* .cse10 4))))) (let ((.cse13 (select .cse5 (+ v_~f~0.offset_314 (* v_~x1~0_501 4)))) (.cse9 (select .cse5 (+ v_~f~0.offset_314 (* .cse7 4))))) (let ((.cse1 (select .cse5 (+ v_~f~0.offset_314 (* .cse9 4)))) (.cse2 (select .cse5 (+ v_~f~0.offset_314 (* 4 .cse13))))) (let ((.cse12 (select .cse5 (+ v_~f~0.offset_314 (* .cse2 4)))) (.cse4 (select .cse5 (+ (* .cse1 4) v_~f~0.offset_314)))) (let ((.cse0 (select .cse5 (+ v_~f~0.offset_314 (* .cse4 4)))) (.cse3 (select .cse5 (+ v_~f~0.offset_314 (* .cse12 4))))) (let ((.cse6 (select .cse5 (+ v_~f~0.offset_314 (* .cse3 4)))) (.cse8 (select .cse5 (+ v_~f~0.offset_314 (* 4 .cse0))))) (and (not (= (ite (and (< .cse0 v_~size~0_315) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_450) (< v_~x2~0_450 v_~size~0_315)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_315)) 1 0) 0)) (not (= (ite (and (< .cse2 v_~size~0_315) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_315)) 1 0) 0)) (= 9 |v_thread2Thread1of1ForFork1_~i~1#1_321|) (= |v_thread1Thread1of1ForFork0_~i~0#1_377| 6) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_315)) 1 0) 0)) (= (select .cse5 (+ v_~f~0.offset_314 (* .cse6 4))) v_~x1~0_499) (not (= (ite (and (< .cse7 v_~size~0_315) (<= 0 .cse7)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_237| (ite (and (< .cse8 v_~size~0_315) (<= 0 .cse8)) 1 0)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_315)) 1 0) 0)) (not (= 0 (ite (and (<= 0 v_~x1~0_501) (< v_~x1~0_501 v_~size~0_315)) 1 0))) (not (= (ite (and (< .cse10 v_~size~0_315) (<= 0 .cse10)) 1 0) 0)) (not (= (ite (and (< .cse11 v_~size~0_315) (<= 0 .cse11)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_274| 0)) (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_315)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_258|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_269| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_258| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_274|) (not (= (ite (and (<= 0 .cse12) (< .cse12 v_~size~0_315)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_237| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_269|) (= (select .cse5 (+ v_~f~0.offset_314 (* .cse8 4))) v_~x2~0_449) (< 6 (mod (* 3 v_~n~0_301) 4294967296)) (not (= (ite (and (<= 0 .cse13) (< .cse13 v_~size~0_315)) 1 0) 0)))))))))))) InVars {~x2~0=v_~x2~0_450, ~size~0=v_~size~0_315, ~f~0.base=v_~f~0.base_317, #memory_int=|v_#memory_int_438|, ~n~0=v_~n~0_301, ~x1~0=v_~x1~0_501, ~f~0.offset=v_~f~0.offset_314} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_266|, ~x2~0=v_~x2~0_449, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_229|, ~size~0=v_~size~0_315, ~f~0.base=v_~f~0.base_317, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_201|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_237|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_321|, ~x1~0=v_~x1~0_499, ~f~0.offset=v_~f~0.offset_314, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_269|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_258|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_193|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_377|, #memory_int=|v_#memory_int_438|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_274|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_191|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_201|, ~n~0=v_~n~0_301, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_276|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_205|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:27:47,729 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 02:27:47,729 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4593 [2022-12-13 02:27:47,729 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 379 transitions, 10144 flow [2022-12-13 02:27:47,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:27:47,730 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:27:47,730 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:27:47,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-13 02:27:47,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-12-13 02:27:47,940 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:27:47,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:27:47,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1050463081, now seen corresponding path program 1 times [2022-12-13 02:27:47,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:27:47,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266433426] [2022-12-13 02:27:47,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:27:47,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:27:47,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:27:49,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:27:49,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:27:49,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266433426] [2022-12-13 02:27:49,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266433426] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:27:49,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938373006] [2022-12-13 02:27:49,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:27:49,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:27:49,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:27:49,775 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:27:49,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-13 02:27:49,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:27:49,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 02:27:49,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:27:49,994 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:27:49,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 15 case distinctions, treesize of input 95 treesize of output 162 [2022-12-13 02:27:50,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:27:50,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:27:51,801 INFO L321 Elim1Store]: treesize reduction 30, result has 95.1 percent of original size [2022-12-13 02:27:51,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 22 new quantified variables, introduced 66 case distinctions, treesize of input 99 treesize of output 666 [2022-12-13 02:28:01,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:28:01,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938373006] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:28:01,761 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:28:01,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 2] total 7 [2022-12-13 02:28:01,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047142920] [2022-12-13 02:28:01,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:28:01,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 02:28:01,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:28:01,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 02:28:01,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-13 02:28:01,762 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 77 [2022-12-13 02:28:01,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 379 transitions, 10144 flow. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states 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 02:28:01,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:28:01,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 77 [2022-12-13 02:28:01,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:28:03,393 INFO L130 PetriNetUnfolder]: 1808/3308 cut-off events. [2022-12-13 02:28:03,393 INFO L131 PetriNetUnfolder]: For 164262/164262 co-relation queries the response was YES. [2022-12-13 02:28:03,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39566 conditions, 3308 events. 1808/3308 cut-off events. For 164262/164262 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 22037 event pairs, 680 based on Foata normal form. 1/3307 useless extension candidates. Maximal degree in co-relation 38848. Up to 3112 conditions per place. [2022-12-13 02:28:03,432 INFO L137 encePairwiseOnDemand]: 30/77 looper letters, 298 selfloop transitions, 93 changer transitions 14/405 dead transitions. [2022-12-13 02:28:03,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 405 transitions, 11459 flow [2022-12-13 02:28:03,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 02:28:03,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 02:28:03,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2022-12-13 02:28:03,433 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.18923933209647495 [2022-12-13 02:28:03,433 INFO L175 Difference]: Start difference. First operand has 271 places, 379 transitions, 10144 flow. Second operand 7 states and 102 transitions. [2022-12-13 02:28:03,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 405 transitions, 11459 flow [2022-12-13 02:28:04,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 405 transitions, 11061 flow, removed 149 selfloop flow, removed 6 redundant places. [2022-12-13 02:28:04,065 INFO L231 Difference]: Finished difference. Result has 274 places, 373 transitions, 9891 flow [2022-12-13 02:28:04,065 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=9764, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=9891, PETRI_PLACES=274, PETRI_TRANSITIONS=373} [2022-12-13 02:28:04,066 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 253 predicate places. [2022-12-13 02:28:04,066 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:28:04,066 INFO L89 Accepts]: Start accepts. Operand has 274 places, 373 transitions, 9891 flow [2022-12-13 02:28:04,068 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:28:04,068 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:28:04,068 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 274 places, 373 transitions, 9891 flow [2022-12-13 02:28:04,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 271 places, 373 transitions, 9891 flow [2022-12-13 02:28:04,333 INFO L130 PetriNetUnfolder]: 399/1201 cut-off events. [2022-12-13 02:28:04,333 INFO L131 PetriNetUnfolder]: For 58800/58991 co-relation queries the response was YES. [2022-12-13 02:28:04,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14472 conditions, 1201 events. 399/1201 cut-off events. For 58800/58991 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 9818 event pairs, 34 based on Foata normal form. 9/1184 useless extension candidates. Maximal degree in co-relation 14150. Up to 449 conditions per place. [2022-12-13 02:28:04,362 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 271 places, 373 transitions, 9891 flow [2022-12-13 02:28:04,362 INFO L226 LiptonReduction]: Number of co-enabled transitions 1056 [2022-12-13 02:28:04,364 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [792] $Ultimate##0-->L59-2: Formula: (let ((.cse6 (select |v_#memory_int_469| v_~f~0.base_345))) (let ((.cse4 (select .cse6 (+ v_~f~0.offset_342 (* v_~x2~0_507 4))))) (let ((.cse9 (select .cse6 (+ v_~f~0.offset_342 (* 4 .cse4))))) (let ((.cse11 (select .cse6 (+ v_~f~0.offset_342 (* .cse9 4))))) (let ((.cse12 (select .cse6 (+ v_~f~0.offset_342 (* .cse11 4))))) (let ((.cse2 (select .cse6 (+ v_~f~0.offset_342 (* .cse12 4))))) (let ((.cse5 (select .cse6 (+ v_~f~0.offset_342 (* .cse2 4))))) (let ((.cse16 (select .cse6 (+ v_~f~0.offset_342 (* .cse5 4)))) (.cse15 (select .cse6 (+ v_~f~0.offset_342 (* v_~x1~0_584 4))))) (let ((.cse1 (select .cse6 (+ v_~f~0.offset_342 (* .cse15 4)))) (.cse13 (select .cse6 (+ v_~f~0.offset_342 (* 4 .cse16))))) (let ((.cse8 (select .cse6 (+ v_~f~0.offset_342 (* .cse13 4)))) (.cse10 (select .cse6 (+ v_~f~0.offset_342 (* .cse1 4))))) (let ((.cse14 (select .cse6 (+ v_~f~0.offset_342 (* 4 .cse10)))) (.cse0 (select .cse6 (+ v_~f~0.offset_342 (* .cse8 4))))) (let ((.cse3 (select .cse6 (+ v_~f~0.offset_342 (* 4 .cse0)))) (.cse7 (select .cse6 (+ v_~f~0.offset_342 (* .cse14 4))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_447| 6) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_331| 0)) (not (= (ite (and (< .cse0 v_~size~0_343) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_584 v_~size~0_343) (<= 0 v_~x1~0_584)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_360| 12) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_343)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_507) (< v_~x2~0_507 v_~size~0_343)) 1 0) 0)) (not (= (ite (and (< .cse2 v_~size~0_343) (<= 0 .cse2)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_272| (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_343)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_315| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_331|) (not (= (ite (and (< .cse4 v_~size~0_343) (<= 0 .cse4)) 1 0) 0)) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_360| 4294967293) 4294967296) (mod (* 3 v_~n~0_329) 4294967296)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_343)) 1 0) 0)) (= (select .cse6 (+ v_~f~0.offset_342 (* .cse3 4))) v_~x2~0_505) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_315| (ite (and (< .cse7 v_~size~0_343) (<= 0 .cse7)) 1 0)) (= v_~x1~0_583 (select .cse6 (+ v_~f~0.offset_342 (* .cse7 4)))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_272| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_304|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_304| 0)) (not (= (ite (and (< .cse8 v_~size~0_343) (<= 0 .cse8)) 1 0) 0)) (not (= (ite (and (< .cse9 v_~size~0_343) (<= 0 .cse9)) 1 0) 0)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_343)) 1 0) 0)) (not (= (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_343)) 1 0) 0)) (not (= (ite (and (< .cse12 v_~size~0_343) (<= 0 .cse12)) 1 0) 0)) (not (= (ite (and (< .cse13 v_~size~0_343) (<= 0 .cse13)) 1 0) 0)) (not (= (ite (and (<= 0 .cse14) (< .cse14 v_~size~0_343)) 1 0) 0)) (not (= (ite (and (<= 0 .cse15) (< .cse15 v_~size~0_343)) 1 0) 0)) (not (= (ite (and (<= 0 .cse16) (< .cse16 v_~size~0_343)) 1 0) 0))))))))))))))) InVars {~x2~0=v_~x2~0_507, ~size~0=v_~size~0_343, ~f~0.base=v_~f~0.base_345, #memory_int=|v_#memory_int_469|, ~n~0=v_~n~0_329, ~x1~0=v_~x1~0_584, ~f~0.offset=v_~f~0.offset_342} OutVars{~x2~0=v_~x2~0_505, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_323|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_264|, ~size~0=v_~size~0_343, ~f~0.base=v_~f~0.base_345, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_236|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_272|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_360|, ~x1~0=v_~x1~0_583, ~f~0.offset=v_~f~0.offset_342, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_304|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_315|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_228|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_447|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_226|, #memory_int=|v_#memory_int_469|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_331|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_236|, ~n~0=v_~n~0_329, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_240|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_333|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:28:05,837 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:28:05,838 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1772 [2022-12-13 02:28:05,838 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 373 transitions, 9909 flow [2022-12-13 02:28:05,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states 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 02:28:05,838 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:28:05,838 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:28:05,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-13 02:28:06,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-12-13 02:28:06,039 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:28:06,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:28:06,039 INFO L85 PathProgramCache]: Analyzing trace with hash -232395600, now seen corresponding path program 1 times [2022-12-13 02:28:06,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:28:06,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659263646] [2022-12-13 02:28:06,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:28:06,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:28:06,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:28:06,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:28:06,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:28:06,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659263646] [2022-12-13 02:28:06,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659263646] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:28:06,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202716974] [2022-12-13 02:28:06,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:28:06,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:28:06,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:28:06,205 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:28:06,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-13 02:28:06,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:28:06,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 02:28:06,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:28:06,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:28:06,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:28:06,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:28:06,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202716974] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:28:06,722 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:28:06,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-12-13 02:28:06,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725182889] [2022-12-13 02:28:06,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:28:06,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 02:28:06,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:28:06,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 02:28:06,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-13 02:28:06,722 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 74 [2022-12-13 02:28:06,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 373 transitions, 9909 flow. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:28:06,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:28:06,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 74 [2022-12-13 02:28:06,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:28:08,403 INFO L130 PetriNetUnfolder]: 1777/3255 cut-off events. [2022-12-13 02:28:08,403 INFO L131 PetriNetUnfolder]: For 160902/160902 co-relation queries the response was YES. [2022-12-13 02:28:08,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38598 conditions, 3255 events. 1777/3255 cut-off events. For 160902/160902 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 21718 event pairs, 186 based on Foata normal form. 8/3261 useless extension candidates. Maximal degree in co-relation 37749. Up to 1365 conditions per place. [2022-12-13 02:28:08,437 INFO L137 encePairwiseOnDemand]: 18/74 looper letters, 219 selfloop transitions, 228 changer transitions 2/449 dead transitions. [2022-12-13 02:28:08,437 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 449 transitions, 12546 flow [2022-12-13 02:28:08,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 02:28:08,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 02:28:08,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2022-12-13 02:28:08,439 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17417417417417416 [2022-12-13 02:28:08,439 INFO L175 Difference]: Start difference. First operand has 271 places, 373 transitions, 9909 flow. Second operand 9 states and 116 transitions. [2022-12-13 02:28:08,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 449 transitions, 12546 flow [2022-12-13 02:28:08,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 449 transitions, 12375 flow, removed 64 selfloop flow, removed 2 redundant places. [2022-12-13 02:28:09,010 INFO L231 Difference]: Finished difference. Result has 280 places, 382 transitions, 10813 flow [2022-12-13 02:28:09,010 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=9756, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=220, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10813, PETRI_PLACES=280, PETRI_TRANSITIONS=382} [2022-12-13 02:28:09,010 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 259 predicate places. [2022-12-13 02:28:09,011 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:28:09,011 INFO L89 Accepts]: Start accepts. Operand has 280 places, 382 transitions, 10813 flow [2022-12-13 02:28:09,013 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:28:09,013 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:28:09,014 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 280 places, 382 transitions, 10813 flow [2022-12-13 02:28:09,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 280 places, 382 transitions, 10813 flow [2022-12-13 02:28:09,216 INFO L130 PetriNetUnfolder]: 408/1222 cut-off events. [2022-12-13 02:28:09,216 INFO L131 PetriNetUnfolder]: For 65879/66107 co-relation queries the response was YES. [2022-12-13 02:28:09,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15453 conditions, 1222 events. 408/1222 cut-off events. For 65879/66107 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 9980 event pairs, 38 based on Foata normal form. 10/1201 useless extension candidates. Maximal degree in co-relation 15125. Up to 459 conditions per place. [2022-12-13 02:28:09,236 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 280 places, 382 transitions, 10813 flow [2022-12-13 02:28:09,236 INFO L226 LiptonReduction]: Number of co-enabled transitions 1084 [2022-12-13 02:28:09,380 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:28:09,380 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 369 [2022-12-13 02:28:09,380 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 382 transitions, 10838 flow [2022-12-13 02:28:09,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:28:09,381 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:28:09,381 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:28:09,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-13 02:28:09,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:28:09,583 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:28:09,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:28:09,584 INFO L85 PathProgramCache]: Analyzing trace with hash -599013570, now seen corresponding path program 2 times [2022-12-13 02:28:09,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:28:09,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592258214] [2022-12-13 02:28:09,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:28:09,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:28:09,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:28:10,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:28:10,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:28:10,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592258214] [2022-12-13 02:28:10,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592258214] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:28:10,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715008498] [2022-12-13 02:28:10,536 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 02:28:10,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:28:10,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:28:10,537 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:28:10,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-13 02:28:10,659 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 02:28:10,659 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 02:28:10,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 02:28:10,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:28:10,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:28:10,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2022-12-13 02:28:10,737 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:28:10,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2022-12-13 02:28:10,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:28:10,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:28:10,873 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:28:10,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 104 treesize of output 228 [2022-12-13 02:28:10,918 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:28:10,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 92 [2022-12-13 02:28:11,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:28:11,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715008498] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:28:11,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:28:11,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-13 02:28:11,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035078793] [2022-12-13 02:28:11,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:28:11,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 02:28:11,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:28:11,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 02:28:11,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-13 02:28:11,512 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 75 [2022-12-13 02:28:11,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 382 transitions, 10838 flow. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states 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 02:28:11,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:28:11,512 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 75 [2022-12-13 02:28:11,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:28:14,754 INFO L130 PetriNetUnfolder]: 1818/3330 cut-off events. [2022-12-13 02:28:14,754 INFO L131 PetriNetUnfolder]: For 181773/181773 co-relation queries the response was YES. [2022-12-13 02:28:14,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41087 conditions, 3330 events. 1818/3330 cut-off events. For 181773/181773 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 22233 event pairs, 698 based on Foata normal form. 1/3329 useless extension candidates. Maximal degree in co-relation 40438. Up to 3091 conditions per place. [2022-12-13 02:28:14,867 INFO L137 encePairwiseOnDemand]: 27/75 looper letters, 332 selfloop transitions, 94 changer transitions 2/428 dead transitions. [2022-12-13 02:28:14,867 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 428 transitions, 12706 flow [2022-12-13 02:28:14,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 02:28:14,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 02:28:14,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 123 transitions. [2022-12-13 02:28:14,868 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.14909090909090908 [2022-12-13 02:28:14,868 INFO L175 Difference]: Start difference. First operand has 280 places, 382 transitions, 10838 flow. Second operand 11 states and 123 transitions. [2022-12-13 02:28:14,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 428 transitions, 12706 flow [2022-12-13 02:28:15,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 428 transitions, 12278 flow, removed 74 selfloop flow, removed 12 redundant places. [2022-12-13 02:28:15,624 INFO L231 Difference]: Finished difference. Result has 281 places, 399 transitions, 11341 flow [2022-12-13 02:28:15,624 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=10443, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11341, PETRI_PLACES=281, PETRI_TRANSITIONS=399} [2022-12-13 02:28:15,624 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 260 predicate places. [2022-12-13 02:28:15,624 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:28:15,624 INFO L89 Accepts]: Start accepts. Operand has 281 places, 399 transitions, 11341 flow [2022-12-13 02:28:15,626 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:28:15,626 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:28:15,626 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 281 places, 399 transitions, 11341 flow [2022-12-13 02:28:15,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 281 places, 399 transitions, 11341 flow [2022-12-13 02:28:15,832 INFO L130 PetriNetUnfolder]: 417/1243 cut-off events. [2022-12-13 02:28:15,832 INFO L131 PetriNetUnfolder]: For 67021/67234 co-relation queries the response was YES. [2022-12-13 02:28:15,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15779 conditions, 1243 events. 417/1243 cut-off events. For 67021/67234 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 10206 event pairs, 37 based on Foata normal form. 12/1227 useless extension candidates. Maximal degree in co-relation 15536. Up to 470 conditions per place. [2022-12-13 02:28:15,853 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 281 places, 399 transitions, 11341 flow [2022-12-13 02:28:15,853 INFO L226 LiptonReduction]: Number of co-enabled transitions 1132 [2022-12-13 02:28:15,861 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:28:15,862 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 238 [2022-12-13 02:28:15,862 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 399 transitions, 11341 flow [2022-12-13 02:28:15,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states 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 02:28:15,862 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:28:15,862 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:28:15,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-13 02:28:16,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:28:16,069 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:28:16,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:28:16,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1824556187, now seen corresponding path program 1 times [2022-12-13 02:28:16,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:28:16,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25326116] [2022-12-13 02:28:16,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:28:16,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:28:16,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:28:16,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:28:16,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:28:16,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25326116] [2022-12-13 02:28:16,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25326116] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:28:16,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135153231] [2022-12-13 02:28:16,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:28:16,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:28:16,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:28:16,160 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:28:16,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-13 02:28:16,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:28:16,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 02:28:16,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:28:16,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:28:16,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:28:16,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:28:16,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135153231] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:28:16,427 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:28:16,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-12-13 02:28:16,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562994928] [2022-12-13 02:28:16,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:28:16,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 02:28:16,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:28:16,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 02:28:16,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-12-13 02:28:16,428 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 75 [2022-12-13 02:28:16,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 399 transitions, 11341 flow. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:28:16,428 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:28:16,428 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 75 [2022-12-13 02:28:16,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:28:17,550 INFO L130 PetriNetUnfolder]: 1851/3389 cut-off events. [2022-12-13 02:28:17,550 INFO L131 PetriNetUnfolder]: For 175527/175527 co-relation queries the response was YES. [2022-12-13 02:28:17,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41843 conditions, 3389 events. 1851/3389 cut-off events. For 175527/175527 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 22737 event pairs, 816 based on Foata normal form. 4/3390 useless extension candidates. Maximal degree in co-relation 41495. Up to 3248 conditions per place. [2022-12-13 02:28:17,596 INFO L137 encePairwiseOnDemand]: 57/75 looper letters, 375 selfloop transitions, 38 changer transitions 11/424 dead transitions. [2022-12-13 02:28:17,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 424 transitions, 12796 flow [2022-12-13 02:28:17,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 02:28:17,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 02:28:17,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2022-12-13 02:28:17,597 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.18285714285714286 [2022-12-13 02:28:17,597 INFO L175 Difference]: Start difference. First operand has 282 places, 399 transitions, 11341 flow. Second operand 7 states and 96 transitions. [2022-12-13 02:28:17,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 424 transitions, 12796 flow [2022-12-13 02:28:18,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 424 transitions, 12525 flow, removed 97 selfloop flow, removed 5 redundant places. [2022-12-13 02:28:18,222 INFO L231 Difference]: Finished difference. Result has 285 places, 392 transitions, 10905 flow [2022-12-13 02:28:18,223 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=11070, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=10905, PETRI_PLACES=285, PETRI_TRANSITIONS=392} [2022-12-13 02:28:18,223 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 264 predicate places. [2022-12-13 02:28:18,223 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:28:18,223 INFO L89 Accepts]: Start accepts. Operand has 285 places, 392 transitions, 10905 flow [2022-12-13 02:28:18,229 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:28:18,230 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:28:18,230 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 285 places, 392 transitions, 10905 flow [2022-12-13 02:28:18,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 284 places, 392 transitions, 10905 flow [2022-12-13 02:28:18,434 INFO L130 PetriNetUnfolder]: 412/1221 cut-off events. [2022-12-13 02:28:18,434 INFO L131 PetriNetUnfolder]: For 66946/67191 co-relation queries the response was YES. [2022-12-13 02:28:18,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15604 conditions, 1221 events. 412/1221 cut-off events. For 66946/67191 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 9962 event pairs, 39 based on Foata normal form. 12/1202 useless extension candidates. Maximal degree in co-relation 15415. Up to 455 conditions per place. [2022-12-13 02:28:18,452 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 284 places, 392 transitions, 10905 flow [2022-12-13 02:28:18,452 INFO L226 LiptonReduction]: Number of co-enabled transitions 1120 [2022-12-13 02:28:18,754 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [800] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_478| v_~f~0.base_353))) (let ((.cse15 (select .cse0 (+ v_~f~0.offset_350 (* v_~x2~0_524 4))))) (let ((.cse8 (select .cse0 (+ v_~f~0.offset_350 (* 4 .cse15))))) (let ((.cse14 (select .cse0 (+ v_~f~0.offset_350 (* .cse8 4))))) (let ((.cse9 (select .cse0 (+ v_~f~0.offset_350 (* .cse14 4))))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_350 (* .cse9 4))))) (let ((.cse12 (select .cse0 (+ v_~f~0.offset_350 (* v_~x1~0_609 4)))) (.cse16 (select .cse0 (+ (* .cse2 4) v_~f~0.offset_350)))) (let ((.cse4 (select .cse0 (+ v_~f~0.offset_350 (* .cse16 4)))) (.cse3 (select .cse0 (+ v_~f~0.offset_350 (* .cse12 4))))) (let ((.cse17 (select .cse0 (+ v_~f~0.offset_350 (* .cse3 4)))) (.cse10 (select .cse0 (+ v_~f~0.offset_350 (* .cse4 4))))) (let ((.cse11 (select .cse0 (+ v_~f~0.offset_350 (* .cse10 4)))) (.cse13 (select .cse0 (+ v_~f~0.offset_350 (* .cse17 4))))) (let ((.cse7 (select .cse0 (+ v_~f~0.offset_350 (* .cse13 4)))) (.cse6 (select .cse0 (+ v_~f~0.offset_350 (* .cse11 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_350 (* .cse6 4)))) (.cse5 (select .cse0 (+ v_~f~0.offset_350 (* .cse7 4))))) (and (= v_~x2~0_523 (select .cse0 (+ v_~f~0.offset_350 (* .cse1 4)))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_284| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_316|) (not (= (ite (and (< .cse2 v_~size~0_351) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (< .cse3 v_~size~0_351) (<= 0 .cse3)) 1 0) 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_351)) 1 0) 0)) (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_351)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_330|) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_351)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_351)) 1 0) 0)) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_351)) 1 0) 0)) (= 7 |v_thread1Thread1of1ForFork0_~i~0#1_464|) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_351)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_524 v_~size~0_351) (<= 0 v_~x2~0_524)) 1 0) 0)) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_374| 4294967293) 4294967296) (mod (* 3 v_~n~0_337) 4294967296)) (= |v_thread2Thread1of1ForFork1_~i~1#1_374| 12) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_284| (ite (and (< .cse1 v_~size~0_351) (<= 0 .cse1)) 1 0)) (= v_~x1~0_607 (select .cse0 (+ v_~f~0.offset_350 (* .cse5 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_330| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_346|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_316| 0)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_351)) 1 0) 0)) (not (= (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_351)) 1 0) 0)) (not (= (ite (and (<= 0 .cse12) (< .cse12 v_~size~0_351)) 1 0) 0)) (not (= (ite (and (<= 0 .cse13) (< .cse13 v_~size~0_351)) 1 0) 0)) (not (= (ite (and (< .cse14 v_~size~0_351) (<= 0 .cse14)) 1 0) 0)) (not (= (ite (and (< .cse15 v_~size~0_351) (<= 0 .cse15)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_346| 0)) (not (= (ite (and (<= 0 .cse16) (< .cse16 v_~size~0_351)) 1 0) 0)) (not (= (ite (and (<= 0 .cse17) (< .cse17 v_~size~0_351)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_609 v_~size~0_351) (<= 0 v_~x1~0_609)) 1 0) 0))))))))))))))) InVars {~x2~0=v_~x2~0_524, ~size~0=v_~size~0_351, ~f~0.base=v_~f~0.base_353, #memory_int=|v_#memory_int_478|, ~n~0=v_~n~0_337, ~x1~0=v_~x1~0_609, ~f~0.offset=v_~f~0.offset_350} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_338|, ~x2~0=v_~x2~0_523, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_276|, ~size~0=v_~size~0_351, ~f~0.base=v_~f~0.base_353, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_248|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_284|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_374|, ~x1~0=v_~x1~0_607, ~f~0.offset=v_~f~0.offset_350, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_316|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_330|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_240|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_464|, #memory_int=|v_#memory_int_478|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_346|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_238|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_248|, ~n~0=v_~n~0_337, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_348|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_252|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:28:25,218 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [796] $Ultimate##0-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_473| v_~f~0.base_349))) (let ((.cse7 (select .cse3 (+ v_~f~0.offset_346 (* v_~x2~0_517 4))))) (let ((.cse10 (select .cse3 (+ v_~f~0.offset_346 (* .cse7 4))))) (let ((.cse14 (select .cse3 (+ v_~f~0.offset_346 (* .cse10 4))))) (let ((.cse13 (select .cse3 (+ v_~f~0.offset_346 (* .cse14 4))))) (let ((.cse5 (select .cse3 (+ v_~f~0.offset_346 (* .cse13 4))))) (let ((.cse12 (select .cse3 (+ v_~f~0.offset_346 (* .cse5 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_346 (* .cse12 4))))) (let ((.cse0 (select .cse3 (+ v_~f~0.offset_346 (* .cse1 4))))) (let ((.cse6 (select .cse3 (+ v_~f~0.offset_346 (* v_~x1~0_594 4)))) (.cse8 (select .cse3 (+ v_~f~0.offset_346 (* .cse0 4))))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_346 (* .cse8 4)))) (.cse11 (select .cse3 (+ v_~f~0.offset_346 (* .cse6 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_346 (* .cse11 4)))) (.cse9 (select .cse3 (+ v_~f~0.offset_346 (* .cse2 4))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_453| 4) (not (= (ite (and (< .cse0 v_~size~0_347) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_594 v_~size~0_347) (<= 0 v_~x1~0_594)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_347) (<= 0 .cse1)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_337| 0)) (not (= (ite (and (< .cse2 v_~size~0_347) (<= 0 .cse2)) 1 0) 0)) (< 9 (mod (* 3 v_~n~0_333) 4294967296)) (= v_~x1~0_593 (select .cse3 (+ v_~f~0.offset_346 (* .cse4 4)))) (not (= (ite (and (< .cse5 v_~size~0_347) (<= 0 .cse5)) 1 0) 0)) (not (= (ite (and (< .cse6 v_~size~0_347) (<= 0 .cse6)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_278| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_310|) (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_347)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_321|) (not (= (ite (and (< .cse7 v_~size~0_347) (<= 0 .cse7)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_310| 0)) (not (= (ite (and (< .cse8 v_~size~0_347) (<= 0 .cse8)) 1 0) 0)) (= v_~x2~0_515 (select .cse3 (+ v_~f~0.offset_346 (* .cse9 4)))) (not (= (ite (and (< v_~x2~0_517 v_~size~0_347) (<= 0 v_~x2~0_517)) 1 0) 0)) (not (= (ite (and (< .cse10 v_~size~0_347) (<= 0 .cse10)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_366| 12) (not (= (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_347)) 1 0) 0)) (not (= (ite (and (<= 0 .cse12) (< .cse12 v_~size~0_347)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_278| (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_347)) 1 0)) (not (= (ite (and (< .cse13 v_~size~0_347) (<= 0 .cse13)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_321| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_337|) (not (= (ite (and (<= 0 .cse14) (< .cse14 v_~size~0_347)) 1 0) 0))))))))))))))) InVars {~x2~0=v_~x2~0_517, ~size~0=v_~size~0_347, ~f~0.base=v_~f~0.base_349, #memory_int=|v_#memory_int_473|, ~n~0=v_~n~0_333, ~x1~0=v_~x1~0_594, ~f~0.offset=v_~f~0.offset_346} OutVars{~x2~0=v_~x2~0_515, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_329|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_270|, ~size~0=v_~size~0_347, ~f~0.base=v_~f~0.base_349, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_242|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_278|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_366|, ~x1~0=v_~x1~0_593, ~f~0.offset=v_~f~0.offset_346, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_310|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_321|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_234|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_453|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_232|, #memory_int=|v_#memory_int_473|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_337|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_242|, ~n~0=v_~n~0_333, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_246|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_339|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:28:26,446 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 02:28:26,447 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8224 [2022-12-13 02:28:26,447 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 391 transitions, 11017 flow [2022-12-13 02:28:26,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:28:26,447 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:28:26,448 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:28:26,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-12-13 02:28:26,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-12-13 02:28:26,648 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:28:26,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:28:26,648 INFO L85 PathProgramCache]: Analyzing trace with hash -265949280, now seen corresponding path program 1 times [2022-12-13 02:28:26,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:28:26,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379673123] [2022-12-13 02:28:26,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:28:26,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:28:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:28:27,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:28:27,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:28:27,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379673123] [2022-12-13 02:28:27,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379673123] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:28:27,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706672747] [2022-12-13 02:28:27,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:28:27,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:28:27,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:28:27,627 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:28:27,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-13 02:28:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:28:27,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-13 02:28:27,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:28:27,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:28:27,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2022-12-13 02:28:27,835 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:28:27,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2022-12-13 02:28:27,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:28:27,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:28:27,946 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:28:27,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 104 treesize of output 228 [2022-12-13 02:28:27,979 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:28:27,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 92 [2022-12-13 02:28:28,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:28:28,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706672747] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:28:28,733 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:28:28,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 02:28:28,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603837073] [2022-12-13 02:28:28,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:28:28,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 02:28:28,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:28:28,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 02:28:28,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-12-13 02:28:28,734 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 79 [2022-12-13 02:28:28,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 391 transitions, 11017 flow. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:28:28,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:28:28,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 79 [2022-12-13 02:28:28,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:28:35,516 INFO L130 PetriNetUnfolder]: 1839/3368 cut-off events. [2022-12-13 02:28:35,517 INFO L131 PetriNetUnfolder]: For 187441/187441 co-relation queries the response was YES. [2022-12-13 02:28:35,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41721 conditions, 3368 events. 1839/3368 cut-off events. For 187441/187441 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 22384 event pairs, 715 based on Foata normal form. 1/3366 useless extension candidates. Maximal degree in co-relation 41365. Up to 3082 conditions per place. [2022-12-13 02:28:35,559 INFO L137 encePairwiseOnDemand]: 29/79 looper letters, 329 selfloop transitions, 102 changer transitions 5/436 dead transitions. [2022-12-13 02:28:35,559 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 436 transitions, 12671 flow [2022-12-13 02:28:35,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 02:28:35,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 02:28:35,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2022-12-13 02:28:35,560 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1472957422324511 [2022-12-13 02:28:35,560 INFO L175 Difference]: Start difference. First operand has 283 places, 391 transitions, 11017 flow. Second operand 11 states and 128 transitions. [2022-12-13 02:28:35,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 436 transitions, 12671 flow [2022-12-13 02:28:36,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 436 transitions, 12455 flow, removed 73 selfloop flow, removed 7 redundant places. [2022-12-13 02:28:36,261 INFO L231 Difference]: Finished difference. Result has 289 places, 405 transitions, 11554 flow [2022-12-13 02:28:36,262 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=10802, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11554, PETRI_PLACES=289, PETRI_TRANSITIONS=405} [2022-12-13 02:28:36,263 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 268 predicate places. [2022-12-13 02:28:36,263 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:28:36,263 INFO L89 Accepts]: Start accepts. Operand has 289 places, 405 transitions, 11554 flow [2022-12-13 02:28:36,272 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:28:36,272 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:28:36,272 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 289 places, 405 transitions, 11554 flow [2022-12-13 02:28:36,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 288 places, 405 transitions, 11554 flow [2022-12-13 02:28:36,520 INFO L130 PetriNetUnfolder]: 423/1253 cut-off events. [2022-12-13 02:28:36,520 INFO L131 PetriNetUnfolder]: For 72890/73123 co-relation queries the response was YES. [2022-12-13 02:28:36,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16292 conditions, 1253 events. 423/1253 cut-off events. For 72890/73123 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 10197 event pairs, 39 based on Foata normal form. 10/1230 useless extension candidates. Maximal degree in co-relation 16099. Up to 462 conditions per place. [2022-12-13 02:28:36,545 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 288 places, 405 transitions, 11554 flow [2022-12-13 02:28:36,545 INFO L226 LiptonReduction]: Number of co-enabled transitions 1152 [2022-12-13 02:28:39,515 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] and [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:28:41,212 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [741] $Ultimate##0-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_387| v_~f~0.base_273))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_270 (* v_~x1~0_397 4))))) (let ((.cse4 (select .cse2 (+ v_~f~0.offset_270 (* .cse0 4))))) (let ((.cse6 (select .cse2 (+ v_~f~0.offset_270 (* v_~x2~0_345 4)))) (.cse1 (select .cse2 (+ v_~f~0.offset_270 (* .cse4 4))))) (let ((.cse5 (select .cse2 (+ v_~f~0.offset_270 (* 4 .cse1)))) (.cse3 (select .cse2 (+ v_~f~0.offset_270 (* .cse6 4))))) (and (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_242|) (not (= (ite (and (< v_~x2~0_345 v_~size~0_271) (<= 0 v_~x2~0_345)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_191| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_207|) (= |v_thread1Thread1of1ForFork0_~i~0#1_291| 5) (not (= (ite (and (< .cse0 v_~size~0_271) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_271) (<= 0 .cse1)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_207| 0)) (= v_~x2~0_344 (select .cse2 (+ v_~f~0.offset_270 (* .cse3 4)))) (not (= (ite (and (< .cse4 v_~size~0_271) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_397) (< v_~x1~0_397 v_~size~0_271)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_191| (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_271)) 1 0)) (= v_~x1~0_395 (select .cse2 (+ v_~f~0.offset_270 (* .cse5 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_204| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_172| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_204|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_291| 4294967295) 4294967296) (mod (* 3 v_~n~0_257) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_172| (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_271)) 1 0)) (not (= (ite (and (< .cse6 v_~size~0_271) (<= 0 .cse6)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_345, ~size~0=v_~size~0_271, ~f~0.base=v_~f~0.base_273, #memory_int=|v_#memory_int_387|, ~n~0=v_~n~0_257, ~x1~0=v_~x1~0_397, ~f~0.offset=v_~f~0.offset_270} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_199|, ~x2~0=v_~x2~0_344, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_164|, ~size~0=v_~size~0_271, ~f~0.base=v_~f~0.base_273, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_136|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_172|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_242|, ~x1~0=v_~x1~0_395, ~f~0.offset=v_~f~0.offset_270, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_204|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_191|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_128|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_291|, #memory_int=|v_#memory_int_387|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_207|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_126|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_136|, ~n~0=v_~n~0_257, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_209|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_140|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:28:42,209 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 02:28:42,210 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5947 [2022-12-13 02:28:42,210 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 405 transitions, 11722 flow [2022-12-13 02:28:42,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:28:42,210 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:28:42,210 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:28:42,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-12-13 02:28:42,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-12-13 02:28:42,411 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:28:42,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:28:42,411 INFO L85 PathProgramCache]: Analyzing trace with hash -696973624, now seen corresponding path program 1 times [2022-12-13 02:28:42,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:28:42,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859496468] [2022-12-13 02:28:42,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:28:42,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:28:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:28:42,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:28:42,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:28:42,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859496468] [2022-12-13 02:28:42,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859496468] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:28:42,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175463546] [2022-12-13 02:28:42,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:28:42,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:28:42,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:28:42,521 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:28:42,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-13 02:28:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:28:42,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 66 conjunts are in the unsatisfiable core [2022-12-13 02:28:42,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:28:42,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:28:42,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-13 02:28:42,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 02:28:42,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 02:28:42,883 INFO L321 Elim1Store]: treesize reduction 87, result has 28.1 percent of original size [2022-12-13 02:28:42,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 15 case distinctions, treesize of input 141 treesize of output 83 [2022-12-13 02:28:42,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:28:42,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:28:43,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:28:43,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175463546] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:28:43,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:28:43,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-13 02:28:43,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141773391] [2022-12-13 02:28:43,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:28:43,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 02:28:43,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:28:43,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 02:28:43,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=192, Unknown=1, NotChecked=0, Total=240 [2022-12-13 02:28:43,404 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 84 [2022-12-13 02:28:43,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 405 transitions, 11722 flow. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:28:43,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:28:43,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 84 [2022-12-13 02:28:43,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:28:45,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 02:28:58,041 WARN L233 SmtUtils]: Spent 12.26s on a formula simplification that was a NOOP. DAG size: 137 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 02:29:01,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 02:29:06,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 02:29:09,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 02:29:13,052 INFO L130 PetriNetUnfolder]: 2418/4403 cut-off events. [2022-12-13 02:29:13,052 INFO L131 PetriNetUnfolder]: For 256686/256686 co-relation queries the response was YES. [2022-12-13 02:29:13,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57781 conditions, 4403 events. 2418/4403 cut-off events. For 256686/256686 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 30823 event pairs, 327 based on Foata normal form. 33/4432 useless extension candidates. Maximal degree in co-relation 57016. Up to 2704 conditions per place. [2022-12-13 02:29:13,108 INFO L137 encePairwiseOnDemand]: 12/84 looper letters, 289 selfloop transitions, 310 changer transitions 7/606 dead transitions. [2022-12-13 02:29:13,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 606 transitions, 17880 flow [2022-12-13 02:29:13,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 02:29:13,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-13 02:29:13,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 228 transitions. [2022-12-13 02:29:13,110 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.09693877551020408 [2022-12-13 02:29:13,110 INFO L175 Difference]: Start difference. First operand has 288 places, 405 transitions, 11722 flow. Second operand 28 states and 228 transitions. [2022-12-13 02:29:13,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 606 transitions, 17880 flow [2022-12-13 02:29:13,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 606 transitions, 17556 flow, removed 151 selfloop flow, removed 3 redundant places. [2022-12-13 02:29:13,948 INFO L231 Difference]: Finished difference. Result has 323 places, 507 transitions, 15911 flow [2022-12-13 02:29:13,948 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=11436, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=218, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=15911, PETRI_PLACES=323, PETRI_TRANSITIONS=507} [2022-12-13 02:29:13,949 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 302 predicate places. [2022-12-13 02:29:13,949 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:29:13,949 INFO L89 Accepts]: Start accepts. Operand has 323 places, 507 transitions, 15911 flow [2022-12-13 02:29:13,951 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:29:13,951 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:29:13,952 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 323 places, 507 transitions, 15911 flow [2022-12-13 02:29:13,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 321 places, 507 transitions, 15911 flow [2022-12-13 02:29:14,338 INFO L130 PetriNetUnfolder]: 542/1608 cut-off events. [2022-12-13 02:29:14,338 INFO L131 PetriNetUnfolder]: For 101413/101790 co-relation queries the response was YES. [2022-12-13 02:29:14,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23100 conditions, 1608 events. 542/1608 cut-off events. For 101413/101790 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 13985 event pairs, 57 based on Foata normal form. 12/1572 useless extension candidates. Maximal degree in co-relation 22756. Up to 624 conditions per place. [2022-12-13 02:29:14,368 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 321 places, 507 transitions, 15911 flow [2022-12-13 02:29:14,369 INFO L226 LiptonReduction]: Number of co-enabled transitions 1506 [2022-12-13 02:29:14,525 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [707] L59-2-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_313| v_~f~0.base_213))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_210 (* v_~x2~0_272 4))))) (let ((.cse0 (mod (* 3 v_~n~0_199) 4294967296)) (.cse2 (select .cse1 (+ v_~f~0.offset_210 (* .cse3 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_145| (ite (and (<= 0 v_~x1~0_311) (< v_~x1~0_311 v_~size~0_213)) 1 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_207| (+ |v_thread1Thread1of1ForFork0_~i~0#1_208| 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_164| 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_208| 4294967296) .cse0) (= v_~x1~0_310 (select .cse1 (+ v_~f~0.offset_210 (* v_~x1~0_311 4)))) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_165|) |v_thread2Thread1of1ForFork1_~i~1#1_164|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_161| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_165| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_132| (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_213)) 1 0)) (= (select .cse1 (+ v_~f~0.offset_210 (* 4 .cse2))) v_~x2~0_271) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_145| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_161|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_132| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_164|) (not (= (ite (and (<= 0 v_~x2~0_272) (< v_~x2~0_272 v_~size~0_213)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_213)) 1 0) 0)))))) InVars {~x2~0=v_~x2~0_272, ~size~0=v_~size~0_213, ~f~0.base=v_~f~0.base_213, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_208|, #memory_int=|v_#memory_int_313|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_165|, ~n~0=v_~n~0_199, ~x1~0=v_~x1~0_311, ~f~0.offset=v_~f~0.offset_210} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_153|, ~x2~0=v_~x2~0_271, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_124|, ~size~0=v_~size~0_213, ~f~0.base=v_~f~0.base_213, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_96|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_132|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_164|, ~x1~0=v_~x1~0_310, ~f~0.offset=v_~f~0.offset_210, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_164|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_145|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_88|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_207|, #memory_int=|v_#memory_int_313|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_161|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_86|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_96|, ~n~0=v_~n~0_199, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_163|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_100|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:29:18,102 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [804] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_485| v_~f~0.base_357))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_354 (* v_~x1~0_629 4))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_354 (* .cse3 4)))) (.cse0 (mod (* 3 v_~n~0_341) 4294967296))) (and (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_486| 2) 4294967296) .cse0) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_355)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_346|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_486| 1) 4294967296) .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_346| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_362|) (= |v_thread1Thread1of1ForFork0_~i~0#1_484| (+ |v_thread1Thread1of1ForFork0_~i~0#1_486| 3)) (not (= (ite (and (< v_~x1~0_629 v_~size~0_355) (<= 0 v_~x1~0_629)) 1 0) 0)) (= v_~x1~0_627 (select .cse2 (+ v_~f~0.offset_354 (* .cse1 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_362| 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_355)) 1 0) 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_486| 4294967296) .cse0))))) InVars {~size~0=v_~size~0_355, ~f~0.base=v_~f~0.base_357, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_486|, #memory_int=|v_#memory_int_485|, ~n~0=v_~n~0_341, ~x1~0=v_~x1~0_629, ~f~0.offset=v_~f~0.offset_354} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_354|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_346|, ~size~0=v_~size~0_355, ~f~0.base=v_~f~0.base_357, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_484|, #memory_int=|v_#memory_int_485|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_362|, ~n~0=v_~n~0_341, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_364|, ~x1~0=v_~x1~0_627, ~f~0.offset=v_~f~0.offset_354} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] and [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:29:18,574 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [700] $Ultimate##0-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_303| v_~f~0.base_205))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_202 (* v_~x2~0_261 4))))) (let ((.cse4 (select .cse2 (+ v_~f~0.offset_202 (* 4 .cse1))))) (let ((.cse5 (select .cse2 (+ v_~f~0.offset_202 (* 4 .cse4))))) (let ((.cse6 (select .cse2 (+ v_~f~0.offset_202 (* .cse5 4))))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_202 (* 4 .cse6)))) (.cse0 (select .cse2 (+ v_~f~0.offset_202 (* v_~x1~0_283 4))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_187| 2) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_126| (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_205)) 1 0)) (not (= (ite (and (< v_~x1~0_283 v_~size~0_205) (<= 0 v_~x1~0_283)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_205)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_126| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_142|) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_157|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_142| 0)) (not (= (ite (and (< v_~x2~0_261 v_~size~0_205) (<= 0 v_~x2~0_261)) 1 0) 0)) (= (select .cse2 (+ v_~f~0.offset_202 (* .cse3 4))) v_~x2~0_260) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_157| 4294967293) 4294967296) (mod (* 3 v_~n~0_191) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_125| (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_205)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_157|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_157| 0)) (not (= (ite (and (< .cse4 v_~size~0_205) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (< .cse5 v_~size~0_205) (<= 0 .cse5)) 1 0) 0)) (= (select .cse2 (+ v_~f~0.offset_202 (* .cse0 4))) v_~x1~0_282) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_205)) 1 0) 0))))))))) InVars {~x2~0=v_~x2~0_261, ~size~0=v_~size~0_205, ~f~0.base=v_~f~0.base_205, #memory_int=|v_#memory_int_303|, ~n~0=v_~n~0_191, ~x1~0=v_~x1~0_283, ~f~0.offset=v_~f~0.offset_202} OutVars{~x2~0=v_~x2~0_260, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_134|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_117|, ~size~0=v_~size~0_205, ~f~0.base=v_~f~0.base_205, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_89|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_125|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_157|, ~x1~0=v_~x1~0_282, ~f~0.offset=v_~f~0.offset_202, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_157|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_126|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_81|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_187|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_79|, #memory_int=|v_#memory_int_303|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_142|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_89|, ~n~0=v_~n~0_191, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_93|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_144|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:29:19,093 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [805] $Ultimate##0-->L59-2: Formula: (let ((.cse10 (select |v_#memory_int_487| v_~f~0.base_359))) (let ((.cse11 (select .cse10 (+ v_~f~0.offset_356 (* v_~x2~0_533 4))))) (let ((.cse4 (select .cse10 (+ v_~f~0.offset_356 (* .cse11 4))))) (let ((.cse16 (select .cse10 (+ v_~f~0.offset_356 (* .cse4 4))))) (let ((.cse19 (select .cse10 (+ v_~f~0.offset_356 (* 4 .cse16))))) (let ((.cse15 (select .cse10 (+ v_~f~0.offset_356 (* .cse19 4))))) (let ((.cse17 (select .cse10 (+ v_~f~0.offset_356 (* .cse15 4))))) (let ((.cse13 (select .cse10 (+ v_~f~0.offset_356 (* .cse17 4))))) (let ((.cse1 (select .cse10 (+ v_~f~0.offset_356 (* 4 .cse13))))) (let ((.cse5 (select .cse10 (+ v_~f~0.offset_356 (* .cse1 4)))) (.cse2 (select .cse10 (+ v_~f~0.offset_356 (* v_~x1~0_634 4))))) (let ((.cse8 (select .cse10 (+ v_~f~0.offset_356 (* 4 .cse2)))) (.cse18 (select .cse10 (+ v_~f~0.offset_356 (* .cse5 4))))) (let ((.cse20 (select .cse10 (+ v_~f~0.offset_356 (* .cse18 4)))) (.cse3 (select .cse10 (+ v_~f~0.offset_356 (* 4 .cse8))))) (let ((.cse9 (select .cse10 (+ (* .cse3 4) v_~f~0.offset_356))) (.cse0 (select .cse10 (+ v_~f~0.offset_356 (* .cse20 4))))) (let ((.cse14 (select .cse10 (+ v_~f~0.offset_356 (* .cse0 4)))) (.cse7 (select .cse10 (+ v_~f~0.offset_356 (* .cse9 4))))) (let ((.cse6 (select .cse10 (+ v_~f~0.offset_356 (* .cse7 4)))) (.cse12 (select .cse10 (+ v_~f~0.offset_356 (* 4 .cse14))))) (and (< 12 (mod (* 3 v_~n~0_343) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_357)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_357)) 1 0) 0)) (= 7 |v_thread1Thread1of1ForFork0_~i~0#1_490|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_366| 0)) (not (= (ite (and (< .cse2 v_~size~0_357) (<= 0 .cse2)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_323| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_291| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_323|) (= |v_thread2Thread1of1ForFork1_~i~1#1_381| 15) (not (= (ite (and (< .cse3 v_~size~0_357) (<= 0 .cse3)) 1 0) 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_357)) 1 0) 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_357)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_350| (ite (and (< .cse6 v_~size~0_357) (<= 0 .cse6)) 1 0)) (not (= (ite (and (< .cse7 v_~size~0_357) (<= 0 .cse7)) 1 0) 0)) (not (= (ite (and (< .cse8 v_~size~0_357) (<= 0 .cse8)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_533) (< v_~x2~0_533 v_~size~0_357)) 1 0) 0)) (not (= (ite (and (< .cse9 v_~size~0_357) (<= 0 .cse9)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_634) (< v_~x1~0_634 v_~size~0_357)) 1 0) 0)) (= (select .cse10 (+ v_~f~0.offset_356 (* .cse6 4))) v_~x1~0_633) (not (= (ite (and (< .cse11 v_~size~0_357) (<= 0 .cse11)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_291| (ite (and (<= 0 .cse12) (< .cse12 v_~size~0_357)) 1 0)) (= (select .cse10 (+ v_~f~0.offset_356 (* 4 .cse12))) v_~x2~0_531) (not (= (ite (and (<= 0 .cse13) (< .cse13 v_~size~0_357)) 1 0) 0)) (not (= (ite (and (< .cse14 v_~size~0_357) (<= 0 .cse14)) 1 0) 0)) (not (= (ite (and (<= 0 .cse15) (< .cse15 v_~size~0_357)) 1 0) 0)) (not (= (ite (and (< .cse16 v_~size~0_357) (<= 0 .cse16)) 1 0) 0)) (not (= (ite (and (<= 0 .cse17) (< .cse17 v_~size~0_357)) 1 0) 0)) (not (= (ite (and (< .cse18 v_~size~0_357) (<= 0 .cse18)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_350| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_366|) (not (= (ite (and (<= 0 .cse19) (< .cse19 v_~size~0_357)) 1 0) 0)) (not (= (ite (and (<= 0 .cse20) (< .cse20 v_~size~0_357)) 1 0) 0)))))))))))))))))) InVars {~x2~0=v_~x2~0_533, ~size~0=v_~size~0_357, ~f~0.base=v_~f~0.base_359, #memory_int=|v_#memory_int_487|, ~n~0=v_~n~0_343, ~x1~0=v_~x1~0_634, ~f~0.offset=v_~f~0.offset_356} OutVars{~x2~0=v_~x2~0_531, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_358|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_283|, ~size~0=v_~size~0_357, ~f~0.base=v_~f~0.base_359, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_255|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_291|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_381|, ~x1~0=v_~x1~0_633, ~f~0.offset=v_~f~0.offset_356, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_323|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_350|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_247|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_490|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_245|, #memory_int=|v_#memory_int_487|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_366|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_255|, ~n~0=v_~n~0_343, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_259|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_368|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [804] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_485| v_~f~0.base_357))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_354 (* v_~x1~0_629 4))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_354 (* .cse3 4)))) (.cse0 (mod (* 3 v_~n~0_341) 4294967296))) (and (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_486| 2) 4294967296) .cse0) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_355)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_346|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_486| 1) 4294967296) .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_346| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_362|) (= |v_thread1Thread1of1ForFork0_~i~0#1_484| (+ |v_thread1Thread1of1ForFork0_~i~0#1_486| 3)) (not (= (ite (and (< v_~x1~0_629 v_~size~0_355) (<= 0 v_~x1~0_629)) 1 0) 0)) (= v_~x1~0_627 (select .cse2 (+ v_~f~0.offset_354 (* .cse1 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_362| 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_355)) 1 0) 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_486| 4294967296) .cse0))))) InVars {~size~0=v_~size~0_355, ~f~0.base=v_~f~0.base_357, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_486|, #memory_int=|v_#memory_int_485|, ~n~0=v_~n~0_341, ~x1~0=v_~x1~0_629, ~f~0.offset=v_~f~0.offset_354} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_354|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_346|, ~size~0=v_~size~0_355, ~f~0.base=v_~f~0.base_357, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_484|, #memory_int=|v_#memory_int_485|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_362|, ~n~0=v_~n~0_341, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_364|, ~x1~0=v_~x1~0_627, ~f~0.offset=v_~f~0.offset_354} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:29:22,637 INFO L241 LiptonReduction]: Total number of compositions: 7 [2022-12-13 02:29:22,638 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8689 [2022-12-13 02:29:22,638 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 506 transitions, 16050 flow [2022-12-13 02:29:22,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:29:22,638 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:29:22,638 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:29:22,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-12-13 02:29:22,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-12-13 02:29:22,839 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:29:22,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:29:22,839 INFO L85 PathProgramCache]: Analyzing trace with hash 231534611, now seen corresponding path program 1 times [2022-12-13 02:29:22,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:29:22,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813151942] [2022-12-13 02:29:22,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:29:22,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:29:22,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:29:23,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:29:23,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:29:23,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813151942] [2022-12-13 02:29:23,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813151942] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:29:23,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058822175] [2022-12-13 02:29:23,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:29:23,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:29:23,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:29:23,589 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:29:23,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-13 02:29:23,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:29:23,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 02:29:23,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:29:23,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:29:23,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2022-12-13 02:29:23,776 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:29:23,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 45 [2022-12-13 02:29:23,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:29:23,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:29:23,884 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:29:23,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 104 treesize of output 228 [2022-12-13 02:29:23,917 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:29:23,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 116 [2022-12-13 02:29:24,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:29:24,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058822175] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:29:24,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:29:24,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-13 02:29:24,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750424776] [2022-12-13 02:29:24,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:29:24,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 02:29:24,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:29:24,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 02:29:24,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-12-13 02:29:24,601 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 91 [2022-12-13 02:29:24,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 506 transitions, 16050 flow. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states 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 02:29:24,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:29:24,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 91 [2022-12-13 02:29:24,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:29:27,291 INFO L130 PetriNetUnfolder]: 2432/4432 cut-off events. [2022-12-13 02:29:27,292 INFO L131 PetriNetUnfolder]: For 282955/282955 co-relation queries the response was YES. [2022-12-13 02:29:27,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60864 conditions, 4432 events. 2432/4432 cut-off events. For 282955/282955 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 31099 event pairs, 1012 based on Foata normal form. 1/4431 useless extension candidates. Maximal degree in co-relation 60160. Up to 4176 conditions per place. [2022-12-13 02:29:27,348 INFO L137 encePairwiseOnDemand]: 36/91 looper letters, 435 selfloop transitions, 103 changer transitions 3/541 dead transitions. [2022-12-13 02:29:27,349 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 541 transitions, 17825 flow [2022-12-13 02:29:27,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 02:29:27,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 02:29:27,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 133 transitions. [2022-12-13 02:29:27,351 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1623931623931624 [2022-12-13 02:29:27,352 INFO L175 Difference]: Start difference. First operand has 320 places, 506 transitions, 16050 flow. Second operand 9 states and 133 transitions. [2022-12-13 02:29:27,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 541 transitions, 17825 flow [2022-12-13 02:29:28,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 541 transitions, 16098 flow, removed 788 selfloop flow, removed 11 redundant places. [2022-12-13 02:29:28,601 INFO L231 Difference]: Finished difference. Result has 320 places, 514 transitions, 14949 flow [2022-12-13 02:29:28,602 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=14345, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=506, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14949, PETRI_PLACES=320, PETRI_TRANSITIONS=514} [2022-12-13 02:29:28,602 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 299 predicate places. [2022-12-13 02:29:28,602 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:29:28,602 INFO L89 Accepts]: Start accepts. Operand has 320 places, 514 transitions, 14949 flow [2022-12-13 02:29:28,604 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:29:28,605 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:29:28,605 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 320 places, 514 transitions, 14949 flow [2022-12-13 02:29:28,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 319 places, 514 transitions, 14949 flow [2022-12-13 02:29:28,980 INFO L130 PetriNetUnfolder]: 544/1611 cut-off events. [2022-12-13 02:29:28,980 INFO L131 PetriNetUnfolder]: For 90641/90956 co-relation queries the response was YES. [2022-12-13 02:29:28,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21525 conditions, 1611 events. 544/1611 cut-off events. For 90641/90956 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 14024 event pairs, 62 based on Foata normal form. 10/1572 useless extension candidates. Maximal degree in co-relation 21251. Up to 517 conditions per place. [2022-12-13 02:29:29,012 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 319 places, 514 transitions, 14949 flow [2022-12-13 02:29:29,012 INFO L226 LiptonReduction]: Number of co-enabled transitions 1516 [2022-12-13 02:29:29,014 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:29:29,015 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 413 [2022-12-13 02:29:29,015 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 514 transitions, 14949 flow [2022-12-13 02:29:29,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states 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 02:29:29,015 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:29:29,015 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:29:29,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-12-13 02:29:29,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-12-13 02:29:29,220 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:29:29,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:29:29,221 INFO L85 PathProgramCache]: Analyzing trace with hash -841780125, now seen corresponding path program 1 times [2022-12-13 02:29:29,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:29:29,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685948272] [2022-12-13 02:29:29,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:29:29,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:29:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:29:30,129 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 02:29:30,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:29:30,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685948272] [2022-12-13 02:29:30,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685948272] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:29:30,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:29:30,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:29:30,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113667879] [2022-12-13 02:29:30,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:29:30,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:29:30,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:29:30,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:29:30,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:29:30,130 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 91 [2022-12-13 02:29:30,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 514 transitions, 14949 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:29:30,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:29:30,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 91 [2022-12-13 02:29:30,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:29:33,353 INFO L130 PetriNetUnfolder]: 2469/4504 cut-off events. [2022-12-13 02:29:33,353 INFO L131 PetriNetUnfolder]: For 237107/237107 co-relation queries the response was YES. [2022-12-13 02:29:33,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56771 conditions, 4504 events. 2469/4504 cut-off events. For 237107/237107 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 31875 event pairs, 1042 based on Foata normal form. 1/4503 useless extension candidates. Maximal degree in co-relation 56238. Up to 4225 conditions per place. [2022-12-13 02:29:33,411 INFO L137 encePairwiseOnDemand]: 39/91 looper letters, 437 selfloop transitions, 101 changer transitions 9/547 dead transitions. [2022-12-13 02:29:33,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 547 transitions, 16493 flow [2022-12-13 02:29:33,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:29:33,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:29:33,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2022-12-13 02:29:33,412 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.26593406593406593 [2022-12-13 02:29:33,412 INFO L175 Difference]: Start difference. First operand has 319 places, 514 transitions, 14949 flow. Second operand 5 states and 121 transitions. [2022-12-13 02:29:33,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 547 transitions, 16493 flow [2022-12-13 02:29:34,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 547 transitions, 16333 flow, removed 36 selfloop flow, removed 4 redundant places. [2022-12-13 02:29:34,388 INFO L231 Difference]: Finished difference. Result has 321 places, 524 transitions, 15332 flow [2022-12-13 02:29:34,388 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=14789, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=514, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=15332, PETRI_PLACES=321, PETRI_TRANSITIONS=524} [2022-12-13 02:29:34,388 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 300 predicate places. [2022-12-13 02:29:34,389 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:29:34,389 INFO L89 Accepts]: Start accepts. Operand has 321 places, 524 transitions, 15332 flow [2022-12-13 02:29:34,391 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:29:34,391 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:29:34,391 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 321 places, 524 transitions, 15332 flow [2022-12-13 02:29:34,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 321 places, 524 transitions, 15332 flow [2022-12-13 02:29:34,840 INFO L130 PetriNetUnfolder]: 555/1643 cut-off events. [2022-12-13 02:29:34,840 INFO L131 PetriNetUnfolder]: For 90920/91255 co-relation queries the response was YES. [2022-12-13 02:29:34,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21861 conditions, 1643 events. 555/1643 cut-off events. For 90920/91255 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 14455 event pairs, 58 based on Foata normal form. 13/1608 useless extension candidates. Maximal degree in co-relation 21588. Up to 530 conditions per place. [2022-12-13 02:29:34,882 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 321 places, 524 transitions, 15332 flow [2022-12-13 02:29:34,882 INFO L226 LiptonReduction]: Number of co-enabled transitions 1540 [2022-12-13 02:29:34,885 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:29:34,886 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 497 [2022-12-13 02:29:34,886 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 524 transitions, 15332 flow [2022-12-13 02:29:34,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:29:34,886 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:29:34,886 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:29:34,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-12-13 02:29:34,887 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:29:34,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:29:34,887 INFO L85 PathProgramCache]: Analyzing trace with hash -2014123978, now seen corresponding path program 1 times [2022-12-13 02:29:34,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:29:34,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183159864] [2022-12-13 02:29:34,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:29:34,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:29:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:29:34,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:29:34,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:29:34,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183159864] [2022-12-13 02:29:34,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183159864] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:29:34,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:29:34,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 02:29:34,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046569102] [2022-12-13 02:29:34,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:29:34,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:29:34,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:29:34,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:29:34,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:29:34,970 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 91 [2022-12-13 02:29:34,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 524 transitions, 15332 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:29:34,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:29:34,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 91 [2022-12-13 02:29:34,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:29:36,780 INFO L130 PetriNetUnfolder]: 2466/4501 cut-off events. [2022-12-13 02:29:36,780 INFO L131 PetriNetUnfolder]: For 238364/238364 co-relation queries the response was YES. [2022-12-13 02:29:36,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56851 conditions, 4501 events. 2466/4501 cut-off events. For 238364/238364 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 31566 event pairs, 1106 based on Foata normal form. 2/4501 useless extension candidates. Maximal degree in co-relation 56322. Up to 4423 conditions per place. [2022-12-13 02:29:36,832 INFO L137 encePairwiseOnDemand]: 80/91 looper letters, 504 selfloop transitions, 35 changer transitions 1/540 dead transitions. [2022-12-13 02:29:36,833 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 540 transitions, 16737 flow [2022-12-13 02:29:36,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:29:36,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:29:36,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2022-12-13 02:29:36,833 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22857142857142856 [2022-12-13 02:29:36,833 INFO L175 Difference]: Start difference. First operand has 321 places, 524 transitions, 15332 flow. Second operand 5 states and 104 transitions. [2022-12-13 02:29:36,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 540 transitions, 16737 flow [2022-12-13 02:29:37,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 540 transitions, 16596 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 02:29:37,759 INFO L231 Difference]: Finished difference. Result has 324 places, 530 transitions, 15451 flow [2022-12-13 02:29:37,760 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=15191, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=493, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=15451, PETRI_PLACES=324, PETRI_TRANSITIONS=530} [2022-12-13 02:29:37,760 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 303 predicate places. [2022-12-13 02:29:37,760 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:29:37,760 INFO L89 Accepts]: Start accepts. Operand has 324 places, 530 transitions, 15451 flow [2022-12-13 02:29:37,762 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:29:37,762 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:29:37,762 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 324 places, 530 transitions, 15451 flow [2022-12-13 02:29:37,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 324 places, 530 transitions, 15451 flow [2022-12-13 02:29:38,182 INFO L130 PetriNetUnfolder]: 558/1655 cut-off events. [2022-12-13 02:29:38,182 INFO L131 PetriNetUnfolder]: For 92739/93050 co-relation queries the response was YES. [2022-12-13 02:29:38,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22101 conditions, 1655 events. 558/1655 cut-off events. For 92739/93050 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 14457 event pairs, 54 based on Foata normal form. 11/1623 useless extension candidates. Maximal degree in co-relation 21826. Up to 531 conditions per place. [2022-12-13 02:29:38,213 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 324 places, 530 transitions, 15451 flow [2022-12-13 02:29:38,213 INFO L226 LiptonReduction]: Number of co-enabled transitions 1548 [2022-12-13 02:29:38,219 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:29:38,318 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:29:38,435 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:29:38,550 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [652] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_145| v_~f~0.base_103))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_103 (* v_~x2~0_157 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse2))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (= (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse1))) v_~x2~0_156) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_109)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_99|) (not (= (ite (and (<= 0 v_~x2~0_157) (< v_~x2~0_157 v_~size~0_109)) 1 0) 0)) (< (mod (+ 4294967293 |v_thread2Thread1of1ForFork1_~i~1#1_99|) 4294967296) (mod (* v_~n~0_90 3) 4294967296)) (not (= 0 (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_109)) 1 0))))))) InVars {~x2~0=v_~x2~0_157, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, #memory_int=|v_#memory_int_145|, ~n~0=v_~n~0_90, ~f~0.offset=v_~f~0.offset_103} OutVars{~x2~0=v_~x2~0_156, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_65|, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_99|, ~f~0.offset=v_~f~0.offset_103, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_29|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_90, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_41|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:29:38,758 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [652] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_145| v_~f~0.base_103))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_103 (* v_~x2~0_157 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse2))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (= (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse1))) v_~x2~0_156) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_109)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_99|) (not (= (ite (and (<= 0 v_~x2~0_157) (< v_~x2~0_157 v_~size~0_109)) 1 0) 0)) (< (mod (+ 4294967293 |v_thread2Thread1of1ForFork1_~i~1#1_99|) 4294967296) (mod (* v_~n~0_90 3) 4294967296)) (not (= 0 (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_109)) 1 0))))))) InVars {~x2~0=v_~x2~0_157, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, #memory_int=|v_#memory_int_145|, ~n~0=v_~n~0_90, ~f~0.offset=v_~f~0.offset_103} OutVars{~x2~0=v_~x2~0_156, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_65|, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_99|, ~f~0.offset=v_~f~0.offset_103, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_29|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_90, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_41|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [837] L49-2-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_539| v_~f~0.base_400))) (let ((.cse0 (mod (* 3 v_~n~0_381) 4294967296)) (.cse2 (select .cse1 (+ v_~f~0.offset_397 (* v_~x1~0_739 4))))) (and (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_569| 1) 4294967296) .cse0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_429| 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_569| 4294967296) .cse0) (= v_~x1~0_737 (select .cse1 (+ v_~f~0.offset_397 (* .cse2 4)))) (not (= (ite (and (<= 0 v_~x1~0_739) (< v_~x1~0_739 v_~size~0_395)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_413| (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_395)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_413| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_429|) (= |v_thread1Thread1of1ForFork0_~i~0#1_567| (+ |v_thread1Thread1of1ForFork0_~i~0#1_569| 2))))) InVars {~size~0=v_~size~0_395, ~f~0.base=v_~f~0.base_400, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_569|, #memory_int=|v_#memory_int_539|, ~n~0=v_~n~0_381, ~x1~0=v_~x1~0_739, ~f~0.offset=v_~f~0.offset_397} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_421|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_413|, ~size~0=v_~size~0_395, ~f~0.base=v_~f~0.base_400, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_567|, #memory_int=|v_#memory_int_539|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_429|, ~n~0=v_~n~0_381, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_431|, ~x1~0=v_~x1~0_737, ~f~0.offset=v_~f~0.offset_397} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:29:39,118 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 02:29:39,118 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1358 [2022-12-13 02:29:39,118 INFO L495 AbstractCegarLoop]: Abstraction has has 324 places, 530 transitions, 15559 flow [2022-12-13 02:29:39,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:29:39,118 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:29:39,118 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:29:39,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-12-13 02:29:39,119 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:29:39,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:29:39,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1207476663, now seen corresponding path program 1 times [2022-12-13 02:29:39,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:29:39,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012417293] [2022-12-13 02:29:39,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:29:39,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:29:39,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:29:39,160 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 02:29:39,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:29:39,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012417293] [2022-12-13 02:29:39,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012417293] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:29:39,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:29:39,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:29:39,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282004512] [2022-12-13 02:29:39,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:29:39,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:29:39,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:29:39,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:29:39,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:29:39,162 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 95 [2022-12-13 02:29:39,162 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 530 transitions, 15559 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:29:39,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:29:39,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 95 [2022-12-13 02:29:39,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:29:40,910 INFO L130 PetriNetUnfolder]: 2472/4506 cut-off events. [2022-12-13 02:29:40,910 INFO L131 PetriNetUnfolder]: For 246942/246942 co-relation queries the response was YES. [2022-12-13 02:29:40,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57700 conditions, 4506 events. 2472/4506 cut-off events. For 246942/246942 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 31607 event pairs, 1118 based on Foata normal form. 6/4510 useless extension candidates. Maximal degree in co-relation 57166. Up to 4386 conditions per place. [2022-12-13 02:29:40,998 INFO L137 encePairwiseOnDemand]: 79/95 looper letters, 506 selfloop transitions, 37 changer transitions 2/545 dead transitions. [2022-12-13 02:29:40,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 545 transitions, 17008 flow [2022-12-13 02:29:40,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:29:40,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:29:40,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-12-13 02:29:40,999 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28421052631578947 [2022-12-13 02:29:40,999 INFO L175 Difference]: Start difference. First operand has 324 places, 530 transitions, 15559 flow. Second operand 4 states and 108 transitions. [2022-12-13 02:29:40,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 545 transitions, 17008 flow [2022-12-13 02:29:42,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 545 transitions, 16797 flow, removed 92 selfloop flow, removed 1 redundant places. [2022-12-13 02:29:42,385 INFO L231 Difference]: Finished difference. Result has 327 places, 529 transitions, 15465 flow [2022-12-13 02:29:42,386 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=15348, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=530, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=493, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=15465, PETRI_PLACES=327, PETRI_TRANSITIONS=529} [2022-12-13 02:29:42,386 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 306 predicate places. [2022-12-13 02:29:42,386 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:29:42,386 INFO L89 Accepts]: Start accepts. Operand has 327 places, 529 transitions, 15465 flow [2022-12-13 02:29:42,389 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:29:42,389 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:29:42,389 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 327 places, 529 transitions, 15465 flow [2022-12-13 02:29:42,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 325 places, 529 transitions, 15465 flow [2022-12-13 02:29:42,733 INFO L130 PetriNetUnfolder]: 561/1649 cut-off events. [2022-12-13 02:29:42,733 INFO L131 PetriNetUnfolder]: For 96284/96608 co-relation queries the response was YES. [2022-12-13 02:29:42,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22338 conditions, 1649 events. 561/1649 cut-off events. For 96284/96608 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 14327 event pairs, 61 based on Foata normal form. 11/1612 useless extension candidates. Maximal degree in co-relation 22060. Up to 534 conditions per place. [2022-12-13 02:29:42,766 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 325 places, 529 transitions, 15465 flow [2022-12-13 02:29:42,767 INFO L226 LiptonReduction]: Number of co-enabled transitions 1550 [2022-12-13 02:29:43,125 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [652] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_145| v_~f~0.base_103))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_103 (* v_~x2~0_157 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse2))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (= (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse1))) v_~x2~0_156) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_109)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_99|) (not (= (ite (and (<= 0 v_~x2~0_157) (< v_~x2~0_157 v_~size~0_109)) 1 0) 0)) (< (mod (+ 4294967293 |v_thread2Thread1of1ForFork1_~i~1#1_99|) 4294967296) (mod (* v_~n~0_90 3) 4294967296)) (not (= 0 (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_109)) 1 0))))))) InVars {~x2~0=v_~x2~0_157, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, #memory_int=|v_#memory_int_145|, ~n~0=v_~n~0_90, ~f~0.offset=v_~f~0.offset_103} OutVars{~x2~0=v_~x2~0_156, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_65|, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_99|, ~f~0.offset=v_~f~0.offset_103, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_29|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_90, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_41|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:29:43,578 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:29:43,579 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1193 [2022-12-13 02:29:43,579 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 529 transitions, 15502 flow [2022-12-13 02:29:43,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:29:43,579 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:29:43,579 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:29:43,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-12-13 02:29:43,579 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:29:43,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:29:43,580 INFO L85 PathProgramCache]: Analyzing trace with hash 638253172, now seen corresponding path program 1 times [2022-12-13 02:29:43,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:29:43,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775175225] [2022-12-13 02:29:43,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:29:43,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:29:43,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:29:43,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:29:43,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:29:43,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775175225] [2022-12-13 02:29:43,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775175225] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:29:43,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:29:43,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 02:29:43,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468775766] [2022-12-13 02:29:43,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:29:43,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:29:43,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:29:43,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:29:43,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:29:43,635 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 97 [2022-12-13 02:29:43,635 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 529 transitions, 15502 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:29:43,635 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:29:43,635 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 97 [2022-12-13 02:29:43,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:29:45,419 INFO L130 PetriNetUnfolder]: 2470/4500 cut-off events. [2022-12-13 02:29:45,420 INFO L131 PetriNetUnfolder]: For 261151/261151 co-relation queries the response was YES. [2022-12-13 02:29:45,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58249 conditions, 4500 events. 2470/4500 cut-off events. For 261151/261151 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 31708 event pairs, 660 based on Foata normal form. 6/4504 useless extension candidates. Maximal degree in co-relation 57708. Up to 2736 conditions per place. [2022-12-13 02:29:45,484 INFO L137 encePairwiseOnDemand]: 76/97 looper letters, 531 selfloop transitions, 46 changer transitions 8/585 dead transitions. [2022-12-13 02:29:45,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 585 transitions, 17850 flow [2022-12-13 02:29:45,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:29:45,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:29:45,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2022-12-13 02:29:45,485 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23917525773195877 [2022-12-13 02:29:45,485 INFO L175 Difference]: Start difference. First operand has 325 places, 529 transitions, 15502 flow. Second operand 5 states and 116 transitions. [2022-12-13 02:29:45,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 585 transitions, 17850 flow [2022-12-13 02:29:46,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 585 transitions, 17698 flow, removed 44 selfloop flow, removed 2 redundant places. [2022-12-13 02:29:46,596 INFO L231 Difference]: Finished difference. Result has 329 places, 527 transitions, 15490 flow [2022-12-13 02:29:46,597 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=15383, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=529, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=483, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=15490, PETRI_PLACES=329, PETRI_TRANSITIONS=527} [2022-12-13 02:29:46,597 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 308 predicate places. [2022-12-13 02:29:46,597 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:29:46,597 INFO L89 Accepts]: Start accepts. Operand has 329 places, 527 transitions, 15490 flow [2022-12-13 02:29:46,599 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:29:46,599 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:29:46,599 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 329 places, 527 transitions, 15490 flow [2022-12-13 02:29:46,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 328 places, 527 transitions, 15490 flow [2022-12-13 02:29:46,997 INFO L130 PetriNetUnfolder]: 557/1641 cut-off events. [2022-12-13 02:29:46,997 INFO L131 PetriNetUnfolder]: For 100651/100957 co-relation queries the response was YES. [2022-12-13 02:29:47,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22645 conditions, 1641 events. 557/1641 cut-off events. For 100651/100957 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 14316 event pairs, 62 based on Foata normal form. 9/1603 useless extension candidates. Maximal degree in co-relation 22362. Up to 533 conditions per place. [2022-12-13 02:29:47,029 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 328 places, 527 transitions, 15490 flow [2022-12-13 02:29:47,029 INFO L226 LiptonReduction]: Number of co-enabled transitions 1546 [2022-12-13 02:29:47,043 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [652] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_145| v_~f~0.base_103))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_103 (* v_~x2~0_157 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse2))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (= (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse1))) v_~x2~0_156) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_109)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_99|) (not (= (ite (and (<= 0 v_~x2~0_157) (< v_~x2~0_157 v_~size~0_109)) 1 0) 0)) (< (mod (+ 4294967293 |v_thread2Thread1of1ForFork1_~i~1#1_99|) 4294967296) (mod (* v_~n~0_90 3) 4294967296)) (not (= 0 (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_109)) 1 0))))))) InVars {~x2~0=v_~x2~0_157, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, #memory_int=|v_#memory_int_145|, ~n~0=v_~n~0_90, ~f~0.offset=v_~f~0.offset_103} OutVars{~x2~0=v_~x2~0_156, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_65|, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_99|, ~f~0.offset=v_~f~0.offset_103, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_29|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_90, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_41|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:29:47,572 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:29:47,573 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 976 [2022-12-13 02:29:47,573 INFO L495 AbstractCegarLoop]: Abstraction has has 328 places, 527 transitions, 15514 flow [2022-12-13 02:29:47,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:29:47,573 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:29:47,573 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:29:47,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-12-13 02:29:47,573 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:29:47,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:29:47,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1473775901, now seen corresponding path program 1 times [2022-12-13 02:29:47,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:29:47,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912351938] [2022-12-13 02:29:47,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:29:47,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:29:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:29:49,974 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 02:29:49,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:29:49,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912351938] [2022-12-13 02:29:49,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912351938] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:29:49,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:29:49,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 02:29:49,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99351301] [2022-12-13 02:29:49,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:29:49,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 02:29:49,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:29:49,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 02:29:49,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 02:29:49,975 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 97 [2022-12-13 02:29:49,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 527 transitions, 15514 flow. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:29:49,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:29:49,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 97 [2022-12-13 02:29:49,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:29:56,522 INFO L130 PetriNetUnfolder]: 2501/4551 cut-off events. [2022-12-13 02:29:56,523 INFO L131 PetriNetUnfolder]: For 281229/281229 co-relation queries the response was YES. [2022-12-13 02:29:56,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59968 conditions, 4551 events. 2501/4551 cut-off events. For 281229/281229 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 32044 event pairs, 1022 based on Foata normal form. 1/4550 useless extension candidates. Maximal degree in co-relation 59410. Up to 4283 conditions per place. [2022-12-13 02:29:56,583 INFO L137 encePairwiseOnDemand]: 35/97 looper letters, 444 selfloop transitions, 113 changer transitions 4/561 dead transitions. [2022-12-13 02:29:56,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 561 transitions, 17461 flow [2022-12-13 02:29:56,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 02:29:56,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 02:29:56,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2022-12-13 02:29:56,584 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19145802650957292 [2022-12-13 02:29:56,585 INFO L175 Difference]: Start difference. First operand has 328 places, 527 transitions, 15514 flow. Second operand 7 states and 130 transitions. [2022-12-13 02:29:56,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 561 transitions, 17461 flow [2022-12-13 02:29:57,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 561 transitions, 17380 flow, removed 21 selfloop flow, removed 3 redundant places. [2022-12-13 02:29:57,771 INFO L231 Difference]: Finished difference. Result has 336 places, 540 transitions, 16346 flow [2022-12-13 02:29:57,771 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=15455, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=527, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=16346, PETRI_PLACES=336, PETRI_TRANSITIONS=540} [2022-12-13 02:29:57,772 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 315 predicate places. [2022-12-13 02:29:57,772 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:29:57,772 INFO L89 Accepts]: Start accepts. Operand has 336 places, 540 transitions, 16346 flow [2022-12-13 02:29:57,774 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:29:57,775 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:29:57,775 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 336 places, 540 transitions, 16346 flow [2022-12-13 02:29:57,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 335 places, 540 transitions, 16346 flow [2022-12-13 02:29:58,110 INFO L130 PetriNetUnfolder]: 570/1672 cut-off events. [2022-12-13 02:29:58,110 INFO L131 PetriNetUnfolder]: For 107561/107867 co-relation queries the response was YES. [2022-12-13 02:29:58,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23507 conditions, 1672 events. 570/1672 cut-off events. For 107561/107867 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 14626 event pairs, 63 based on Foata normal form. 9/1634 useless extension candidates. Maximal degree in co-relation 23214. Up to 543 conditions per place. [2022-12-13 02:29:58,140 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 335 places, 540 transitions, 16346 flow [2022-12-13 02:29:58,141 INFO L226 LiptonReduction]: Number of co-enabled transitions 1574 [2022-12-13 02:30:01,764 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:30:01,765 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3993 [2022-12-13 02:30:01,765 INFO L495 AbstractCegarLoop]: Abstraction has has 335 places, 540 transitions, 16392 flow [2022-12-13 02:30:01,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:30:01,765 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:30:01,765 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:30:01,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-12-13 02:30:01,765 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:30:01,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:30:01,766 INFO L85 PathProgramCache]: Analyzing trace with hash -84252202, now seen corresponding path program 1 times [2022-12-13 02:30:01,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:30:01,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671671135] [2022-12-13 02:30:01,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:30:01,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:30:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:30:01,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:30:01,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:30:01,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671671135] [2022-12-13 02:30:01,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671671135] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:30:01,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003568856] [2022-12-13 02:30:01,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:30:01,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:30:01,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:30:01,824 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:30:01,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-13 02:30:01,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:30:01,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 02:30:01,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:30:01,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:30:01,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:30:02,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:30:02,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003568856] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:30:02,040 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:30:02,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-13 02:30:02,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840735465] [2022-12-13 02:30:02,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:30:02,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 02:30:02,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:30:02,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 02:30:02,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 02:30:02,041 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 99 [2022-12-13 02:30:02,042 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 540 transitions, 16392 flow. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states 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 02:30:02,042 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:30:02,042 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 99 [2022-12-13 02:30:02,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:30:04,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 02:30:07,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 02:30:08,497 INFO L130 PetriNetUnfolder]: 2653/4866 cut-off events. [2022-12-13 02:30:08,497 INFO L131 PetriNetUnfolder]: For 326132/326132 co-relation queries the response was YES. [2022-12-13 02:30:08,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65773 conditions, 4866 events. 2653/4866 cut-off events. For 326132/326132 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 35040 event pairs, 873 based on Foata normal form. 26/4890 useless extension candidates. Maximal degree in co-relation 65208. Up to 3334 conditions per place. [2022-12-13 02:30:08,563 INFO L137 encePairwiseOnDemand]: 37/99 looper letters, 363 selfloop transitions, 249 changer transitions 3/615 dead transitions. [2022-12-13 02:30:08,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 615 transitions, 19386 flow [2022-12-13 02:30:08,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 02:30:08,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 02:30:08,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions. [2022-12-13 02:30:08,564 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.18181818181818182 [2022-12-13 02:30:08,564 INFO L175 Difference]: Start difference. First operand has 335 places, 540 transitions, 16392 flow. Second operand 9 states and 162 transitions. [2022-12-13 02:30:08,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 615 transitions, 19386 flow [2022-12-13 02:30:09,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 615 transitions, 19258 flow, removed 19 selfloop flow, removed 1 redundant places. [2022-12-13 02:30:09,867 INFO L231 Difference]: Finished difference. Result has 346 places, 552 transitions, 17568 flow [2022-12-13 02:30:09,867 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=16264, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=236, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=17568, PETRI_PLACES=346, PETRI_TRANSITIONS=552} [2022-12-13 02:30:09,867 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 325 predicate places. [2022-12-13 02:30:09,867 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:30:09,867 INFO L89 Accepts]: Start accepts. Operand has 346 places, 552 transitions, 17568 flow [2022-12-13 02:30:09,870 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:30:09,870 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:30:09,870 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 346 places, 552 transitions, 17568 flow [2022-12-13 02:30:09,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 345 places, 552 transitions, 17568 flow [2022-12-13 02:30:10,288 INFO L130 PetriNetUnfolder]: 610/1816 cut-off events. [2022-12-13 02:30:10,288 INFO L131 PetriNetUnfolder]: For 138054/138479 co-relation queries the response was YES. [2022-12-13 02:30:10,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27044 conditions, 1816 events. 610/1816 cut-off events. For 138054/138479 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 16284 event pairs, 69 based on Foata normal form. 12/1777 useless extension candidates. Maximal degree in co-relation 26740. Up to 588 conditions per place. [2022-12-13 02:30:10,324 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 345 places, 552 transitions, 17568 flow [2022-12-13 02:30:10,324 INFO L226 LiptonReduction]: Number of co-enabled transitions 1626 [2022-12-13 02:30:10,326 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:30:10,326 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 459 [2022-12-13 02:30:10,326 INFO L495 AbstractCegarLoop]: Abstraction has has 345 places, 552 transitions, 17568 flow [2022-12-13 02:30:10,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states 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 02:30:10,327 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:30:10,327 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:30:10,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-12-13 02:30:10,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:30:10,529 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:30:10,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:30:10,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1798304842, now seen corresponding path program 1 times [2022-12-13 02:30:10,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:30:10,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033035434] [2022-12-13 02:30:10,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:30:10,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:30:10,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:30:10,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:30:10,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:30:10,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033035434] [2022-12-13 02:30:10,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033035434] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:30:10,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:30:10,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 02:30:10,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133728680] [2022-12-13 02:30:10,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:30:10,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:30:10,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:30:10,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:30:10,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:30:10,602 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 98 [2022-12-13 02:30:10,602 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 552 transitions, 17568 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:30:10,602 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:30:10,602 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 98 [2022-12-13 02:30:10,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:30:12,873 INFO L130 PetriNetUnfolder]: 2688/4950 cut-off events. [2022-12-13 02:30:12,873 INFO L131 PetriNetUnfolder]: For 377597/377597 co-relation queries the response was YES. [2022-12-13 02:30:12,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70561 conditions, 4950 events. 2688/4950 cut-off events. For 377597/377597 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 35949 event pairs, 982 based on Foata normal form. 20/4968 useless extension candidates. Maximal degree in co-relation 69799. Up to 4192 conditions per place. [2022-12-13 02:30:12,943 INFO L137 encePairwiseOnDemand]: 37/98 looper letters, 390 selfloop transitions, 211 changer transitions 0/601 dead transitions. [2022-12-13 02:30:12,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 601 transitions, 19961 flow [2022-12-13 02:30:12,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 02:30:12,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 02:30:12,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 136 transitions. [2022-12-13 02:30:12,944 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.15419501133786848 [2022-12-13 02:30:12,944 INFO L175 Difference]: Start difference. First operand has 345 places, 552 transitions, 17568 flow. Second operand 9 states and 136 transitions. [2022-12-13 02:30:12,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 601 transitions, 19961 flow [2022-12-13 02:30:14,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 601 transitions, 19558 flow, removed 86 selfloop flow, removed 4 redundant places. [2022-12-13 02:30:14,325 INFO L231 Difference]: Finished difference. Result has 353 places, 563 transitions, 18221 flow [2022-12-13 02:30:14,325 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=17179, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=552, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=200, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=18221, PETRI_PLACES=353, PETRI_TRANSITIONS=563} [2022-12-13 02:30:14,325 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 332 predicate places. [2022-12-13 02:30:14,325 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:30:14,325 INFO L89 Accepts]: Start accepts. Operand has 353 places, 563 transitions, 18221 flow [2022-12-13 02:30:14,328 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:30:14,328 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:30:14,328 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 353 places, 563 transitions, 18221 flow [2022-12-13 02:30:14,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 353 places, 563 transitions, 18221 flow [2022-12-13 02:30:14,802 INFO L130 PetriNetUnfolder]: 612/1839 cut-off events. [2022-12-13 02:30:14,802 INFO L131 PetriNetUnfolder]: For 144537/144970 co-relation queries the response was YES. [2022-12-13 02:30:14,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27768 conditions, 1839 events. 612/1839 cut-off events. For 144537/144970 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 16649 event pairs, 60 based on Foata normal form. 13/1796 useless extension candidates. Maximal degree in co-relation 27343. Up to 605 conditions per place. [2022-12-13 02:30:14,837 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 353 places, 563 transitions, 18221 flow [2022-12-13 02:30:14,837 INFO L226 LiptonReduction]: Number of co-enabled transitions 1658 [2022-12-13 02:30:14,839 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:30:14,839 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 514 [2022-12-13 02:30:14,839 INFO L495 AbstractCegarLoop]: Abstraction has has 353 places, 563 transitions, 18221 flow [2022-12-13 02:30:14,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:30:14,840 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:30:14,840 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:30:14,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-12-13 02:30:14,840 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:30:14,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:30:14,840 INFO L85 PathProgramCache]: Analyzing trace with hash -894272857, now seen corresponding path program 1 times [2022-12-13 02:30:14,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:30:14,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588959775] [2022-12-13 02:30:14,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:30:14,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:30:14,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:30:14,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 02:30:14,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:30:14,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588959775] [2022-12-13 02:30:14,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588959775] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:30:14,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:30:14,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:30:14,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176704832] [2022-12-13 02:30:14,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:30:14,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:30:14,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:30:14,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:30:14,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:30:14,947 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 98 [2022-12-13 02:30:14,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 563 transitions, 18221 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:30:14,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:30:14,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 98 [2022-12-13 02:30:14,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:30:17,062 INFO L130 PetriNetUnfolder]: 2685/4941 cut-off events. [2022-12-13 02:30:17,062 INFO L131 PetriNetUnfolder]: For 386061/386061 co-relation queries the response was YES. [2022-12-13 02:30:17,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70854 conditions, 4941 events. 2685/4941 cut-off events. For 386061/386061 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 35721 event pairs, 815 based on Foata normal form. 10/4949 useless extension candidates. Maximal degree in co-relation 70067. Up to 4420 conditions per place. [2022-12-13 02:30:17,125 INFO L137 encePairwiseOnDemand]: 40/98 looper letters, 430 selfloop transitions, 155 changer transitions 0/585 dead transitions. [2022-12-13 02:30:17,125 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 585 transitions, 19968 flow [2022-12-13 02:30:17,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:30:17,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:30:17,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2022-12-13 02:30:17,126 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19727891156462585 [2022-12-13 02:30:17,126 INFO L175 Difference]: Start difference. First operand has 353 places, 563 transitions, 18221 flow. Second operand 6 states and 116 transitions. [2022-12-13 02:30:17,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 585 transitions, 19968 flow [2022-12-13 02:30:18,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 585 transitions, 19621 flow, removed 50 selfloop flow, removed 5 redundant places. [2022-12-13 02:30:18,490 INFO L231 Difference]: Finished difference. Result has 354 places, 566 transitions, 18457 flow [2022-12-13 02:30:18,490 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=17878, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=152, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=18457, PETRI_PLACES=354, PETRI_TRANSITIONS=566} [2022-12-13 02:30:18,491 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 333 predicate places. [2022-12-13 02:30:18,491 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:30:18,491 INFO L89 Accepts]: Start accepts. Operand has 354 places, 566 transitions, 18457 flow [2022-12-13 02:30:18,494 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:30:18,494 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:30:18,494 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 354 places, 566 transitions, 18457 flow [2022-12-13 02:30:18,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 354 places, 566 transitions, 18457 flow [2022-12-13 02:30:18,873 INFO L130 PetriNetUnfolder]: 609/1833 cut-off events. [2022-12-13 02:30:18,874 INFO L131 PetriNetUnfolder]: For 148050/148495 co-relation queries the response was YES. [2022-12-13 02:30:18,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27821 conditions, 1833 events. 609/1833 cut-off events. For 148050/148495 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 16576 event pairs, 57 based on Foata normal form. 13/1792 useless extension candidates. Maximal degree in co-relation 27468. Up to 604 conditions per place. [2022-12-13 02:30:18,910 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 354 places, 566 transitions, 18457 flow [2022-12-13 02:30:18,910 INFO L226 LiptonReduction]: Number of co-enabled transitions 1664 [2022-12-13 02:30:18,912 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:30:18,912 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 421 [2022-12-13 02:30:18,912 INFO L495 AbstractCegarLoop]: Abstraction has has 354 places, 566 transitions, 18457 flow [2022-12-13 02:30:18,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:30:18,913 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:30:18,913 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:30:18,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-12-13 02:30:18,913 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:30:18,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:30:18,913 INFO L85 PathProgramCache]: Analyzing trace with hash 494236214, now seen corresponding path program 1 times [2022-12-13 02:30:18,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:30:18,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005341257] [2022-12-13 02:30:18,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:30:18,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:30:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:30:18,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:30:18,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:30:18,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005341257] [2022-12-13 02:30:18,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005341257] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:30:18,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:30:18,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 02:30:18,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921062360] [2022-12-13 02:30:18,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:30:18,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:30:18,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:30:18,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:30:18,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:30:18,979 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 98 [2022-12-13 02:30:18,979 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 566 transitions, 18457 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:30:18,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:30:18,979 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 98 [2022-12-13 02:30:18,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:30:20,941 INFO L130 PetriNetUnfolder]: 2672/4983 cut-off events. [2022-12-13 02:30:20,942 INFO L131 PetriNetUnfolder]: For 392236/392236 co-relation queries the response was YES. [2022-12-13 02:30:20,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71414 conditions, 4983 events. 2672/4983 cut-off events. For 392236/392236 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 37117 event pairs, 441 based on Foata normal form. 16/4997 useless extension candidates. Maximal degree in co-relation 70755. Up to 2505 conditions per place. [2022-12-13 02:30:21,013 INFO L137 encePairwiseOnDemand]: 42/98 looper letters, 605 selfloop transitions, 160 changer transitions 7/772 dead transitions. [2022-12-13 02:30:21,014 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 772 transitions, 26050 flow [2022-12-13 02:30:21,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 02:30:21,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 02:30:21,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions. [2022-12-13 02:30:21,015 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1564625850340136 [2022-12-13 02:30:21,015 INFO L175 Difference]: Start difference. First operand has 354 places, 566 transitions, 18457 flow. Second operand 9 states and 138 transitions. [2022-12-13 02:30:21,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 772 transitions, 26050 flow [2022-12-13 02:30:22,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 772 transitions, 25772 flow, removed 48 selfloop flow, removed 2 redundant places. [2022-12-13 02:30:22,645 INFO L231 Difference]: Finished difference. Result has 361 places, 587 transitions, 19361 flow [2022-12-13 02:30:22,645 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=18264, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=19361, PETRI_PLACES=361, PETRI_TRANSITIONS=587} [2022-12-13 02:30:22,645 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 340 predicate places. [2022-12-13 02:30:22,645 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:30:22,645 INFO L89 Accepts]: Start accepts. Operand has 361 places, 587 transitions, 19361 flow [2022-12-13 02:30:22,648 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:30:22,648 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:30:22,648 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 361 places, 587 transitions, 19361 flow [2022-12-13 02:30:22,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 361 places, 587 transitions, 19361 flow [2022-12-13 02:30:23,047 INFO L130 PetriNetUnfolder]: 609/1887 cut-off events. [2022-12-13 02:30:23,047 INFO L131 PetriNetUnfolder]: For 156022/156427 co-relation queries the response was YES. [2022-12-13 02:30:23,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28680 conditions, 1887 events. 609/1887 cut-off events. For 156022/156427 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 17355 event pairs, 55 based on Foata normal form. 15/1857 useless extension candidates. Maximal degree in co-relation 28327. Up to 614 conditions per place. [2022-12-13 02:30:23,083 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 361 places, 587 transitions, 19361 flow [2022-12-13 02:30:23,083 INFO L226 LiptonReduction]: Number of co-enabled transitions 1658 [2022-12-13 02:30:24,116 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [821] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_518| v_~f~0.base_382))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_379 (* v_~x2~0_571 4)))) (.cse7 (select .cse1 (+ v_~f~0.offset_379 (* v_~x1~0_685 4))))) (let ((.cse10 (select .cse1 (+ v_~f~0.offset_379 (* .cse7 4)))) (.cse9 (select .cse1 (+ v_~f~0.offset_379 (* .cse4 4))))) (let ((.cse8 (select .cse1 (+ v_~f~0.offset_379 (* .cse9 4)))) (.cse6 (select .cse1 (+ v_~f~0.offset_379 (* .cse10 4))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_379 (* .cse6 4)))) (.cse5 (select .cse1 (+ v_~f~0.offset_379 (* .cse8 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_379 (* 4 .cse5)))) (.cse3 (select .cse1 (+ v_~f~0.offset_379 (* .cse0 4))))) (and (not (= 0 (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_377)) 1 0))) (= (select .cse1 (+ v_~f~0.offset_379 (* .cse2 4))) v_~x2~0_569) (not (= (ite (and (< v_~x2~0_571 v_~size~0_377) (<= 0 v_~x2~0_571)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_395| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_311| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_343|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_523| 4294967295) 4294967296) (mod (* 3 v_~n~0_363) 4294967296)) (= v_~x1~0_683 (select .cse1 (+ v_~f~0.offset_379 (* .cse3 4)))) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_377)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_311| (ite (and (< .cse2 v_~size~0_377) (<= 0 .cse2)) 1 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_377)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_685) (< v_~x1~0_685 v_~size~0_377)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_523| 6) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_377)) 1 0) 0)) (not (= (ite (and (< .cse7 v_~size~0_377) (<= 0 .cse7)) 1 0) 0)) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_377)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_379| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_395|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_343| 0)) (not (= (ite (and (< .cse9 v_~size~0_377) (<= 0 .cse9)) 1 0) 0)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_377)) 1 0) 0)) (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_377)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_379|) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_403|)))))))) InVars {~x2~0=v_~x2~0_571, ~size~0=v_~size~0_377, ~f~0.base=v_~f~0.base_382, #memory_int=|v_#memory_int_518|, ~n~0=v_~n~0_363, ~x1~0=v_~x1~0_685, ~f~0.offset=v_~f~0.offset_379} OutVars{~x2~0=v_~x2~0_569, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_387|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_303|, ~size~0=v_~size~0_377, ~f~0.base=v_~f~0.base_382, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_275|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_311|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_403|, ~x1~0=v_~x1~0_683, ~f~0.offset=v_~f~0.offset_379, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_343|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_379|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_267|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_523|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_265|, #memory_int=|v_#memory_int_518|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_395|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_275|, ~n~0=v_~n~0_363, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_279|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_397|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:30:24,966 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:30:25,057 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:30:25,148 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:30:25,252 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [845] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_553| v_~f~0.base_412))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_409 (* v_~x2~0_616 4))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_409 (* .cse2 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_339| (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_407)) 1 0)) (= v_~x1~0_771 (select .cse1 (+ v_~f~0.offset_409 (* v_~x1~0_772 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_371| 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_443|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_450| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_596| (+ |v_thread1Thread1of1ForFork0_~i~0#1_597| 1)) (not (= (ite (and (< v_~x2~0_616 v_~size~0_407) (<= 0 v_~x2~0_616)) 1 0) 0)) (= (ite (and (<= 0 v_~x1~0_772) (< v_~x1~0_772 v_~size~0_407)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_434|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_339| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_371|) (= v_~x2~0_615 (select .cse1 (+ (* 4 .cse0) v_~f~0.offset_409))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_434| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_450|) (not (= (ite (and (< .cse2 v_~size~0_407) (<= 0 .cse2)) 1 0) 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_597| 4294967296) (mod (* 3 v_~n~0_393) 4294967296)))))) InVars {~x2~0=v_~x2~0_616, ~size~0=v_~size~0_407, ~f~0.base=v_~f~0.base_412, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_597|, #memory_int=|v_#memory_int_553|, ~n~0=v_~n~0_393, ~x1~0=v_~x1~0_772, ~f~0.offset=v_~f~0.offset_409} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_442|, ~x2~0=v_~x2~0_615, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_331|, ~size~0=v_~size~0_407, ~f~0.base=v_~f~0.base_412, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_303|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_339|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_443|, ~x1~0=v_~x1~0_771, ~f~0.offset=v_~f~0.offset_409, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_371|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_434|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_295|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_596|, #memory_int=|v_#memory_int_553|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_450|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_293|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_303|, ~n~0=v_~n~0_393, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_452|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_307|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:30:25,634 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [845] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_553| v_~f~0.base_412))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_409 (* v_~x2~0_616 4))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_409 (* .cse2 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_339| (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_407)) 1 0)) (= v_~x1~0_771 (select .cse1 (+ v_~f~0.offset_409 (* v_~x1~0_772 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_371| 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_443|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_450| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_596| (+ |v_thread1Thread1of1ForFork0_~i~0#1_597| 1)) (not (= (ite (and (< v_~x2~0_616 v_~size~0_407) (<= 0 v_~x2~0_616)) 1 0) 0)) (= (ite (and (<= 0 v_~x1~0_772) (< v_~x1~0_772 v_~size~0_407)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_434|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_339| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_371|) (= v_~x2~0_615 (select .cse1 (+ (* 4 .cse0) v_~f~0.offset_409))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_434| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_450|) (not (= (ite (and (< .cse2 v_~size~0_407) (<= 0 .cse2)) 1 0) 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_597| 4294967296) (mod (* 3 v_~n~0_393) 4294967296)))))) InVars {~x2~0=v_~x2~0_616, ~size~0=v_~size~0_407, ~f~0.base=v_~f~0.base_412, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_597|, #memory_int=|v_#memory_int_553|, ~n~0=v_~n~0_393, ~x1~0=v_~x1~0_772, ~f~0.offset=v_~f~0.offset_409} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_442|, ~x2~0=v_~x2~0_615, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_331|, ~size~0=v_~size~0_407, ~f~0.base=v_~f~0.base_412, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_303|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_339|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_443|, ~x1~0=v_~x1~0_771, ~f~0.offset=v_~f~0.offset_409, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_371|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_434|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_295|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_596|, #memory_int=|v_#memory_int_553|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_450|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_293|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_303|, ~n~0=v_~n~0_393, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_452|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_307|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] [2022-12-13 02:30:25,860 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 02:30:25,860 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3215 [2022-12-13 02:30:25,860 INFO L495 AbstractCegarLoop]: Abstraction has has 360 places, 586 transitions, 19565 flow [2022-12-13 02:30:25,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:30:25,860 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:30:25,861 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:30:25,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-12-13 02:30:25,861 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:30:25,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:30:25,861 INFO L85 PathProgramCache]: Analyzing trace with hash 733156254, now seen corresponding path program 2 times [2022-12-13 02:30:25,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:30:25,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425122917] [2022-12-13 02:30:25,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:30:25,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:30:25,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:30:25,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:30:25,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:30:25,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425122917] [2022-12-13 02:30:25,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425122917] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:30:25,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:30:25,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 02:30:25,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213703035] [2022-12-13 02:30:25,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:30:25,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:30:25,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:30:25,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:30:25,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:30:25,941 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 105 [2022-12-13 02:30:25,941 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 586 transitions, 19565 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:30:25,941 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:30:25,941 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 105 [2022-12-13 02:30:25,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:30:27,980 INFO L130 PetriNetUnfolder]: 2663/4960 cut-off events. [2022-12-13 02:30:27,980 INFO L131 PetriNetUnfolder]: For 395306/395306 co-relation queries the response was YES. [2022-12-13 02:30:28,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72518 conditions, 4960 events. 2663/4960 cut-off events. For 395306/395306 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 36418 event pairs, 1098 based on Foata normal form. 8/4966 useless extension candidates. Maximal degree in co-relation 71692. Up to 4422 conditions per place. [2022-12-13 02:30:28,045 INFO L137 encePairwiseOnDemand]: 69/105 looper letters, 514 selfloop transitions, 95 changer transitions 7/616 dead transitions. [2022-12-13 02:30:28,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 616 transitions, 21493 flow [2022-12-13 02:30:28,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:30:28,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:30:28,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2022-12-13 02:30:28,047 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.20952380952380953 [2022-12-13 02:30:28,047 INFO L175 Difference]: Start difference. First operand has 360 places, 586 transitions, 19565 flow. Second operand 6 states and 132 transitions. [2022-12-13 02:30:28,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 616 transitions, 21493 flow [2022-12-13 02:30:29,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 616 transitions, 21021 flow, removed 219 selfloop flow, removed 1 redundant places. [2022-12-13 02:30:29,570 INFO L231 Difference]: Finished difference. Result has 365 places, 585 transitions, 19234 flow [2022-12-13 02:30:29,570 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=18973, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=19234, PETRI_PLACES=365, PETRI_TRANSITIONS=585} [2022-12-13 02:30:29,571 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 344 predicate places. [2022-12-13 02:30:29,571 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:30:29,571 INFO L89 Accepts]: Start accepts. Operand has 365 places, 585 transitions, 19234 flow [2022-12-13 02:30:29,573 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:30:29,574 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:30:29,574 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 365 places, 585 transitions, 19234 flow [2022-12-13 02:30:29,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 363 places, 585 transitions, 19234 flow [2022-12-13 02:30:30,071 INFO L130 PetriNetUnfolder]: 606/1844 cut-off events. [2022-12-13 02:30:30,071 INFO L131 PetriNetUnfolder]: For 152406/152813 co-relation queries the response was YES. [2022-12-13 02:30:30,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28173 conditions, 1844 events. 606/1844 cut-off events. For 152406/152813 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 16801 event pairs, 53 based on Foata normal form. 13/1808 useless extension candidates. Maximal degree in co-relation 27771. Up to 614 conditions per place. [2022-12-13 02:30:30,104 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 363 places, 585 transitions, 19234 flow [2022-12-13 02:30:30,104 INFO L226 LiptonReduction]: Number of co-enabled transitions 1654 [2022-12-13 02:30:30,106 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:30:30,106 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 535 [2022-12-13 02:30:30,106 INFO L495 AbstractCegarLoop]: Abstraction has has 363 places, 585 transitions, 19234 flow [2022-12-13 02:30:30,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:30:30,107 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:30:30,107 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:30:30,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-12-13 02:30:30,107 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:30:30,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:30:30,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1388592975, now seen corresponding path program 1 times [2022-12-13 02:30:30,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:30:30,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314634105] [2022-12-13 02:30:30,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:30:30,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:30:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:30:30,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:30:30,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:30:30,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314634105] [2022-12-13 02:30:30,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314634105] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:30:30,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992900953] [2022-12-13 02:30:30,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:30:30,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:30:30,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:30:30,263 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:30:30,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-13 02:30:30,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:30:30,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 02:30:30,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:30:30,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:30:30,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:30:30,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:30:30,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992900953] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:30:30,763 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:30:30,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 5] total 10 [2022-12-13 02:30:30,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960338315] [2022-12-13 02:30:30,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:30:30,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 02:30:30,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:30:30,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 02:30:30,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-13 02:30:30,764 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 102 [2022-12-13 02:30:30,764 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 585 transitions, 19234 flow. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:30:30,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:30:30,764 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 102 [2022-12-13 02:30:30,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:30:33,847 INFO L130 PetriNetUnfolder]: 2736/5065 cut-off events. [2022-12-13 02:30:33,848 INFO L131 PetriNetUnfolder]: For 417583/417583 co-relation queries the response was YES. [2022-12-13 02:30:33,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73732 conditions, 5065 events. 2736/5065 cut-off events. For 417583/417583 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 37188 event pairs, 800 based on Foata normal form. 28/5091 useless extension candidates. Maximal degree in co-relation 72719. Up to 4232 conditions per place. [2022-12-13 02:30:33,917 INFO L137 encePairwiseOnDemand]: 31/102 looper letters, 397 selfloop transitions, 259 changer transitions 0/656 dead transitions. [2022-12-13 02:30:33,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 656 transitions, 22722 flow [2022-12-13 02:30:33,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 02:30:33,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 02:30:33,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 148 transitions. [2022-12-13 02:30:33,918 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1319073083778966 [2022-12-13 02:30:33,918 INFO L175 Difference]: Start difference. First operand has 363 places, 585 transitions, 19234 flow. Second operand 11 states and 148 transitions. [2022-12-13 02:30:33,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 656 transitions, 22722 flow [2022-12-13 02:30:35,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 656 transitions, 22439 flow, removed 77 selfloop flow, removed 4 redundant places. [2022-12-13 02:30:35,623 INFO L231 Difference]: Finished difference. Result has 375 places, 617 transitions, 20996 flow [2022-12-13 02:30:35,624 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=18980, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=230, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=20996, PETRI_PLACES=375, PETRI_TRANSITIONS=617} [2022-12-13 02:30:35,624 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 354 predicate places. [2022-12-13 02:30:35,624 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:30:35,624 INFO L89 Accepts]: Start accepts. Operand has 375 places, 617 transitions, 20996 flow [2022-12-13 02:30:35,629 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:30:35,629 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:30:35,629 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 375 places, 617 transitions, 20996 flow [2022-12-13 02:30:35,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 375 places, 617 transitions, 20996 flow [2022-12-13 02:30:36,052 INFO L130 PetriNetUnfolder]: 635/1918 cut-off events. [2022-12-13 02:30:36,052 INFO L131 PetriNetUnfolder]: For 177935/178336 co-relation queries the response was YES. [2022-12-13 02:30:36,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30729 conditions, 1918 events. 635/1918 cut-off events. For 177935/178336 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 17515 event pairs, 56 based on Foata normal form. 14/1884 useless extension candidates. Maximal degree in co-relation 30312. Up to 646 conditions per place. [2022-12-13 02:30:36,092 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 375 places, 617 transitions, 20996 flow [2022-12-13 02:30:36,093 INFO L226 LiptonReduction]: Number of co-enabled transitions 1726 [2022-12-13 02:30:38,251 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [832] $Ultimate##0-->L49-2: Formula: (let ((.cse7 (select |v_#memory_int_533| v_~f~0.base_394))) (let ((.cse16 (select .cse7 (+ v_~f~0.offset_391 (* v_~x2~0_598 4))))) (let ((.cse18 (select .cse7 (+ v_~f~0.offset_391 (* 4 .cse16))))) (let ((.cse5 (select .cse7 (+ v_~f~0.offset_391 (* v_~x1~0_723 4)))) (.cse14 (select .cse7 (+ v_~f~0.offset_391 (* 4 .cse18))))) (let ((.cse0 (select .cse7 (+ v_~f~0.offset_391 (* .cse14 4)))) (.cse10 (select .cse7 (+ (* .cse5 4) v_~f~0.offset_391)))) (let ((.cse9 (select .cse7 (+ v_~f~0.offset_391 (* 4 .cse10)))) (.cse1 (select .cse7 (+ v_~f~0.offset_391 (* .cse0 4))))) (let ((.cse20 (select .cse7 (+ v_~f~0.offset_391 (* 4 .cse1)))) (.cse6 (select .cse7 (+ v_~f~0.offset_391 (* .cse9 4))))) (let ((.cse12 (select .cse7 (+ v_~f~0.offset_391 (* .cse6 4)))) (.cse17 (select .cse7 (+ v_~f~0.offset_391 (* .cse20 4))))) (let ((.cse13 (select .cse7 (+ v_~f~0.offset_391 (* .cse17 4)))) (.cse19 (select .cse7 (+ (* .cse12 4) v_~f~0.offset_391)))) (let ((.cse11 (select .cse7 (+ v_~f~0.offset_391 (* .cse19 4)))) (.cse15 (select .cse7 (+ v_~f~0.offset_391 (* .cse13 4))))) (let ((.cse2 (select .cse7 (+ v_~f~0.offset_391 (* 4 .cse15)))) (.cse3 (select .cse7 (+ v_~f~0.offset_391 (* 4 .cse11))))) (let ((.cse4 (select .cse7 (+ v_~f~0.offset_391 (* .cse3 4)))) (.cse8 (select .cse7 (+ v_~f~0.offset_391 (* .cse2 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_389) (<= 0 .cse0)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_329| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_361|) (not (= (ite (and (< .cse1 v_~size~0_389) (<= 0 .cse1)) 1 0) 0)) (not (= (ite (and (< .cse2 v_~size~0_389) (<= 0 .cse2)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_361| 0)) (not (= (ite (and (< .cse3 v_~size~0_389) (<= 0 .cse3)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_403| (ite (and (< .cse4 v_~size~0_389) (<= 0 .cse4)) 1 0)) (not (= (ite (and (< .cse5 v_~size~0_389) (<= 0 .cse5)) 1 0) 0)) (< 9 (mod (* 3 v_~n~0_375) 4294967296)) (not (= (ite (and (< .cse6 v_~size~0_389) (<= 0 .cse6)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_723) (< v_~x1~0_723 v_~size~0_389)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_425| 12) (= (select .cse7 (+ (* .cse8 4) v_~f~0.offset_391)) v_~x2~0_597) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_403| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_419|) (= v_~x1~0_721 (select .cse7 (+ v_~f~0.offset_391 (* .cse4 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_419| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_553| 10) (not (= 0 (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_389)) 1 0))) (not (= (ite (and (< .cse10 v_~size~0_389) (<= 0 .cse10)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_329| (ite (and (< .cse8 v_~size~0_389) (<= 0 .cse8)) 1 0)) (not (= (ite (and (< .cse11 v_~size~0_389) (<= 0 .cse11)) 1 0) 0)) (not (= (ite (and (< .cse12 v_~size~0_389) (<= 0 .cse12)) 1 0) 0)) (not (= (ite (and (< .cse13 v_~size~0_389) (<= 0 .cse13)) 1 0) 0)) (not (= (ite (and (<= 0 .cse14) (< .cse14 v_~size~0_389)) 1 0) 0)) (not (= (ite (and (< .cse15 v_~size~0_389) (<= 0 .cse15)) 1 0) 0)) (not (= (ite (and (< .cse16 v_~size~0_389) (<= 0 .cse16)) 1 0) 0)) (not (= (ite (and (< .cse17 v_~size~0_389) (<= 0 .cse17)) 1 0) 0)) (not (= (ite (and (<= 0 .cse18) (< .cse18 v_~size~0_389)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_598) (< v_~x2~0_598 v_~size~0_389)) 1 0) 0)) (not (= (ite (and (<= 0 .cse19) (< .cse19 v_~size~0_389)) 1 0) 0)) (not (= (ite (and (<= 0 .cse20) (< .cse20 v_~size~0_389)) 1 0) 0))))))))))))))) InVars {~x2~0=v_~x2~0_598, ~size~0=v_~size~0_389, ~f~0.base=v_~f~0.base_394, #memory_int=|v_#memory_int_533|, ~n~0=v_~n~0_375, ~x1~0=v_~x1~0_723, ~f~0.offset=v_~f~0.offset_391} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_411|, ~x2~0=v_~x2~0_597, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_321|, ~size~0=v_~size~0_389, ~f~0.base=v_~f~0.base_394, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_293|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_329|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_425|, ~x1~0=v_~x1~0_721, ~f~0.offset=v_~f~0.offset_391, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_361|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_403|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_285|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_553|, #memory_int=|v_#memory_int_533|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_419|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_283|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_293|, ~n~0=v_~n~0_375, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_421|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_297|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:30:41,561 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [859] $Ultimate##0-->L49-2: Formula: (let ((.cse3 (select |v_#memory_int_582| v_~f~0.base_434))) (let ((.cse9 (select .cse3 (+ v_~f~0.offset_431 (* v_~x1~0_804 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_431 (* v_~x2~0_659 4)))) (.cse2 (select .cse3 (+ v_~f~0.offset_431 (* .cse9 4))))) (let ((.cse5 (select .cse3 (+ v_~f~0.offset_431 (* .cse2 4)))) (.cse0 (select .cse3 (+ v_~f~0.offset_431 (* .cse1 4))))) (let ((.cse8 (select .cse3 (+ v_~f~0.offset_431 (* .cse0 4)))) (.cse11 (select .cse3 (+ v_~f~0.offset_431 (* .cse5 4))))) (let ((.cse7 (select .cse3 (+ v_~f~0.offset_431 (* .cse11 4)))) (.cse10 (select .cse3 (+ (* .cse8 4) v_~f~0.offset_431)))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_431 (* 4 .cse10)))) (.cse6 (select .cse3 (+ v_~f~0.offset_431 (* 4 .cse7))))) (and (not (= (ite (and (<= 0 v_~x1~0_804) (< v_~x1~0_804 v_~size~0_427)) 1 0) 0)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_427)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_427) (<= 0 .cse1)) 1 0) 0)) (not (= (ite (and (< .cse2 v_~size~0_427) (<= 0 .cse2)) 1 0) 0)) (= (select .cse3 (+ v_~f~0.offset_431 (* .cse4 4))) v_~x2~0_658) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_363| (ite (and (< .cse4 v_~size~0_427) (<= 0 .cse4)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_363| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_395|) (not (= (ite (and (< .cse5 v_~size~0_427) (<= 0 .cse5)) 1 0) 0)) (= v_~x1~0_802 (select .cse3 (+ (* .cse6 4) v_~f~0.offset_431))) (not (= (ite (and (< .cse7 v_~size~0_427) (<= 0 .cse7)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_465| 0)) (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_427)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_449|) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_467|) (not (= (ite (and (< .cse8 v_~size~0_427) (<= 0 .cse8)) 1 0) 0)) (= 7 |v_thread1Thread1of1ForFork0_~i~0#1_622|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_395| 0)) (not (= (ite (and (< .cse9 v_~size~0_427) (<= 0 .cse9)) 1 0) 0)) (< 6 (mod (* 3 v_~n~0_413) 4294967296)) (not (= 0 (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_427)) 1 0))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_449| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_465|) (not (= (ite (and (< v_~x2~0_659 v_~size~0_427) (<= 0 v_~x2~0_659)) 1 0) 0)) (not (= 0 (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_427)) 1 0))))))))))) InVars {~x2~0=v_~x2~0_659, ~size~0=v_~size~0_427, ~f~0.base=v_~f~0.base_434, #memory_int=|v_#memory_int_582|, ~n~0=v_~n~0_413, ~x1~0=v_~x1~0_804, ~f~0.offset=v_~f~0.offset_431} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_457|, ~x2~0=v_~x2~0_658, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_355|, ~size~0=v_~size~0_427, ~f~0.base=v_~f~0.base_434, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_327|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_363|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_467|, ~x1~0=v_~x1~0_802, ~f~0.offset=v_~f~0.offset_431, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_395|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_449|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_319|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_622|, #memory_int=|v_#memory_int_582|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_465|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_317|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_327|, ~n~0=v_~n~0_413, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_467|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_331|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:30:42,612 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 02:30:42,612 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6988 [2022-12-13 02:30:42,612 INFO L495 AbstractCegarLoop]: Abstraction has has 375 places, 617 transitions, 21110 flow [2022-12-13 02:30:42,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:30:42,612 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:30:42,613 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:30:42,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-12-13 02:30:42,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:30:42,819 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:30:42,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:30:42,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1686454094, now seen corresponding path program 1 times [2022-12-13 02:30:42,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:30:42,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791702265] [2022-12-13 02:30:42,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:30:42,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:30:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:30:42,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:30:42,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:30:42,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791702265] [2022-12-13 02:30:42,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791702265] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:30:42,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130539253] [2022-12-13 02:30:42,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:30:42,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:30:42,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:30:42,896 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:30:42,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-13 02:30:43,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:30:43,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 02:30:43,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:30:43,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:30:43,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:30:43,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:30:43,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130539253] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:30:43,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:30:43,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-13 02:30:43,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475604405] [2022-12-13 02:30:43,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:30:43,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 02:30:43,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:30:43,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 02:30:43,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-12-13 02:30:43,123 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 105 [2022-12-13 02:30:43,124 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 617 transitions, 21110 flow. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:30:43,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:30:43,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 105 [2022-12-13 02:30:43,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:30:46,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 02:30:48,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 02:30:49,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 02:30:51,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 02:30:54,403 INFO L130 PetriNetUnfolder]: 2853/5290 cut-off events. [2022-12-13 02:30:54,404 INFO L131 PetriNetUnfolder]: For 478880/478880 co-relation queries the response was YES. [2022-12-13 02:30:54,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81259 conditions, 5290 events. 2853/5290 cut-off events. For 478880/478880 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 39089 event pairs, 878 based on Foata normal form. 64/5352 useless extension candidates. Maximal degree in co-relation 80410. Up to 4145 conditions per place. [2022-12-13 02:30:54,476 INFO L137 encePairwiseOnDemand]: 39/105 looper letters, 430 selfloop transitions, 356 changer transitions 1/787 dead transitions. [2022-12-13 02:30:54,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 787 transitions, 28307 flow [2022-12-13 02:30:54,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 02:30:54,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-13 02:30:54,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 194 transitions. [2022-12-13 02:30:54,477 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.0803312629399586 [2022-12-13 02:30:54,477 INFO L175 Difference]: Start difference. First operand has 375 places, 617 transitions, 21110 flow. Second operand 23 states and 194 transitions. [2022-12-13 02:30:54,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 787 transitions, 28307 flow [2022-12-13 02:30:56,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 787 transitions, 27570 flow, removed 302 selfloop flow, removed 3 redundant places. [2022-12-13 02:30:56,186 INFO L231 Difference]: Finished difference. Result has 408 places, 724 transitions, 25598 flow [2022-12-13 02:30:56,187 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=20451, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=615, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=259, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=25598, PETRI_PLACES=408, PETRI_TRANSITIONS=724} [2022-12-13 02:30:56,187 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 387 predicate places. [2022-12-13 02:30:56,187 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:30:56,187 INFO L89 Accepts]: Start accepts. Operand has 408 places, 724 transitions, 25598 flow [2022-12-13 02:30:56,191 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:30:56,191 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:30:56,191 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 408 places, 724 transitions, 25598 flow [2022-12-13 02:30:56,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 408 places, 724 transitions, 25598 flow [2022-12-13 02:30:56,714 INFO L130 PetriNetUnfolder]: 712/2064 cut-off events. [2022-12-13 02:30:56,714 INFO L131 PetriNetUnfolder]: For 238943/239371 co-relation queries the response was YES. [2022-12-13 02:30:56,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36186 conditions, 2064 events. 712/2064 cut-off events. For 238943/239371 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 18647 event pairs, 54 based on Foata normal form. 14/2039 useless extension candidates. Maximal degree in co-relation 35742. Up to 740 conditions per place. [2022-12-13 02:30:56,762 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 408 places, 724 transitions, 25598 flow [2022-12-13 02:30:56,762 INFO L226 LiptonReduction]: Number of co-enabled transitions 1828 [2022-12-13 02:30:56,774 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:30:56,868 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:30:56,962 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:30:57,197 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:30:57,289 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:30:57,381 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:30:57,472 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:30:57,584 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [802] L49-2-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_481| v_~f~0.base_355))) (let ((.cse0 (mod (* 3 v_~n~0_339) 4294967296)) (.cse2 (select .cse1 (+ v_~f~0.offset_352 (* v_~x1~0_617 4))))) (and (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_474| 2) |v_thread1Thread1of1ForFork0_~i~0#1_472|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_474| 4294967296) .cse0) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_474| 1) 4294967296) .cse0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_353| 0)) (= (select .cse1 (+ v_~f~0.offset_352 (* .cse2 4))) v_~x1~0_615) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_337| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_353|) (not (= (ite (and (< v_~x1~0_617 v_~size~0_353) (<= 0 v_~x1~0_617)) 1 0) 0)) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_353)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_337|)))) InVars {~size~0=v_~size~0_353, ~f~0.base=v_~f~0.base_355, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_474|, #memory_int=|v_#memory_int_481|, ~n~0=v_~n~0_339, ~x1~0=v_~x1~0_617, ~f~0.offset=v_~f~0.offset_352} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_345|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_337|, ~size~0=v_~size~0_353, ~f~0.base=v_~f~0.base_355, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_472|, #memory_int=|v_#memory_int_481|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_353|, ~n~0=v_~n~0_339, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_355|, ~x1~0=v_~x1~0_615, ~f~0.offset=v_~f~0.offset_352} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:30:57,736 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:30:57,827 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:30:57,918 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:30:58,011 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [802] L49-2-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_481| v_~f~0.base_355))) (let ((.cse0 (mod (* 3 v_~n~0_339) 4294967296)) (.cse2 (select .cse1 (+ v_~f~0.offset_352 (* v_~x1~0_617 4))))) (and (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_474| 2) |v_thread1Thread1of1ForFork0_~i~0#1_472|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_474| 4294967296) .cse0) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_474| 1) 4294967296) .cse0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_353| 0)) (= (select .cse1 (+ v_~f~0.offset_352 (* .cse2 4))) v_~x1~0_615) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_337| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_353|) (not (= (ite (and (< v_~x1~0_617 v_~size~0_353) (<= 0 v_~x1~0_617)) 1 0) 0)) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_353)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_337|)))) InVars {~size~0=v_~size~0_353, ~f~0.base=v_~f~0.base_355, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_474|, #memory_int=|v_#memory_int_481|, ~n~0=v_~n~0_339, ~x1~0=v_~x1~0_617, ~f~0.offset=v_~f~0.offset_352} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_345|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_337|, ~size~0=v_~size~0_353, ~f~0.base=v_~f~0.base_355, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_472|, #memory_int=|v_#memory_int_481|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_353|, ~n~0=v_~n~0_339, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_355|, ~x1~0=v_~x1~0_615, ~f~0.offset=v_~f~0.offset_352} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:30:58,162 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:30:58,256 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:30:58,345 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:30:58,436 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:30:58,537 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:30:58,635 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:30:58,734 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:30:58,824 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:30:58,913 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:30:59,009 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 02:30:59,010 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2823 [2022-12-13 02:30:59,010 INFO L495 AbstractCegarLoop]: Abstraction has has 407 places, 723 transitions, 26388 flow [2022-12-13 02:30:59,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:30:59,010 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:30:59,010 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:30:59,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-12-13 02:30:59,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable61 [2022-12-13 02:30:59,215 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:30:59,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:30:59,216 INFO L85 PathProgramCache]: Analyzing trace with hash -76933012, now seen corresponding path program 1 times [2022-12-13 02:30:59,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:30:59,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365661922] [2022-12-13 02:30:59,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:30:59,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:30:59,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:30:59,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:30:59,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:30:59,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365661922] [2022-12-13 02:30:59,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365661922] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:30:59,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141927650] [2022-12-13 02:30:59,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:30:59,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:30:59,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:30:59,906 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:30:59,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-13 02:31:00,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:31:00,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 02:31:00,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:31:00,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:31:00,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:31:04,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:31:04,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141927650] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:31:04,761 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:31:04,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-13 02:31:04,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897718040] [2022-12-13 02:31:04,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:31:04,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 02:31:04,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:31:04,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 02:31:04,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=91, Unknown=2, NotChecked=0, Total=132 [2022-12-13 02:31:04,762 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 126 [2022-12-13 02:31:04,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 723 transitions, 26388 flow. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:31:04,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:31:04,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 126 [2022-12-13 02:31:04,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:31:10,158 INFO L130 PetriNetUnfolder]: 2911/5391 cut-off events. [2022-12-13 02:31:10,158 INFO L131 PetriNetUnfolder]: For 629756/629756 co-relation queries the response was YES. [2022-12-13 02:31:10,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90381 conditions, 5391 events. 2911/5391 cut-off events. For 629756/629756 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 40478 event pairs, 370 based on Foata normal form. 12/5401 useless extension candidates. Maximal degree in co-relation 89360. Up to 2054 conditions per place. [2022-12-13 02:31:10,250 INFO L137 encePairwiseOnDemand]: 21/126 looper letters, 364 selfloop transitions, 445 changer transitions 11/820 dead transitions. [2022-12-13 02:31:10,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 820 transitions, 30896 flow [2022-12-13 02:31:10,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 02:31:10,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 02:31:10,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 168 transitions. [2022-12-13 02:31:10,252 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.13333333333333333 [2022-12-13 02:31:10,252 INFO L175 Difference]: Start difference. First operand has 407 places, 723 transitions, 26388 flow. Second operand 10 states and 168 transitions. [2022-12-13 02:31:10,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 820 transitions, 30896 flow [2022-12-13 02:31:13,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 820 transitions, 28981 flow, removed 945 selfloop flow, removed 2 redundant places. [2022-12-13 02:31:13,064 INFO L231 Difference]: Finished difference. Result has 419 places, 739 transitions, 27020 flow [2022-12-13 02:31:13,064 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=24687, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=723, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=428, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=27020, PETRI_PLACES=419, PETRI_TRANSITIONS=739} [2022-12-13 02:31:13,065 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 398 predicate places. [2022-12-13 02:31:13,065 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:31:13,065 INFO L89 Accepts]: Start accepts. Operand has 419 places, 739 transitions, 27020 flow [2022-12-13 02:31:13,070 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:31:13,070 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:31:13,070 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 419 places, 739 transitions, 27020 flow [2022-12-13 02:31:13,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 417 places, 739 transitions, 27020 flow [2022-12-13 02:31:13,694 INFO L130 PetriNetUnfolder]: 725/2075 cut-off events. [2022-12-13 02:31:13,694 INFO L131 PetriNetUnfolder]: For 252045/252467 co-relation queries the response was YES. [2022-12-13 02:31:13,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37039 conditions, 2075 events. 725/2075 cut-off events. For 252045/252467 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 18657 event pairs, 56 based on Foata normal form. 16/2053 useless extension candidates. Maximal degree in co-relation 36508. Up to 720 conditions per place. [2022-12-13 02:31:13,747 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 417 places, 739 transitions, 27020 flow [2022-12-13 02:31:13,747 INFO L226 LiptonReduction]: Number of co-enabled transitions 1866 [2022-12-13 02:31:13,887 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:31:13,888 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 823 [2022-12-13 02:31:13,888 INFO L495 AbstractCegarLoop]: Abstraction has has 416 places, 738 transitions, 27004 flow [2022-12-13 02:31:13,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:31:13,888 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:31:13,888 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:31:13,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-12-13 02:31:14,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:31:14,089 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:31:14,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:31:14,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1138484517, now seen corresponding path program 1 times [2022-12-13 02:31:14,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:31:14,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816234394] [2022-12-13 02:31:14,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:31:14,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:31:14,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:31:14,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:31:14,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:31:14,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816234394] [2022-12-13 02:31:14,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816234394] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:31:14,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897445319] [2022-12-13 02:31:14,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:31:14,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:31:14,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:31:14,169 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:31:14,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-13 02:31:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:31:14,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 02:31:14,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:31:14,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:31:14,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:31:14,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:31:14,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897445319] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:31:14,375 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:31:14,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-13 02:31:14,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183946338] [2022-12-13 02:31:14,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:31:14,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 02:31:14,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:31:14,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 02:31:14,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-12-13 02:31:14,376 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 127 [2022-12-13 02:31:14,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 738 transitions, 27004 flow. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:31:14,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:31:14,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 127 [2022-12-13 02:31:14,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:31:17,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 02:31:19,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 02:31:21,852 INFO L130 PetriNetUnfolder]: 2905/5362 cut-off events. [2022-12-13 02:31:21,852 INFO L131 PetriNetUnfolder]: For 616100/616100 co-relation queries the response was YES. [2022-12-13 02:31:21,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90141 conditions, 5362 events. 2905/5362 cut-off events. For 616100/616100 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 39534 event pairs, 1156 based on Foata normal form. 4/5364 useless extension candidates. Maximal degree in co-relation 88871. Up to 4862 conditions per place. [2022-12-13 02:31:21,935 INFO L137 encePairwiseOnDemand]: 77/127 looper letters, 625 selfloop transitions, 185 changer transitions 2/812 dead transitions. [2022-12-13 02:31:21,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 812 transitions, 30708 flow [2022-12-13 02:31:21,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 02:31:21,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-13 02:31:21,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 197 transitions. [2022-12-13 02:31:21,936 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.0738657667791526 [2022-12-13 02:31:21,936 INFO L175 Difference]: Start difference. First operand has 416 places, 738 transitions, 27004 flow. Second operand 21 states and 197 transitions. [2022-12-13 02:31:21,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 812 transitions, 30708 flow [2022-12-13 02:31:24,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 812 transitions, 30311 flow, removed 162 selfloop flow, removed 3 redundant places. [2022-12-13 02:31:24,535 INFO L231 Difference]: Finished difference. Result has 436 places, 756 transitions, 27723 flow [2022-12-13 02:31:24,536 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=26620, PETRI_DIFFERENCE_MINUEND_PLACES=413, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=738, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=167, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=27723, PETRI_PLACES=436, PETRI_TRANSITIONS=756} [2022-12-13 02:31:24,536 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 415 predicate places. [2022-12-13 02:31:24,536 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:31:24,536 INFO L89 Accepts]: Start accepts. Operand has 436 places, 756 transitions, 27723 flow [2022-12-13 02:31:24,540 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:31:24,540 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:31:24,540 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 436 places, 756 transitions, 27723 flow [2022-12-13 02:31:24,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 436 places, 756 transitions, 27723 flow [2022-12-13 02:31:25,213 INFO L130 PetriNetUnfolder]: 728/2086 cut-off events. [2022-12-13 02:31:25,213 INFO L131 PetriNetUnfolder]: For 250564/251051 co-relation queries the response was YES. [2022-12-13 02:31:25,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37126 conditions, 2086 events. 728/2086 cut-off events. For 250564/251051 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 18792 event pairs, 59 based on Foata normal form. 19/2062 useless extension candidates. Maximal degree in co-relation 36651. Up to 725 conditions per place. [2022-12-13 02:31:25,269 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 436 places, 756 transitions, 27723 flow [2022-12-13 02:31:25,270 INFO L226 LiptonReduction]: Number of co-enabled transitions 1902 [2022-12-13 02:31:25,278 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:31:25,374 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:31:25,472 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:31:25,566 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:31:25,659 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:31:25,939 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [834] L49-2-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_535| v_~f~0.base_396))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_393 (* v_~x1~0_729 4))))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_393 (* 4 .cse3))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_393 (* .cse4 4)))) (.cse0 (mod (* 3 v_~n~0_377) 4294967296))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_407| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_423|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_559| 1) 4294967296) .cse0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_423| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_559| 2) 4294967296) .cse0) (= v_~x1~0_727 (select .cse1 (+ v_~f~0.offset_393 (* .cse2 4)))) (not (= (ite (and (< .cse3 v_~size~0_391) (<= 0 .cse3)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_729 v_~size~0_391) (<= 0 v_~x1~0_729)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_407| (ite (and (< .cse2 v_~size~0_391) (<= 0 .cse2)) 1 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_557| (+ |v_thread1Thread1of1ForFork0_~i~0#1_559| 4)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_559| 4294967296) .cse0) (not (= (ite (and (< .cse4 v_~size~0_391) (<= 0 .cse4)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_559| 3) 4294967296) .cse0)))))) InVars {~size~0=v_~size~0_391, ~f~0.base=v_~f~0.base_396, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_559|, #memory_int=|v_#memory_int_535|, ~n~0=v_~n~0_377, ~x1~0=v_~x1~0_729, ~f~0.offset=v_~f~0.offset_393} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_415|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_407|, ~size~0=v_~size~0_391, ~f~0.base=v_~f~0.base_396, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_557|, #memory_int=|v_#memory_int_535|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_423|, ~n~0=v_~n~0_377, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_425|, ~x1~0=v_~x1~0_727, ~f~0.offset=v_~f~0.offset_393} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:31:26,484 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [804] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_485| v_~f~0.base_357))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_354 (* v_~x1~0_629 4))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_354 (* .cse3 4)))) (.cse0 (mod (* 3 v_~n~0_341) 4294967296))) (and (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_486| 2) 4294967296) .cse0) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_355)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_346|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_486| 1) 4294967296) .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_346| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_362|) (= |v_thread1Thread1of1ForFork0_~i~0#1_484| (+ |v_thread1Thread1of1ForFork0_~i~0#1_486| 3)) (not (= (ite (and (< v_~x1~0_629 v_~size~0_355) (<= 0 v_~x1~0_629)) 1 0) 0)) (= v_~x1~0_627 (select .cse2 (+ v_~f~0.offset_354 (* .cse1 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_362| 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_355)) 1 0) 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_486| 4294967296) .cse0))))) InVars {~size~0=v_~size~0_355, ~f~0.base=v_~f~0.base_357, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_486|, #memory_int=|v_#memory_int_485|, ~n~0=v_~n~0_341, ~x1~0=v_~x1~0_629, ~f~0.offset=v_~f~0.offset_354} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_354|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_346|, ~size~0=v_~size~0_355, ~f~0.base=v_~f~0.base_357, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_484|, #memory_int=|v_#memory_int_485|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_362|, ~n~0=v_~n~0_341, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_364|, ~x1~0=v_~x1~0_627, ~f~0.offset=v_~f~0.offset_354} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:31:26,795 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [807] $Ultimate##0-->L49-2: Formula: (let ((.cse6 (select |v_#memory_int_489| v_~f~0.base_361))) (let ((.cse8 (select .cse6 (+ v_~f~0.offset_358 (* v_~x2~0_538 4))))) (let ((.cse17 (select .cse6 (+ v_~f~0.offset_358 (* .cse8 4))))) (let ((.cse14 (select .cse6 (+ v_~f~0.offset_358 (* .cse17 4))))) (let ((.cse19 (select .cse6 (+ v_~f~0.offset_358 (* v_~x1~0_639 4)))) (.cse12 (select .cse6 (+ v_~f~0.offset_358 (* 4 .cse14))))) (let ((.cse15 (select .cse6 (+ v_~f~0.offset_358 (* .cse12 4)))) (.cse2 (select .cse6 (+ v_~f~0.offset_358 (* 4 .cse19))))) (let ((.cse11 (select .cse6 (+ v_~f~0.offset_358 (* .cse2 4)))) (.cse18 (select .cse6 (+ v_~f~0.offset_358 (* .cse15 4))))) (let ((.cse9 (select .cse6 (+ v_~f~0.offset_358 (* .cse18 4)))) (.cse1 (select .cse6 (+ v_~f~0.offset_358 (* .cse11 4))))) (let ((.cse16 (select .cse6 (+ v_~f~0.offset_358 (* .cse1 4)))) (.cse7 (select .cse6 (+ v_~f~0.offset_358 (* .cse9 4))))) (let ((.cse13 (select .cse6 (+ (* .cse7 4) v_~f~0.offset_358))) (.cse10 (select .cse6 (+ v_~f~0.offset_358 (* .cse16 4))))) (let ((.cse4 (select .cse6 (+ v_~f~0.offset_358 (* 4 .cse10)))) (.cse0 (select .cse6 (+ v_~f~0.offset_358 (* .cse13 4))))) (let ((.cse5 (select .cse6 (+ v_~f~0.offset_358 (* .cse0 4)))) (.cse3 (select .cse6 (+ v_~f~0.offset_358 (* .cse4 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_352| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_368|) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_359)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_359) (<= 0 .cse1)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_639) (< v_~x1~0_639 v_~size~0_359)) 1 0) 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_359)) 1 0) 0)) (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_359)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_352|) (not (= (ite (and (< .cse4 v_~size~0_359) (<= 0 .cse4)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_295| (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_359)) 1 0)) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_385| 4294967293) 4294967296) (mod (* 3 v_~n~0_345) 4294967296)) (= v_~x2~0_537 (select .cse6 (+ v_~f~0.offset_358 (* 4 .cse5)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_327| 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_368| 0)) (= (select .cse6 (+ v_~f~0.offset_358 (* .cse3 4))) v_~x1~0_637) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_359)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_295| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_327|) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_359)) 1 0) 0)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_359)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_385| 12) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_359)) 1 0) 0)) (not (= (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_359)) 1 0) 0)) (not (= (ite (and (<= 0 .cse12) (< .cse12 v_~size~0_359)) 1 0) 0)) (not (= (ite (and (< .cse13 v_~size~0_359) (<= 0 .cse13)) 1 0) 0)) (not (= (ite (and (<= 0 .cse14) (< .cse14 v_~size~0_359)) 1 0) 0)) (not (= (ite (and (< .cse15 v_~size~0_359) (<= 0 .cse15)) 1 0) 0)) (not (= (ite (and (<= 0 .cse16) (< .cse16 v_~size~0_359)) 1 0) 0)) (not (= (ite (and (<= 0 .cse17) (< .cse17 v_~size~0_359)) 1 0) 0)) (not (= (ite (and (<= 0 .cse18) (< .cse18 v_~size~0_359)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_492| 9) (not (= (ite (and (<= 0 .cse19) (< .cse19 v_~size~0_359)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_538) (< v_~x2~0_538 v_~size~0_359)) 1 0) 0))))))))))))))) InVars {~x2~0=v_~x2~0_538, ~size~0=v_~size~0_359, ~f~0.base=v_~f~0.base_361, #memory_int=|v_#memory_int_489|, ~n~0=v_~n~0_345, ~x1~0=v_~x1~0_639, ~f~0.offset=v_~f~0.offset_358} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_360|, ~x2~0=v_~x2~0_537, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_287|, ~size~0=v_~size~0_359, ~f~0.base=v_~f~0.base_361, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_259|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_295|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_385|, ~x1~0=v_~x1~0_637, ~f~0.offset=v_~f~0.offset_358, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_327|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_352|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_251|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_492|, #memory_int=|v_#memory_int_489|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_368|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_249|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_259|, ~n~0=v_~n~0_345, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_370|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_263|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:31:30,962 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [902] $Ultimate##0-->L59-2: Formula: (let ((.cse16 (select |v_#memory_int_663| v_~f~0.base_512))) (let ((.cse7 (select .cse16 (+ v_~f~0.offset_509 (* v_~x2~0_696 4))))) (let ((.cse5 (select .cse16 (+ v_~f~0.offset_509 (* .cse7 4))))) (let ((.cse22 (select .cse16 (+ v_~f~0.offset_509 (* .cse5 4))))) (let ((.cse15 (select .cse16 (+ v_~f~0.offset_509 (* .cse22 4))))) (let ((.cse11 (select .cse16 (+ v_~f~0.offset_509 (* 4 .cse15))))) (let ((.cse3 (select .cse16 (+ v_~f~0.offset_509 (* .cse11 4))))) (let ((.cse13 (select .cse16 (+ v_~f~0.offset_509 (* v_~x1~0_975 4)))) (.cse0 (select .cse16 (+ v_~f~0.offset_509 (* 4 .cse3))))) (let ((.cse2 (select .cse16 (+ v_~f~0.offset_509 (* .cse0 4)))) (.cse4 (select .cse16 (+ v_~f~0.offset_509 (* .cse13 4))))) (let ((.cse8 (select .cse16 (+ v_~f~0.offset_509 (* 4 .cse4)))) (.cse10 (select .cse16 (+ v_~f~0.offset_509 (* .cse2 4))))) (let ((.cse6 (select .cse16 (+ v_~f~0.offset_509 (* .cse10 4)))) (.cse19 (select .cse16 (+ v_~f~0.offset_509 (* .cse8 4))))) (let ((.cse14 (select .cse16 (+ v_~f~0.offset_509 (* .cse19 4)))) (.cse18 (select .cse16 (+ v_~f~0.offset_509 (* 4 .cse6))))) (let ((.cse21 (select .cse16 (+ v_~f~0.offset_509 (* .cse18 4)))) (.cse9 (select .cse16 (+ v_~f~0.offset_509 (* 4 .cse14))))) (let ((.cse20 (select .cse16 (+ v_~f~0.offset_509 (* .cse9 4)))) (.cse1 (select .cse16 (+ v_~f~0.offset_509 (* .cse21 4))))) (let ((.cse12 (select .cse16 (+ v_~f~0.offset_509 (* .cse1 4)))) (.cse17 (select .cse16 (+ v_~f~0.offset_509 (* .cse20 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_505) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_505)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_561| 0)) (not (= (ite (and (< .cse2 v_~size~0_505) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (< .cse3 v_~size~0_505) (<= 0 .cse3)) 1 0) 0)) (not (= (ite (and (< .cse4 v_~size~0_505) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (< .cse5 v_~size~0_505) (<= 0 .cse5)) 1 0) 0)) (not (= (ite (and (< .cse6 v_~size~0_505) (<= 0 .cse6)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_505)) 1 0) 0)) (not (= (ite (and (< .cse8 v_~size~0_505) (<= 0 .cse8)) 1 0) 0)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_505)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_545| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_561|) (not (= (ite (and (< v_~x1~0_975 v_~size~0_505) (<= 0 v_~x1~0_975)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_696 v_~size~0_505) (<= 0 v_~x2~0_696)) 1 0) 0)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_505)) 1 0) 0)) (not (= (ite (and (< .cse11 v_~size~0_505) (<= 0 .cse11)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_390| (ite (and (<= 0 .cse12) (< .cse12 v_~size~0_505)) 1 0)) (not (= (ite (and (< .cse13 v_~size~0_505) (<= 0 .cse13)) 1 0) 0)) (not (= (ite (and (< .cse14 v_~size~0_505) (<= 0 .cse14)) 1 0) 0)) (< 12 (mod (* 3 v_~n~0_491) 4294967296)) (not (= (ite (and (< .cse15 v_~size~0_505) (<= 0 .cse15)) 1 0) 0)) (= v_~x1~0_974 (select .cse16 (+ v_~f~0.offset_509 (* 4 .cse17)))) (not (= (ite (and (<= 0 .cse18) (< .cse18 v_~size~0_505)) 1 0) 0)) (not (= (ite (and (<= 0 .cse19) (< .cse19 v_~size~0_505)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_792| 9) (= (select .cse16 (+ v_~f~0.offset_509 (* 4 .cse12))) v_~x2~0_694) (= (ite (and (<= 0 .cse17) (< .cse17 v_~size~0_505)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_545|) (= |v_thread2Thread1of1ForFork1_~i~1#1_558| 15) (not (= (ite (and (< .cse20 v_~size~0_505) (<= 0 .cse20)) 1 0) 0)) (not (= (ite (and (<= 0 .cse21) (< .cse21 v_~size~0_505)) 1 0) 0)) (not (= (ite (and (<= 0 .cse22) (< .cse22 v_~size~0_505)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_422| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_390| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_422|))))))))))))))))) InVars {~x2~0=v_~x2~0_696, ~size~0=v_~size~0_505, ~f~0.base=v_~f~0.base_512, #memory_int=|v_#memory_int_663|, ~n~0=v_~n~0_491, ~x1~0=v_~x1~0_975, ~f~0.offset=v_~f~0.offset_509} OutVars{~x2~0=v_~x2~0_694, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_553|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_382|, ~size~0=v_~size~0_505, ~f~0.base=v_~f~0.base_512, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_354|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_390|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_558|, ~x1~0=v_~x1~0_974, ~f~0.offset=v_~f~0.offset_509, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_422|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_545|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_346|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_792|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_344|, #memory_int=|v_#memory_int_663|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_561|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_354|, ~n~0=v_~n~0_491, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_358|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_563|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:31:33,829 INFO L241 LiptonReduction]: Total number of compositions: 7 [2022-12-13 02:31:33,830 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9294 [2022-12-13 02:31:33,830 INFO L495 AbstractCegarLoop]: Abstraction has has 432 places, 752 transitions, 27969 flow [2022-12-13 02:31:33,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:31:33,830 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:31:33,830 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:31:33,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-12-13 02:31:34,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:31:34,036 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:31:34,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:31:34,036 INFO L85 PathProgramCache]: Analyzing trace with hash 569566556, now seen corresponding path program 1 times [2022-12-13 02:31:34,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:31:34,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18138760] [2022-12-13 02:31:34,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:31:34,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:31:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:31:35,035 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 02:31:35,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:31:35,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18138760] [2022-12-13 02:31:35,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18138760] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:31:35,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:31:35,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:31:35,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95487] [2022-12-13 02:31:35,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:31:35,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 02:31:35,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:31:35,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 02:31:35,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 02:31:35,037 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 136 [2022-12-13 02:31:35,037 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 432 places, 752 transitions, 27969 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:31:35,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:31:35,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 136 [2022-12-13 02:31:35,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:31:39,166 INFO L130 PetriNetUnfolder]: 2942/5431 cut-off events. [2022-12-13 02:31:39,167 INFO L131 PetriNetUnfolder]: For 630437/630437 co-relation queries the response was YES. [2022-12-13 02:31:39,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90642 conditions, 5431 events. 2942/5431 cut-off events. For 630437/630437 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 40103 event pairs, 1200 based on Foata normal form. 1/5430 useless extension candidates. Maximal degree in co-relation 89677. Up to 5099 conditions per place. [2022-12-13 02:31:39,265 INFO L137 encePairwiseOnDemand]: 78/136 looper letters, 650 selfloop transitions, 121 changer transitions 12/783 dead transitions. [2022-12-13 02:31:39,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 783 transitions, 30005 flow [2022-12-13 02:31:39,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:31:39,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:31:39,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 166 transitions. [2022-12-13 02:31:39,266 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24411764705882352 [2022-12-13 02:31:39,266 INFO L175 Difference]: Start difference. First operand has 432 places, 752 transitions, 27969 flow. Second operand 5 states and 166 transitions. [2022-12-13 02:31:39,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 783 transitions, 30005 flow [2022-12-13 02:31:42,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 783 transitions, 29264 flow, removed 270 selfloop flow, removed 6 redundant places. [2022-12-13 02:31:42,188 INFO L231 Difference]: Finished difference. Result has 432 places, 761 transitions, 27845 flow [2022-12-13 02:31:42,188 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=27228, PETRI_DIFFERENCE_MINUEND_PLACES=426, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=752, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=631, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=27845, PETRI_PLACES=432, PETRI_TRANSITIONS=761} [2022-12-13 02:31:42,189 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 411 predicate places. [2022-12-13 02:31:42,189 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:31:42,189 INFO L89 Accepts]: Start accepts. Operand has 432 places, 761 transitions, 27845 flow [2022-12-13 02:31:42,192 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:31:42,192 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:31:42,192 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 432 places, 761 transitions, 27845 flow [2022-12-13 02:31:42,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 431 places, 761 transitions, 27845 flow [2022-12-13 02:31:42,731 INFO L130 PetriNetUnfolder]: 735/2107 cut-off events. [2022-12-13 02:31:42,731 INFO L131 PetriNetUnfolder]: For 253873/254343 co-relation queries the response was YES. [2022-12-13 02:31:42,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37229 conditions, 2107 events. 735/2107 cut-off events. For 253873/254343 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 19011 event pairs, 57 based on Foata normal form. 21/2086 useless extension candidates. Maximal degree in co-relation 36911. Up to 731 conditions per place. [2022-12-13 02:31:42,782 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 431 places, 761 transitions, 27845 flow [2022-12-13 02:31:42,782 INFO L226 LiptonReduction]: Number of co-enabled transitions 1916 [2022-12-13 02:31:45,913 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:31:45,914 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3725 [2022-12-13 02:31:45,914 INFO L495 AbstractCegarLoop]: Abstraction has has 431 places, 761 transitions, 27883 flow [2022-12-13 02:31:45,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:31:45,914 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:31:45,914 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:31:45,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-12-13 02:31:45,914 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:31:45,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:31:45,914 INFO L85 PathProgramCache]: Analyzing trace with hash 917962756, now seen corresponding path program 1 times [2022-12-13 02:31:45,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:31:45,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063432135] [2022-12-13 02:31:45,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:31:45,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:31:45,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:31:45,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 02:31:45,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:31:45,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063432135] [2022-12-13 02:31:45,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063432135] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:31:45,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:31:45,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:31:45,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689464014] [2022-12-13 02:31:45,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:31:45,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:31:45,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:31:45,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:31:45,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:31:45,991 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 136 [2022-12-13 02:31:45,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 761 transitions, 27883 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:31:45,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:31:45,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 136 [2022-12-13 02:31:45,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:31:48,612 INFO L130 PetriNetUnfolder]: 2951/5444 cut-off events. [2022-12-13 02:31:48,612 INFO L131 PetriNetUnfolder]: For 616296/616296 co-relation queries the response was YES. [2022-12-13 02:31:48,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90818 conditions, 5444 events. 2951/5444 cut-off events. For 616296/616296 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 40249 event pairs, 1242 based on Foata normal form. 4/5446 useless extension candidates. Maximal degree in co-relation 90071. Up to 5227 conditions per place. [2022-12-13 02:31:48,707 INFO L137 encePairwiseOnDemand]: 105/136 looper letters, 707 selfloop transitions, 74 changer transitions 1/782 dead transitions. [2022-12-13 02:31:48,707 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 782 transitions, 30122 flow [2022-12-13 02:31:48,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:31:48,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:31:48,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2022-12-13 02:31:48,708 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2647058823529412 [2022-12-13 02:31:48,708 INFO L175 Difference]: Start difference. First operand has 431 places, 761 transitions, 27883 flow. Second operand 4 states and 144 transitions. [2022-12-13 02:31:48,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 434 places, 782 transitions, 30122 flow [2022-12-13 02:31:51,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 782 transitions, 29918 flow, removed 18 selfloop flow, removed 2 redundant places. [2022-12-13 02:31:51,395 INFO L231 Difference]: Finished difference. Result has 433 places, 765 transitions, 28080 flow [2022-12-13 02:31:51,396 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=27679, PETRI_DIFFERENCE_MINUEND_PLACES=429, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=761, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=687, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=28080, PETRI_PLACES=433, PETRI_TRANSITIONS=765} [2022-12-13 02:31:51,396 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 412 predicate places. [2022-12-13 02:31:51,396 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:31:51,396 INFO L89 Accepts]: Start accepts. Operand has 433 places, 765 transitions, 28080 flow [2022-12-13 02:31:51,401 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:31:51,401 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:31:51,401 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 433 places, 765 transitions, 28080 flow [2022-12-13 02:31:51,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 433 places, 765 transitions, 28080 flow [2022-12-13 02:31:52,096 INFO L130 PetriNetUnfolder]: 741/2119 cut-off events. [2022-12-13 02:31:52,096 INFO L131 PetriNetUnfolder]: For 260602/261100 co-relation queries the response was YES. [2022-12-13 02:31:52,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37801 conditions, 2119 events. 741/2119 cut-off events. For 260602/261100 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 19132 event pairs, 55 based on Foata normal form. 21/2098 useless extension candidates. Maximal degree in co-relation 37422. Up to 740 conditions per place. [2022-12-13 02:31:52,151 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 433 places, 765 transitions, 28080 flow [2022-12-13 02:31:52,152 INFO L226 LiptonReduction]: Number of co-enabled transitions 1926 [2022-12-13 02:31:52,154 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:31:52,154 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 758 [2022-12-13 02:31:52,154 INFO L495 AbstractCegarLoop]: Abstraction has has 433 places, 765 transitions, 28080 flow [2022-12-13 02:31:52,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:31:52,154 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:31:52,154 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:31:52,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-12-13 02:31:52,155 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:31:52,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:31:52,155 INFO L85 PathProgramCache]: Analyzing trace with hash 64428805, now seen corresponding path program 1 times [2022-12-13 02:31:52,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:31:52,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410928117] [2022-12-13 02:31:52,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:31:52,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:31:52,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:31:52,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:31:52,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:31:52,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410928117] [2022-12-13 02:31:52,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410928117] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:31:52,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127199238] [2022-12-13 02:31:52,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:31:52,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:31:52,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:31:52,272 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:31:52,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-12-13 02:31:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:31:52,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 02:31:52,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:31:52,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:31:52,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:31:52,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:31:52,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127199238] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:31:52,523 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:31:52,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-13 02:31:52,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804288859] [2022-12-13 02:31:52,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:31:52,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 02:31:52,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:31:52,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 02:31:52,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-12-13 02:31:52,524 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 136 [2022-12-13 02:31:52,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 765 transitions, 28080 flow. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:31:52,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:31:52,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 136 [2022-12-13 02:31:52,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:31:55,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 02:31:59,055 INFO L130 PetriNetUnfolder]: 2964/5467 cut-off events. [2022-12-13 02:31:59,056 INFO L131 PetriNetUnfolder]: For 640048/640048 co-relation queries the response was YES. [2022-12-13 02:31:59,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91757 conditions, 5467 events. 2964/5467 cut-off events. For 640048/640048 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 40366 event pairs, 1166 based on Foata normal form. 10/5475 useless extension candidates. Maximal degree in co-relation 91007. Up to 4972 conditions per place. [2022-12-13 02:31:59,144 INFO L137 encePairwiseOnDemand]: 77/136 looper letters, 633 selfloop transitions, 191 changer transitions 1/825 dead transitions. [2022-12-13 02:31:59,144 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 825 transitions, 31479 flow [2022-12-13 02:31:59,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 02:31:59,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 02:31:59,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 196 transitions. [2022-12-13 02:31:59,145 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.08006535947712418 [2022-12-13 02:31:59,145 INFO L175 Difference]: Start difference. First operand has 433 places, 765 transitions, 28080 flow. Second operand 18 states and 196 transitions. [2022-12-13 02:31:59,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 825 transitions, 31479 flow [2022-12-13 02:32:02,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 825 transitions, 31376 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-12-13 02:32:02,376 INFO L231 Difference]: Finished difference. Result has 453 places, 774 transitions, 28809 flow [2022-12-13 02:32:02,376 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=27977, PETRI_DIFFERENCE_MINUEND_PLACES=431, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=765, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=183, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=28809, PETRI_PLACES=453, PETRI_TRANSITIONS=774} [2022-12-13 02:32:02,377 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 432 predicate places. [2022-12-13 02:32:02,377 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:32:02,377 INFO L89 Accepts]: Start accepts. Operand has 453 places, 774 transitions, 28809 flow [2022-12-13 02:32:02,382 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:32:02,382 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:32:02,382 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 453 places, 774 transitions, 28809 flow [2022-12-13 02:32:02,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 453 places, 774 transitions, 28809 flow [2022-12-13 02:32:03,022 INFO L130 PetriNetUnfolder]: 742/2128 cut-off events. [2022-12-13 02:32:03,022 INFO L131 PetriNetUnfolder]: For 273639/274142 co-relation queries the response was YES. [2022-12-13 02:32:03,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38412 conditions, 2128 events. 742/2128 cut-off events. For 273639/274142 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 19257 event pairs, 55 based on Foata normal form. 21/2106 useless extension candidates. Maximal degree in co-relation 38025. Up to 746 conditions per place. [2022-12-13 02:32:03,082 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 453 places, 774 transitions, 28809 flow [2022-12-13 02:32:03,082 INFO L226 LiptonReduction]: Number of co-enabled transitions 1946 [2022-12-13 02:32:03,083 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:32:15,714 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:32:15,815 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 02:32:15,815 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13438 [2022-12-13 02:32:15,815 INFO L495 AbstractCegarLoop]: Abstraction has has 451 places, 772 transitions, 28897 flow [2022-12-13 02:32:15,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:32:15,815 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:32:15,816 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:32:15,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-12-13 02:32:16,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2022-12-13 02:32:16,019 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:32:16,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:32:16,019 INFO L85 PathProgramCache]: Analyzing trace with hash -955594791, now seen corresponding path program 1 times [2022-12-13 02:32:16,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:32:16,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626228053] [2022-12-13 02:32:16,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:32:16,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:32:16,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:32:16,083 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:32:16,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:32:16,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626228053] [2022-12-13 02:32:16,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626228053] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:32:16,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157069600] [2022-12-13 02:32:16,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:32:16,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:32:16,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:32:16,085 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:32:16,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-12-13 02:32:16,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:32:16,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 02:32:16,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:32:16,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:32:16,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:32:16,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:32:16,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157069600] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:32:16,357 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:32:16,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-13 02:32:16,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872111181] [2022-12-13 02:32:16,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:32:16,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 02:32:16,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:32:16,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 02:32:16,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-12-13 02:32:16,358 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 138 [2022-12-13 02:32:16,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 451 places, 772 transitions, 28897 flow. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:32:16,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:32:16,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 138 [2022-12-13 02:32:16,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:32:19,793 INFO L130 PetriNetUnfolder]: 3018/5557 cut-off events. [2022-12-13 02:32:19,793 INFO L131 PetriNetUnfolder]: For 676784/676784 co-relation queries the response was YES. [2022-12-13 02:32:19,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94829 conditions, 5557 events. 3018/5557 cut-off events. For 676784/676784 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 41025 event pairs, 1170 based on Foata normal form. 14/5569 useless extension candidates. Maximal degree in co-relation 94064. Up to 4934 conditions per place. [2022-12-13 02:32:20,003 INFO L137 encePairwiseOnDemand]: 101/138 looper letters, 682 selfloop transitions, 142 changer transitions 0/824 dead transitions. [2022-12-13 02:32:20,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 824 transitions, 32381 flow [2022-12-13 02:32:20,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 02:32:20,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 02:32:20,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 165 transitions. [2022-12-13 02:32:20,004 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.14945652173913043 [2022-12-13 02:32:20,004 INFO L175 Difference]: Start difference. First operand has 451 places, 772 transitions, 28897 flow. Second operand 8 states and 165 transitions. [2022-12-13 02:32:20,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 824 transitions, 32381 flow [2022-12-13 02:32:23,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 824 transitions, 31987 flow, removed 134 selfloop flow, removed 8 redundant places. [2022-12-13 02:32:23,187 INFO L231 Difference]: Finished difference. Result has 453 places, 782 transitions, 29345 flow [2022-12-13 02:32:23,187 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=28509, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=772, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=634, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=29345, PETRI_PLACES=453, PETRI_TRANSITIONS=782} [2022-12-13 02:32:23,187 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 432 predicate places. [2022-12-13 02:32:23,188 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:32:23,188 INFO L89 Accepts]: Start accepts. Operand has 453 places, 782 transitions, 29345 flow [2022-12-13 02:32:23,191 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:32:23,191 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:32:23,191 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 453 places, 782 transitions, 29345 flow [2022-12-13 02:32:23,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 453 places, 782 transitions, 29345 flow [2022-12-13 02:32:23,807 INFO L130 PetriNetUnfolder]: 756/2161 cut-off events. [2022-12-13 02:32:23,807 INFO L131 PetriNetUnfolder]: For 292636/293162 co-relation queries the response was YES. [2022-12-13 02:32:23,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39750 conditions, 2161 events. 756/2161 cut-off events. For 292636/293162 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 19586 event pairs, 55 based on Foata normal form. 21/2137 useless extension candidates. Maximal degree in co-relation 39360. Up to 769 conditions per place. [2022-12-13 02:32:23,867 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 453 places, 782 transitions, 29345 flow [2022-12-13 02:32:23,868 INFO L226 LiptonReduction]: Number of co-enabled transitions 1972 [2022-12-13 02:32:24,795 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:32:24,796 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1608 [2022-12-13 02:32:24,796 INFO L495 AbstractCegarLoop]: Abstraction has has 453 places, 782 transitions, 29636 flow [2022-12-13 02:32:24,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:32:24,796 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:32:24,796 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:32:24,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-12-13 02:32:24,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2022-12-13 02:32:24,997 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:32:24,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:32:24,997 INFO L85 PathProgramCache]: Analyzing trace with hash -618397300, now seen corresponding path program 1 times [2022-12-13 02:32:24,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:32:24,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354659726] [2022-12-13 02:32:24,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:32:24,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:32:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:32:25,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:32:25,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:32:25,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354659726] [2022-12-13 02:32:25,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354659726] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:32:25,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:32:25,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 02:32:25,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887882331] [2022-12-13 02:32:25,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:32:25,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 02:32:25,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:32:25,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 02:32:25,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 02:32:25,728 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 145 [2022-12-13 02:32:25,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 782 transitions, 29636 flow. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:32:25,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:32:25,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 145 [2022-12-13 02:32:25,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:32:29,284 INFO L130 PetriNetUnfolder]: 3071/5654 cut-off events. [2022-12-13 02:32:29,285 INFO L131 PetriNetUnfolder]: For 736677/736677 co-relation queries the response was YES. [2022-12-13 02:32:29,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98002 conditions, 5654 events. 3071/5654 cut-off events. For 736677/736677 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 42005 event pairs, 1200 based on Foata normal form. 2/5654 useless extension candidates. Maximal degree in co-relation 97234. Up to 5386 conditions per place. [2022-12-13 02:32:29,375 INFO L137 encePairwiseOnDemand]: 74/145 looper letters, 680 selfloop transitions, 136 changer transitions 3/819 dead transitions. [2022-12-13 02:32:29,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 819 transitions, 32420 flow [2022-12-13 02:32:29,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 02:32:29,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 02:32:29,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 178 transitions. [2022-12-13 02:32:29,376 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17536945812807883 [2022-12-13 02:32:29,377 INFO L175 Difference]: Start difference. First operand has 453 places, 782 transitions, 29636 flow. Second operand 7 states and 178 transitions. [2022-12-13 02:32:29,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 819 transitions, 32420 flow [2022-12-13 02:32:32,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 819 transitions, 31910 flow, removed 255 selfloop flow, removed 0 redundant places. [2022-12-13 02:32:32,624 INFO L231 Difference]: Finished difference. Result has 464 places, 798 transitions, 30295 flow [2022-12-13 02:32:32,625 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=29126, PETRI_DIFFERENCE_MINUEND_PLACES=453, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=782, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=651, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=30295, PETRI_PLACES=464, PETRI_TRANSITIONS=798} [2022-12-13 02:32:32,625 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 443 predicate places. [2022-12-13 02:32:32,625 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:32:32,625 INFO L89 Accepts]: Start accepts. Operand has 464 places, 798 transitions, 30295 flow [2022-12-13 02:32:32,629 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:32:32,629 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:32:32,629 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 464 places, 798 transitions, 30295 flow [2022-12-13 02:32:32,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 464 places, 798 transitions, 30295 flow [2022-12-13 02:32:33,256 INFO L130 PetriNetUnfolder]: 770/2196 cut-off events. [2022-12-13 02:32:33,257 INFO L131 PetriNetUnfolder]: For 304751/305273 co-relation queries the response was YES. [2022-12-13 02:32:33,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40719 conditions, 2196 events. 770/2196 cut-off events. For 304751/305273 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 19966 event pairs, 58 based on Foata normal form. 22/2174 useless extension candidates. Maximal degree in co-relation 40321. Up to 776 conditions per place. [2022-12-13 02:32:33,309 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 464 places, 798 transitions, 30295 flow [2022-12-13 02:32:33,310 INFO L226 LiptonReduction]: Number of co-enabled transitions 2010 [2022-12-13 02:32:33,312 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:32:33,313 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 688 [2022-12-13 02:32:33,313 INFO L495 AbstractCegarLoop]: Abstraction has has 464 places, 798 transitions, 30295 flow [2022-12-13 02:32:33,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:32:33,313 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:32:33,313 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:32:33,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-12-13 02:32:33,313 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:32:33,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:32:33,314 INFO L85 PathProgramCache]: Analyzing trace with hash 394708848, now seen corresponding path program 1 times [2022-12-13 02:32:33,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:32:33,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243381061] [2022-12-13 02:32:33,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:32:33,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:32:33,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:32:33,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:32:33,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:32:33,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243381061] [2022-12-13 02:32:33,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243381061] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:32:33,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546368896] [2022-12-13 02:32:33,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:32:33,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:32:33,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:32:33,397 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:32:33,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-12-13 02:32:33,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:32:33,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 02:32:33,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:32:33,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:32:33,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:32:33,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:32:33,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546368896] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:32:33,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:32:33,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-13 02:32:33,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74515445] [2022-12-13 02:32:33,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:32:33,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 02:32:33,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:32:33,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 02:32:33,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-12-13 02:32:33,708 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 145 [2022-12-13 02:32:33,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 798 transitions, 30295 flow. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:32:33,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:32:33,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 145 [2022-12-13 02:32:33,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:32:37,044 INFO L130 PetriNetUnfolder]: 3081/5665 cut-off events. [2022-12-13 02:32:37,044 INFO L131 PetriNetUnfolder]: For 725043/725043 co-relation queries the response was YES. [2022-12-13 02:32:37,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98617 conditions, 5665 events. 3081/5665 cut-off events. For 725043/725043 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 42012 event pairs, 1202 based on Foata normal form. 8/5671 useless extension candidates. Maximal degree in co-relation 97839. Up to 5096 conditions per place. [2022-12-13 02:32:37,139 INFO L137 encePairwiseOnDemand]: 101/145 looper letters, 709 selfloop transitions, 134 changer transitions 0/843 dead transitions. [2022-12-13 02:32:37,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 471 places, 843 transitions, 33566 flow [2022-12-13 02:32:37,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 02:32:37,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 02:32:37,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 170 transitions. [2022-12-13 02:32:37,140 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.14655172413793102 [2022-12-13 02:32:37,140 INFO L175 Difference]: Start difference. First operand has 464 places, 798 transitions, 30295 flow. Second operand 8 states and 170 transitions. [2022-12-13 02:32:37,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 471 places, 843 transitions, 33566 flow [2022-12-13 02:32:40,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 470 places, 843 transitions, 33421 flow, removed 20 selfloop flow, removed 1 redundant places. [2022-12-13 02:32:40,500 INFO L231 Difference]: Finished difference. Result has 472 places, 801 transitions, 30698 flow [2022-12-13 02:32:40,501 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=30150, PETRI_DIFFERENCE_MINUEND_PLACES=463, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=798, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=665, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=30698, PETRI_PLACES=472, PETRI_TRANSITIONS=801} [2022-12-13 02:32:40,501 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 451 predicate places. [2022-12-13 02:32:40,501 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:32:40,501 INFO L89 Accepts]: Start accepts. Operand has 472 places, 801 transitions, 30698 flow [2022-12-13 02:32:40,508 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:32:40,508 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:32:40,508 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 472 places, 801 transitions, 30698 flow [2022-12-13 02:32:40,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 472 places, 801 transitions, 30698 flow [2022-12-13 02:32:41,212 INFO L130 PetriNetUnfolder]: 775/2200 cut-off events. [2022-12-13 02:32:41,213 INFO L131 PetriNetUnfolder]: For 316193/316746 co-relation queries the response was YES. [2022-12-13 02:32:41,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41430 conditions, 2200 events. 775/2200 cut-off events. For 316193/316746 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 19954 event pairs, 57 based on Foata normal form. 22/2176 useless extension candidates. Maximal degree in co-relation 41030. Up to 785 conditions per place. [2022-12-13 02:32:41,266 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 472 places, 801 transitions, 30698 flow [2022-12-13 02:32:41,266 INFO L226 LiptonReduction]: Number of co-enabled transitions 2016 [2022-12-13 02:32:42,535 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:32:42,535 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2034 [2022-12-13 02:32:42,535 INFO L495 AbstractCegarLoop]: Abstraction has has 472 places, 801 transitions, 30778 flow [2022-12-13 02:32:42,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:32:42,535 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:32:42,535 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:32:42,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-12-13 02:32:42,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2022-12-13 02:32:42,736 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:32:42,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:32:42,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1042671536, now seen corresponding path program 1 times [2022-12-13 02:32:42,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:32:42,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216459833] [2022-12-13 02:32:42,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:32:42,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:32:42,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:32:42,907 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:32:42,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:32:42,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216459833] [2022-12-13 02:32:42,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216459833] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:32:42,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172598504] [2022-12-13 02:32:42,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:32:42,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:32:42,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:32:42,909 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:32:42,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-12-13 02:32:43,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:32:43,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 86 conjunts are in the unsatisfiable core [2022-12-13 02:32:43,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:32:43,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:32:43,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-13 02:32:43,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 02:32:43,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 02:32:44,721 INFO L321 Elim1Store]: treesize reduction 767, result has 8.8 percent of original size [2022-12-13 02:32:44,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 15 select indices, 15 select index equivalence classes, 0 disjoint index pairs (out of 105 index pairs), introduced 29 new quantified variables, introduced 105 case distinctions, treesize of input 491 treesize of output 174 [2022-12-13 02:32:44,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:32:44,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:32:56,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:32:56,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172598504] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:32:56,309 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:32:56,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-13 02:32:56,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013238657] [2022-12-13 02:32:56,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:32:56,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 02:32:56,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:32:56,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 02:32:56,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=189, Unknown=2, NotChecked=0, Total=240 [2022-12-13 02:32:56,310 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 149 [2022-12-13 02:32:56,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 801 transitions, 30778 flow. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:32:56,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:32:56,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 149 [2022-12-13 02:32:56,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:33:48,893 WARN L233 SmtUtils]: Spent 51.15s on a formula simplification that was a NOOP. DAG size: 374 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 02:34:21,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 02:34:56,694 INFO L130 PetriNetUnfolder]: 4011/7368 cut-off events. [2022-12-13 02:34:56,694 INFO L131 PetriNetUnfolder]: For 1095742/1095742 co-relation queries the response was YES. [2022-12-13 02:34:56,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137722 conditions, 7368 events. 4011/7368 cut-off events. For 1095742/1095742 co-relation queries the response was YES. Maximal size of possible extension queue 608. Compared 57037 event pairs, 953 based on Foata normal form. 33/7399 useless extension candidates. Maximal degree in co-relation 136310. Up to 4609 conditions per place. [2022-12-13 02:34:56,825 INFO L137 encePairwiseOnDemand]: 45/149 looper letters, 578 selfloop transitions, 504 changer transitions 7/1089 dead transitions. [2022-12-13 02:34:56,825 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 499 places, 1089 transitions, 43835 flow [2022-12-13 02:34:56,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 02:34:56,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-13 02:34:56,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 300 transitions. [2022-12-13 02:34:56,827 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.07190795781399809 [2022-12-13 02:34:56,827 INFO L175 Difference]: Start difference. First operand has 472 places, 801 transitions, 30778 flow. Second operand 28 states and 300 transitions. [2022-12-13 02:34:56,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 499 places, 1089 transitions, 43835 flow [2022-12-13 02:35:01,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 497 places, 1089 transitions, 43384 flow, removed 184 selfloop flow, removed 2 redundant places. [2022-12-13 02:35:01,628 INFO L231 Difference]: Finished difference. Result has 509 places, 983 transitions, 40252 flow [2022-12-13 02:35:01,628 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=30565, PETRI_DIFFERENCE_MINUEND_PLACES=470, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=801, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=356, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=40252, PETRI_PLACES=509, PETRI_TRANSITIONS=983} [2022-12-13 02:35:01,629 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 488 predicate places. [2022-12-13 02:35:01,629 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:35:01,629 INFO L89 Accepts]: Start accepts. Operand has 509 places, 983 transitions, 40252 flow [2022-12-13 02:35:01,635 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:35:01,636 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:35:01,636 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 509 places, 983 transitions, 40252 flow [2022-12-13 02:35:01,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 509 places, 983 transitions, 40252 flow [2022-12-13 02:35:02,665 INFO L130 PetriNetUnfolder]: 1013/2852 cut-off events. [2022-12-13 02:35:02,665 INFO L131 PetriNetUnfolder]: For 485269/485974 co-relation queries the response was YES. [2022-12-13 02:35:02,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60208 conditions, 2852 events. 1013/2852 cut-off events. For 485269/485974 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 27071 event pairs, 87 based on Foata normal form. 25/2819 useless extension candidates. Maximal degree in co-relation 59525. Up to 1094 conditions per place. [2022-12-13 02:35:02,747 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 509 places, 983 transitions, 40252 flow [2022-12-13 02:35:02,747 INFO L226 LiptonReduction]: Number of co-enabled transitions 2488 [2022-12-13 02:35:04,791 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:35:04,792 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3163 [2022-12-13 02:35:04,792 INFO L495 AbstractCegarLoop]: Abstraction has has 509 places, 983 transitions, 40279 flow [2022-12-13 02:35:04,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:35:04,792 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:35:04,792 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:35:04,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-12-13 02:35:04,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:35:04,993 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:35:04,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:35:04,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1922395780, now seen corresponding path program 1 times [2022-12-13 02:35:04,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:35:04,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902352066] [2022-12-13 02:35:04,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:35:04,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:35:05,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:35:05,948 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:35:05,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:35:05,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902352066] [2022-12-13 02:35:05,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902352066] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:35:05,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993695147] [2022-12-13 02:35:05,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:35:05,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:35:05,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:35:05,950 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:35:05,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-12-13 02:35:06,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:35:06,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 02:35:06,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:35:06,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:35:06,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 02:35:06,218 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:35:06,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2022-12-13 02:35:06,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:35:06,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:35:06,357 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:35:06,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 102 treesize of output 234 [2022-12-13 02:35:06,415 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:35:06,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 37 treesize of output 140 [2022-12-13 02:35:07,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:35:07,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993695147] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:35:07,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:35:07,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 02:35:07,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435568416] [2022-12-13 02:35:07,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:35:07,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 02:35:07,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:35:07,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 02:35:07,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-12-13 02:35:07,360 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 150 [2022-12-13 02:35:07,360 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 509 places, 983 transitions, 40279 flow. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:35:07,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:35:07,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 150 [2022-12-13 02:35:07,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:35:09,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 02:35:11,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 02:35:14,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 02:35:28,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 02:35:35,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 02:35:37,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 02:35:54,681 INFO L130 PetriNetUnfolder]: 4686/8647 cut-off events. [2022-12-13 02:35:54,681 INFO L131 PetriNetUnfolder]: For 1460503/1460503 co-relation queries the response was YES. [2022-12-13 02:35:54,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173530 conditions, 8647 events. 4686/8647 cut-off events. For 1460503/1460503 co-relation queries the response was YES. Maximal size of possible extension queue 694. Compared 68049 event pairs, 659 based on Foata normal form. 8/8653 useless extension candidates. Maximal degree in co-relation 172245. Up to 7157 conditions per place. [2022-12-13 02:35:54,835 INFO L137 encePairwiseOnDemand]: 72/150 looper letters, 869 selfloop transitions, 251 changer transitions 4/1124 dead transitions. [2022-12-13 02:35:54,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 524 places, 1124 transitions, 46883 flow [2022-12-13 02:35:54,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 02:35:54,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 02:35:54,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 248 transitions. [2022-12-13 02:35:54,837 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.10333333333333333 [2022-12-13 02:35:54,837 INFO L175 Difference]: Start difference. First operand has 509 places, 983 transitions, 40279 flow. Second operand 16 states and 248 transitions. [2022-12-13 02:35:54,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 524 places, 1124 transitions, 46883 flow [2022-12-13 02:36:02,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 1124 transitions, 43991 flow, removed 1353 selfloop flow, removed 9 redundant places. [2022-12-13 02:36:03,022 INFO L231 Difference]: Finished difference. Result has 522 places, 1056 transitions, 41264 flow [2022-12-13 02:36:03,023 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=150, PETRI_DIFFERENCE_MINUEND_FLOW=37565, PETRI_DIFFERENCE_MINUEND_PLACES=500, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=983, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=189, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=754, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=41264, PETRI_PLACES=522, PETRI_TRANSITIONS=1056} [2022-12-13 02:36:03,023 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 501 predicate places. [2022-12-13 02:36:03,023 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:36:03,023 INFO L89 Accepts]: Start accepts. Operand has 522 places, 1056 transitions, 41264 flow [2022-12-13 02:36:03,027 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:36:03,028 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:36:03,028 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 522 places, 1056 transitions, 41264 flow [2022-12-13 02:36:03,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 522 places, 1056 transitions, 41264 flow [2022-12-13 02:36:04,159 INFO L130 PetriNetUnfolder]: 1173/3361 cut-off events. [2022-12-13 02:36:04,159 INFO L131 PetriNetUnfolder]: For 588574/589405 co-relation queries the response was YES. [2022-12-13 02:36:04,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69772 conditions, 3361 events. 1173/3361 cut-off events. For 588574/589405 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 33006 event pairs, 136 based on Foata normal form. 27/3305 useless extension candidates. Maximal degree in co-relation 69222. Up to 1106 conditions per place. [2022-12-13 02:36:04,399 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 522 places, 1056 transitions, 41264 flow [2022-12-13 02:36:04,400 INFO L226 LiptonReduction]: Number of co-enabled transitions 2760 [2022-12-13 02:36:05,385 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [680] $Ultimate##0-->L86-3: Formula: (and (= (store |v_#memory_int_270| |v_ULTIMATE.start_main_~#t2~0#1.base_83| (store (select |v_#memory_int_270| |v_ULTIMATE.start_main_~#t2~0#1.base_83|) |v_ULTIMATE.start_main_~#t2~0#1.offset_80| |v_ULTIMATE.start_main_#t~pre14#1_84|)) |v_#memory_int_269|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_110| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_94|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_110| 0)) (= (select (select |v_#memory_int_270| v_~f~0.base_179) (+ v_~f~0.offset_176 (* v_~x1~0_229 4))) v_~x1~0_228) (= (ite (and (< v_~x1~0_229 v_~size~0_179) (<= 0 v_~x1~0_229)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_94|) (= (+ |v_#pthreadsForks_135| 1) |v_#pthreadsForks_134|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_153| 4294967295) 4294967296) (mod (* 3 v_~n~0_165) 4294967296)) (= |v_ULTIMATE.start_main_#t~pre14#1_84| |v_#pthreadsForks_135|) (= |v_thread1Thread1of1ForFork0_~i~0#1_153| 1)) InVars {#pthreadsForks=|v_#pthreadsForks_135|, ~size~0=v_~size~0_179, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_80|, ~f~0.base=v_~f~0.base_179, #memory_int=|v_#memory_int_270|, ~n~0=v_~n~0_165, ~x1~0=v_~x1~0_229, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_83|, ~f~0.offset=v_~f~0.offset_176} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_102|, ~size~0=v_~size~0_179, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_80|, ~f~0.base=v_~f~0.base_179, ~x1~0=v_~x1~0_228, ~f~0.offset=v_~f~0.offset_176, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_99|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_94|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_84|, #pthreadsForks=|v_#pthreadsForks_134|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_153|, #memory_int=|v_#memory_int_269|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_69|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_110|, ~n~0=v_~n~0_165, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_112|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_83|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, thread1Thread1of1ForFork0_~i~0#1, #memory_int, ULTIMATE.start_main_#t~nondet13#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:36:05,540 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [946] $Ultimate##0-->L49-2: Formula: (let ((.cse6 (select |v_#memory_int_720| v_~f~0.base_562))) (let ((.cse12 (select .cse6 (+ v_~f~0.offset_559 (* v_~x1~0_1126 4))))) (let ((.cse1 (select .cse6 (+ v_~f~0.offset_559 (* .cse12 4))))) (let ((.cse5 (select .cse6 (+ v_~f~0.offset_559 (* .cse1 4)))) (.cse4 (select .cse6 (+ v_~f~0.offset_559 (* v_~x2~0_745 4))))) (let ((.cse3 (select .cse6 (+ v_~f~0.offset_559 (* .cse4 4)))) (.cse9 (select .cse6 (+ v_~f~0.offset_559 (* 4 .cse5))))) (let ((.cse8 (select .cse6 (+ v_~f~0.offset_559 (* .cse9 4)))) (.cse7 (select .cse6 (+ v_~f~0.offset_559 (* .cse3 4))))) (let ((.cse0 (select .cse6 (+ v_~f~0.offset_559 (* .cse7 4)))) (.cse11 (select .cse6 (+ v_~f~0.offset_559 (* .cse8 4))))) (let ((.cse2 (select .cse6 (+ v_~f~0.offset_559 (* .cse11 4)))) (.cse10 (select .cse6 (+ v_~f~0.offset_559 (* .cse0 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_553)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_454| 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_553)) 1 0) 0)) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_553)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_643|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_553)) 1 0) 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_553)) 1 0) 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_553)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_929| 8) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_929| 4294967295) 4294967296) (mod (* 3 v_~n~0_539) 4294967296)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_600|) (= (select .cse6 (+ v_~f~0.offset_559 (* .cse2 4))) v_~x1~0_1124) (not (= (ite (and (< .cse7 v_~size~0_553) (<= 0 .cse7)) 1 0) 0)) (not (= (ite (and (< .cse8 v_~size~0_553) (<= 0 .cse8)) 1 0) 0)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_553)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_1126 v_~size~0_553) (<= 0 v_~x1~0_1126)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_745 v_~size~0_553) (<= 0 v_~x2~0_745)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_422| (ite (and (< .cse10 v_~size~0_553) (<= 0 .cse10)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_422| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_454|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_659| 0)) (not (= (ite (and (< .cse11 v_~size~0_553) (<= 0 .cse11)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_643| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_659|) (= (select .cse6 (+ v_~f~0.offset_559 (* .cse10 4))) v_~x2~0_744) (not (= 0 (ite (and (<= 0 .cse12) (< .cse12 v_~size~0_553)) 1 0)))))))))))) InVars {~x2~0=v_~x2~0_745, ~size~0=v_~size~0_553, ~f~0.base=v_~f~0.base_562, #memory_int=|v_#memory_int_720|, ~n~0=v_~n~0_539, ~x1~0=v_~x1~0_1126, ~f~0.offset=v_~f~0.offset_559} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_651|, ~x2~0=v_~x2~0_744, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_414|, ~size~0=v_~size~0_553, ~f~0.base=v_~f~0.base_562, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_386|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_422|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_600|, ~x1~0=v_~x1~0_1124, ~f~0.offset=v_~f~0.offset_559, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_454|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_643|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_378|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_929|, #memory_int=|v_#memory_int_720|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_659|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_376|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_386|, ~n~0=v_~n~0_539, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_661|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_390|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:36:08,752 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [819] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_516| v_~f~0.base_380))) (let ((.cse8 (select .cse1 (+ v_~f~0.offset_377 (* v_~x1~0_679 4))))) (let ((.cse7 (select .cse1 (+ v_~f~0.offset_377 (* .cse8 4))))) (let ((.cse5 (select .cse1 (+ v_~f~0.offset_377 (* .cse7 4))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_377 (* 4 .cse5))))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_377 (* v_~x2~0_566 4)))) (.cse6 (select .cse1 (+ (* .cse0 4) v_~f~0.offset_377)))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_377 (* .cse6 4)))) (.cse2 (select .cse1 (+ v_~f~0.offset_377 (* .cse3 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_309| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_341|) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_375)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_679) (< v_~x1~0_679 v_~size~0_375)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_377 (* .cse2 4))) v_~x2~0_565) (= 7 |v_thread1Thread1of1ForFork0_~i~0#1_519|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_375)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_377 (* 4 .cse4))) v_~x1~0_677) (not (= (ite (and (< v_~x2~0_566 v_~size~0_375) (<= 0 v_~x2~0_566)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_341| 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_401|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_391| 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_375)) 1 0) 0)) (not (= (ite (and (< .cse6 v_~size~0_375) (<= 0 .cse6)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_375| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_391|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_375| (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_375)) 1 0)) (= (ite (and (< .cse2 v_~size~0_375) (<= 0 .cse2)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_309|) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_375)) 1 0) 0)) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_375)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_519| 4294967295) 4294967296) (mod (* 3 v_~n~0_361) 4294967296)))))))))) InVars {~x2~0=v_~x2~0_566, ~size~0=v_~size~0_375, ~f~0.base=v_~f~0.base_380, #memory_int=|v_#memory_int_516|, ~n~0=v_~n~0_361, ~x1~0=v_~x1~0_679, ~f~0.offset=v_~f~0.offset_377} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_383|, ~x2~0=v_~x2~0_565, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_301|, ~size~0=v_~size~0_375, ~f~0.base=v_~f~0.base_380, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_273|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_309|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_401|, ~x1~0=v_~x1~0_677, ~f~0.offset=v_~f~0.offset_377, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_341|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_375|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_265|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_519|, #memory_int=|v_#memory_int_516|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_391|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_263|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_273|, ~n~0=v_~n~0_361, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_393|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_277|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:36:09,614 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 02:36:09,614 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6591 [2022-12-13 02:36:09,614 INFO L495 AbstractCegarLoop]: Abstraction has has 521 places, 1055 transitions, 41481 flow [2022-12-13 02:36:09,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:36:09,615 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:36:09,615 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:36:09,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-12-13 02:36:09,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:36:09,815 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:36:09,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:36:09,816 INFO L85 PathProgramCache]: Analyzing trace with hash -602130100, now seen corresponding path program 1 times [2022-12-13 02:36:09,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:36:09,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545461766] [2022-12-13 02:36:09,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:36:09,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:36:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:36:10,926 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 02:36:10,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:36:10,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545461766] [2022-12-13 02:36:10,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545461766] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:36:10,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:36:10,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 02:36:10,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390496808] [2022-12-13 02:36:10,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:36:10,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 02:36:10,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:36:10,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 02:36:10,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-13 02:36:10,928 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 155 [2022-12-13 02:36:10,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 521 places, 1055 transitions, 41481 flow. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:36:10,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:36:10,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 155 [2022-12-13 02:36:10,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:36:18,261 INFO L130 PetriNetUnfolder]: 4722/8719 cut-off events. [2022-12-13 02:36:18,261 INFO L131 PetriNetUnfolder]: For 1423351/1423351 co-relation queries the response was YES. [2022-12-13 02:36:18,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168487 conditions, 8719 events. 4722/8719 cut-off events. For 1423351/1423351 co-relation queries the response was YES. Maximal size of possible extension queue 675. Compared 69296 event pairs, 2085 based on Foata normal form. 1/8718 useless extension candidates. Maximal degree in co-relation 167274. Up to 8311 conditions per place. [2022-12-13 02:36:18,430 INFO L137 encePairwiseOnDemand]: 88/155 looper letters, 924 selfloop transitions, 146 changer transitions 13/1083 dead transitions. [2022-12-13 02:36:18,430 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 1083 transitions, 44066 flow [2022-12-13 02:36:18,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:36:18,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:36:18,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 185 transitions. [2022-12-13 02:36:18,431 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23870967741935484 [2022-12-13 02:36:18,431 INFO L175 Difference]: Start difference. First operand has 521 places, 1055 transitions, 41481 flow. Second operand 5 states and 185 transitions. [2022-12-13 02:36:18,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 1083 transitions, 44066 flow [2022-12-13 02:36:25,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 522 places, 1083 transitions, 43015 flow, removed 455 selfloop flow, removed 3 redundant places. [2022-12-13 02:36:25,734 INFO L231 Difference]: Finished difference. Result has 524 places, 1061 transitions, 40993 flow [2022-12-13 02:36:25,735 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=40430, PETRI_DIFFERENCE_MINUEND_PLACES=518, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1055, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=909, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=40993, PETRI_PLACES=524, PETRI_TRANSITIONS=1061} [2022-12-13 02:36:25,736 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 503 predicate places. [2022-12-13 02:36:25,736 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:36:25,736 INFO L89 Accepts]: Start accepts. Operand has 524 places, 1061 transitions, 40993 flow [2022-12-13 02:36:25,745 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:36:25,745 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:36:25,745 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 524 places, 1061 transitions, 40993 flow [2022-12-13 02:36:25,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 522 places, 1061 transitions, 40993 flow [2022-12-13 02:36:26,965 INFO L130 PetriNetUnfolder]: 1179/3390 cut-off events. [2022-12-13 02:36:26,966 INFO L131 PetriNetUnfolder]: For 575474/576327 co-relation queries the response was YES. [2022-12-13 02:36:27,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68264 conditions, 3390 events. 1179/3390 cut-off events. For 575474/576327 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 33375 event pairs, 142 based on Foata normal form. 23/3329 useless extension candidates. Maximal degree in co-relation 67713. Up to 1078 conditions per place. [2022-12-13 02:36:27,066 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 522 places, 1061 transitions, 40993 flow [2022-12-13 02:36:27,066 INFO L226 LiptonReduction]: Number of co-enabled transitions 2772 [2022-12-13 02:36:27,068 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [951] $Ultimate##0-->L49-2: Formula: (let ((.cse8 (select |v_#memory_int_728| v_~f~0.base_568))) (let ((.cse3 (select .cse8 (+ v_~f~0.offset_565 (* v_~x1~0_1142 4))))) (let ((.cse10 (select .cse8 (+ v_~f~0.offset_565 (* .cse3 4))))) (let ((.cse13 (select .cse8 (+ v_~f~0.offset_565 (* 4 .cse10))))) (let ((.cse6 (select .cse8 (+ v_~f~0.offset_565 (* v_~x2~0_755 4)))) (.cse7 (select .cse8 (+ v_~f~0.offset_565 (* .cse13 4))))) (let ((.cse4 (select .cse8 (+ v_~f~0.offset_565 (* .cse7 4)))) (.cse5 (select .cse8 (+ v_~f~0.offset_565 (* .cse6 4))))) (let ((.cse1 (select .cse8 (+ v_~f~0.offset_565 (* .cse5 4)))) (.cse12 (select .cse8 (+ v_~f~0.offset_565 (* .cse4 4))))) (let ((.cse2 (select .cse8 (+ v_~f~0.offset_565 (* .cse12 4)))) (.cse11 (select .cse8 (+ v_~f~0.offset_565 (* .cse1 4))))) (let ((.cse9 (select .cse8 (+ (* .cse11 4) v_~f~0.offset_565))) (.cse0 (select .cse8 (+ v_~f~0.offset_565 (* .cse2 4))))) (and (not (= (ite (and (<= 0 v_~x2~0_755) (< v_~x2~0_755 v_~size~0_559)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_653| (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_559)) 1 0)) (not (= (ite (and (< .cse1 v_~size~0_559) (<= 0 .cse1)) 1 0) 0)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_606|) (not (= (ite (and (< .cse2 v_~size~0_559) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (< .cse3 v_~size~0_559) (<= 0 .cse3)) 1 0) 0)) (not (= (ite (and (< .cse4 v_~size~0_559) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_559)) 1 0) 0)) (< 8 (mod (* 3 v_~n~0_545) 4294967296)) (= |v_thread1Thread1of1ForFork0_~i~0#1_939| 9) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_559)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_428| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_460|) (not (= (ite (and (< .cse7 v_~size~0_559) (<= 0 .cse7)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_460| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_653| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_669|) (= (select .cse8 (+ v_~f~0.offset_565 (* 4 .cse9))) v_~x2~0_754) (not (= (ite (and (< .cse10 v_~size~0_559) (<= 0 .cse10)) 1 0) 0)) (not (= 0 (ite (and (< .cse11 v_~size~0_559) (<= 0 .cse11)) 1 0))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_428| (ite (and (< .cse9 v_~size~0_559) (<= 0 .cse9)) 1 0)) (not (= (ite (and (<= 0 v_~x1~0_1142) (< v_~x1~0_1142 v_~size~0_559)) 1 0) 0)) (not (= (ite (and (< .cse12 v_~size~0_559) (<= 0 .cse12)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_669| 0)) (not (= (ite (and (< .cse13 v_~size~0_559) (<= 0 .cse13)) 1 0) 0)) (= v_~x1~0_1140 (select .cse8 (+ v_~f~0.offset_565 (* .cse0 4)))))))))))))) InVars {~x2~0=v_~x2~0_755, ~size~0=v_~size~0_559, ~f~0.base=v_~f~0.base_568, #memory_int=|v_#memory_int_728|, ~n~0=v_~n~0_545, ~x1~0=v_~x1~0_1142, ~f~0.offset=v_~f~0.offset_565} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_661|, ~x2~0=v_~x2~0_754, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_420|, ~size~0=v_~size~0_559, ~f~0.base=v_~f~0.base_568, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_392|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_428|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_606|, ~x1~0=v_~x1~0_1140, ~f~0.offset=v_~f~0.offset_565, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_460|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_653|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_384|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_939|, #memory_int=|v_#memory_int_728|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_669|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_382|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_392|, ~n~0=v_~n~0_545, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_671|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_396|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:36:28,539 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:36:28,540 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2804 [2022-12-13 02:36:28,540 INFO L495 AbstractCegarLoop]: Abstraction has has 522 places, 1061 transitions, 41030 flow [2022-12-13 02:36:28,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:36:28,540 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:36:28,540 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:36:28,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2022-12-13 02:36:28,541 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:36:28,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:36:28,541 INFO L85 PathProgramCache]: Analyzing trace with hash -536078654, now seen corresponding path program 1 times [2022-12-13 02:36:28,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:36:28,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821567256] [2022-12-13 02:36:28,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:36:28,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:36:28,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:36:29,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:36:29,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:36:29,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821567256] [2022-12-13 02:36:29,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821567256] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:36:29,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142711900] [2022-12-13 02:36:29,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:36:29,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:36:29,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:36:29,412 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:36:29,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-12-13 02:36:29,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:36:29,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 02:36:29,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:36:29,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:36:29,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-13 02:36:29,625 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:36:29,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 45 [2022-12-13 02:36:29,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:36:29,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:36:29,732 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:36:29,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 102 treesize of output 234 [2022-12-13 02:36:29,785 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:36:29,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 45 treesize of output 152 [2022-12-13 02:36:30,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:36:30,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142711900] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:36:30,610 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:36:30,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-13 02:36:30,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105673552] [2022-12-13 02:36:30,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:36:30,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 02:36:30,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:36:30,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 02:36:30,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-13 02:36:30,611 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 154 [2022-12-13 02:36:30,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 522 places, 1061 transitions, 41030 flow. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states 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 02:36:30,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:36:30,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 154 [2022-12-13 02:36:30,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:36:35,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 02:36:38,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 02:36:40,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 02:36:41,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 02:36:49,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 02:36:52,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 02:37:09,981 INFO L130 PetriNetUnfolder]: 4755/8777 cut-off events. [2022-12-13 02:37:09,981 INFO L131 PetriNetUnfolder]: For 1366363/1366363 co-relation queries the response was YES. [2022-12-13 02:37:10,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165969 conditions, 8777 events. 4755/8777 cut-off events. For 1366363/1366363 co-relation queries the response was YES. Maximal size of possible extension queue 702. Compared 70107 event pairs, 927 based on Foata normal form. 1/8776 useless extension candidates. Maximal degree in co-relation 164755. Up to 8435 conditions per place. [2022-12-13 02:37:10,154 INFO L137 encePairwiseOnDemand]: 80/154 looper letters, 943 selfloop transitions, 155 changer transitions 2/1100 dead transitions. [2022-12-13 02:37:10,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 530 places, 1100 transitions, 44372 flow [2022-12-13 02:37:10,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 02:37:10,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 02:37:10,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 196 transitions. [2022-12-13 02:37:10,155 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1414141414141414 [2022-12-13 02:37:10,155 INFO L175 Difference]: Start difference. First operand has 522 places, 1061 transitions, 41030 flow. Second operand 9 states and 196 transitions. [2022-12-13 02:37:10,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 530 places, 1100 transitions, 44372 flow [2022-12-13 02:37:16,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 529 places, 1100 transitions, 44227 flow, removed 10 selfloop flow, removed 1 redundant places. [2022-12-13 02:37:17,016 INFO L231 Difference]: Finished difference. Result has 534 places, 1072 transitions, 41849 flow [2022-12-13 02:37:17,017 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=40885, PETRI_DIFFERENCE_MINUEND_PLACES=521, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1061, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=145, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=907, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=41849, PETRI_PLACES=534, PETRI_TRANSITIONS=1072} [2022-12-13 02:37:17,017 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 513 predicate places. [2022-12-13 02:37:17,018 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:37:17,018 INFO L89 Accepts]: Start accepts. Operand has 534 places, 1072 transitions, 41849 flow [2022-12-13 02:37:17,023 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:37:17,023 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:37:17,023 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 534 places, 1072 transitions, 41849 flow [2022-12-13 02:37:17,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 534 places, 1072 transitions, 41849 flow [2022-12-13 02:37:18,314 INFO L130 PetriNetUnfolder]: 1190/3422 cut-off events. [2022-12-13 02:37:18,315 INFO L131 PetriNetUnfolder]: For 589913/590835 co-relation queries the response was YES. [2022-12-13 02:37:18,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69382 conditions, 3422 events. 1190/3422 cut-off events. For 589913/590835 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 33895 event pairs, 140 based on Foata normal form. 26/3359 useless extension candidates. Maximal degree in co-relation 68825. Up to 1088 conditions per place. [2022-12-13 02:37:18,408 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 534 places, 1072 transitions, 41849 flow [2022-12-13 02:37:18,408 INFO L226 LiptonReduction]: Number of co-enabled transitions 2808 [2022-12-13 02:37:18,411 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:37:18,412 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1394 [2022-12-13 02:37:18,412 INFO L495 AbstractCegarLoop]: Abstraction has has 534 places, 1072 transitions, 41849 flow [2022-12-13 02:37:18,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states 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 02:37:18,412 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:37:18,412 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:37:18,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-12-13 02:37:18,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable73 [2022-12-13 02:37:18,612 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:37:18,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:37:18,613 INFO L85 PathProgramCache]: Analyzing trace with hash 546049026, now seen corresponding path program 1 times [2022-12-13 02:37:18,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:37:18,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949375656] [2022-12-13 02:37:18,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:37:18,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:37:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:37:18,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:37:18,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:37:18,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949375656] [2022-12-13 02:37:18,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949375656] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:37:18,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:37:18,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:37:18,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550509388] [2022-12-13 02:37:18,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:37:18,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:37:18,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:37:18,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:37:18,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:37:18,806 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 154 [2022-12-13 02:37:18,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 534 places, 1072 transitions, 41849 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:37:18,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:37:18,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 154 [2022-12-13 02:37:18,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:37:24,624 INFO L130 PetriNetUnfolder]: 4785/8839 cut-off events. [2022-12-13 02:37:24,624 INFO L131 PetriNetUnfolder]: For 1406711/1406711 co-relation queries the response was YES. [2022-12-13 02:37:24,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168187 conditions, 8839 events. 4785/8839 cut-off events. For 1406711/1406711 co-relation queries the response was YES. Maximal size of possible extension queue 707. Compared 70806 event pairs, 2049 based on Foata normal form. 8/8845 useless extension candidates. Maximal degree in co-relation 166966. Up to 8205 conditions per place. [2022-12-13 02:37:24,781 INFO L137 encePairwiseOnDemand]: 65/154 looper letters, 828 selfloop transitions, 275 changer transitions 2/1105 dead transitions. [2022-12-13 02:37:24,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 538 places, 1105 transitions, 45192 flow [2022-12-13 02:37:24,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:37:24,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:37:24,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2022-12-13 02:37:24,783 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22857142857142856 [2022-12-13 02:37:24,783 INFO L175 Difference]: Start difference. First operand has 534 places, 1072 transitions, 41849 flow. Second operand 5 states and 176 transitions. [2022-12-13 02:37:24,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 538 places, 1105 transitions, 45192 flow [2022-12-13 02:37:32,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 536 places, 1105 transitions, 44955 flow, removed 79 selfloop flow, removed 2 redundant places. [2022-12-13 02:37:32,370 INFO L231 Difference]: Finished difference. Result has 538 places, 1076 transitions, 42633 flow [2022-12-13 02:37:32,371 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=41612, PETRI_DIFFERENCE_MINUEND_PLACES=532, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1072, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=271, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=797, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=42633, PETRI_PLACES=538, PETRI_TRANSITIONS=1076} [2022-12-13 02:37:32,371 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 517 predicate places. [2022-12-13 02:37:32,371 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:37:32,371 INFO L89 Accepts]: Start accepts. Operand has 538 places, 1076 transitions, 42633 flow [2022-12-13 02:37:32,380 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:37:32,380 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:37:32,380 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 538 places, 1076 transitions, 42633 flow [2022-12-13 02:37:32,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 538 places, 1076 transitions, 42633 flow [2022-12-13 02:37:33,646 INFO L130 PetriNetUnfolder]: 1194/3433 cut-off events. [2022-12-13 02:37:33,647 INFO L131 PetriNetUnfolder]: For 604740/605611 co-relation queries the response was YES. [2022-12-13 02:37:33,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70445 conditions, 3433 events. 1194/3433 cut-off events. For 604740/605611 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 34088 event pairs, 143 based on Foata normal form. 25/3369 useless extension candidates. Maximal degree in co-relation 69883. Up to 1094 conditions per place. [2022-12-13 02:37:33,756 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 538 places, 1076 transitions, 42633 flow [2022-12-13 02:37:33,757 INFO L226 LiptonReduction]: Number of co-enabled transitions 2818 [2022-12-13 02:37:33,759 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:37:33,760 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1389 [2022-12-13 02:37:33,760 INFO L495 AbstractCegarLoop]: Abstraction has has 538 places, 1076 transitions, 42633 flow [2022-12-13 02:37:33,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:37:33,760 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:37:33,760 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:37:33,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-12-13 02:37:33,760 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:37:33,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:37:33,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1005899380, now seen corresponding path program 1 times [2022-12-13 02:37:33,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:37:33,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654363500] [2022-12-13 02:37:33,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:37:33,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:37:33,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:37:33,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:37:33,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:37:33,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654363500] [2022-12-13 02:37:33,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654363500] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:37:33,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856641495] [2022-12-13 02:37:33,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:37:33,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:37:33,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:37:33,825 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:37:33,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-12-13 02:37:34,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:37:34,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 02:37:34,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:37:34,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:37:34,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:37:34,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:37:34,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856641495] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:37:34,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:37:34,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-13 02:37:34,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647080350] [2022-12-13 02:37:34,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:37:34,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 02:37:34,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:37:34,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 02:37:34,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 02:37:34,174 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 154 [2022-12-13 02:37:34,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 538 places, 1076 transitions, 42633 flow. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:37:34,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:37:34,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 154 [2022-12-13 02:37:34,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:37:40,392 INFO L130 PetriNetUnfolder]: 4795/8879 cut-off events. [2022-12-13 02:37:40,393 INFO L131 PetriNetUnfolder]: For 1466923/1466923 co-relation queries the response was YES. [2022-12-13 02:37:40,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170497 conditions, 8879 events. 4795/8879 cut-off events. For 1466923/1466923 co-relation queries the response was YES. Maximal size of possible extension queue 710. Compared 71299 event pairs, 2142 based on Foata normal form. 34/8911 useless extension candidates. Maximal degree in co-relation 169269. Up to 8611 conditions per place. [2022-12-13 02:37:40,568 INFO L137 encePairwiseOnDemand]: 134/154 looper letters, 1028 selfloop transitions, 80 changer transitions 1/1109 dead transitions. [2022-12-13 02:37:40,569 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 1109 transitions, 46151 flow [2022-12-13 02:37:40,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:37:40,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:37:40,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 183 transitions. [2022-12-13 02:37:40,569 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19805194805194806 [2022-12-13 02:37:40,570 INFO L175 Difference]: Start difference. First operand has 538 places, 1076 transitions, 42633 flow. Second operand 6 states and 183 transitions. [2022-12-13 02:37:40,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 1109 transitions, 46151 flow [2022-12-13 02:37:48,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 541 places, 1109 transitions, 45811 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-13 02:37:48,430 INFO L231 Difference]: Finished difference. Result has 543 places, 1081 transitions, 42788 flow [2022-12-13 02:37:48,431 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=42293, PETRI_DIFFERENCE_MINUEND_PLACES=536, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1076, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=997, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=42788, PETRI_PLACES=543, PETRI_TRANSITIONS=1081} [2022-12-13 02:37:48,431 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 522 predicate places. [2022-12-13 02:37:48,431 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:37:48,431 INFO L89 Accepts]: Start accepts. Operand has 543 places, 1081 transitions, 42788 flow [2022-12-13 02:37:48,437 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:37:48,437 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:37:48,437 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 543 places, 1081 transitions, 42788 flow [2022-12-13 02:37:48,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 543 places, 1081 transitions, 42788 flow [2022-12-13 02:37:49,630 INFO L130 PetriNetUnfolder]: 1199/3469 cut-off events. [2022-12-13 02:37:49,630 INFO L131 PetriNetUnfolder]: For 631674/632508 co-relation queries the response was YES. [2022-12-13 02:37:49,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71707 conditions, 3469 events. 1199/3469 cut-off events. For 631674/632508 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 34586 event pairs, 136 based on Foata normal form. 25/3411 useless extension candidates. Maximal degree in co-relation 71141. Up to 1105 conditions per place. [2022-12-13 02:37:49,895 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 543 places, 1081 transitions, 42788 flow [2022-12-13 02:37:49,896 INFO L226 LiptonReduction]: Number of co-enabled transitions 2830 [2022-12-13 02:37:49,898 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:37:49,899 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1468 [2022-12-13 02:37:49,899 INFO L495 AbstractCegarLoop]: Abstraction has has 543 places, 1081 transitions, 42788 flow [2022-12-13 02:37:49,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:37:49,899 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:37:49,899 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:37:49,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2022-12-13 02:37:50,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable75 [2022-12-13 02:37:50,099 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:37:50,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:37:50,100 INFO L85 PathProgramCache]: Analyzing trace with hash -2029385272, now seen corresponding path program 2 times [2022-12-13 02:37:50,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:37:50,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462560797] [2022-12-13 02:37:50,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:37:50,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:37:50,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:37:50,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:37:50,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:37:50,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462560797] [2022-12-13 02:37:50,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462560797] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:37:50,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:37:50,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:37:50,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426710494] [2022-12-13 02:37:50,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:37:50,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:37:50,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:37:50,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:37:50,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:37:50,168 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 154 [2022-12-13 02:37:50,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 1081 transitions, 42788 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:37:50,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:37:50,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 154 [2022-12-13 02:37:50,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:37:56,131 INFO L130 PetriNetUnfolder]: 4799/8927 cut-off events. [2022-12-13 02:37:56,131 INFO L131 PetriNetUnfolder]: For 1509695/1509695 co-relation queries the response was YES. [2022-12-13 02:37:56,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173253 conditions, 8927 events. 4799/8927 cut-off events. For 1509695/1509695 co-relation queries the response was YES. Maximal size of possible extension queue 719. Compared 72141 event pairs, 2037 based on Foata normal form. 4/8929 useless extension candidates. Maximal degree in co-relation 172015. Up to 8092 conditions per place. [2022-12-13 02:37:56,297 INFO L137 encePairwiseOnDemand]: 107/154 looper letters, 1012 selfloop transitions, 123 changer transitions 4/1139 dead transitions. [2022-12-13 02:37:56,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 546 places, 1139 transitions, 47325 flow [2022-12-13 02:37:56,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:37:56,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:37:56,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-12-13 02:37:56,298 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2775974025974026 [2022-12-13 02:37:56,298 INFO L175 Difference]: Start difference. First operand has 543 places, 1081 transitions, 42788 flow. Second operand 4 states and 171 transitions. [2022-12-13 02:37:56,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 546 places, 1139 transitions, 47325 flow [2022-12-13 02:38:04,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 1139 transitions, 47060 flow, removed 103 selfloop flow, removed 3 redundant places. [2022-12-13 02:38:04,658 INFO L231 Difference]: Finished difference. Result has 544 places, 1089 transitions, 43207 flow [2022-12-13 02:38:04,658 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=42546, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1081, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=958, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=43207, PETRI_PLACES=544, PETRI_TRANSITIONS=1089} [2022-12-13 02:38:04,659 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 523 predicate places. [2022-12-13 02:38:04,659 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:38:04,659 INFO L89 Accepts]: Start accepts. Operand has 544 places, 1089 transitions, 43207 flow [2022-12-13 02:38:04,665 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:38:04,665 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:38:04,665 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 544 places, 1089 transitions, 43207 flow [2022-12-13 02:38:04,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 544 places, 1089 transitions, 43207 flow [2022-12-13 02:38:06,145 INFO L130 PetriNetUnfolder]: 1200/3503 cut-off events. [2022-12-13 02:38:06,145 INFO L131 PetriNetUnfolder]: For 647317/648196 co-relation queries the response was YES. [2022-12-13 02:38:06,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72579 conditions, 3503 events. 1200/3503 cut-off events. For 647317/648196 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 35133 event pairs, 140 based on Foata normal form. 31/3453 useless extension candidates. Maximal degree in co-relation 72012. Up to 1104 conditions per place. [2022-12-13 02:38:06,260 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 544 places, 1089 transitions, 43207 flow [2022-12-13 02:38:06,261 INFO L226 LiptonReduction]: Number of co-enabled transitions 2836 [2022-12-13 02:38:07,998 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [955] $Ultimate##0-->L59-2: Formula: (let ((.cse7 (select |v_#memory_int_734| v_~f~0.base_574))) (let ((.cse1 (select .cse7 (+ v_~f~0.offset_571 (* v_~x1~0_1157 4)))) (.cse0 (select .cse7 (+ v_~f~0.offset_571 (* v_~x2~0_770 4))))) (let ((.cse3 (select .cse7 (+ v_~f~0.offset_571 (* .cse0 4)))) (.cse16 (select .cse7 (+ v_~f~0.offset_571 (* .cse1 4))))) (let ((.cse13 (select .cse7 (+ (* 4 .cse16) v_~f~0.offset_571))) (.cse12 (select .cse7 (+ v_~f~0.offset_571 (* .cse3 4))))) (let ((.cse15 (select .cse7 (+ (* .cse12 4) v_~f~0.offset_571))) (.cse9 (select .cse7 (+ v_~f~0.offset_571 (* .cse13 4))))) (let ((.cse6 (select .cse7 (+ v_~f~0.offset_571 (* .cse9 4)))) (.cse2 (select .cse7 (+ v_~f~0.offset_571 (* .cse15 4))))) (let ((.cse14 (select .cse7 (+ v_~f~0.offset_571 (* 4 .cse2)))) (.cse10 (select .cse7 (+ v_~f~0.offset_571 (* .cse6 4))))) (let ((.cse4 (select .cse7 (+ v_~f~0.offset_571 (* .cse10 4)))) (.cse11 (select .cse7 (+ v_~f~0.offset_571 (* .cse14 4))))) (let ((.cse5 (select .cse7 (+ v_~f~0.offset_571 (* .cse11 4)))) (.cse8 (select .cse7 (+ v_~f~0.offset_571 (* .cse4 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_565)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_565)) 1 0) 0)) (< 8 (mod (* 3 v_~n~0_551) 4294967296)) (= 9 |v_thread2Thread1of1ForFork1_~i~1#1_614|) (not (= (ite (and (< .cse2 v_~size~0_565) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_1157) (< v_~x1~0_1157 v_~size~0_565)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_565)) 1 0) 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_565)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_436| (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_565)) 1 0)) (not (= (ite (and (< .cse6 v_~size~0_565) (<= 0 .cse6)) 1 0) 0)) (= (select .cse7 (+ v_~f~0.offset_571 (* .cse8 4))) v_~x1~0_1156) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_565)) 1 0) 0)) (= (select .cse7 (+ v_~f~0.offset_571 (* .cse5 4))) v_~x2~0_768) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_565)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_949| 9) (not (= (ite (and (< .cse11 v_~size~0_565) (<= 0 .cse11)) 1 0) 0)) (not (= (ite (and (<= 0 .cse12) (< .cse12 v_~size~0_565)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_679| 0)) (not (= (ite (and (< v_~x2~0_770 v_~size~0_565) (<= 0 v_~x2~0_770)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_663| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_679|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_436| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_468|) (= (ite (and (< .cse8 v_~size~0_565) (<= 0 .cse8)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_663|) (not (= 0 (ite (and (<= 0 .cse13) (< .cse13 v_~size~0_565)) 1 0))) (not (= (ite (and (<= 0 .cse14) (< .cse14 v_~size~0_565)) 1 0) 0)) (not (= (ite (and (<= 0 .cse15) (< .cse15 v_~size~0_565)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_468| 0)) (not (= (ite (and (< .cse16 v_~size~0_565) (<= 0 .cse16)) 1 0) 0)))))))))))) InVars {~x2~0=v_~x2~0_770, ~size~0=v_~size~0_565, ~f~0.base=v_~f~0.base_574, #memory_int=|v_#memory_int_734|, ~n~0=v_~n~0_551, ~x1~0=v_~x1~0_1157, ~f~0.offset=v_~f~0.offset_571} OutVars{~x2~0=v_~x2~0_768, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_671|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_428|, ~size~0=v_~size~0_565, ~f~0.base=v_~f~0.base_574, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_400|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_436|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_614|, ~x1~0=v_~x1~0_1156, ~f~0.offset=v_~f~0.offset_571, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_468|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_663|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_392|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_949|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_390|, #memory_int=|v_#memory_int_734|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_679|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_400|, ~n~0=v_~n~0_551, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_404|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_681|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-13 02:38:09,793 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:38:09,793 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5134 [2022-12-13 02:38:09,793 INFO L495 AbstractCegarLoop]: Abstraction has has 544 places, 1089 transitions, 43279 flow [2022-12-13 02:38:09,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:38:09,793 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:38:09,793 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:38:09,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2022-12-13 02:38:09,794 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:38:09,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:38:09,794 INFO L85 PathProgramCache]: Analyzing trace with hash -519099562, now seen corresponding path program 2 times [2022-12-13 02:38:09,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:38:09,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271179893] [2022-12-13 02:38:09,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:38:09,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:38:09,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:38:09,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:38:09,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:38:09,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271179893] [2022-12-13 02:38:09,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271179893] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:38:09,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:38:09,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:38:09,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362686606] [2022-12-13 02:38:09,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:38:09,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:38:09,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:38:09,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:38:09,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:38:09,876 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 156 [2022-12-13 02:38:09,876 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 1089 transitions, 43279 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:38:09,876 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:38:09,876 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 156 [2022-12-13 02:38:09,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:38:15,733 INFO L130 PetriNetUnfolder]: 4796/8908 cut-off events. [2022-12-13 02:38:15,734 INFO L131 PetriNetUnfolder]: For 1515573/1515573 co-relation queries the response was YES. [2022-12-13 02:38:15,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173454 conditions, 8908 events. 4796/8908 cut-off events. For 1515573/1515573 co-relation queries the response was YES. Maximal size of possible extension queue 714. Compared 71924 event pairs, 2084 based on Foata normal form. 2/8908 useless extension candidates. Maximal degree in co-relation 172215. Up to 8273 conditions per place. [2022-12-13 02:38:15,897 INFO L137 encePairwiseOnDemand]: 134/156 looper letters, 1039 selfloop transitions, 81 changer transitions 5/1125 dead transitions. [2022-12-13 02:38:15,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 548 places, 1125 transitions, 47032 flow [2022-12-13 02:38:15,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:38:15,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:38:15,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 177 transitions. [2022-12-13 02:38:15,898 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22692307692307692 [2022-12-13 02:38:15,898 INFO L175 Difference]: Start difference. First operand has 544 places, 1089 transitions, 43279 flow. Second operand 5 states and 177 transitions. [2022-12-13 02:38:15,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 548 places, 1125 transitions, 47032 flow [2022-12-13 02:38:24,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 547 places, 1125 transitions, 46657 flow, removed 135 selfloop flow, removed 1 redundant places. [2022-12-13 02:38:24,375 INFO L231 Difference]: Finished difference. Result has 548 places, 1094 transitions, 43421 flow [2022-12-13 02:38:24,375 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=42947, PETRI_DIFFERENCE_MINUEND_PLACES=543, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1088, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1012, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=43421, PETRI_PLACES=548, PETRI_TRANSITIONS=1094} [2022-12-13 02:38:24,376 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 527 predicate places. [2022-12-13 02:38:24,376 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:38:24,376 INFO L89 Accepts]: Start accepts. Operand has 548 places, 1094 transitions, 43421 flow [2022-12-13 02:38:24,381 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:38:24,381 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:38:24,381 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 548 places, 1094 transitions, 43421 flow [2022-12-13 02:38:24,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 547 places, 1094 transitions, 43421 flow [2022-12-13 02:38:25,616 INFO L130 PetriNetUnfolder]: 1197/3483 cut-off events. [2022-12-13 02:38:25,616 INFO L131 PetriNetUnfolder]: For 645711/646577 co-relation queries the response was YES. [2022-12-13 02:38:25,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72084 conditions, 3483 events. 1197/3483 cut-off events. For 645711/646577 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 34896 event pairs, 139 based on Foata normal form. 31/3434 useless extension candidates. Maximal degree in co-relation 71517. Up to 1104 conditions per place. [2022-12-13 02:38:25,715 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 547 places, 1094 transitions, 43421 flow [2022-12-13 02:38:25,716 INFO L226 LiptonReduction]: Number of co-enabled transitions 2846 [2022-12-13 02:38:25,718 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [959] $Ultimate##0-->L49-2: Formula: (let ((.cse6 (select |v_#memory_int_740| v_~f~0.base_578))) (let ((.cse9 (select .cse6 (+ v_~f~0.offset_575 (* v_~x1~0_1172 4))))) (let ((.cse5 (select .cse6 (+ v_~f~0.offset_575 (* v_~x2~0_784 4)))) (.cse17 (select .cse6 (+ v_~f~0.offset_575 (* .cse9 4))))) (let ((.cse13 (select .cse6 (+ v_~f~0.offset_575 (* .cse17 4)))) (.cse1 (select .cse6 (+ v_~f~0.offset_575 (* 4 .cse5))))) (let ((.cse15 (select .cse6 (+ v_~f~0.offset_575 (* .cse1 4)))) (.cse11 (select .cse6 (+ v_~f~0.offset_575 (* .cse13 4))))) (let ((.cse16 (select .cse6 (+ v_~f~0.offset_575 (* .cse11 4)))) (.cse14 (select .cse6 (+ v_~f~0.offset_575 (* .cse15 4))))) (let ((.cse0 (select .cse6 (+ v_~f~0.offset_575 (* .cse14 4)))) (.cse12 (select .cse6 (+ v_~f~0.offset_575 (* .cse16 4))))) (let ((.cse8 (select .cse6 (+ v_~f~0.offset_575 (* .cse12 4)))) (.cse2 (select .cse6 (+ v_~f~0.offset_575 (* .cse0 4))))) (let ((.cse10 (select .cse6 (+ v_~f~0.offset_575 (* .cse2 4)))) (.cse4 (select .cse6 (+ v_~f~0.offset_575 (* 4 .cse8))))) (let ((.cse7 (select .cse6 (+ v_~f~0.offset_575 (* .cse4 4)))) (.cse3 (select .cse6 (+ v_~f~0.offset_575 (* .cse10 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_569) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_569) (<= 0 .cse1)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_672| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_688|) (not (= (ite (and (< .cse2 v_~size~0_569) (<= 0 .cse2)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_447| (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_569)) 1 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_569)) 1 0) 0)) (not (= (ite (and (< .cse5 v_~size~0_569) (<= 0 .cse5)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_784) (< v_~x2~0_784 v_~size~0_569)) 1 0) 0)) (= v_~x1~0_1170 (select .cse6 (+ (* 4 .cse7) v_~f~0.offset_575))) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_569)) 1 0) 0)) (not (= (ite (and (< .cse9 v_~size~0_569) (<= 0 .cse9)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_1172 v_~size~0_569) (<= 0 v_~x1~0_1172)) 1 0) 0)) (= (ite (and (< .cse7 v_~size~0_569) (<= 0 .cse7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_672|) (= (select .cse6 (+ v_~f~0.offset_575 (* .cse3 4))) v_~x2~0_783) (not (= (ite (and (< .cse10 v_~size~0_569) (<= 0 .cse10)) 1 0) 0)) (not (= (ite (and (< .cse11 v_~size~0_569) (<= 0 .cse11)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_958| 10) (not (= (ite (and (< .cse12 v_~size~0_569) (<= 0 .cse12)) 1 0) 0)) (not (= (ite (and (<= 0 .cse13) (< .cse13 v_~size~0_569)) 1 0) 0)) (< 9 (mod (* 3 v_~n~0_555) 4294967296)) (not (= (ite (and (<= 0 .cse14) (< .cse14 v_~size~0_569)) 1 0) 0)) (not (= (ite (and (< .cse15 v_~size~0_569) (<= 0 .cse15)) 1 0) 0)) (= 9 |v_thread2Thread1of1ForFork1_~i~1#1_625|) (not (= (ite (and (<= 0 .cse16) (< .cse16 v_~size~0_569)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_447| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_479|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_479| 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_688| 0)) (not (= (ite (and (<= 0 .cse17) (< .cse17 v_~size~0_569)) 1 0) 0))))))))))))) InVars {~x2~0=v_~x2~0_784, ~size~0=v_~size~0_569, ~f~0.base=v_~f~0.base_578, #memory_int=|v_#memory_int_740|, ~n~0=v_~n~0_555, ~x1~0=v_~x1~0_1172, ~f~0.offset=v_~f~0.offset_575} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_680|, ~x2~0=v_~x2~0_783, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_439|, ~size~0=v_~size~0_569, ~f~0.base=v_~f~0.base_578, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_411|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_447|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_625|, ~x1~0=v_~x1~0_1170, ~f~0.offset=v_~f~0.offset_575, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_479|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_672|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_403|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_958|, #memory_int=|v_#memory_int_740|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_688|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_401|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_411|, ~n~0=v_~n~0_555, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_690|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_415|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 02:38:28,314 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:38:28,315 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3939 [2022-12-13 02:38:28,315 INFO L495 AbstractCegarLoop]: Abstraction has has 547 places, 1094 transitions, 43456 flow [2022-12-13 02:38:28,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:38:28,315 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:38:28,315 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:38:28,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2022-12-13 02:38:28,315 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:38:28,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:38:28,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1867600571, now seen corresponding path program 1 times [2022-12-13 02:38:28,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:38:28,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976155628] [2022-12-13 02:38:28,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:38:28,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:38:28,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:38:28,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:38:28,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:38:28,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976155628] [2022-12-13 02:38:28,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976155628] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:38:28,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:38:28,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:38:28,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596551582] [2022-12-13 02:38:28,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:38:28,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:38:28,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:38:28,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:38:28,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:38:28,423 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 156 [2022-12-13 02:38:28,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 547 places, 1094 transitions, 43456 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:38:28,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:38:28,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 156 [2022-12-13 02:38:28,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-13 02:38:33,893 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 02:38:33,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:38:33,967 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-13 02:38:33,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2022-12-13 02:38:33,967 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (4states, 0/156 universal loopers) in iteration 79,while PetriNetUnfolder was constructing finite prefix that currently has 162277 conditions, 8169 events (4605/8168 cut-off events. For 1427025/1427025 co-relation queries the response was YES. Maximal size of possible extension queue 713. Compared 65053 event pairs, 2104 based on Foata normal form. 6/8385 useless extension candidates. Maximal degree in co-relation 161041. Up to 8078 conditions per place.). [2022-12-13 02:38:33,968 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-13 02:38:33,968 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-13 02:38:33,969 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:38:33,971 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 02:38:33,971 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 02:38:33,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 02:38:33 BasicIcfg [2022-12-13 02:38:33,972 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 02:38:33,973 INFO L158 Benchmark]: Toolchain (without parser) took 794227.48ms. Allocated memory was 184.5MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 160.8MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 3.4GB. Max. memory is 8.0GB. [2022-12-13 02:38:33,973 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 184.5MB. Free memory is still 162.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 02:38:33,973 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.38ms. Allocated memory is still 184.5MB. Free memory was 160.3MB in the beginning and 148.8MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-13 02:38:33,973 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.10ms. Allocated memory is still 184.5MB. Free memory was 148.8MB in the beginning and 146.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 02:38:33,973 INFO L158 Benchmark]: Boogie Preprocessor took 33.04ms. Allocated memory is still 184.5MB. Free memory was 146.7MB in the beginning and 145.5MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 02:38:33,973 INFO L158 Benchmark]: RCFGBuilder took 506.91ms. Allocated memory is still 184.5MB. Free memory was 145.1MB in the beginning and 128.9MB in the end (delta: 16.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-12-13 02:38:33,973 INFO L158 Benchmark]: TraceAbstraction took 793392.68ms. Allocated memory was 184.5MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 127.8MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 3.3GB. Max. memory is 8.0GB. [2022-12-13 02:38:33,974 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.12ms. Allocated memory is still 184.5MB. Free memory is still 162.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 219.38ms. Allocated memory is still 184.5MB. Free memory was 160.3MB in the beginning and 148.8MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.10ms. Allocated memory is still 184.5MB. Free memory was 148.8MB in the beginning and 146.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.04ms. Allocated memory is still 184.5MB. Free memory was 146.7MB in the beginning and 145.5MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 506.91ms. Allocated memory is still 184.5MB. Free memory was 145.1MB in the beginning and 128.9MB in the end (delta: 16.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 793392.68ms. Allocated memory was 184.5MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 127.8MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 3.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.9s, 149 PlacesBefore, 21 PlacesAfterwards, 157 TransitionsBefore, 17 TransitionsAfterwards, 2592 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 69 TrivialYvCompositions, 59 ConcurrentYvCompositions, 12 ChoiceCompositions, 140 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1612, independent: 1609, independent conditional: 1609, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1612, independent: 1609, independent conditional: 0, independent unconditional: 1609, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1612, independent: 1609, independent conditional: 0, independent unconditional: 1609, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1612, independent: 1609, independent conditional: 0, independent unconditional: 1609, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1538, independent: 1535, independent conditional: 0, independent unconditional: 1535, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1538, independent: 1535, independent conditional: 0, independent unconditional: 1535, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, 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: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1612, independent: 74, independent conditional: 0, independent unconditional: 74, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1538, unknown conditional: 0, unknown unconditional: 1538] , Statistics on independence cache: Total cache size (in pairs): 3041, Positive cache size: 3038, Positive conditional cache size: 0, Positive unconditional cache size: 3038, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 20 PlacesBefore, 19 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 54 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 20 PlacesBefore, 20 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 72 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 25 PlacesBefore, 24 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 3, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 21, independent: 21, independent conditional: 3, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 3, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 21, independent: 15, independent conditional: 3, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 6, Positive conditional cache size: 0, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 22 PlacesBefore, 22 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 56 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 6, Positive conditional cache size: 0, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 25 PlacesBefore, 24 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 70 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 3, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 18, independent conditional: 3, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 3, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 1, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, independent: 12, independent conditional: 2, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 15, Positive conditional cache size: 1, Positive unconditional cache size: 14, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 23 PlacesBefore, 23 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 50 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 15, Positive conditional cache size: 1, Positive unconditional cache size: 14, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 25 PlacesBefore, 25 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 58 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 16, Positive cache size: 15, Positive conditional cache size: 1, Positive unconditional cache size: 14, Negative cache size: 1, Negative conditional cache size: 1, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 40 PlacesBefore, 39 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 21, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 18, Positive conditional cache size: 4, Positive unconditional cache size: 14, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 37 PlacesBefore, 38 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 38, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 30, Positive cache size: 24, Positive conditional cache size: 10, Positive unconditional cache size: 14, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 90 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 30, Positive cache size: 24, Positive conditional cache size: 10, Positive unconditional cache size: 14, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 68 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 30, Positive cache size: 24, Positive conditional cache size: 10, Positive unconditional cache size: 14, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 39 PlacesBefore, 38 PlacesAfterwards, 32 TransitionsBefore, 31 TransitionsAfterwards, 110 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 30, Positive cache size: 24, Positive conditional cache size: 10, Positive unconditional cache size: 14, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.1s, 56 PlacesBefore, 52 PlacesAfterwards, 74 TransitionsBefore, 70 TransitionsAfterwards, 252 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 57, independent: 57, independent conditional: 57, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 57, independent: 57, independent conditional: 57, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 57, independent: 57, independent conditional: 57, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 57, independent: 57, independent conditional: 57, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 57, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 22, unknown conditional: 22, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 74, Positive cache size: 68, Positive conditional cache size: 48, Positive unconditional cache size: 20, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 54 PlacesBefore, 54 PlacesAfterwards, 78 TransitionsBefore, 78 TransitionsAfterwards, 286 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 70, Positive conditional cache size: 50, Positive unconditional cache size: 20, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 64 PlacesBefore, 64 PlacesAfterwards, 105 TransitionsBefore, 105 TransitionsAfterwards, 416 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 70, Positive conditional cache size: 50, Positive unconditional cache size: 20, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 67 PlacesBefore, 67 PlacesAfterwards, 110 TransitionsBefore, 110 TransitionsAfterwards, 450 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 70, Positive conditional cache size: 50, Positive unconditional cache size: 20, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 71 PlacesBefore, 71 PlacesAfterwards, 115 TransitionsBefore, 115 TransitionsAfterwards, 470 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 70, Positive conditional cache size: 50, Positive unconditional cache size: 20, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 76 PlacesBefore, 76 PlacesAfterwards, 119 TransitionsBefore, 119 TransitionsAfterwards, 494 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 70, Positive conditional cache size: 50, Positive unconditional cache size: 20, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 81 PlacesBefore, 82 PlacesAfterwards, 137 TransitionsBefore, 138 TransitionsAfterwards, 532 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 78, Positive cache size: 72, Positive conditional cache size: 52, Positive unconditional cache size: 20, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 97 PlacesBefore, 97 PlacesAfterwards, 162 TransitionsBefore, 162 TransitionsAfterwards, 580 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 82, Positive cache size: 76, Positive conditional cache size: 56, Positive unconditional cache size: 20, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 100 PlacesBefore, 101 PlacesAfterwards, 159 TransitionsBefore, 159 TransitionsAfterwards, 574 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 26, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 26, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 85, Positive conditional cache size: 65, Positive unconditional cache size: 20, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 99 PlacesBefore, 99 PlacesAfterwards, 154 TransitionsBefore, 154 TransitionsAfterwards, 520 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 85, Positive conditional cache size: 65, Positive unconditional cache size: 20, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 112 PlacesBefore, 112 PlacesAfterwards, 193 TransitionsBefore, 193 TransitionsAfterwards, 640 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 91, Positive conditional cache size: 69, Positive unconditional cache size: 22, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 131 PlacesBefore, 129 PlacesAfterwards, 221 TransitionsBefore, 220 TransitionsAfterwards, 712 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 100, Positive cache size: 94, Positive conditional cache size: 72, Positive unconditional cache size: 22, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 132 PlacesBefore, 133 PlacesAfterwards, 230 TransitionsBefore, 232 TransitionsAfterwards, 752 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 98, Positive conditional cache size: 75, Positive unconditional cache size: 23, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 142 PlacesBefore, 142 PlacesAfterwards, 245 TransitionsBefore, 245 TransitionsAfterwards, 748 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 106, Positive cache size: 100, Positive conditional cache size: 77, Positive unconditional cache size: 23, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 157 PlacesBefore, 158 PlacesAfterwards, 279 TransitionsBefore, 279 TransitionsAfterwards, 854 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 107, Positive cache size: 101, Positive conditional cache size: 78, Positive unconditional cache size: 23, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 162 PlacesBefore, 162 PlacesAfterwards, 282 TransitionsBefore, 282 TransitionsAfterwards, 864 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 107, Positive cache size: 101, Positive conditional cache size: 78, Positive unconditional cache size: 23, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 172 PlacesBefore, 172 PlacesAfterwards, 293 TransitionsBefore, 293 TransitionsAfterwards, 910 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 107, Positive cache size: 101, Positive conditional cache size: 78, Positive unconditional cache size: 23, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 174 PlacesBefore, 174 PlacesAfterwards, 296 TransitionsBefore, 296 TransitionsAfterwards, 918 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 107, Positive cache size: 101, Positive conditional cache size: 78, Positive unconditional cache size: 23, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 178 PlacesBefore, 178 PlacesAfterwards, 302 TransitionsBefore, 302 TransitionsAfterwards, 928 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 107, Positive cache size: 101, Positive conditional cache size: 78, Positive unconditional cache size: 23, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 182 PlacesBefore, 182 PlacesAfterwards, 303 TransitionsBefore, 303 TransitionsAfterwards, 908 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 107, Positive cache size: 101, Positive conditional cache size: 78, Positive unconditional cache size: 23, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 184 PlacesBefore, 184 PlacesAfterwards, 306 TransitionsBefore, 306 TransitionsAfterwards, 914 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 107, Positive cache size: 101, Positive conditional cache size: 78, Positive unconditional cache size: 23, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 195 PlacesBefore, 194 PlacesAfterwards, 318 TransitionsBefore, 317 TransitionsAfterwards, 946 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 109, Positive cache size: 103, Positive conditional cache size: 80, Positive unconditional cache size: 23, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.6s, 194 PlacesBefore, 193 PlacesAfterwards, 321 TransitionsBefore, 320 TransitionsAfterwards, 938 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 105, Positive conditional cache size: 82, Positive unconditional cache size: 23, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 197 PlacesBefore, 197 PlacesAfterwards, 328 TransitionsBefore, 328 TransitionsAfterwards, 962 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 105, Positive conditional cache size: 82, Positive unconditional cache size: 23, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 206 PlacesBefore, 206 PlacesAfterwards, 331 TransitionsBefore, 331 TransitionsAfterwards, 966 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 114, Positive cache size: 108, Positive conditional cache size: 85, Positive unconditional cache size: 23, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 218 PlacesBefore, 218 PlacesAfterwards, 340 TransitionsBefore, 340 TransitionsAfterwards, 1002 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 115, Positive cache size: 109, Positive conditional cache size: 86, Positive unconditional cache size: 23, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 228 PlacesBefore, 229 PlacesAfterwards, 344 TransitionsBefore, 344 TransitionsAfterwards, 980 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 116, Positive cache size: 110, Positive conditional cache size: 87, Positive unconditional cache size: 23, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 233 PlacesBefore, 233 PlacesAfterwards, 343 TransitionsBefore, 343 TransitionsAfterwards, 982 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 141, Positive conditional cache size: 116, Positive unconditional cache size: 25, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 245 PlacesBefore, 246 PlacesAfterwards, 357 TransitionsBefore, 357 TransitionsAfterwards, 1024 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 145, Positive conditional cache size: 120, Positive unconditional cache size: 25, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.1s, 254 PlacesBefore, 255 PlacesAfterwards, 360 TransitionsBefore, 359 TransitionsAfterwards, 1032 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 156, Positive cache size: 150, Positive conditional cache size: 125, Positive unconditional cache size: 25, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 272 PlacesBefore, 271 PlacesAfterwards, 381 TransitionsBefore, 379 TransitionsAfterwards, 1068 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 162, Positive cache size: 156, Positive conditional cache size: 131, Positive unconditional cache size: 25, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 271 PlacesBefore, 271 PlacesAfterwards, 373 TransitionsBefore, 373 TransitionsAfterwards, 1056 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 162, Positive cache size: 156, Positive conditional cache size: 131, Positive unconditional cache size: 25, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 280 PlacesBefore, 280 PlacesAfterwards, 382 TransitionsBefore, 382 TransitionsAfterwards, 1084 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 183, Positive cache size: 177, Positive conditional cache size: 151, Positive unconditional cache size: 26, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 281 PlacesBefore, 282 PlacesAfterwards, 399 TransitionsBefore, 399 TransitionsAfterwards, 1132 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 184, Positive cache size: 178, Positive conditional cache size: 152, Positive unconditional cache size: 26, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.0s, 284 PlacesBefore, 283 PlacesAfterwards, 392 TransitionsBefore, 391 TransitionsAfterwards, 1120 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 206, Positive cache size: 200, Positive conditional cache size: 173, Positive unconditional cache size: 27, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 288 PlacesBefore, 288 PlacesAfterwards, 405 TransitionsBefore, 405 TransitionsAfterwards, 1152 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 228, Positive cache size: 222, Positive conditional cache size: 194, Positive unconditional cache size: 28, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.3s, 321 PlacesBefore, 320 PlacesAfterwards, 507 TransitionsBefore, 506 TransitionsAfterwards, 1506 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 300, Positive cache size: 294, Positive conditional cache size: 263, Positive unconditional cache size: 31, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 319 PlacesBefore, 319 PlacesAfterwards, 514 TransitionsBefore, 514 TransitionsAfterwards, 1516 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 300, Positive cache size: 294, Positive conditional cache size: 263, Positive unconditional cache size: 31, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 321 PlacesBefore, 321 PlacesAfterwards, 524 TransitionsBefore, 524 TransitionsAfterwards, 1540 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 300, Positive cache size: 294, Positive conditional cache size: 263, Positive unconditional cache size: 31, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 324 PlacesBefore, 324 PlacesAfterwards, 530 TransitionsBefore, 530 TransitionsAfterwards, 1548 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 302, Positive cache size: 296, Positive conditional cache size: 265, Positive unconditional cache size: 31, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 325 PlacesBefore, 325 PlacesAfterwards, 529 TransitionsBefore, 529 TransitionsAfterwards, 1550 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 303, Positive cache size: 297, Positive conditional cache size: 265, Positive unconditional cache size: 32, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 328 PlacesBefore, 328 PlacesAfterwards, 527 TransitionsBefore, 527 TransitionsAfterwards, 1546 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 304, Positive cache size: 298, Positive conditional cache size: 265, Positive unconditional cache size: 33, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 335 PlacesBefore, 335 PlacesAfterwards, 540 TransitionsBefore, 540 TransitionsAfterwards, 1574 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 304, Positive cache size: 298, Positive conditional cache size: 265, Positive unconditional cache size: 33, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 345 PlacesBefore, 345 PlacesAfterwards, 552 TransitionsBefore, 552 TransitionsAfterwards, 1626 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 304, Positive cache size: 298, Positive conditional cache size: 265, Positive unconditional cache size: 33, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 353 PlacesBefore, 353 PlacesAfterwards, 563 TransitionsBefore, 563 TransitionsAfterwards, 1658 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 304, Positive cache size: 298, Positive conditional cache size: 265, Positive unconditional cache size: 33, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 354 PlacesBefore, 354 PlacesAfterwards, 566 TransitionsBefore, 566 TransitionsAfterwards, 1664 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 304, Positive cache size: 298, Positive conditional cache size: 265, Positive unconditional cache size: 33, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 361 PlacesBefore, 360 PlacesAfterwards, 587 TransitionsBefore, 586 TransitionsAfterwards, 1658 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 4, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 4, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 307, Positive cache size: 301, Positive conditional cache size: 267, Positive unconditional cache size: 34, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 363 PlacesBefore, 363 PlacesAfterwards, 585 TransitionsBefore, 585 TransitionsAfterwards, 1654 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 307, Positive cache size: 301, Positive conditional cache size: 267, Positive unconditional cache size: 34, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.5s, 375 PlacesBefore, 375 PlacesAfterwards, 617 TransitionsBefore, 617 TransitionsAfterwards, 1726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 309, Positive cache size: 303, Positive conditional cache size: 269, Positive unconditional cache size: 34, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 408 PlacesBefore, 407 PlacesAfterwards, 724 TransitionsBefore, 723 TransitionsAfterwards, 1828 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 21, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 309, Positive cache size: 303, Positive conditional cache size: 269, Positive unconditional cache size: 34, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 417 PlacesBefore, 416 PlacesAfterwards, 739 TransitionsBefore, 738 TransitionsAfterwards, 1866 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 335, Positive cache size: 329, Positive conditional cache size: 294, Positive unconditional cache size: 35, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.6s, 436 PlacesBefore, 432 PlacesAfterwards, 756 TransitionsBefore, 752 TransitionsAfterwards, 1902 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 360, Positive cache size: 354, Positive conditional cache size: 318, Positive unconditional cache size: 36, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 431 PlacesBefore, 431 PlacesAfterwards, 761 TransitionsBefore, 761 TransitionsAfterwards, 1916 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 361, Positive cache size: 355, Positive conditional cache size: 319, Positive unconditional cache size: 36, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 433 PlacesBefore, 433 PlacesAfterwards, 765 TransitionsBefore, 765 TransitionsAfterwards, 1926 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 361, Positive cache size: 355, Positive conditional cache size: 319, Positive unconditional cache size: 36, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.7s, 453 PlacesBefore, 451 PlacesAfterwards, 774 TransitionsBefore, 772 TransitionsAfterwards, 1946 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 363, Positive cache size: 357, Positive conditional cache size: 321, Positive unconditional cache size: 36, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 453 PlacesBefore, 453 PlacesAfterwards, 782 TransitionsBefore, 782 TransitionsAfterwards, 1972 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 584, Positive cache size: 578, Positive conditional cache size: 535, Positive unconditional cache size: 43, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 464 PlacesBefore, 464 PlacesAfterwards, 798 TransitionsBefore, 798 TransitionsAfterwards, 2010 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 584, Positive cache size: 578, Positive conditional cache size: 535, Positive unconditional cache size: 43, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 472 PlacesBefore, 472 PlacesAfterwards, 801 TransitionsBefore, 801 TransitionsAfterwards, 2016 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 708, Positive cache size: 702, Positive conditional cache size: 655, Positive unconditional cache size: 47, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 509 PlacesBefore, 509 PlacesAfterwards, 983 TransitionsBefore, 983 TransitionsAfterwards, 2488 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 708, Positive cache size: 702, Positive conditional cache size: 655, Positive unconditional cache size: 47, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.2s, 522 PlacesBefore, 521 PlacesAfterwards, 1056 TransitionsBefore, 1055 TransitionsAfterwards, 2760 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 710, Positive cache size: 704, Positive conditional cache size: 657, Positive unconditional cache size: 47, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 522 PlacesBefore, 522 PlacesAfterwards, 1061 TransitionsBefore, 1061 TransitionsAfterwards, 2772 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 711, Positive cache size: 705, Positive conditional cache size: 658, Positive unconditional cache size: 47, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 534 PlacesBefore, 534 PlacesAfterwards, 1072 TransitionsBefore, 1072 TransitionsAfterwards, 2808 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 711, Positive cache size: 705, Positive conditional cache size: 658, Positive unconditional cache size: 47, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 538 PlacesBefore, 538 PlacesAfterwards, 1076 TransitionsBefore, 1076 TransitionsAfterwards, 2818 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 711, Positive cache size: 705, Positive conditional cache size: 658, Positive unconditional cache size: 47, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 543 PlacesBefore, 543 PlacesAfterwards, 1081 TransitionsBefore, 1081 TransitionsAfterwards, 2830 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 711, Positive cache size: 705, Positive conditional cache size: 658, Positive unconditional cache size: 47, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 544 PlacesBefore, 544 PlacesAfterwards, 1089 TransitionsBefore, 1089 TransitionsAfterwards, 2836 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 712, Positive cache size: 706, Positive conditional cache size: 659, Positive unconditional cache size: 47, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 547 PlacesBefore, 547 PlacesAfterwards, 1094 TransitionsBefore, 1094 TransitionsAfterwards, 2846 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 713, Positive cache size: 707, Positive conditional cache size: 660, Positive unconditional cache size: 47, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (4states, 0/156 universal loopers) in iteration 79,while PetriNetUnfolder was constructing finite prefix that currently has 162277 conditions, 8169 events (4605/8168 cut-off events. For 1427025/1427025 co-relation queries the response was YES. Maximal size of possible extension queue 713. Compared 65053 event pairs, 2104 based on Foata normal form. 6/8385 useless extension candidates. Maximal degree in co-relation 161041. Up to 8078 conditions per place.). - TimeoutResultAtElement [Line: 86]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (4states, 0/156 universal loopers) in iteration 79,while PetriNetUnfolder was constructing finite prefix that currently has 162277 conditions, 8169 events (4605/8168 cut-off events. For 1427025/1427025 co-relation queries the response was YES. Maximal size of possible extension queue 713. Compared 65053 event pairs, 2104 based on Foata normal form. 6/8385 useless extension candidates. Maximal degree in co-relation 161041. Up to 8078 conditions per place.). - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (4states, 0/156 universal loopers) in iteration 79,while PetriNetUnfolder was constructing finite prefix that currently has 162277 conditions, 8169 events (4605/8168 cut-off events. For 1427025/1427025 co-relation queries the response was YES. Maximal size of possible extension queue 713. Compared 65053 event pairs, 2104 based on Foata normal form. 6/8385 useless extension candidates. Maximal degree in co-relation 161041. Up to 8078 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 213 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 793.2s, OverallIterations: 79, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 521.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: 46 mSolverCounterUnknown, 3959 SdHoareTripleChecker+Valid, 224.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3959 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 217.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 35 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 2846 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36457 IncrementalHoareTripleChecker+Invalid, 39384 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2846 mSolverCounterUnsat, 5 mSDtfsCounter, 36457 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1574 GetRequests, 845 SyntacticMatches, 24 SemanticMatches, 705 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1720 ImplicationChecksByTransitivity, 100.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43456occurred in iteration=78, InterpolantAutomatonStates: 648, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 4.2s SatisfiabilityAnalysisTime, 92.4s InterpolantComputationTime, 1556 NumberOfCodeBlocks, 1556 NumberOfCodeBlocksAsserted, 122 NumberOfCheckSat, 1902 ConstructedInterpolants, 41 QuantifiedInterpolants, 50139 SizeOfPredicates, 280 NumberOfNonLiveVariables, 7621 ConjunctsInSsa, 759 ConjunctsInUnsatCore, 156 InterpolantComputations, 41 PerfectInterpolantSequences, 22/173 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown