/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/unroll-cond-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:46:02,909 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:46:02,911 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:46:02,949 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:46:02,950 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:46:02,952 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:46:02,955 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:46:02,959 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:46:02,962 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:46:02,966 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:46:02,967 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:46:02,969 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:46:02,969 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:46:02,971 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:46:02,972 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:46:02,975 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:46:02,975 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:46:02,976 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:46:02,978 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:46:02,983 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:46:02,985 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:46:02,986 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:46:02,987 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:46:02,988 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:46:02,994 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:46:02,995 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:46:02,995 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:46:02,996 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:46:02,997 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:46:02,997 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:46:02,997 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:46:02,998 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:46:03,000 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:46:03,001 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:46:03,001 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:46:03,001 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:46:03,002 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:46:03,002 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:46:03,002 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:46:03,003 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:46:03,003 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:46:03,004 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:46:03,034 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:46:03,035 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:46:03,036 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:46:03,036 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:46:03,037 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:46:03,037 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:46:03,038 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:46:03,038 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:46:03,038 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:46:03,038 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:46:03,039 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:46:03,039 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:46:03,039 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:46:03,039 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:46:03,039 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:46:03,039 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:46:03,039 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:46:03,039 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:46:03,040 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:46:03,040 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:46:03,040 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:46:03,040 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:46:03,040 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:46:03,040 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:46:03,040 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:46:03,040 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:46:03,041 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:46:03,041 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:46:03,041 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 05:46:03,384 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:46:03,408 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:46:03,410 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:46:03,411 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:46:03,411 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:46:03,413 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-cond-2.wvr.c [2022-12-06 05:46:04,470 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:46:04,667 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:46:04,668 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-2.wvr.c [2022-12-06 05:46:04,673 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5186713d/7c59748b6ea34dcca78caf92d6f8051f/FLAG44bac9c03 [2022-12-06 05:46:04,686 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5186713d/7c59748b6ea34dcca78caf92d6f8051f [2022-12-06 05:46:04,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:46:04,690 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:46:04,692 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:46:04,692 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:46:04,694 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:46:04,695 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:46:04" (1/1) ... [2022-12-06 05:46:04,696 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51b0bc2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:46:04, skipping insertion in model container [2022-12-06 05:46:04,696 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:46:04" (1/1) ... [2022-12-06 05:46:04,702 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:46:04,724 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:46:04,895 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-cond-2.wvr.c[2474,2487] [2022-12-06 05:46:04,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:46:04,918 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:46:04,950 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-cond-2.wvr.c[2474,2487] [2022-12-06 05:46:04,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:46:04,967 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:46:04,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:46:04 WrapperNode [2022-12-06 05:46:04,967 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:46:04,968 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:46:04,969 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:46:04,970 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:46:04,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:46:04" (1/1) ... [2022-12-06 05:46:04,990 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:46:04" (1/1) ... [2022-12-06 05:46:05,019 INFO L138 Inliner]: procedures = 24, calls = 33, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 141 [2022-12-06 05:46:05,020 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:46:05,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:46:05,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:46:05,021 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:46:05,029 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:46:04" (1/1) ... [2022-12-06 05:46:05,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:46:04" (1/1) ... [2022-12-06 05:46:05,036 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:46:04" (1/1) ... [2022-12-06 05:46:05,036 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:46:04" (1/1) ... [2022-12-06 05:46:05,041 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:46:04" (1/1) ... [2022-12-06 05:46:05,043 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:46:04" (1/1) ... [2022-12-06 05:46:05,045 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:46:04" (1/1) ... [2022-12-06 05:46:05,045 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:46:04" (1/1) ... [2022-12-06 05:46:05,047 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:46:05,048 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:46:05,048 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:46:05,048 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:46:05,049 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:46:04" (1/1) ... [2022-12-06 05:46:05,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:46:05,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:46:05,080 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 05:46:05,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 05:46:05,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:46:05,117 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:46:05,117 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:46:05,118 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:46:05,118 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:46:05,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:46:05,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:46:05,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:46:05,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 05:46:05,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:46:05,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:46:05,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:46:05,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:46:05,120 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 05:46:05,215 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:46:05,216 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:46:05,477 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:46:05,486 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:46:05,486 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 05:46:05,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:46:05 BoogieIcfgContainer [2022-12-06 05:46:05,488 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:46:05,490 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:46:05,490 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:46:05,492 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:46:05,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:46:04" (1/3) ... [2022-12-06 05:46:05,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f5e27a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:46:05, skipping insertion in model container [2022-12-06 05:46:05,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:46:04" (2/3) ... [2022-12-06 05:46:05,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f5e27a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:46:05, skipping insertion in model container [2022-12-06 05:46:05,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:46:05" (3/3) ... [2022-12-06 05:46:05,494 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-cond-2.wvr.c [2022-12-06 05:46:05,514 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:46:05,514 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:46:05,514 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:46:05,622 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 05:46:05,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 163 transitions, 342 flow [2022-12-06 05:46:05,753 INFO L130 PetriNetUnfolder]: 15/161 cut-off events. [2022-12-06 05:46:05,753 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:46:05,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 161 events. 15/161 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 207 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-12-06 05:46:05,758 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 163 transitions, 342 flow [2022-12-06 05:46:05,766 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 153 transitions, 318 flow [2022-12-06 05:46:05,767 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:05,793 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 153 transitions, 318 flow [2022-12-06 05:46:05,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 153 transitions, 318 flow [2022-12-06 05:46:05,850 INFO L130 PetriNetUnfolder]: 15/153 cut-off events. [2022-12-06 05:46:05,850 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:46:05,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 153 events. 15/153 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 203 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-12-06 05:46:05,858 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 153 transitions, 318 flow [2022-12-06 05:46:05,858 INFO L188 LiptonReduction]: Number of co-enabled transitions 2692 [2022-12-06 05:46:11,203 INFO L203 LiptonReduction]: Total number of compositions: 135 [2022-12-06 05:46:11,216 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:46:11,221 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;@28a9338b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:46:11,221 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 05:46:11,225 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-06 05:46:11,226 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:46:11,226 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:11,226 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:11,227 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:11,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:11,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1841114468, now seen corresponding path program 1 times [2022-12-06 05:46:11,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:11,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019120000] [2022-12-06 05:46:11,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:11,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:11,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:11,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:11,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:11,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019120000] [2022-12-06 05:46:11,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019120000] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:46:11,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:46:11,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:46:11,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805812027] [2022-12-06 05:46:11,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:46:11,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:46:11,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:11,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:46:11,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:46:11,533 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-06 05:46:11,534 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-06 05:46:11,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:11,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-06 05:46:11,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:11,592 INFO L130 PetriNetUnfolder]: 49/84 cut-off events. [2022-12-06 05:46:11,592 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-06 05:46:11,593 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 198 event pairs, 19 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 129. Up to 81 conditions per place. [2022-12-06 05:46:11,594 INFO L137 encePairwiseOnDemand]: 14/17 looper letters, 14 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2022-12-06 05:46:11,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 18 transitions, 80 flow [2022-12-06 05:46:11,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:46:11,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:46:11,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-06 05:46:11,604 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2022-12-06 05:46:11,605 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 3 states and 23 transitions. [2022-12-06 05:46:11,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 18 transitions, 80 flow [2022-12-06 05:46:11,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 18 transitions, 72 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 05:46:11,609 INFO L231 Difference]: Finished difference. Result has 20 places, 18 transitions, 50 flow [2022-12-06 05:46:11,611 INFO L276 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-06 05:46:11,613 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2022-12-06 05:46:11,613 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:11,614 INFO L89 Accepts]: Start accepts. Operand has 20 places, 18 transitions, 50 flow [2022-12-06 05:46:11,616 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:11,616 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:11,616 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-06 05:46:11,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 18 transitions, 50 flow [2022-12-06 05:46:11,621 INFO L130 PetriNetUnfolder]: 3/18 cut-off events. [2022-12-06 05:46:11,621 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:46:11,622 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-06 05:46:11,622 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-06 05:46:11,622 INFO L188 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-06 05:46:12,428 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:46:12,430 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 817 [2022-12-06 05:46:12,430 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 17 transitions, 46 flow [2022-12-06 05:46:12,430 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-06 05:46:12,431 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:12,431 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:12,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:46:12,431 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:12,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:12,432 INFO L85 PathProgramCache]: Analyzing trace with hash -79956225, now seen corresponding path program 1 times [2022-12-06 05:46:12,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:12,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721855864] [2022-12-06 05:46:12,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:12,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:12,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:12,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:12,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721855864] [2022-12-06 05:46:12,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721855864] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:46:12,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:46:12,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:46:12,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438744808] [2022-12-06 05:46:12,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:46:12,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:46:12,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:12,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:46:12,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:46:12,652 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 05:46:12,652 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 17 transitions, 46 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:12,652 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:12,652 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 05:46:12,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:12,764 INFO L130 PetriNetUnfolder]: 72/134 cut-off events. [2022-12-06 05:46:12,765 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:46:12,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 134 events. 72/134 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 366 event pairs, 24 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 274. Up to 76 conditions per place. [2022-12-06 05:46:12,770 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 34 selfloop transitions, 5 changer transitions 0/39 dead transitions. [2022-12-06 05:46:12,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 39 transitions, 173 flow [2022-12-06 05:46:12,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:46:12,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:46:12,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-12-06 05:46:12,772 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2022-12-06 05:46:12,772 INFO L175 Difference]: Start difference. First operand has 19 places, 17 transitions, 46 flow. Second operand 5 states and 40 transitions. [2022-12-06 05:46:12,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 39 transitions, 173 flow [2022-12-06 05:46:12,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 39 transitions, 165 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 05:46:12,773 INFO L231 Difference]: Finished difference. Result has 24 places, 21 transitions, 74 flow [2022-12-06 05:46:12,774 INFO L276 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=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=74, PETRI_PLACES=24, PETRI_TRANSITIONS=21} [2022-12-06 05:46:12,774 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 3 predicate places. [2022-12-06 05:46:12,775 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:12,775 INFO L89 Accepts]: Start accepts. Operand has 24 places, 21 transitions, 74 flow [2022-12-06 05:46:12,776 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:12,776 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:12,777 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 21 transitions, 74 flow [2022-12-06 05:46:12,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 21 transitions, 74 flow [2022-12-06 05:46:12,782 INFO L130 PetriNetUnfolder]: 4/28 cut-off events. [2022-12-06 05:46:12,783 INFO L131 PetriNetUnfolder]: For 3/4 co-relation queries the response was YES. [2022-12-06 05:46:12,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 28 events. 4/28 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 45 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 32. Up to 6 conditions per place. [2022-12-06 05:46:12,784 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 21 transitions, 74 flow [2022-12-06 05:46:12,784 INFO L188 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-06 05:46:12,985 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:46:12,986 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 211 [2022-12-06 05:46:12,987 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 19 transitions, 65 flow [2022-12-06 05:46:12,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:12,987 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:12,987 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:12,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:46:12,987 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:12,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:12,988 INFO L85 PathProgramCache]: Analyzing trace with hash 2027654860, now seen corresponding path program 1 times [2022-12-06 05:46:12,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:12,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741208106] [2022-12-06 05:46:12,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:12,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:13,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:13,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:13,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741208106] [2022-12-06 05:46:13,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741208106] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:46:13,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:46:13,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:46:13,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786093703] [2022-12-06 05:46:13,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:46:13,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:46:13,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:13,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:46:13,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:46:13,197 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 05:46:13,197 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 19 transitions, 65 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:13,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:13,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 05:46:13,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:13,304 INFO L130 PetriNetUnfolder]: 86/156 cut-off events. [2022-12-06 05:46:13,305 INFO L131 PetriNetUnfolder]: For 135/135 co-relation queries the response was YES. [2022-12-06 05:46:13,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 451 conditions, 156 events. 86/156 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 433 event pairs, 15 based on Foata normal form. 2/123 useless extension candidates. Maximal degree in co-relation 169. Up to 80 conditions per place. [2022-12-06 05:46:13,306 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 36 selfloop transitions, 8 changer transitions 0/44 dead transitions. [2022-12-06 05:46:13,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 44 transitions, 239 flow [2022-12-06 05:46:13,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:46:13,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:46:13,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-12-06 05:46:13,310 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2022-12-06 05:46:13,310 INFO L175 Difference]: Start difference. First operand has 22 places, 19 transitions, 65 flow. Second operand 5 states and 45 transitions. [2022-12-06 05:46:13,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 44 transitions, 239 flow [2022-12-06 05:46:13,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 44 transitions, 195 flow, removed 21 selfloop flow, removed 3 redundant places. [2022-12-06 05:46:13,314 INFO L231 Difference]: Finished difference. Result has 26 places, 26 transitions, 105 flow [2022-12-06 05:46:13,314 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=48, 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=105, PETRI_PLACES=26, PETRI_TRANSITIONS=26} [2022-12-06 05:46:13,315 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2022-12-06 05:46:13,315 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:13,316 INFO L89 Accepts]: Start accepts. Operand has 26 places, 26 transitions, 105 flow [2022-12-06 05:46:13,316 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:13,317 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:13,317 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 26 transitions, 105 flow [2022-12-06 05:46:13,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 26 transitions, 105 flow [2022-12-06 05:46:13,325 INFO L130 PetriNetUnfolder]: 11/46 cut-off events. [2022-12-06 05:46:13,325 INFO L131 PetriNetUnfolder]: For 14/15 co-relation queries the response was YES. [2022-12-06 05:46:13,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 46 events. 11/46 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 116 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 61. Up to 11 conditions per place. [2022-12-06 05:46:13,326 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 26 transitions, 105 flow [2022-12-06 05:46:13,326 INFO L188 LiptonReduction]: Number of co-enabled transitions 108 [2022-12-06 05:46:13,394 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [407] $Ultimate##0-->L59-2: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1] and [639] $Ultimate##0-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_33| (ite (and (<= 0 v_~x1~0_81) (< v_~x1~0_81 v_~size~0_101)) 1 0)) (= |v_thread1Thread1of1ForFork1_~i~0#1_51| 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_33| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_41|) (= v_~x1~0_80 (select (select |v_#memory_int_129| v_~f~0.base_95) (+ v_~f~0.offset_95 (* v_~x1~0_81 4)))) (< (mod (+ 4294967295 |v_thread1Thread1of1ForFork1_~i~0#1_51|) 4294967296) (mod v_~n~0_79 4294967296)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_41| 0))) InVars {~size~0=v_~size~0_101, ~f~0.base=v_~f~0.base_95, #memory_int=|v_#memory_int_129|, ~n~0=v_~n~0_79, ~x1~0=v_~x1~0_81, ~f~0.offset=v_~f~0.offset_95} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_31|, ~size~0=v_~size~0_101, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_51|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_33|, ~f~0.base=v_~f~0.base_95, #memory_int=|v_#memory_int_129|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_35|, ~n~0=v_~n~0_79, ~x1~0=v_~x1~0_80, ~f~0.offset=v_~f~0.offset_95, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_41|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, ~x1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:46:13,441 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:46:13,442 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-06 05:46:13,442 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 26 transitions, 113 flow [2022-12-06 05:46:13,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:13,442 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:13,442 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:13,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:46:13,443 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:13,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:13,443 INFO L85 PathProgramCache]: Analyzing trace with hash 319613206, now seen corresponding path program 1 times [2022-12-06 05:46:13,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:13,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354103063] [2022-12-06 05:46:13,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:13,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:13,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:13,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:13,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:13,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354103063] [2022-12-06 05:46:13,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354103063] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:46:13,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:46:13,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:46:13,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132836038] [2022-12-06 05:46:13,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:46:13,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:46:13,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:13,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:46:13,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:46:13,554 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 05:46:13,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 26 transitions, 113 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:13,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:13,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 05:46:13,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:13,645 INFO L130 PetriNetUnfolder]: 85/159 cut-off events. [2022-12-06 05:46:13,646 INFO L131 PetriNetUnfolder]: For 161/161 co-relation queries the response was YES. [2022-12-06 05:46:13,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 159 events. 85/159 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 474 event pairs, 22 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 221. Up to 106 conditions per place. [2022-12-06 05:46:13,647 INFO L137 encePairwiseOnDemand]: 17/21 looper letters, 37 selfloop transitions, 3 changer transitions 0/40 dead transitions. [2022-12-06 05:46:13,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 40 transitions, 241 flow [2022-12-06 05:46:13,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:46:13,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:46:13,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-12-06 05:46:13,649 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 05:46:13,649 INFO L175 Difference]: Start difference. First operand has 26 places, 26 transitions, 113 flow. Second operand 4 states and 35 transitions. [2022-12-06 05:46:13,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 40 transitions, 241 flow [2022-12-06 05:46:13,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 40 transitions, 235 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-12-06 05:46:13,651 INFO L231 Difference]: Finished difference. Result has 30 places, 27 transitions, 125 flow [2022-12-06 05:46:13,652 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=125, PETRI_PLACES=30, PETRI_TRANSITIONS=27} [2022-12-06 05:46:13,652 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 9 predicate places. [2022-12-06 05:46:13,652 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:13,652 INFO L89 Accepts]: Start accepts. Operand has 30 places, 27 transitions, 125 flow [2022-12-06 05:46:13,653 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:13,653 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:13,653 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 27 transitions, 125 flow [2022-12-06 05:46:13,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 27 transitions, 125 flow [2022-12-06 05:46:13,659 INFO L130 PetriNetUnfolder]: 10/50 cut-off events. [2022-12-06 05:46:13,660 INFO L131 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2022-12-06 05:46:13,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 50 events. 10/50 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 149 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 74. Up to 7 conditions per place. [2022-12-06 05:46:13,660 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 27 transitions, 125 flow [2022-12-06 05:46:13,660 INFO L188 LiptonReduction]: Number of co-enabled transitions 108 [2022-12-06 05:46:13,889 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:46:13,890 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 238 [2022-12-06 05:46:13,890 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 26 transitions, 121 flow [2022-12-06 05:46:13,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:13,891 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:13,891 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:13,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 05:46:13,891 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:13,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:13,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1637384971, now seen corresponding path program 1 times [2022-12-06 05:46:13,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:13,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327876740] [2022-12-06 05:46:13,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:13,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:14,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:14,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:14,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327876740] [2022-12-06 05:46:14,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327876740] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:46:14,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:46:14,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:46:14,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459894425] [2022-12-06 05:46:14,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:46:14,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:46:14,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:14,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:46:14,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:46:14,042 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 05:46:14,042 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 121 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:14,042 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:14,043 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 05:46:14,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:14,178 INFO L130 PetriNetUnfolder]: 126/230 cut-off events. [2022-12-06 05:46:14,178 INFO L131 PetriNetUnfolder]: For 351/351 co-relation queries the response was YES. [2022-12-06 05:46:14,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 786 conditions, 230 events. 126/230 cut-off events. For 351/351 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 751 event pairs, 37 based on Foata normal form. 2/185 useless extension candidates. Maximal degree in co-relation 534. Up to 157 conditions per place. [2022-12-06 05:46:14,180 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 44 selfloop transitions, 6 changer transitions 0/50 dead transitions. [2022-12-06 05:46:14,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 50 transitions, 321 flow [2022-12-06 05:46:14,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:46:14,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:46:14,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-12-06 05:46:14,181 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4380952380952381 [2022-12-06 05:46:14,181 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 121 flow. Second operand 5 states and 46 transitions. [2022-12-06 05:46:14,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 50 transitions, 321 flow [2022-12-06 05:46:14,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 50 transitions, 293 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-06 05:46:14,184 INFO L231 Difference]: Finished difference. Result has 33 places, 31 transitions, 170 flow [2022-12-06 05:46:14,184 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=170, PETRI_PLACES=33, PETRI_TRANSITIONS=31} [2022-12-06 05:46:14,185 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 12 predicate places. [2022-12-06 05:46:14,185 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:14,185 INFO L89 Accepts]: Start accepts. Operand has 33 places, 31 transitions, 170 flow [2022-12-06 05:46:14,186 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:14,186 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:14,186 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 31 transitions, 170 flow [2022-12-06 05:46:14,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 31 transitions, 170 flow [2022-12-06 05:46:14,194 INFO L130 PetriNetUnfolder]: 16/67 cut-off events. [2022-12-06 05:46:14,194 INFO L131 PetriNetUnfolder]: For 74/77 co-relation queries the response was YES. [2022-12-06 05:46:14,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 67 events. 16/67 cut-off events. For 74/77 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 239 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 129. Up to 17 conditions per place. [2022-12-06 05:46:14,195 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 31 transitions, 170 flow [2022-12-06 05:46:14,195 INFO L188 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-06 05:46:14,196 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [640] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_131| v_~f~0.base_97))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_97 (* v_~x2~0_141 4))))) (and (= (select .cse0 (+ v_~f~0.offset_97 (* .cse1 4))) v_~x2~0_140) (= 2 |v_thread2Thread1of1ForFork0_~i~1#1_127|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_99| 0)) (not (= (ite (and (<= 0 v_~x2~0_141) (< v_~x2~0_141 v_~size~0_103)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_99| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_73|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_103)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_73|) (< (mod (+ |v_thread2Thread1of1ForFork0_~i~1#1_127| 4294967294) 4294967296) (mod (+ v_~n~0_81 4294967295) 4294967296))))) InVars {~x2~0=v_~x2~0_141, ~size~0=v_~size~0_103, ~f~0.base=v_~f~0.base_97, #memory_int=|v_#memory_int_131|, ~n~0=v_~n~0_81, ~f~0.offset=v_~f~0.offset_97} OutVars{thread2Thread1of1ForFork0_#t~mem3#1=|v_thread2Thread1of1ForFork0_#t~mem3#1_31|, ~x2~0=v_~x2~0_140, ~size~0=v_~size~0_103, ~f~0.base=v_~f~0.base_97, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_73|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_127|, ~f~0.offset=v_~f~0.offset_97, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_99|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_43|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_31|, ~n~0=v_~n~0_81, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_31|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem3#1, ~x2~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1] and [639] $Ultimate##0-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_33| (ite (and (<= 0 v_~x1~0_81) (< v_~x1~0_81 v_~size~0_101)) 1 0)) (= |v_thread1Thread1of1ForFork1_~i~0#1_51| 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_33| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_41|) (= v_~x1~0_80 (select (select |v_#memory_int_129| v_~f~0.base_95) (+ v_~f~0.offset_95 (* v_~x1~0_81 4)))) (< (mod (+ 4294967295 |v_thread1Thread1of1ForFork1_~i~0#1_51|) 4294967296) (mod v_~n~0_79 4294967296)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_41| 0))) InVars {~size~0=v_~size~0_101, ~f~0.base=v_~f~0.base_95, #memory_int=|v_#memory_int_129|, ~n~0=v_~n~0_79, ~x1~0=v_~x1~0_81, ~f~0.offset=v_~f~0.offset_95} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_31|, ~size~0=v_~size~0_101, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_51|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_33|, ~f~0.base=v_~f~0.base_95, #memory_int=|v_#memory_int_129|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_35|, ~n~0=v_~n~0_79, ~x1~0=v_~x1~0_80, ~f~0.offset=v_~f~0.offset_95, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_41|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, ~x1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:46:14,552 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:46:14,553 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 368 [2022-12-06 05:46:14,553 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 31 transitions, 180 flow [2022-12-06 05:46:14,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:14,554 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:14,554 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:14,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 05:46:14,554 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:14,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:14,554 INFO L85 PathProgramCache]: Analyzing trace with hash 2138477380, now seen corresponding path program 2 times [2022-12-06 05:46:14,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:14,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864715138] [2022-12-06 05:46:14,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:14,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:14,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:14,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:14,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:14,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864715138] [2022-12-06 05:46:14,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864715138] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:46:14,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:46:14,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:46:14,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408510507] [2022-12-06 05:46:14,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:46:14,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:46:14,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:14,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:46:14,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:46:14,662 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 05:46:14,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 31 transitions, 180 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:14,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:14,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 05:46:14,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:14,767 INFO L130 PetriNetUnfolder]: 119/217 cut-off events. [2022-12-06 05:46:14,767 INFO L131 PetriNetUnfolder]: For 469/469 co-relation queries the response was YES. [2022-12-06 05:46:14,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 806 conditions, 217 events. 119/217 cut-off events. For 469/469 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 729 event pairs, 42 based on Foata normal form. 4/180 useless extension candidates. Maximal degree in co-relation 411. Up to 194 conditions per place. [2022-12-06 05:46:14,769 INFO L137 encePairwiseOnDemand]: 18/23 looper letters, 30 selfloop transitions, 6 changer transitions 4/40 dead transitions. [2022-12-06 05:46:14,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 40 transitions, 286 flow [2022-12-06 05:46:14,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:46:14,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:46:14,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-12-06 05:46:14,771 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3804347826086957 [2022-12-06 05:46:14,771 INFO L175 Difference]: Start difference. First operand has 33 places, 31 transitions, 180 flow. Second operand 4 states and 35 transitions. [2022-12-06 05:46:14,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 40 transitions, 286 flow [2022-12-06 05:46:14,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 40 transitions, 262 flow, removed 11 selfloop flow, removed 1 redundant places. [2022-12-06 05:46:14,778 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 176 flow [2022-12-06 05:46:14,783 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2022-12-06 05:46:14,785 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 15 predicate places. [2022-12-06 05:46:14,786 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:14,786 INFO L89 Accepts]: Start accepts. Operand has 36 places, 31 transitions, 176 flow [2022-12-06 05:46:14,787 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:14,787 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:14,787 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 31 transitions, 176 flow [2022-12-06 05:46:14,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 31 transitions, 176 flow [2022-12-06 05:46:14,799 INFO L130 PetriNetUnfolder]: 16/65 cut-off events. [2022-12-06 05:46:14,799 INFO L131 PetriNetUnfolder]: For 97/104 co-relation queries the response was YES. [2022-12-06 05:46:14,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 65 events. 16/65 cut-off events. For 97/104 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 232 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 121. Up to 15 conditions per place. [2022-12-06 05:46:14,800 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 31 transitions, 176 flow [2022-12-06 05:46:14,800 INFO L188 LiptonReduction]: Number of co-enabled transitions 124 [2022-12-06 05:46:14,948 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:46:14,949 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 05:46:14,949 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 30 transitions, 170 flow [2022-12-06 05:46:14,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:14,949 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:14,950 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:14,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:46:14,950 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:14,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:14,950 INFO L85 PathProgramCache]: Analyzing trace with hash -496507661, now seen corresponding path program 1 times [2022-12-06 05:46:14,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:14,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172182917] [2022-12-06 05:46:14,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:14,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:15,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:15,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:15,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172182917] [2022-12-06 05:46:15,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172182917] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:46:15,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:46:15,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:46:15,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729866190] [2022-12-06 05:46:15,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:46:15,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:46:15,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:15,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:46:15,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:46:15,098 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 05:46:15,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:15,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:15,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 05:46:15,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:15,200 INFO L130 PetriNetUnfolder]: 148/256 cut-off events. [2022-12-06 05:46:15,200 INFO L131 PetriNetUnfolder]: For 629/629 co-relation queries the response was YES. [2022-12-06 05:46:15,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 993 conditions, 256 events. 148/256 cut-off events. For 629/629 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 877 event pairs, 44 based on Foata normal form. 0/205 useless extension candidates. Maximal degree in co-relation 727. Up to 232 conditions per place. [2022-12-06 05:46:15,202 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 37 selfloop transitions, 6 changer transitions 0/43 dead transitions. [2022-12-06 05:46:15,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 43 transitions, 321 flow [2022-12-06 05:46:15,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:46:15,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:46:15,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-12-06 05:46:15,203 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2022-12-06 05:46:15,203 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 170 flow. Second operand 4 states and 38 transitions. [2022-12-06 05:46:15,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 43 transitions, 321 flow [2022-12-06 05:46:15,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 43 transitions, 299 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:46:15,207 INFO L231 Difference]: Finished difference. Result has 36 places, 34 transitions, 215 flow [2022-12-06 05:46:15,207 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=215, PETRI_PLACES=36, PETRI_TRANSITIONS=34} [2022-12-06 05:46:15,207 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 15 predicate places. [2022-12-06 05:46:15,207 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:15,208 INFO L89 Accepts]: Start accepts. Operand has 36 places, 34 transitions, 215 flow [2022-12-06 05:46:15,208 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:15,208 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:15,208 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 34 transitions, 215 flow [2022-12-06 05:46:15,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 34 transitions, 215 flow [2022-12-06 05:46:15,219 INFO L130 PetriNetUnfolder]: 24/82 cut-off events. [2022-12-06 05:46:15,219 INFO L131 PetriNetUnfolder]: For 166/176 co-relation queries the response was YES. [2022-12-06 05:46:15,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 82 events. 24/82 cut-off events. For 166/176 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 295 event pairs, 0 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 191. Up to 25 conditions per place. [2022-12-06 05:46:15,220 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 34 transitions, 215 flow [2022-12-06 05:46:15,220 INFO L188 LiptonReduction]: Number of co-enabled transitions 148 [2022-12-06 05:46:15,229 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_~i~0#1_49| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_11| 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_11| 0) (not (< (mod |v_thread1Thread1of1ForFork1_~i~0#1_49| 4294967296) (mod v_~n~0_77 4294967296)))) InVars {~n~0=v_~n~0_77} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_49|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_11|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_11|, ~n~0=v_~n~0_77} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base] and [635] L59-2-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_121| v_~f~0.base_89))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_89 (* v_~x2~0_131 4))))) (and (= |v_thread2Thread1of1ForFork0_~i~1#1_119| (+ 2 |v_thread2Thread1of1ForFork0_~i~1#1_120|)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_120| 4294967296) (mod (+ v_~n~0_71 4294967295) 4294967296)) (= (ite (and (< .cse0 v_~size~0_95) (<= 0 .cse0)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_67|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_93| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_67|) (= v_~x2~0_130 (select .cse1 (+ v_~f~0.offset_89 (* .cse0 4)))) (not (= (ite (and (< v_~x2~0_131 v_~size~0_95) (<= 0 v_~x2~0_131)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_93| 0))))) InVars {~x2~0=v_~x2~0_131, ~size~0=v_~size~0_95, ~f~0.base=v_~f~0.base_89, #memory_int=|v_#memory_int_121|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_120|, ~n~0=v_~n~0_71, ~f~0.offset=v_~f~0.offset_89} OutVars{thread2Thread1of1ForFork0_#t~mem3#1=|v_thread2Thread1of1ForFork0_#t~mem3#1_27|, ~x2~0=v_~x2~0_130, ~size~0=v_~size~0_95, ~f~0.base=v_~f~0.base_89, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_67|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_119|, ~f~0.offset=v_~f~0.offset_89, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_93|, #memory_int=|v_#memory_int_121|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_39|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_27|, ~n~0=v_~n~0_71, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem3#1, ~x2~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1] [2022-12-06 05:46:15,344 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:46:15,345 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-06 05:46:15,345 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 33 transitions, 213 flow [2022-12-06 05:46:15,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:15,346 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:15,346 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:15,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 05:46:15,346 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:15,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:15,347 INFO L85 PathProgramCache]: Analyzing trace with hash -607330181, now seen corresponding path program 2 times [2022-12-06 05:46:15,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:15,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662180216] [2022-12-06 05:46:15,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:15,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:15,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:15,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:15,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662180216] [2022-12-06 05:46:15,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662180216] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:46:15,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:46:15,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:46:15,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412946069] [2022-12-06 05:46:15,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:46:15,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:46:15,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:15,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:46:15,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:46:15,433 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 05:46:15,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 213 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:15,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:15,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 05:46:15,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:15,605 INFO L130 PetriNetUnfolder]: 161/287 cut-off events. [2022-12-06 05:46:15,605 INFO L131 PetriNetUnfolder]: For 830/830 co-relation queries the response was YES. [2022-12-06 05:46:15,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1146 conditions, 287 events. 161/287 cut-off events. For 830/830 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1002 event pairs, 50 based on Foata normal form. 2/254 useless extension candidates. Maximal degree in co-relation 875. Up to 212 conditions per place. [2022-12-06 05:46:15,608 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 46 selfloop transitions, 8 changer transitions 0/54 dead transitions. [2022-12-06 05:46:15,608 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 54 transitions, 413 flow [2022-12-06 05:46:15,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:46:15,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:46:15,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-12-06 05:46:15,609 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.392 [2022-12-06 05:46:15,609 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 213 flow. Second operand 5 states and 49 transitions. [2022-12-06 05:46:15,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 54 transitions, 413 flow [2022-12-06 05:46:15,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 54 transitions, 377 flow, removed 18 selfloop flow, removed 1 redundant places. [2022-12-06 05:46:15,612 INFO L231 Difference]: Finished difference. Result has 40 places, 36 transitions, 237 flow [2022-12-06 05:46:15,612 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=237, PETRI_PLACES=40, PETRI_TRANSITIONS=36} [2022-12-06 05:46:15,613 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 19 predicate places. [2022-12-06 05:46:15,613 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:15,613 INFO L89 Accepts]: Start accepts. Operand has 40 places, 36 transitions, 237 flow [2022-12-06 05:46:15,614 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:15,614 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:15,614 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 36 transitions, 237 flow [2022-12-06 05:46:15,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 36 transitions, 237 flow [2022-12-06 05:46:15,624 INFO L130 PetriNetUnfolder]: 22/82 cut-off events. [2022-12-06 05:46:15,624 INFO L131 PetriNetUnfolder]: For 214/226 co-relation queries the response was YES. [2022-12-06 05:46:15,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 82 events. 22/82 cut-off events. For 214/226 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 308 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 201. Up to 28 conditions per place. [2022-12-06 05:46:15,625 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 36 transitions, 237 flow [2022-12-06 05:46:15,625 INFO L188 LiptonReduction]: Number of co-enabled transitions 156 [2022-12-06 05:46:15,626 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:46:15,626 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 05:46:15,627 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 36 transitions, 237 flow [2022-12-06 05:46:15,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:15,627 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:15,627 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:15,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 05:46:15,627 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:15,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:15,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1526562451, now seen corresponding path program 2 times [2022-12-06 05:46:15,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:15,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990962867] [2022-12-06 05:46:15,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:15,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:15,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:15,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:15,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:15,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990962867] [2022-12-06 05:46:15,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990962867] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:46:15,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:46:15,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:46:15,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966261505] [2022-12-06 05:46:15,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:46:15,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:46:15,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:15,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:46:15,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:46:15,733 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 05:46:15,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 36 transitions, 237 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:15,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:15,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 05:46:15,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:15,851 INFO L130 PetriNetUnfolder]: 158/278 cut-off events. [2022-12-06 05:46:15,851 INFO L131 PetriNetUnfolder]: For 916/916 co-relation queries the response was YES. [2022-12-06 05:46:15,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1098 conditions, 278 events. 158/278 cut-off events. For 916/916 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 963 event pairs, 53 based on Foata normal form. 4/259 useless extension candidates. Maximal degree in co-relation 728. Up to 261 conditions per place. [2022-12-06 05:46:15,853 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 36 selfloop transitions, 5 changer transitions 4/45 dead transitions. [2022-12-06 05:46:15,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 45 transitions, 359 flow [2022-12-06 05:46:15,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:46:15,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:46:15,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-06 05:46:15,854 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37 [2022-12-06 05:46:15,855 INFO L175 Difference]: Start difference. First operand has 40 places, 36 transitions, 237 flow. Second operand 4 states and 37 transitions. [2022-12-06 05:46:15,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 45 transitions, 359 flow [2022-12-06 05:46:15,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 334 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-06 05:46:15,858 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 229 flow [2022-12-06 05:46:15,858 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=229, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2022-12-06 05:46:15,859 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 21 predicate places. [2022-12-06 05:46:15,859 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:15,859 INFO L89 Accepts]: Start accepts. Operand has 42 places, 36 transitions, 229 flow [2022-12-06 05:46:15,861 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:15,861 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:15,861 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 36 transitions, 229 flow [2022-12-06 05:46:15,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 36 transitions, 229 flow [2022-12-06 05:46:15,871 INFO L130 PetriNetUnfolder]: 23/80 cut-off events. [2022-12-06 05:46:15,872 INFO L131 PetriNetUnfolder]: For 239/253 co-relation queries the response was YES. [2022-12-06 05:46:15,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 80 events. 23/80 cut-off events. For 239/253 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 278 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 190. Up to 19 conditions per place. [2022-12-06 05:46:15,872 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 36 transitions, 229 flow [2022-12-06 05:46:15,873 INFO L188 LiptonReduction]: Number of co-enabled transitions 152 [2022-12-06 05:46:16,164 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:46:16,165 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 306 [2022-12-06 05:46:16,165 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 223 flow [2022-12-06 05:46:16,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:16,165 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:16,166 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:16,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 05:46:16,166 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:16,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:16,166 INFO L85 PathProgramCache]: Analyzing trace with hash 648684592, now seen corresponding path program 1 times [2022-12-06 05:46:16,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:16,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698187646] [2022-12-06 05:46:16,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:16,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:16,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:16,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:16,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:16,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698187646] [2022-12-06 05:46:16,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698187646] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:46:16,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:46:16,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:46:16,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581744410] [2022-12-06 05:46:16,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:46:16,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:46:16,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:16,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:46:16,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:46:16,302 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 05:46:16,302 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 223 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:16,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:16,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 05:46:16,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:16,409 INFO L130 PetriNetUnfolder]: 153/261 cut-off events. [2022-12-06 05:46:16,409 INFO L131 PetriNetUnfolder]: For 937/937 co-relation queries the response was YES. [2022-12-06 05:46:16,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1029 conditions, 261 events. 153/261 cut-off events. For 937/937 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 853 event pairs, 48 based on Foata normal form. 4/242 useless extension candidates. Maximal degree in co-relation 779. Up to 220 conditions per place. [2022-12-06 05:46:16,411 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 44 selfloop transitions, 4 changer transitions 0/48 dead transitions. [2022-12-06 05:46:16,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 48 transitions, 367 flow [2022-12-06 05:46:16,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:46:16,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:46:16,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-12-06 05:46:16,412 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39 [2022-12-06 05:46:16,412 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 223 flow. Second operand 4 states and 39 transitions. [2022-12-06 05:46:16,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 48 transitions, 367 flow [2022-12-06 05:46:16,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 48 transitions, 359 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 05:46:16,415 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 233 flow [2022-12-06 05:46:16,415 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=233, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2022-12-06 05:46:16,416 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 21 predicate places. [2022-12-06 05:46:16,416 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:16,416 INFO L89 Accepts]: Start accepts. Operand has 42 places, 36 transitions, 233 flow [2022-12-06 05:46:16,417 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:16,417 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:16,417 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 36 transitions, 233 flow [2022-12-06 05:46:16,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 36 transitions, 233 flow [2022-12-06 05:46:16,427 INFO L130 PetriNetUnfolder]: 24/80 cut-off events. [2022-12-06 05:46:16,427 INFO L131 PetriNetUnfolder]: For 263/278 co-relation queries the response was YES. [2022-12-06 05:46:16,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 80 events. 24/80 cut-off events. For 263/278 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 270 event pairs, 0 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 189. Up to 19 conditions per place. [2022-12-06 05:46:16,428 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 36 transitions, 233 flow [2022-12-06 05:46:16,428 INFO L188 LiptonReduction]: Number of co-enabled transitions 148 [2022-12-06 05:46:16,439 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [635] L59-2-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_121| v_~f~0.base_89))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_89 (* v_~x2~0_131 4))))) (and (= |v_thread2Thread1of1ForFork0_~i~1#1_119| (+ 2 |v_thread2Thread1of1ForFork0_~i~1#1_120|)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_120| 4294967296) (mod (+ v_~n~0_71 4294967295) 4294967296)) (= (ite (and (< .cse0 v_~size~0_95) (<= 0 .cse0)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_67|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_93| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_67|) (= v_~x2~0_130 (select .cse1 (+ v_~f~0.offset_89 (* .cse0 4)))) (not (= (ite (and (< v_~x2~0_131 v_~size~0_95) (<= 0 v_~x2~0_131)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_93| 0))))) InVars {~x2~0=v_~x2~0_131, ~size~0=v_~size~0_95, ~f~0.base=v_~f~0.base_89, #memory_int=|v_#memory_int_121|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_120|, ~n~0=v_~n~0_71, ~f~0.offset=v_~f~0.offset_89} OutVars{thread2Thread1of1ForFork0_#t~mem3#1=|v_thread2Thread1of1ForFork0_#t~mem3#1_27|, ~x2~0=v_~x2~0_130, ~size~0=v_~size~0_95, ~f~0.base=v_~f~0.base_89, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_67|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_119|, ~f~0.offset=v_~f~0.offset_89, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_93|, #memory_int=|v_#memory_int_121|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_39|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_27|, ~n~0=v_~n~0_71, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem3#1, ~x2~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1] and [643] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_135| v_~f~0.base_101))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_101 (* v_~x2~0_146 4))))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_101 (* .cse2 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_101 (* .cse3 4))))) (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_75|) (= v_~x2~0_144 (select .cse0 (+ v_~f~0.offset_101 (* .cse1 4)))) (< (mod (+ |v_thread2Thread1of1ForFork0_~i~1#1_133| 4294967294) 4294967296) (mod (+ v_~n~0_85 4294967295) 4294967296)) (not (= (ite (and (< .cse2 v_~size~0_107) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_146) (< v_~x2~0_146 v_~size~0_107)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~i~1#1_133| 4) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_101| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_75| (ite (and (< .cse1 v_~size~0_107) (<= 0 .cse1)) 1 0)) (not (= (ite (and (< .cse3 v_~size~0_107) (<= 0 .cse3)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_146, ~size~0=v_~size~0_107, ~f~0.base=v_~f~0.base_101, #memory_int=|v_#memory_int_135|, ~n~0=v_~n~0_85, ~f~0.offset=v_~f~0.offset_101} OutVars{thread2Thread1of1ForFork0_#t~mem3#1=|v_thread2Thread1of1ForFork0_#t~mem3#1_33|, ~x2~0=v_~x2~0_144, ~size~0=v_~size~0_107, ~f~0.base=v_~f~0.base_101, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_75|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_133|, ~f~0.offset=v_~f~0.offset_101, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_101|, #memory_int=|v_#memory_int_135|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_45|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_33|, ~n~0=v_~n~0_85, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem3#1, ~x2~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1] [2022-12-06 05:46:16,653 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [648] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_143| v_~f~0.base_109))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_109 (* v_~x2~0_165 4))))) (and (= (select .cse0 (+ v_~f~0.offset_109 (* .cse1 4))) v_~x2~0_164) (= (+ 2 |v_thread2Thread1of1ForFork0_~i~1#1_148|) |v_thread2Thread1of1ForFork0_~i~1#1_147|) (not (< (mod |v_thread1Thread1of1ForFork1_~i~0#1_59| 4294967296) (mod v_~n~0_93 4294967296))) (= |v_thread1Thread1of1ForFork1_#res#1.base_13| 0) (= |v_thread1Thread1of1ForFork1_~i~0#1_59| 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_13| 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_115| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_89|) (not (= (ite (and (< v_~x2~0_165 v_~size~0_115) (<= 0 v_~x2~0_165)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_148| 4294967296) (mod (+ v_~n~0_93 4294967295) 4294967296)) (= (ite (and (< .cse1 v_~size~0_115) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_89|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_115| 0))))) InVars {~x2~0=v_~x2~0_165, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_109, #memory_int=|v_#memory_int_143|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_148|, ~n~0=v_~n~0_93, ~f~0.offset=v_~f~0.offset_109} OutVars{thread2Thread1of1ForFork0_#t~mem3#1=|v_thread2Thread1of1ForFork0_#t~mem3#1_43|, ~x2~0=v_~x2~0_164, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_109, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_89|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_147|, ~f~0.offset=v_~f~0.offset_109, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_115|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_59|, #memory_int=|v_#memory_int_143|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_55|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_13|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_43|, ~n~0=v_~n~0_93, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_13|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem3#1, ~x2~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork0_#t~post6#1] and [643] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_135| v_~f~0.base_101))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_101 (* v_~x2~0_146 4))))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_101 (* .cse2 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_101 (* .cse3 4))))) (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_75|) (= v_~x2~0_144 (select .cse0 (+ v_~f~0.offset_101 (* .cse1 4)))) (< (mod (+ |v_thread2Thread1of1ForFork0_~i~1#1_133| 4294967294) 4294967296) (mod (+ v_~n~0_85 4294967295) 4294967296)) (not (= (ite (and (< .cse2 v_~size~0_107) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_146) (< v_~x2~0_146 v_~size~0_107)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~i~1#1_133| 4) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_101| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_75| (ite (and (< .cse1 v_~size~0_107) (<= 0 .cse1)) 1 0)) (not (= (ite (and (< .cse3 v_~size~0_107) (<= 0 .cse3)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_146, ~size~0=v_~size~0_107, ~f~0.base=v_~f~0.base_101, #memory_int=|v_#memory_int_135|, ~n~0=v_~n~0_85, ~f~0.offset=v_~f~0.offset_101} OutVars{thread2Thread1of1ForFork0_#t~mem3#1=|v_thread2Thread1of1ForFork0_#t~mem3#1_33|, ~x2~0=v_~x2~0_144, ~size~0=v_~size~0_107, ~f~0.base=v_~f~0.base_101, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_75|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_133|, ~f~0.offset=v_~f~0.offset_101, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_101|, #memory_int=|v_#memory_int_135|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_45|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_33|, ~n~0=v_~n~0_85, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem3#1, ~x2~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1] [2022-12-06 05:46:17,124 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:46:17,125 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 709 [2022-12-06 05:46:17,125 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 245 flow [2022-12-06 05:46:17,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:17,125 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:17,125 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:17,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 05:46:17,125 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:17,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:17,126 INFO L85 PathProgramCache]: Analyzing trace with hash -2129272408, now seen corresponding path program 1 times [2022-12-06 05:46:17,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:17,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882498942] [2022-12-06 05:46:17,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:17,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:17,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:17,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:17,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882498942] [2022-12-06 05:46:17,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882498942] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:46:17,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:46:17,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:46:17,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226617433] [2022-12-06 05:46:17,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:46:17,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:46:17,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:17,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:46:17,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:46:17,228 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-06 05:46:17,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 245 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:17,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:17,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-06 05:46:17,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:17,390 INFO L130 PetriNetUnfolder]: 165/299 cut-off events. [2022-12-06 05:46:17,391 INFO L131 PetriNetUnfolder]: For 1103/1103 co-relation queries the response was YES. [2022-12-06 05:46:17,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1148 conditions, 299 events. 165/299 cut-off events. For 1103/1103 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1109 event pairs, 57 based on Foata normal form. 0/274 useless extension candidates. Maximal degree in co-relation 897. Up to 267 conditions per place. [2022-12-06 05:46:17,393 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 44 selfloop transitions, 5 changer transitions 1/51 dead transitions. [2022-12-06 05:46:17,393 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 51 transitions, 391 flow [2022-12-06 05:46:17,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:46:17,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:46:17,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-12-06 05:46:17,394 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-06 05:46:17,395 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 245 flow. Second operand 5 states and 45 transitions. [2022-12-06 05:46:17,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 51 transitions, 391 flow [2022-12-06 05:46:17,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 51 transitions, 385 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 05:46:17,398 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 251 flow [2022-12-06 05:46:17,399 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=251, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2022-12-06 05:46:17,399 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 27 predicate places. [2022-12-06 05:46:17,399 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:17,399 INFO L89 Accepts]: Start accepts. Operand has 48 places, 37 transitions, 251 flow [2022-12-06 05:46:17,400 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:17,400 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:17,400 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 37 transitions, 251 flow [2022-12-06 05:46:17,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 37 transitions, 251 flow [2022-12-06 05:46:17,411 INFO L130 PetriNetUnfolder]: 21/87 cut-off events. [2022-12-06 05:46:17,411 INFO L131 PetriNetUnfolder]: For 288/303 co-relation queries the response was YES. [2022-12-06 05:46:17,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 87 events. 21/87 cut-off events. For 288/303 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 332 event pairs, 1 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 219. Up to 20 conditions per place. [2022-12-06 05:46:17,412 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 37 transitions, 251 flow [2022-12-06 05:46:17,412 INFO L188 LiptonReduction]: Number of co-enabled transitions 150 [2022-12-06 05:46:17,697 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [649] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse4 (select |v_#memory_int_145| v_~f~0.base_111))) (let ((.cse7 (select .cse4 (+ v_~f~0.offset_111 (* v_~x2~0_170 4))))) (let ((.cse0 (mod (+ v_~n~0_95 4294967295) 4294967296)) (.cse1 (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_117)) 1 0))) (and (<= .cse0 2) (< 0 .cse0) (not (= .cse1 0)) (not (= (ite (and (< v_~x2~0_170 v_~size~0_117) (<= 0 v_~x2~0_170)) 1 0) 0)) (let ((.cse2 (= |v_thread2Thread1of1ForFork0_#res#1.offset_23| 0)) (.cse3 (< 2 (mod v_~n~0_95 4294967296))) (.cse5 (select .cse4 (+ v_~f~0.offset_111 (* .cse7 4)))) (.cse6 (= |v_thread2Thread1of1ForFork0_#res#1.base_23| 0))) (or (and .cse2 (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_117| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_91|) .cse3 (= v_~x2~0_168 (select .cse4 (+ v_~f~0.offset_111 (* .cse5 4)))) (= 3 |v_thread2Thread1of1ForFork0_~i~1#1_151|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_117| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_91| (ite (and (< .cse5 v_~size~0_117) (<= 0 .cse5)) 1 0)) .cse6) (and .cse2 (= |v_thread2Thread1of1ForFork0_#t~post8#1_36| |v_thread2Thread1of1ForFork0_#t~post8#1_35|) (not .cse3) (= v_~x2~0_168 .cse5) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_117| .cse1) (= |v_thread2Thread1of1ForFork0_#t~mem7#1_39| |v_thread2Thread1of1ForFork0_#t~mem7#1_40|) (= 2 |v_thread2Thread1of1ForFork0_~i~1#1_151|) (= .cse1 |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_91|) .cse6))))))) InVars {~x2~0=v_~x2~0_170, ~size~0=v_~size~0_117, ~f~0.base=v_~f~0.base_111, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_40|, ~n~0=v_~n~0_95, ~f~0.offset=v_~f~0.offset_111, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_36|} OutVars{thread2Thread1of1ForFork0_#t~mem3#1=|v_thread2Thread1of1ForFork0_#t~mem3#1_45|, ~x2~0=v_~x2~0_168, ~size~0=v_~size~0_117, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_23|, ~f~0.base=v_~f~0.base_111, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_91|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_151|, ~f~0.offset=v_~f~0.offset_111, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_117|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_23|, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_57|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_39|, ~n~0=v_~n~0_95, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_45|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_45|, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_35|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem3#1, ~x2~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread2Thread1of1ForFork0_#t~post8#1] and [639] $Ultimate##0-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_33| (ite (and (<= 0 v_~x1~0_81) (< v_~x1~0_81 v_~size~0_101)) 1 0)) (= |v_thread1Thread1of1ForFork1_~i~0#1_51| 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_33| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_41|) (= v_~x1~0_80 (select (select |v_#memory_int_129| v_~f~0.base_95) (+ v_~f~0.offset_95 (* v_~x1~0_81 4)))) (< (mod (+ 4294967295 |v_thread1Thread1of1ForFork1_~i~0#1_51|) 4294967296) (mod v_~n~0_79 4294967296)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_41| 0))) InVars {~size~0=v_~size~0_101, ~f~0.base=v_~f~0.base_95, #memory_int=|v_#memory_int_129|, ~n~0=v_~n~0_79, ~x1~0=v_~x1~0_81, ~f~0.offset=v_~f~0.offset_95} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_31|, ~size~0=v_~size~0_101, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_51|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_33|, ~f~0.base=v_~f~0.base_95, #memory_int=|v_#memory_int_129|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_35|, ~n~0=v_~n~0_79, ~x1~0=v_~x1~0_80, ~f~0.offset=v_~f~0.offset_95, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_41|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, ~x1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:46:18,876 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_139| v_~f~0.base_105))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_105 (* v_~x2~0_156 4))))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_105 (* .cse2 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_105 (* .cse3 4))))) (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_107| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_81|) (= v_~x2~0_154 (select .cse0 (+ v_~f~0.offset_105 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_156 v_~size~0_111) (<= 0 v_~x2~0_156)) 1 0) 0)) (< 2 (mod (+ v_~n~0_89 4294967295) 4294967296)) (not (= (ite (and (< .cse2 v_~size~0_111) (<= 0 .cse2)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_81| (ite (and (< .cse1 v_~size~0_111) (<= 0 .cse1)) 1 0)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_107| 0)) (not (= (ite (and (< .cse3 v_~size~0_111) (<= 0 .cse3)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~i~1#1_139| 4)))))) InVars {~x2~0=v_~x2~0_156, ~size~0=v_~size~0_111, ~f~0.base=v_~f~0.base_105, #memory_int=|v_#memory_int_139|, ~n~0=v_~n~0_89, ~f~0.offset=v_~f~0.offset_105} OutVars{thread2Thread1of1ForFork0_#t~mem3#1=|v_thread2Thread1of1ForFork0_#t~mem3#1_39|, ~x2~0=v_~x2~0_154, ~size~0=v_~size~0_111, ~f~0.base=v_~f~0.base_105, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_81|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_139|, ~f~0.offset=v_~f~0.offset_105, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_107|, #memory_int=|v_#memory_int_139|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_51|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_39|, ~n~0=v_~n~0_89, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_39|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem3#1, ~x2~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1] and [648] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_143| v_~f~0.base_109))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_109 (* v_~x2~0_165 4))))) (and (= (select .cse0 (+ v_~f~0.offset_109 (* .cse1 4))) v_~x2~0_164) (= (+ 2 |v_thread2Thread1of1ForFork0_~i~1#1_148|) |v_thread2Thread1of1ForFork0_~i~1#1_147|) (not (< (mod |v_thread1Thread1of1ForFork1_~i~0#1_59| 4294967296) (mod v_~n~0_93 4294967296))) (= |v_thread1Thread1of1ForFork1_#res#1.base_13| 0) (= |v_thread1Thread1of1ForFork1_~i~0#1_59| 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_13| 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_115| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_89|) (not (= (ite (and (< v_~x2~0_165 v_~size~0_115) (<= 0 v_~x2~0_165)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_148| 4294967296) (mod (+ v_~n~0_93 4294967295) 4294967296)) (= (ite (and (< .cse1 v_~size~0_115) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_89|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_115| 0))))) InVars {~x2~0=v_~x2~0_165, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_109, #memory_int=|v_#memory_int_143|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_148|, ~n~0=v_~n~0_93, ~f~0.offset=v_~f~0.offset_109} OutVars{thread2Thread1of1ForFork0_#t~mem3#1=|v_thread2Thread1of1ForFork0_#t~mem3#1_43|, ~x2~0=v_~x2~0_164, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_109, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_89|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_147|, ~f~0.offset=v_~f~0.offset_109, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_115|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_59|, #memory_int=|v_#memory_int_143|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_55|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_13|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_43|, ~n~0=v_~n~0_93, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_13|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem3#1, ~x2~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork0_#t~post6#1] [2022-12-06 05:46:19,261 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_139| v_~f~0.base_105))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_105 (* v_~x2~0_156 4))))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_105 (* .cse2 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_105 (* .cse3 4))))) (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_107| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_81|) (= v_~x2~0_154 (select .cse0 (+ v_~f~0.offset_105 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_156 v_~size~0_111) (<= 0 v_~x2~0_156)) 1 0) 0)) (< 2 (mod (+ v_~n~0_89 4294967295) 4294967296)) (not (= (ite (and (< .cse2 v_~size~0_111) (<= 0 .cse2)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_81| (ite (and (< .cse1 v_~size~0_111) (<= 0 .cse1)) 1 0)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_107| 0)) (not (= (ite (and (< .cse3 v_~size~0_111) (<= 0 .cse3)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~i~1#1_139| 4)))))) InVars {~x2~0=v_~x2~0_156, ~size~0=v_~size~0_111, ~f~0.base=v_~f~0.base_105, #memory_int=|v_#memory_int_139|, ~n~0=v_~n~0_89, ~f~0.offset=v_~f~0.offset_105} OutVars{thread2Thread1of1ForFork0_#t~mem3#1=|v_thread2Thread1of1ForFork0_#t~mem3#1_39|, ~x2~0=v_~x2~0_154, ~size~0=v_~size~0_111, ~f~0.base=v_~f~0.base_105, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_81|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_139|, ~f~0.offset=v_~f~0.offset_105, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_107|, #memory_int=|v_#memory_int_139|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_51|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_39|, ~n~0=v_~n~0_89, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_39|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem3#1, ~x2~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1] and [639] $Ultimate##0-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_33| (ite (and (<= 0 v_~x1~0_81) (< v_~x1~0_81 v_~size~0_101)) 1 0)) (= |v_thread1Thread1of1ForFork1_~i~0#1_51| 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_33| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_41|) (= v_~x1~0_80 (select (select |v_#memory_int_129| v_~f~0.base_95) (+ v_~f~0.offset_95 (* v_~x1~0_81 4)))) (< (mod (+ 4294967295 |v_thread1Thread1of1ForFork1_~i~0#1_51|) 4294967296) (mod v_~n~0_79 4294967296)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_41| 0))) InVars {~size~0=v_~size~0_101, ~f~0.base=v_~f~0.base_95, #memory_int=|v_#memory_int_129|, ~n~0=v_~n~0_79, ~x1~0=v_~x1~0_81, ~f~0.offset=v_~f~0.offset_95} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_31|, ~size~0=v_~size~0_101, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_51|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_33|, ~f~0.base=v_~f~0.base_95, #memory_int=|v_#memory_int_129|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_35|, ~n~0=v_~n~0_79, ~x1~0=v_~x1~0_80, ~f~0.offset=v_~f~0.offset_95, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_41|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, ~x1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:46:20,001 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [655] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_151| v_~f~0.base_117))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_117 (* v_~x2~0_187 4)))) (.cse1 (select .cse0 (+ v_~f~0.offset_117 (* v_~x1~0_94 4))))) (and (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_129| 0)) (= 2 |v_thread1Thread1of1ForFork1_~i~0#1_63|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_129| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_103|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_47|) (= (select .cse0 (+ v_~f~0.offset_117 (* .cse1 4))) v_~x1~0_92) (= 2 |v_thread2Thread1of1ForFork0_~i~1#1_167|) (< (mod (+ 4294967294 |v_thread1Thread1of1ForFork1_~i~0#1_63|) 4294967296) (mod v_~n~0_101 4294967296)) (not (= (ite (and (<= 0 v_~x1~0_94) (< v_~x1~0_94 v_~size~0_123)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_187) (< v_~x2~0_187 v_~size~0_123)) 1 0) 0)) (= (select .cse0 (+ v_~f~0.offset_117 (* .cse2 4))) v_~x2~0_186) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_47| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_103| (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_123)) 1 0)) (< (mod (+ |v_thread2Thread1of1ForFork0_~i~1#1_167| 4294967294) 4294967296) (mod (+ 4294967295 v_~n~0_101) 4294967296)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_123)) 1 0))))) InVars {~x2~0=v_~x2~0_187, ~size~0=v_~size~0_123, ~f~0.base=v_~f~0.base_117, #memory_int=|v_#memory_int_151|, ~n~0=v_~n~0_101, ~x1~0=v_~x1~0_94, ~f~0.offset=v_~f~0.offset_117} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_37|, thread2Thread1of1ForFork0_#t~mem3#1=|v_thread2Thread1of1ForFork0_#t~mem3#1_55|, ~x2~0=v_~x2~0_186, ~size~0=v_~size~0_123, ~f~0.base=v_~f~0.base_117, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_103|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_167|, ~x1~0=v_~x1~0_92, ~f~0.offset=v_~f~0.offset_117, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_129|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_63|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39|, #memory_int=|v_#memory_int_151|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_67|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_41|, ~n~0=v_~n~0_101, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_55|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_55|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_47|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork0_#t~mem3#1, ~x2~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, ~x1~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork1_#t~mem1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [635] L59-2-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_121| v_~f~0.base_89))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_89 (* v_~x2~0_131 4))))) (and (= |v_thread2Thread1of1ForFork0_~i~1#1_119| (+ 2 |v_thread2Thread1of1ForFork0_~i~1#1_120|)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_120| 4294967296) (mod (+ v_~n~0_71 4294967295) 4294967296)) (= (ite (and (< .cse0 v_~size~0_95) (<= 0 .cse0)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_67|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_93| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_67|) (= v_~x2~0_130 (select .cse1 (+ v_~f~0.offset_89 (* .cse0 4)))) (not (= (ite (and (< v_~x2~0_131 v_~size~0_95) (<= 0 v_~x2~0_131)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_93| 0))))) InVars {~x2~0=v_~x2~0_131, ~size~0=v_~size~0_95, ~f~0.base=v_~f~0.base_89, #memory_int=|v_#memory_int_121|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_120|, ~n~0=v_~n~0_71, ~f~0.offset=v_~f~0.offset_89} OutVars{thread2Thread1of1ForFork0_#t~mem3#1=|v_thread2Thread1of1ForFork0_#t~mem3#1_27|, ~x2~0=v_~x2~0_130, ~size~0=v_~size~0_95, ~f~0.base=v_~f~0.base_89, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_67|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_119|, ~f~0.offset=v_~f~0.offset_89, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_93|, #memory_int=|v_#memory_int_121|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_39|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_27|, ~n~0=v_~n~0_71, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem3#1, ~x2~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1] [2022-12-06 05:46:20,264 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [655] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_151| v_~f~0.base_117))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_117 (* v_~x2~0_187 4)))) (.cse1 (select .cse0 (+ v_~f~0.offset_117 (* v_~x1~0_94 4))))) (and (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_129| 0)) (= 2 |v_thread1Thread1of1ForFork1_~i~0#1_63|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_129| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_103|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_47|) (= (select .cse0 (+ v_~f~0.offset_117 (* .cse1 4))) v_~x1~0_92) (= 2 |v_thread2Thread1of1ForFork0_~i~1#1_167|) (< (mod (+ 4294967294 |v_thread1Thread1of1ForFork1_~i~0#1_63|) 4294967296) (mod v_~n~0_101 4294967296)) (not (= (ite (and (<= 0 v_~x1~0_94) (< v_~x1~0_94 v_~size~0_123)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_187) (< v_~x2~0_187 v_~size~0_123)) 1 0) 0)) (= (select .cse0 (+ v_~f~0.offset_117 (* .cse2 4))) v_~x2~0_186) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_47| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_103| (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_123)) 1 0)) (< (mod (+ |v_thread2Thread1of1ForFork0_~i~1#1_167| 4294967294) 4294967296) (mod (+ 4294967295 v_~n~0_101) 4294967296)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_123)) 1 0))))) InVars {~x2~0=v_~x2~0_187, ~size~0=v_~size~0_123, ~f~0.base=v_~f~0.base_117, #memory_int=|v_#memory_int_151|, ~n~0=v_~n~0_101, ~x1~0=v_~x1~0_94, ~f~0.offset=v_~f~0.offset_117} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_37|, thread2Thread1of1ForFork0_#t~mem3#1=|v_thread2Thread1of1ForFork0_#t~mem3#1_55|, ~x2~0=v_~x2~0_186, ~size~0=v_~size~0_123, ~f~0.base=v_~f~0.base_117, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_103|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_167|, ~x1~0=v_~x1~0_92, ~f~0.offset=v_~f~0.offset_117, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_129|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_63|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39|, #memory_int=|v_#memory_int_151|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_67|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_41|, ~n~0=v_~n~0_101, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_55|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_55|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_47|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork0_#t~mem3#1, ~x2~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, ~x1~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork1_#t~mem1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [634] L59-2-->thread2EXIT: Formula: (let ((.cse3 (mod |v_thread2Thread1of1ForFork0_~i~1#1_116| 4294967296))) (and (let ((.cse0 (< .cse3 (mod v_~n~0_69 4294967296))) (.cse1 (= |v_thread2Thread1of1ForFork0_#res#1.base_19| 0)) (.cse2 (= |v_thread2Thread1of1ForFork0_#res#1.offset_19| 0))) (or (and (not .cse0) (= |v_thread2Thread1of1ForFork0_#t~post8#1_28| |v_thread2Thread1of1ForFork0_#t~post8#1_27|) (= |v_thread2Thread1of1ForFork0_#t~mem7#1_32| |v_thread2Thread1of1ForFork0_#t~mem7#1_31|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_64| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_63|) .cse1 (= v_~x2~0_127 v_~x2~0_126) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_89| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|) (= |v_thread2Thread1of1ForFork0_~i~1#1_116| |v_thread2Thread1of1ForFork0_~i~1#1_115|) .cse2) (and (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_89| 0)) .cse0 (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_89| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_63|) .cse1 (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_116| 1) |v_thread2Thread1of1ForFork0_~i~1#1_115|) (= (select (select |v_#memory_int_119| v_~f~0.base_87) (+ v_~f~0.offset_87 (* v_~x2~0_127 4))) v_~x2~0_126) (= (ite (and (<= 0 v_~x2~0_127) (< v_~x2~0_127 v_~size~0_93)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_63|) .cse2))) (not (< .cse3 (mod (+ v_~n~0_69 4294967295) 4294967296))))) InVars {~x2~0=v_~x2~0_127, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, ~size~0=v_~size~0_93, ~f~0.base=v_~f~0.base_87, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_64|, #memory_int=|v_#memory_int_119|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_116|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_32|, ~n~0=v_~n~0_69, ~f~0.offset=v_~f~0.offset_87, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_28|} OutVars{~x2~0=v_~x2~0_126, ~size~0=v_~size~0_93, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_19|, ~f~0.base=v_~f~0.base_87, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_63|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_115|, ~f~0.offset=v_~f~0.offset_87, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_89|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_19|, #memory_int=|v_#memory_int_119|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_31|, ~n~0=v_~n~0_69, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_27|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~post8#1] [2022-12-06 05:46:20,674 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 05:46:20,675 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3276 [2022-12-06 05:46:20,675 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 299 flow [2022-12-06 05:46:20,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:20,675 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:20,675 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:20,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 05:46:20,675 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:20,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:20,676 INFO L85 PathProgramCache]: Analyzing trace with hash -896721129, now seen corresponding path program 1 times [2022-12-06 05:46:20,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:20,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047698851] [2022-12-06 05:46:20,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:20,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:20,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:21,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:21,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:21,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047698851] [2022-12-06 05:46:21,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047698851] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:46:21,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:46:21,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:46:21,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507361252] [2022-12-06 05:46:21,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:46:21,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:46:21,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:21,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:46:21,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:46:21,010 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 05:46:21,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 299 flow. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:21,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:21,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 05:46:21,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:21,182 INFO L130 PetriNetUnfolder]: 163/302 cut-off events. [2022-12-06 05:46:21,183 INFO L131 PetriNetUnfolder]: For 1374/1374 co-relation queries the response was YES. [2022-12-06 05:46:21,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1317 conditions, 302 events. 163/302 cut-off events. For 1374/1374 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1181 event pairs, 17 based on Foata normal form. 1/270 useless extension candidates. Maximal degree in co-relation 1065. Up to 258 conditions per place. [2022-12-06 05:46:21,185 INFO L137 encePairwiseOnDemand]: 12/29 looper letters, 30 selfloop transitions, 15 changer transitions 9/54 dead transitions. [2022-12-06 05:46:21,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 54 transitions, 499 flow [2022-12-06 05:46:21,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:46:21,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:46:21,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-12-06 05:46:21,187 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3448275862068966 [2022-12-06 05:46:21,187 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 299 flow. Second operand 5 states and 50 transitions. [2022-12-06 05:46:21,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 54 transitions, 499 flow [2022-12-06 05:46:21,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 54 transitions, 423 flow, removed 35 selfloop flow, removed 7 redundant places. [2022-12-06 05:46:21,191 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 302 flow [2022-12-06 05:46:21,191 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=302, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2022-12-06 05:46:21,192 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 24 predicate places. [2022-12-06 05:46:21,192 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:21,192 INFO L89 Accepts]: Start accepts. Operand has 45 places, 37 transitions, 302 flow [2022-12-06 05:46:21,192 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:21,192 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:21,193 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 37 transitions, 302 flow [2022-12-06 05:46:21,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 37 transitions, 302 flow [2022-12-06 05:46:21,204 INFO L130 PetriNetUnfolder]: 25/98 cut-off events. [2022-12-06 05:46:21,204 INFO L131 PetriNetUnfolder]: For 268/291 co-relation queries the response was YES. [2022-12-06 05:46:21,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 299 conditions, 98 events. 25/98 cut-off events. For 268/291 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 418 event pairs, 1 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 261. Up to 23 conditions per place. [2022-12-06 05:46:21,205 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 37 transitions, 302 flow [2022-12-06 05:46:21,205 INFO L188 LiptonReduction]: Number of co-enabled transitions 138 [2022-12-06 05:46:21,235 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [641] $Ultimate##0-->L49-2: Formula: (and (= (select (select |v_#memory_int_133| v_~f~0.base_99) (+ v_~f~0.offset_99 (* v_~x1~0_85 4))) v_~x1~0_84) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x1~0_85) (< v_~x1~0_85 v_~size~0_105)) 1 0)) (< (mod (+ 4294967295 |v_thread1Thread1of1ForFork1_~i~0#1_55|) 4294967296) (mod v_~n~0_83 4294967296)) (= |v_thread1Thread1of1ForFork1_~i~0#1_55| 1) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_43| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_43|) (= |v_thread2Thread1of1ForFork0_~i~1#1_131| 0)) InVars {~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, #memory_int=|v_#memory_int_133|, ~n~0=v_~n~0_83, ~x1~0=v_~x1~0_85, ~f~0.offset=v_~f~0.offset_99} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_33|, ~size~0=v_~size~0_105, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_55|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|, ~f~0.base=v_~f~0.base_99, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_131|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_37|, ~n~0=v_~n~0_83, ~x1~0=v_~x1~0_84, ~f~0.offset=v_~f~0.offset_99, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_43|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~mem1#1, ~x1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [634] L59-2-->thread2EXIT: Formula: (let ((.cse3 (mod |v_thread2Thread1of1ForFork0_~i~1#1_116| 4294967296))) (and (let ((.cse0 (< .cse3 (mod v_~n~0_69 4294967296))) (.cse1 (= |v_thread2Thread1of1ForFork0_#res#1.base_19| 0)) (.cse2 (= |v_thread2Thread1of1ForFork0_#res#1.offset_19| 0))) (or (and (not .cse0) (= |v_thread2Thread1of1ForFork0_#t~post8#1_28| |v_thread2Thread1of1ForFork0_#t~post8#1_27|) (= |v_thread2Thread1of1ForFork0_#t~mem7#1_32| |v_thread2Thread1of1ForFork0_#t~mem7#1_31|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_64| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_63|) .cse1 (= v_~x2~0_127 v_~x2~0_126) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_89| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|) (= |v_thread2Thread1of1ForFork0_~i~1#1_116| |v_thread2Thread1of1ForFork0_~i~1#1_115|) .cse2) (and (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_89| 0)) .cse0 (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_89| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_63|) .cse1 (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_116| 1) |v_thread2Thread1of1ForFork0_~i~1#1_115|) (= (select (select |v_#memory_int_119| v_~f~0.base_87) (+ v_~f~0.offset_87 (* v_~x2~0_127 4))) v_~x2~0_126) (= (ite (and (<= 0 v_~x2~0_127) (< v_~x2~0_127 v_~size~0_93)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_63|) .cse2))) (not (< .cse3 (mod (+ v_~n~0_69 4294967295) 4294967296))))) InVars {~x2~0=v_~x2~0_127, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, ~size~0=v_~size~0_93, ~f~0.base=v_~f~0.base_87, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_64|, #memory_int=|v_#memory_int_119|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_116|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_32|, ~n~0=v_~n~0_69, ~f~0.offset=v_~f~0.offset_87, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_28|} OutVars{~x2~0=v_~x2~0_126, ~size~0=v_~size~0_93, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_19|, ~f~0.base=v_~f~0.base_87, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_63|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_115|, ~f~0.offset=v_~f~0.offset_87, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_89|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_19|, #memory_int=|v_#memory_int_119|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_31|, ~n~0=v_~n~0_69, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_27|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~post8#1] [2022-12-06 05:46:21,582 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [641] $Ultimate##0-->L49-2: Formula: (and (= (select (select |v_#memory_int_133| v_~f~0.base_99) (+ v_~f~0.offset_99 (* v_~x1~0_85 4))) v_~x1~0_84) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x1~0_85) (< v_~x1~0_85 v_~size~0_105)) 1 0)) (< (mod (+ 4294967295 |v_thread1Thread1of1ForFork1_~i~0#1_55|) 4294967296) (mod v_~n~0_83 4294967296)) (= |v_thread1Thread1of1ForFork1_~i~0#1_55| 1) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_43| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_43|) (= |v_thread2Thread1of1ForFork0_~i~1#1_131| 0)) InVars {~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, #memory_int=|v_#memory_int_133|, ~n~0=v_~n~0_83, ~x1~0=v_~x1~0_85, ~f~0.offset=v_~f~0.offset_99} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_33|, ~size~0=v_~size~0_105, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_55|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|, ~f~0.base=v_~f~0.base_99, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_131|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_37|, ~n~0=v_~n~0_83, ~x1~0=v_~x1~0_84, ~f~0.offset=v_~f~0.offset_99, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_43|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~mem1#1, ~x1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [635] L59-2-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_121| v_~f~0.base_89))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_89 (* v_~x2~0_131 4))))) (and (= |v_thread2Thread1of1ForFork0_~i~1#1_119| (+ 2 |v_thread2Thread1of1ForFork0_~i~1#1_120|)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_120| 4294967296) (mod (+ v_~n~0_71 4294967295) 4294967296)) (= (ite (and (< .cse0 v_~size~0_95) (<= 0 .cse0)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_67|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_93| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_67|) (= v_~x2~0_130 (select .cse1 (+ v_~f~0.offset_89 (* .cse0 4)))) (not (= (ite (and (< v_~x2~0_131 v_~size~0_95) (<= 0 v_~x2~0_131)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_93| 0))))) InVars {~x2~0=v_~x2~0_131, ~size~0=v_~size~0_95, ~f~0.base=v_~f~0.base_89, #memory_int=|v_#memory_int_121|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_120|, ~n~0=v_~n~0_71, ~f~0.offset=v_~f~0.offset_89} OutVars{thread2Thread1of1ForFork0_#t~mem3#1=|v_thread2Thread1of1ForFork0_#t~mem3#1_27|, ~x2~0=v_~x2~0_130, ~size~0=v_~size~0_95, ~f~0.base=v_~f~0.base_89, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_67|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_119|, ~f~0.offset=v_~f~0.offset_89, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_93|, #memory_int=|v_#memory_int_121|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_39|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_27|, ~n~0=v_~n~0_71, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem3#1, ~x2~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1] [2022-12-06 05:46:21,731 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [667] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse0 (select |v_#memory_int_169| v_~f~0.base_135))) (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55| (ite (and (< v_~x1~0_121 v_~size~0_141) (<= 0 v_~x1~0_121)) 1 0)) (= |v_thread1Thread1of1ForFork1_~i~0#1_81| 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_63|) (= |v_thread2Thread1of1ForFork0_~i~1#1_195| 1) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_157| 0)) (= (ite (and (<= 0 v_~x2~0_233) (< v_~x2~0_233 v_~size~0_141)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_131|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_157| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_131|) (= v_~x1~0_120 (select .cse0 (+ v_~f~0.offset_135 (* v_~x1~0_121 4)))) (= (select .cse0 (+ v_~f~0.offset_135 (* v_~x2~0_233 4))) v_~x2~0_232) (<= (mod (+ 4294967295 v_~n~0_119) 4294967296) (mod (+ 4294967295 |v_thread2Thread1of1ForFork0_~i~1#1_195|) 4294967296)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_63| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_33| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_33| 0))) InVars {~x2~0=v_~x2~0_233, ~size~0=v_~size~0_141, ~f~0.base=v_~f~0.base_135, #memory_int=|v_#memory_int_169|, ~n~0=v_~n~0_119, ~x1~0=v_~x1~0_121, ~f~0.offset=v_~f~0.offset_135} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_53|, ~x2~0=v_~x2~0_232, ~size~0=v_~size~0_141, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_33|, ~f~0.base=v_~f~0.base_135, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_195|, ~x1~0=v_~x1~0_120, ~f~0.offset=v_~f~0.offset_135, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_157|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_33|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_81|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55|, #memory_int=|v_#memory_int_169|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_59|, ~n~0=v_~n~0_119, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_57|, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_55|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_63|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, ~x2~0, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, ~x1~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_#t~mem1#1, thread2Thread1of1ForFork0_#t~post8#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [628] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_21| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_6 4)))) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_6 v_~size~0_In_15) (<= 0 v_~x1~0_In_6)) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_In_4| 1) |v_thread1Thread1of1ForFork1_~i~0#1_Out_6|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|) (< (mod |v_thread1Thread1of1ForFork1_~i~0#1_In_4| 4294967296) (mod v_~n~0_In_7 4294967296))) InVars {~size~0=v_~size~0_In_15, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_4|, ~f~0.base=v_~f~0.base_In_9, #memory_int=|v_#memory_int_In_21|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_Out_10|, ~size~0=v_~size~0_In_15, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|, ~f~0.base=v_~f~0.base_In_9, #memory_int=|v_#memory_int_In_21|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_Out_6|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_18, ~f~0.offset=v_~f~0.offset_In_9, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, ~x1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:46:21,747 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:46:21,747 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 555 [2022-12-06 05:46:21,747 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 326 flow [2022-12-06 05:46:21,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:21,748 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:21,748 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:21,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 05:46:21,748 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:21,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:21,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1453849520, now seen corresponding path program 1 times [2022-12-06 05:46:21,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:21,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911470171] [2022-12-06 05:46:21,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:21,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:21,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:22,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:22,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:22,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911470171] [2022-12-06 05:46:22,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911470171] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:46:22,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:46:22,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:46:22,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473101725] [2022-12-06 05:46:22,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:46:22,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:46:22,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:22,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:46:22,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:46:22,241 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 30 [2022-12-06 05:46:22,241 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 326 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:22,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:22,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 30 [2022-12-06 05:46:22,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:22,479 INFO L130 PetriNetUnfolder]: 345/597 cut-off events. [2022-12-06 05:46:22,479 INFO L131 PetriNetUnfolder]: For 2674/2678 co-relation queries the response was YES. [2022-12-06 05:46:22,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2561 conditions, 597 events. 345/597 cut-off events. For 2674/2678 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2667 event pairs, 32 based on Foata normal form. 10/593 useless extension candidates. Maximal degree in co-relation 2517. Up to 313 conditions per place. [2022-12-06 05:46:22,484 INFO L137 encePairwiseOnDemand]: 11/30 looper letters, 56 selfloop transitions, 24 changer transitions 6/87 dead transitions. [2022-12-06 05:46:22,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 87 transitions, 861 flow [2022-12-06 05:46:22,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:46:22,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:46:22,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2022-12-06 05:46:22,486 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45 [2022-12-06 05:46:22,486 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 326 flow. Second operand 6 states and 81 transitions. [2022-12-06 05:46:22,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 87 transitions, 861 flow [2022-12-06 05:46:22,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 87 transitions, 761 flow, removed 50 selfloop flow, removed 3 redundant places. [2022-12-06 05:46:22,492 INFO L231 Difference]: Finished difference. Result has 47 places, 55 transitions, 547 flow [2022-12-06 05:46:22,492 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=547, PETRI_PLACES=47, PETRI_TRANSITIONS=55} [2022-12-06 05:46:22,492 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 26 predicate places. [2022-12-06 05:46:22,492 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:22,492 INFO L89 Accepts]: Start accepts. Operand has 47 places, 55 transitions, 547 flow [2022-12-06 05:46:22,493 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:22,493 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:22,493 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 55 transitions, 547 flow [2022-12-06 05:46:22,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 55 transitions, 547 flow [2022-12-06 05:46:22,516 INFO L130 PetriNetUnfolder]: 55/201 cut-off events. [2022-12-06 05:46:22,516 INFO L131 PetriNetUnfolder]: For 541/580 co-relation queries the response was YES. [2022-12-06 05:46:22,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 630 conditions, 201 events. 55/201 cut-off events. For 541/580 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1127 event pairs, 1 based on Foata normal form. 7/201 useless extension candidates. Maximal degree in co-relation 582. Up to 47 conditions per place. [2022-12-06 05:46:22,518 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 55 transitions, 547 flow [2022-12-06 05:46:22,518 INFO L188 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-06 05:46:24,263 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:46:24,264 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1772 [2022-12-06 05:46:24,264 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 55 transitions, 555 flow [2022-12-06 05:46:24,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:24,264 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:24,264 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:24,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 05:46:24,264 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:24,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:24,265 INFO L85 PathProgramCache]: Analyzing trace with hash -2119709054, now seen corresponding path program 1 times [2022-12-06 05:46:24,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:24,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458759728] [2022-12-06 05:46:24,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:24,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:24,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:24,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:24,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458759728] [2022-12-06 05:46:24,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458759728] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:46:24,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:46:24,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:46:24,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910375686] [2022-12-06 05:46:24,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:46:24,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:46:24,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:24,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:46:24,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:46:24,366 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 05:46:24,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 55 transitions, 555 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:24,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:24,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 05:46:24,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:24,528 INFO L130 PetriNetUnfolder]: 359/611 cut-off events. [2022-12-06 05:46:24,529 INFO L131 PetriNetUnfolder]: For 2242/2242 co-relation queries the response was YES. [2022-12-06 05:46:24,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2691 conditions, 611 events. 359/611 cut-off events. For 2242/2242 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2637 event pairs, 110 based on Foata normal form. 8/610 useless extension candidates. Maximal degree in co-relation 2426. Up to 602 conditions per place. [2022-12-06 05:46:24,533 INFO L137 encePairwiseOnDemand]: 27/30 looper letters, 55 selfloop transitions, 3 changer transitions 1/59 dead transitions. [2022-12-06 05:46:24,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 59 transitions, 688 flow [2022-12-06 05:46:24,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:46:24,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:46:24,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-06 05:46:24,534 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2022-12-06 05:46:24,534 INFO L175 Difference]: Start difference. First operand has 46 places, 55 transitions, 555 flow. Second operand 3 states and 35 transitions. [2022-12-06 05:46:24,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 59 transitions, 688 flow [2022-12-06 05:46:24,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 59 transitions, 647 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-06 05:46:24,542 INFO L231 Difference]: Finished difference. Result has 47 places, 55 transitions, 530 flow [2022-12-06 05:46:24,542 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=530, PETRI_PLACES=47, PETRI_TRANSITIONS=55} [2022-12-06 05:46:24,542 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 26 predicate places. [2022-12-06 05:46:24,542 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:24,543 INFO L89 Accepts]: Start accepts. Operand has 47 places, 55 transitions, 530 flow [2022-12-06 05:46:24,544 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:24,544 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:24,544 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 55 transitions, 530 flow [2022-12-06 05:46:24,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 55 transitions, 530 flow [2022-12-06 05:46:24,566 INFO L130 PetriNetUnfolder]: 56/200 cut-off events. [2022-12-06 05:46:24,567 INFO L131 PetriNetUnfolder]: For 618/657 co-relation queries the response was YES. [2022-12-06 05:46:24,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 200 events. 56/200 cut-off events. For 618/657 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1126 event pairs, 1 based on Foata normal form. 7/200 useless extension candidates. Maximal degree in co-relation 541. Up to 47 conditions per place. [2022-12-06 05:46:24,568 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 55 transitions, 530 flow [2022-12-06 05:46:24,569 INFO L188 LiptonReduction]: Number of co-enabled transitions 216 [2022-12-06 05:46:25,467 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:46:25,467 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 925 [2022-12-06 05:46:25,467 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 54 transitions, 533 flow [2022-12-06 05:46:25,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:25,468 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:25,468 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:25,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 05:46:25,468 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:25,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:25,468 INFO L85 PathProgramCache]: Analyzing trace with hash -915497911, now seen corresponding path program 1 times [2022-12-06 05:46:25,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:25,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950789279] [2022-12-06 05:46:25,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:25,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:25,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:26,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:26,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:26,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950789279] [2022-12-06 05:46:26,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950789279] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:46:26,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:46:26,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:46:26,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981266017] [2022-12-06 05:46:26,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:46:26,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:46:26,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:26,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:46:26,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:46:26,052 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 30 [2022-12-06 05:46:26,053 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 54 transitions, 533 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-06 05:46:26,053 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:26,053 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 30 [2022-12-06 05:46:26,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:26,333 INFO L130 PetriNetUnfolder]: 407/686 cut-off events. [2022-12-06 05:46:26,333 INFO L131 PetriNetUnfolder]: For 3465/3469 co-relation queries the response was YES. [2022-12-06 05:46:26,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3126 conditions, 686 events. 407/686 cut-off events. For 3465/3469 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3024 event pairs, 48 based on Foata normal form. 6/674 useless extension candidates. Maximal degree in co-relation 2901. Up to 577 conditions per place. [2022-12-06 05:46:26,338 INFO L137 encePairwiseOnDemand]: 9/30 looper letters, 41 selfloop transitions, 47 changer transitions 7/96 dead transitions. [2022-12-06 05:46:26,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 96 transitions, 1046 flow [2022-12-06 05:46:26,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:46:26,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:46:26,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2022-12-06 05:46:26,340 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-06 05:46:26,340 INFO L175 Difference]: Start difference. First operand has 45 places, 54 transitions, 533 flow. Second operand 7 states and 77 transitions. [2022-12-06 05:46:26,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 96 transitions, 1046 flow [2022-12-06 05:46:26,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 96 transitions, 990 flow, removed 28 selfloop flow, removed 3 redundant places. [2022-12-06 05:46:26,348 INFO L231 Difference]: Finished difference. Result has 51 places, 77 transitions, 870 flow [2022-12-06 05:46:26,348 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=870, PETRI_PLACES=51, PETRI_TRANSITIONS=77} [2022-12-06 05:46:26,348 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 30 predicate places. [2022-12-06 05:46:26,348 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:26,348 INFO L89 Accepts]: Start accepts. Operand has 51 places, 77 transitions, 870 flow [2022-12-06 05:46:26,349 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:26,349 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:26,350 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 77 transitions, 870 flow [2022-12-06 05:46:26,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 77 transitions, 870 flow [2022-12-06 05:46:26,377 INFO L130 PetriNetUnfolder]: 79/245 cut-off events. [2022-12-06 05:46:26,378 INFO L131 PetriNetUnfolder]: For 896/935 co-relation queries the response was YES. [2022-12-06 05:46:26,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 904 conditions, 245 events. 79/245 cut-off events. For 896/935 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1359 event pairs, 1 based on Foata normal form. 0/236 useless extension candidates. Maximal degree in co-relation 752. Up to 82 conditions per place. [2022-12-06 05:46:26,380 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 77 transitions, 870 flow [2022-12-06 05:46:26,380 INFO L188 LiptonReduction]: Number of co-enabled transitions 268 [2022-12-06 05:46:28,498 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:46:28,499 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2151 [2022-12-06 05:46:28,499 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 77 transitions, 882 flow [2022-12-06 05:46:28,499 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-06 05:46:28,499 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:28,499 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:28,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 05:46:28,500 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:28,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:28,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1529746349, now seen corresponding path program 1 times [2022-12-06 05:46:28,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:28,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398513513] [2022-12-06 05:46:28,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:28,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:28,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:28,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:28,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:28,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398513513] [2022-12-06 05:46:28,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398513513] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:46:28,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:46:28,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:46:28,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165075562] [2022-12-06 05:46:28,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:46:28,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:46:28,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:28,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:46:28,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:46:28,593 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 05:46:28,593 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 77 transitions, 882 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:28,593 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:28,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 05:46:28,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:28,768 INFO L130 PetriNetUnfolder]: 425/716 cut-off events. [2022-12-06 05:46:28,768 INFO L131 PetriNetUnfolder]: For 3689/3689 co-relation queries the response was YES. [2022-12-06 05:46:28,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3486 conditions, 716 events. 425/716 cut-off events. For 3689/3689 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3136 event pairs, 122 based on Foata normal form. 8/711 useless extension candidates. Maximal degree in co-relation 3047. Up to 705 conditions per place. [2022-12-06 05:46:28,774 INFO L137 encePairwiseOnDemand]: 28/32 looper letters, 76 selfloop transitions, 4 changer transitions 1/81 dead transitions. [2022-12-06 05:46:28,774 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 81 transitions, 1061 flow [2022-12-06 05:46:28,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:46:28,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:46:28,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-06 05:46:28,775 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2022-12-06 05:46:28,775 INFO L175 Difference]: Start difference. First operand has 51 places, 77 transitions, 882 flow. Second operand 3 states and 37 transitions. [2022-12-06 05:46:28,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 81 transitions, 1061 flow [2022-12-06 05:46:28,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 81 transitions, 980 flow, removed 22 selfloop flow, removed 1 redundant places. [2022-12-06 05:46:28,788 INFO L231 Difference]: Finished difference. Result has 53 places, 77 transitions, 820 flow [2022-12-06 05:46:28,788 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=820, PETRI_PLACES=53, PETRI_TRANSITIONS=77} [2022-12-06 05:46:28,789 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 32 predicate places. [2022-12-06 05:46:28,789 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:28,789 INFO L89 Accepts]: Start accepts. Operand has 53 places, 77 transitions, 820 flow [2022-12-06 05:46:28,790 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:28,790 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:28,790 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 77 transitions, 820 flow [2022-12-06 05:46:28,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 77 transitions, 820 flow [2022-12-06 05:46:28,818 INFO L130 PetriNetUnfolder]: 76/247 cut-off events. [2022-12-06 05:46:28,818 INFO L131 PetriNetUnfolder]: For 797/837 co-relation queries the response was YES. [2022-12-06 05:46:28,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 898 conditions, 247 events. 76/247 cut-off events. For 797/837 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1387 event pairs, 1 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 803. Up to 81 conditions per place. [2022-12-06 05:46:28,820 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 77 transitions, 820 flow [2022-12-06 05:46:28,820 INFO L188 LiptonReduction]: Number of co-enabled transitions 274 [2022-12-06 05:46:30,497 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:46:30,498 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1709 [2022-12-06 05:46:30,498 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 76 transitions, 828 flow [2022-12-06 05:46:30,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:30,498 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:30,498 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:30,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 05:46:30,498 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:30,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:30,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1330455120, now seen corresponding path program 1 times [2022-12-06 05:46:30,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:30,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029335614] [2022-12-06 05:46:30,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:30,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:30,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:30,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:30,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029335614] [2022-12-06 05:46:30,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029335614] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:46:30,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:46:30,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:46:30,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653547730] [2022-12-06 05:46:30,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:46:30,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:46:30,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:30,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:46:30,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:46:30,619 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 05:46:30,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 76 transitions, 828 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:30,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:30,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 05:46:30,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:30,875 INFO L130 PetriNetUnfolder]: 545/913 cut-off events. [2022-12-06 05:46:30,875 INFO L131 PetriNetUnfolder]: For 5219/5219 co-relation queries the response was YES. [2022-12-06 05:46:30,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4502 conditions, 913 events. 545/913 cut-off events. For 5219/5219 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4213 event pairs, 93 based on Foata normal form. 8/909 useless extension candidates. Maximal degree in co-relation 4251. Up to 535 conditions per place. [2022-12-06 05:46:30,882 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 69 selfloop transitions, 31 changer transitions 0/100 dead transitions. [2022-12-06 05:46:30,882 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 100 transitions, 1198 flow [2022-12-06 05:46:30,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:46:30,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:46:30,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-12-06 05:46:30,883 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.390625 [2022-12-06 05:46:30,883 INFO L175 Difference]: Start difference. First operand has 51 places, 76 transitions, 828 flow. Second operand 4 states and 50 transitions. [2022-12-06 05:46:30,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 100 transitions, 1198 flow [2022-12-06 05:46:30,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 100 transitions, 1150 flow, removed 24 selfloop flow, removed 3 redundant places. [2022-12-06 05:46:30,892 INFO L231 Difference]: Finished difference. Result has 53 places, 80 transitions, 929 flow [2022-12-06 05:46:30,893 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=788, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=929, PETRI_PLACES=53, PETRI_TRANSITIONS=80} [2022-12-06 05:46:30,893 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 32 predicate places. [2022-12-06 05:46:30,893 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:30,893 INFO L89 Accepts]: Start accepts. Operand has 53 places, 80 transitions, 929 flow [2022-12-06 05:46:30,894 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:30,894 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:30,894 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 80 transitions, 929 flow [2022-12-06 05:46:30,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 80 transitions, 929 flow [2022-12-06 05:46:30,926 INFO L130 PetriNetUnfolder]: 92/293 cut-off events. [2022-12-06 05:46:30,927 INFO L131 PetriNetUnfolder]: For 1213/1271 co-relation queries the response was YES. [2022-12-06 05:46:30,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1144 conditions, 293 events. 92/293 cut-off events. For 1213/1271 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1758 event pairs, 0 based on Foata normal form. 0/283 useless extension candidates. Maximal degree in co-relation 975. Up to 99 conditions per place. [2022-12-06 05:46:30,929 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 80 transitions, 929 flow [2022-12-06 05:46:30,929 INFO L188 LiptonReduction]: Number of co-enabled transitions 296 [2022-12-06 05:46:30,938 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_~i~0#1_49| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_11| 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_11| 0) (not (< (mod |v_thread1Thread1of1ForFork1_~i~0#1_49| 4294967296) (mod v_~n~0_77 4294967296)))) InVars {~n~0=v_~n~0_77} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_49|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_11|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_11|, ~n~0=v_~n~0_77} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base] and [635] L59-2-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_121| v_~f~0.base_89))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_89 (* v_~x2~0_131 4))))) (and (= |v_thread2Thread1of1ForFork0_~i~1#1_119| (+ 2 |v_thread2Thread1of1ForFork0_~i~1#1_120|)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_120| 4294967296) (mod (+ v_~n~0_71 4294967295) 4294967296)) (= (ite (and (< .cse0 v_~size~0_95) (<= 0 .cse0)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_67|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_93| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_67|) (= v_~x2~0_130 (select .cse1 (+ v_~f~0.offset_89 (* .cse0 4)))) (not (= (ite (and (< v_~x2~0_131 v_~size~0_95) (<= 0 v_~x2~0_131)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_93| 0))))) InVars {~x2~0=v_~x2~0_131, ~size~0=v_~size~0_95, ~f~0.base=v_~f~0.base_89, #memory_int=|v_#memory_int_121|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_120|, ~n~0=v_~n~0_71, ~f~0.offset=v_~f~0.offset_89} OutVars{thread2Thread1of1ForFork0_#t~mem3#1=|v_thread2Thread1of1ForFork0_#t~mem3#1_27|, ~x2~0=v_~x2~0_130, ~size~0=v_~size~0_95, ~f~0.base=v_~f~0.base_89, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_67|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_119|, ~f~0.offset=v_~f~0.offset_89, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_93|, #memory_int=|v_#memory_int_121|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_39|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_27|, ~n~0=v_~n~0_71, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem3#1, ~x2~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1] [2022-12-06 05:46:31,051 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:46:31,052 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 159 [2022-12-06 05:46:31,052 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 80 transitions, 943 flow [2022-12-06 05:46:31,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:31,052 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:31,052 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:31,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 05:46:31,052 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:31,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:31,053 INFO L85 PathProgramCache]: Analyzing trace with hash 745222291, now seen corresponding path program 1 times [2022-12-06 05:46:31,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:31,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210933896] [2022-12-06 05:46:31,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:31,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:31,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:31,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:31,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210933896] [2022-12-06 05:46:31,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210933896] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:46:31,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:46:31,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:46:31,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372384718] [2022-12-06 05:46:31,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:46:31,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:46:31,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:31,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:46:31,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:46:31,148 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 05:46:31,148 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 80 transitions, 943 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:31,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:31,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 05:46:31,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:31,355 INFO L130 PetriNetUnfolder]: 547/923 cut-off events. [2022-12-06 05:46:31,355 INFO L131 PetriNetUnfolder]: For 5312/5312 co-relation queries the response was YES. [2022-12-06 05:46:31,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4766 conditions, 923 events. 547/923 cut-off events. For 5312/5312 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4348 event pairs, 178 based on Foata normal form. 8/919 useless extension candidates. Maximal degree in co-relation 4193. Up to 912 conditions per place. [2022-12-06 05:46:31,365 INFO L137 encePairwiseOnDemand]: 28/33 looper letters, 80 selfloop transitions, 4 changer transitions 0/84 dead transitions. [2022-12-06 05:46:31,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 84 transitions, 1130 flow [2022-12-06 05:46:31,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:46:31,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:46:31,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-12-06 05:46:31,367 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3838383838383838 [2022-12-06 05:46:31,367 INFO L175 Difference]: Start difference. First operand has 53 places, 80 transitions, 943 flow. Second operand 3 states and 38 transitions. [2022-12-06 05:46:31,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 84 transitions, 1130 flow [2022-12-06 05:46:31,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 84 transitions, 1126 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-06 05:46:31,376 INFO L231 Difference]: Finished difference. Result has 56 places, 81 transitions, 969 flow [2022-12-06 05:46:31,376 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=941, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=969, PETRI_PLACES=56, PETRI_TRANSITIONS=81} [2022-12-06 05:46:31,377 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 35 predicate places. [2022-12-06 05:46:31,377 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:31,377 INFO L89 Accepts]: Start accepts. Operand has 56 places, 81 transitions, 969 flow [2022-12-06 05:46:31,379 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:31,379 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:31,379 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 81 transitions, 969 flow [2022-12-06 05:46:31,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 81 transitions, 969 flow [2022-12-06 05:46:31,413 INFO L130 PetriNetUnfolder]: 95/302 cut-off events. [2022-12-06 05:46:31,413 INFO L131 PetriNetUnfolder]: For 1334/1392 co-relation queries the response was YES. [2022-12-06 05:46:31,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1211 conditions, 302 events. 95/302 cut-off events. For 1334/1392 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 1830 event pairs, 0 based on Foata normal form. 0/292 useless extension candidates. Maximal degree in co-relation 1112. Up to 104 conditions per place. [2022-12-06 05:46:31,416 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 81 transitions, 969 flow [2022-12-06 05:46:31,416 INFO L188 LiptonReduction]: Number of co-enabled transitions 298 [2022-12-06 05:46:33,798 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:46:33,799 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2422 [2022-12-06 05:46:33,799 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 80 transitions, 977 flow [2022-12-06 05:46:33,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:33,799 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:33,799 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:33,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 05:46:33,799 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:33,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:33,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1074393564, now seen corresponding path program 1 times [2022-12-06 05:46:33,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:33,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084769906] [2022-12-06 05:46:33,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:33,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:33,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:33,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:33,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:33,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084769906] [2022-12-06 05:46:33,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084769906] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:46:33,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:46:33,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:46:33,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384990026] [2022-12-06 05:46:33,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:46:33,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:46:33,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:33,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:46:33,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:46:33,888 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 33 [2022-12-06 05:46:33,888 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 80 transitions, 977 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:33,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:33,888 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 33 [2022-12-06 05:46:33,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:34,090 INFO L130 PetriNetUnfolder]: 519/877 cut-off events. [2022-12-06 05:46:34,090 INFO L131 PetriNetUnfolder]: For 5781/5793 co-relation queries the response was YES. [2022-12-06 05:46:34,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4674 conditions, 877 events. 519/877 cut-off events. For 5781/5793 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4136 event pairs, 144 based on Foata normal form. 24/881 useless extension candidates. Maximal degree in co-relation 4413. Up to 848 conditions per place. [2022-12-06 05:46:34,097 INFO L137 encePairwiseOnDemand]: 30/33 looper letters, 82 selfloop transitions, 5 changer transitions 0/88 dead transitions. [2022-12-06 05:46:34,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 88 transitions, 1228 flow [2022-12-06 05:46:34,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:46:34,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:46:34,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-12-06 05:46:34,098 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40404040404040403 [2022-12-06 05:46:34,098 INFO L175 Difference]: Start difference. First operand has 55 places, 80 transitions, 977 flow. Second operand 3 states and 40 transitions. [2022-12-06 05:46:34,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 88 transitions, 1228 flow [2022-12-06 05:46:34,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 88 transitions, 1186 flow, removed 21 selfloop flow, removed 2 redundant places. [2022-12-06 05:46:34,129 INFO L231 Difference]: Finished difference. Result has 56 places, 82 transitions, 975 flow [2022-12-06 05:46:34,129 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=941, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=975, PETRI_PLACES=56, PETRI_TRANSITIONS=82} [2022-12-06 05:46:34,130 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 35 predicate places. [2022-12-06 05:46:34,130 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:34,130 INFO L89 Accepts]: Start accepts. Operand has 56 places, 82 transitions, 975 flow [2022-12-06 05:46:34,131 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:34,131 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:34,131 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 82 transitions, 975 flow [2022-12-06 05:46:34,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 82 transitions, 975 flow [2022-12-06 05:46:34,167 INFO L130 PetriNetUnfolder]: 100/312 cut-off events. [2022-12-06 05:46:34,167 INFO L131 PetriNetUnfolder]: For 1476/1546 co-relation queries the response was YES. [2022-12-06 05:46:34,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1262 conditions, 312 events. 100/312 cut-off events. For 1476/1546 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 1892 event pairs, 1 based on Foata normal form. 0/301 useless extension candidates. Maximal degree in co-relation 1087. Up to 110 conditions per place. [2022-12-06 05:46:34,170 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 82 transitions, 975 flow [2022-12-06 05:46:34,170 INFO L188 LiptonReduction]: Number of co-enabled transitions 296 [2022-12-06 05:46:34,171 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:46:34,172 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 42 [2022-12-06 05:46:34,172 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 82 transitions, 975 flow [2022-12-06 05:46:34,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:34,172 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:34,172 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:34,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 05:46:34,172 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:34,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:34,175 INFO L85 PathProgramCache]: Analyzing trace with hash 945626348, now seen corresponding path program 1 times [2022-12-06 05:46:34,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:34,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823874737] [2022-12-06 05:46:34,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:34,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:34,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:34,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:34,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823874737] [2022-12-06 05:46:34,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823874737] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:46:34,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:46:34,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:46:34,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731349927] [2022-12-06 05:46:34,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:46:34,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:46:34,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:34,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:46:34,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:46:34,270 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 05:46:34,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 82 transitions, 975 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:34,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:34,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 05:46:34,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:34,484 INFO L130 PetriNetUnfolder]: 541/917 cut-off events. [2022-12-06 05:46:34,485 INFO L131 PetriNetUnfolder]: For 5336/5336 co-relation queries the response was YES. [2022-12-06 05:46:34,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4810 conditions, 917 events. 541/917 cut-off events. For 5336/5336 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4337 event pairs, 176 based on Foata normal form. 8/913 useless extension candidates. Maximal degree in co-relation 4227. Up to 906 conditions per place. [2022-12-06 05:46:34,493 INFO L137 encePairwiseOnDemand]: 28/33 looper letters, 82 selfloop transitions, 4 changer transitions 0/86 dead transitions. [2022-12-06 05:46:34,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 86 transitions, 1164 flow [2022-12-06 05:46:34,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:46:34,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:46:34,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-12-06 05:46:34,494 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3838383838383838 [2022-12-06 05:46:34,494 INFO L175 Difference]: Start difference. First operand has 56 places, 82 transitions, 975 flow. Second operand 3 states and 38 transitions. [2022-12-06 05:46:34,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 86 transitions, 1164 flow [2022-12-06 05:46:34,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 86 transitions, 1153 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-06 05:46:34,505 INFO L231 Difference]: Finished difference. Result has 58 places, 83 transitions, 992 flow [2022-12-06 05:46:34,505 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=964, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=992, PETRI_PLACES=58, PETRI_TRANSITIONS=83} [2022-12-06 05:46:34,505 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 37 predicate places. [2022-12-06 05:46:34,505 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:34,505 INFO L89 Accepts]: Start accepts. Operand has 58 places, 83 transitions, 992 flow [2022-12-06 05:46:34,506 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:34,506 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:34,506 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 83 transitions, 992 flow [2022-12-06 05:46:34,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 83 transitions, 992 flow [2022-12-06 05:46:34,544 INFO L130 PetriNetUnfolder]: 100/314 cut-off events. [2022-12-06 05:46:34,544 INFO L131 PetriNetUnfolder]: For 1547/1621 co-relation queries the response was YES. [2022-12-06 05:46:34,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1308 conditions, 314 events. 100/314 cut-off events. For 1547/1621 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 1898 event pairs, 1 based on Foata normal form. 1/306 useless extension candidates. Maximal degree in co-relation 1208. Up to 112 conditions per place. [2022-12-06 05:46:34,547 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 83 transitions, 992 flow [2022-12-06 05:46:34,548 INFO L188 LiptonReduction]: Number of co-enabled transitions 302 [2022-12-06 05:46:37,605 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:46:37,606 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3101 [2022-12-06 05:46:37,606 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 82 transitions, 1000 flow [2022-12-06 05:46:37,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:37,606 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:37,606 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:37,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 05:46:37,606 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:37,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:37,607 INFO L85 PathProgramCache]: Analyzing trace with hash -415511580, now seen corresponding path program 1 times [2022-12-06 05:46:37,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:37,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127626164] [2022-12-06 05:46:37,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:37,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:37,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:37,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:37,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:37,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127626164] [2022-12-06 05:46:37,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127626164] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:46:37,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:46:37,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:46:37,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434452785] [2022-12-06 05:46:37,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:46:37,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:46:37,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:37,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:46:37,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:46:37,704 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 33 [2022-12-06 05:46:37,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 82 transitions, 1000 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:37,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:37,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 33 [2022-12-06 05:46:37,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:37,910 INFO L130 PetriNetUnfolder]: 505/863 cut-off events. [2022-12-06 05:46:37,911 INFO L131 PetriNetUnfolder]: For 5925/5937 co-relation queries the response was YES. [2022-12-06 05:46:37,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4741 conditions, 863 events. 505/863 cut-off events. For 5925/5937 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4112 event pairs, 123 based on Foata normal form. 38/881 useless extension candidates. Maximal degree in co-relation 4479. Up to 773 conditions per place. [2022-12-06 05:46:37,918 INFO L137 encePairwiseOnDemand]: 28/33 looper letters, 74 selfloop transitions, 16 changer transitions 1/92 dead transitions. [2022-12-06 05:46:37,918 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 92 transitions, 1279 flow [2022-12-06 05:46:37,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:46:37,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:46:37,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-12-06 05:46:37,919 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40404040404040403 [2022-12-06 05:46:37,919 INFO L175 Difference]: Start difference. First operand has 57 places, 82 transitions, 1000 flow. Second operand 3 states and 40 transitions. [2022-12-06 05:46:37,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 92 transitions, 1279 flow [2022-12-06 05:46:37,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 92 transitions, 1237 flow, removed 21 selfloop flow, removed 2 redundant places. [2022-12-06 05:46:37,932 INFO L231 Difference]: Finished difference. Result has 58 places, 84 transitions, 1036 flow [2022-12-06 05:46:37,932 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=956, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1036, PETRI_PLACES=58, PETRI_TRANSITIONS=84} [2022-12-06 05:46:37,933 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 37 predicate places. [2022-12-06 05:46:37,933 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:37,934 INFO L89 Accepts]: Start accepts. Operand has 58 places, 84 transitions, 1036 flow [2022-12-06 05:46:37,936 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:37,936 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:37,936 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 84 transitions, 1036 flow [2022-12-06 05:46:37,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 84 transitions, 1036 flow [2022-12-06 05:46:37,972 INFO L130 PetriNetUnfolder]: 102/297 cut-off events. [2022-12-06 05:46:37,973 INFO L131 PetriNetUnfolder]: For 1824/1905 co-relation queries the response was YES. [2022-12-06 05:46:37,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1361 conditions, 297 events. 102/297 cut-off events. For 1824/1905 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1665 event pairs, 2 based on Foata normal form. 1/291 useless extension candidates. Maximal degree in co-relation 1189. Up to 121 conditions per place. [2022-12-06 05:46:37,976 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 84 transitions, 1036 flow [2022-12-06 05:46:37,976 INFO L188 LiptonReduction]: Number of co-enabled transitions 286 [2022-12-06 05:46:39,169 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [665] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_165| v_~f~0.base_131))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_131 (* v_~x2~0_222 4))))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_131 (* .cse0 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_131 (* .cse3 4)))) (.cse4 (select .cse1 (+ v_~f~0.offset_131 (* v_~x1~0_113 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_137)) 1 0) 0)) (= 2 |v_thread1Thread1of1ForFork1_~i~0#1_77|) (= v_~x2~0_220 (select .cse1 (+ v_~f~0.offset_131 (* .cse2 4)))) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_149| 0)) (not (= (ite (and (< .cse3 v_~size~0_137) (<= 0 .cse3)) 1 0) 0)) (< (mod (+ |v_thread2Thread1of1ForFork0_~i~1#1_187| 4294967294) 4294967296) (mod (+ 4294967295 v_~n~0_115) 4294967296)) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_137)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_123|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_149| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_123|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_59|) (not (= (ite (and (< v_~x2~0_222 v_~size~0_137) (<= 0 v_~x2~0_222)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_59| 0)) (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_137)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (= |v_thread2Thread1of1ForFork0_~i~1#1_187| 4) (not (= (ite (and (< v_~x1~0_113 v_~size~0_137) (<= 0 v_~x1~0_113)) 1 0) 0)) (< (mod (+ 4294967294 |v_thread1Thread1of1ForFork1_~i~0#1_77|) 4294967296) (mod v_~n~0_115 4294967296)) (= (select .cse1 (+ v_~f~0.offset_131 (* .cse4 4))) v_~x1~0_112)))))) InVars {~x2~0=v_~x2~0_222, ~size~0=v_~size~0_137, ~f~0.base=v_~f~0.base_131, #memory_int=|v_#memory_int_165|, ~n~0=v_~n~0_115, ~x1~0=v_~x1~0_113, ~f~0.offset=v_~f~0.offset_131} OutVars{thread2Thread1of1ForFork0_#t~mem3#1=|v_thread2Thread1of1ForFork0_#t~mem3#1_73|, thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_49|, ~x2~0=v_~x2~0_220, ~size~0=v_~size~0_137, ~f~0.base=v_~f~0.base_131, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_123|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_187|, ~x1~0=v_~x1~0_112, ~f~0.offset=v_~f~0.offset_131, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_149|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_77|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, #memory_int=|v_#memory_int_165|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_85|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_73|, ~n~0=v_~n~0_115, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_53|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_59|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork1_#t~post2#1, ~x2~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, ~x1~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork1_#t~mem1#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [628] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_21| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_6 4)))) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_6 v_~size~0_In_15) (<= 0 v_~x1~0_In_6)) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_In_4| 1) |v_thread1Thread1of1ForFork1_~i~0#1_Out_6|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|) (< (mod |v_thread1Thread1of1ForFork1_~i~0#1_In_4| 4294967296) (mod v_~n~0_In_7 4294967296))) InVars {~size~0=v_~size~0_In_15, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_4|, ~f~0.base=v_~f~0.base_In_9, #memory_int=|v_#memory_int_In_21|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_Out_10|, ~size~0=v_~size~0_In_15, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|, ~f~0.base=v_~f~0.base_In_9, #memory_int=|v_#memory_int_In_21|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_Out_6|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_18, ~f~0.offset=v_~f~0.offset_In_9, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, ~x1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:46:39,612 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:46:39,613 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1680 [2022-12-06 05:46:39,613 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 84 transitions, 1087 flow [2022-12-06 05:46:39,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:39,613 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:39,613 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:39,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 05:46:39,614 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:39,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:39,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1117401254, now seen corresponding path program 1 times [2022-12-06 05:46:39,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:39,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054329426] [2022-12-06 05:46:39,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:39,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:39,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:39,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:39,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:39,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054329426] [2022-12-06 05:46:39,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054329426] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:46:39,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:46:39,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:46:39,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478406613] [2022-12-06 05:46:39,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:46:39,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:46:39,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:39,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:46:39,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:46:39,735 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 05:46:39,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 84 transitions, 1087 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:39,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:39,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 05:46:39,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:39,945 INFO L130 PetriNetUnfolder]: 523/879 cut-off events. [2022-12-06 05:46:39,946 INFO L131 PetriNetUnfolder]: For 6098/6098 co-relation queries the response was YES. [2022-12-06 05:46:39,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4929 conditions, 879 events. 523/879 cut-off events. For 6098/6098 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4037 event pairs, 174 based on Foata normal form. 8/875 useless extension candidates. Maximal degree in co-relation 4395. Up to 868 conditions per place. [2022-12-06 05:46:39,961 INFO L137 encePairwiseOnDemand]: 31/36 looper letters, 83 selfloop transitions, 4 changer transitions 1/88 dead transitions. [2022-12-06 05:46:39,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 88 transitions, 1280 flow [2022-12-06 05:46:39,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:46:39,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:46:39,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-12-06 05:46:39,962 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37962962962962965 [2022-12-06 05:46:39,962 INFO L175 Difference]: Start difference. First operand has 58 places, 84 transitions, 1087 flow. Second operand 3 states and 41 transitions. [2022-12-06 05:46:39,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 88 transitions, 1280 flow [2022-12-06 05:46:39,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 88 transitions, 1234 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-12-06 05:46:39,976 INFO L231 Difference]: Finished difference. Result has 59 places, 84 transitions, 1048 flow [2022-12-06 05:46:39,976 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1041, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1048, PETRI_PLACES=59, PETRI_TRANSITIONS=84} [2022-12-06 05:46:39,977 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 38 predicate places. [2022-12-06 05:46:39,977 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:39,977 INFO L89 Accepts]: Start accepts. Operand has 59 places, 84 transitions, 1048 flow [2022-12-06 05:46:39,977 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:39,977 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:39,978 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 84 transitions, 1048 flow [2022-12-06 05:46:39,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 84 transitions, 1048 flow [2022-12-06 05:46:40,015 INFO L130 PetriNetUnfolder]: 102/298 cut-off events. [2022-12-06 05:46:40,016 INFO L131 PetriNetUnfolder]: For 1810/1886 co-relation queries the response was YES. [2022-12-06 05:46:40,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1334 conditions, 298 events. 102/298 cut-off events. For 1810/1886 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1698 event pairs, 2 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1236. Up to 123 conditions per place. [2022-12-06 05:46:40,019 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 84 transitions, 1048 flow [2022-12-06 05:46:40,019 INFO L188 LiptonReduction]: Number of co-enabled transitions 290 [2022-12-06 05:46:43,650 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:46:43,651 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3674 [2022-12-06 05:46:43,651 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 83 transitions, 1056 flow [2022-12-06 05:46:43,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:43,651 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:43,651 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:43,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 05:46:43,652 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:43,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:43,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1478813126, now seen corresponding path program 1 times [2022-12-06 05:46:43,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:43,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944671656] [2022-12-06 05:46:43,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:43,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:43,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:44,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:44,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:44,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944671656] [2022-12-06 05:46:44,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944671656] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:46:44,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551135224] [2022-12-06 05:46:44,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:44,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:46:44,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:46:44,751 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:46:44,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 05:46:44,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:44,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-06 05:46:44,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:46:45,088 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:46:45,089 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 52 treesize of output 44 [2022-12-06 05:46:45,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:45,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:46:45,326 INFO L321 Elim1Store]: treesize reduction 15, result has 90.4 percent of original size [2022-12-06 05:46:45,327 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 71 treesize of output 180 [2022-12-06 05:46:45,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:45,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551135224] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:46:45,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:46:45,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 2] total 7 [2022-12-06 05:46:45,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506518721] [2022-12-06 05:46:45,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:46:45,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:46:45,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:45,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:46:45,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:46:45,584 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 36 [2022-12-06 05:46:45,584 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 83 transitions, 1056 flow. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:45,584 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:45,584 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 36 [2022-12-06 05:46:45,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:46,389 INFO L130 PetriNetUnfolder]: 698/1229 cut-off events. [2022-12-06 05:46:46,389 INFO L131 PetriNetUnfolder]: For 8033/8049 co-relation queries the response was YES. [2022-12-06 05:46:46,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6696 conditions, 1229 events. 698/1229 cut-off events. For 8033/8049 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 6618 event pairs, 2 based on Foata normal form. 20/1237 useless extension candidates. Maximal degree in co-relation 6222. Up to 772 conditions per place. [2022-12-06 05:46:46,398 INFO L137 encePairwiseOnDemand]: 8/36 looper letters, 54 selfloop transitions, 94 changer transitions 14/163 dead transitions. [2022-12-06 05:46:46,398 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 163 transitions, 1937 flow [2022-12-06 05:46:46,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:46:46,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:46:46,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2022-12-06 05:46:46,399 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-06 05:46:46,399 INFO L175 Difference]: Start difference. First operand has 57 places, 83 transitions, 1056 flow. Second operand 10 states and 108 transitions. [2022-12-06 05:46:46,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 163 transitions, 1937 flow [2022-12-06 05:46:46,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 163 transitions, 1883 flow, removed 27 selfloop flow, removed 2 redundant places. [2022-12-06 05:46:46,421 INFO L231 Difference]: Finished difference. Result has 69 places, 129 transitions, 1786 flow [2022-12-06 05:46:46,421 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1020, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1786, PETRI_PLACES=69, PETRI_TRANSITIONS=129} [2022-12-06 05:46:46,422 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 48 predicate places. [2022-12-06 05:46:46,422 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:46,422 INFO L89 Accepts]: Start accepts. Operand has 69 places, 129 transitions, 1786 flow [2022-12-06 05:46:46,423 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:46,423 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:46,423 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 129 transitions, 1786 flow [2022-12-06 05:46:46,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 129 transitions, 1786 flow [2022-12-06 05:46:46,487 INFO L130 PetriNetUnfolder]: 181/488 cut-off events. [2022-12-06 05:46:46,487 INFO L131 PetriNetUnfolder]: For 3004/3005 co-relation queries the response was YES. [2022-12-06 05:46:46,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2484 conditions, 488 events. 181/488 cut-off events. For 3004/3005 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3080 event pairs, 0 based on Foata normal form. 0/481 useless extension candidates. Maximal degree in co-relation 1918. Up to 203 conditions per place. [2022-12-06 05:46:46,492 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 129 transitions, 1786 flow [2022-12-06 05:46:46,492 INFO L188 LiptonReduction]: Number of co-enabled transitions 396 [2022-12-06 05:46:46,514 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [629] L49-2-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork1_~i~0#1_In_6| 4294967296) (mod v_~n~0_In_9 4294967296))) (= 0 |v_thread1Thread1of1ForFork1_#res#1.base_Out_4|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_6|} OutVars{thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_Out_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_Out_4|, ~n~0=v_~n~0_In_9, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base] and [634] L59-2-->thread2EXIT: Formula: (let ((.cse3 (mod |v_thread2Thread1of1ForFork0_~i~1#1_116| 4294967296))) (and (let ((.cse0 (< .cse3 (mod v_~n~0_69 4294967296))) (.cse1 (= |v_thread2Thread1of1ForFork0_#res#1.base_19| 0)) (.cse2 (= |v_thread2Thread1of1ForFork0_#res#1.offset_19| 0))) (or (and (not .cse0) (= |v_thread2Thread1of1ForFork0_#t~post8#1_28| |v_thread2Thread1of1ForFork0_#t~post8#1_27|) (= |v_thread2Thread1of1ForFork0_#t~mem7#1_32| |v_thread2Thread1of1ForFork0_#t~mem7#1_31|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_64| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_63|) .cse1 (= v_~x2~0_127 v_~x2~0_126) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_89| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|) (= |v_thread2Thread1of1ForFork0_~i~1#1_116| |v_thread2Thread1of1ForFork0_~i~1#1_115|) .cse2) (and (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_89| 0)) .cse0 (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_89| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_63|) .cse1 (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_116| 1) |v_thread2Thread1of1ForFork0_~i~1#1_115|) (= (select (select |v_#memory_int_119| v_~f~0.base_87) (+ v_~f~0.offset_87 (* v_~x2~0_127 4))) v_~x2~0_126) (= (ite (and (<= 0 v_~x2~0_127) (< v_~x2~0_127 v_~size~0_93)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_63|) .cse2))) (not (< .cse3 (mod (+ v_~n~0_69 4294967295) 4294967296))))) InVars {~x2~0=v_~x2~0_127, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, ~size~0=v_~size~0_93, ~f~0.base=v_~f~0.base_87, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_64|, #memory_int=|v_#memory_int_119|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_116|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_32|, ~n~0=v_~n~0_69, ~f~0.offset=v_~f~0.offset_87, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_28|} OutVars{~x2~0=v_~x2~0_126, ~size~0=v_~size~0_93, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_19|, ~f~0.base=v_~f~0.base_87, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_63|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_115|, ~f~0.offset=v_~f~0.offset_87, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_89|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_19|, #memory_int=|v_#memory_int_119|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_31|, ~n~0=v_~n~0_69, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_27|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~post8#1] [2022-12-06 05:46:46,774 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [629] L49-2-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork1_~i~0#1_In_6| 4294967296) (mod v_~n~0_In_9 4294967296))) (= 0 |v_thread1Thread1of1ForFork1_#res#1.base_Out_4|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_6|} OutVars{thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_Out_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_Out_4|, ~n~0=v_~n~0_In_9, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base] and [634] L59-2-->thread2EXIT: Formula: (let ((.cse3 (mod |v_thread2Thread1of1ForFork0_~i~1#1_116| 4294967296))) (and (let ((.cse0 (< .cse3 (mod v_~n~0_69 4294967296))) (.cse1 (= |v_thread2Thread1of1ForFork0_#res#1.base_19| 0)) (.cse2 (= |v_thread2Thread1of1ForFork0_#res#1.offset_19| 0))) (or (and (not .cse0) (= |v_thread2Thread1of1ForFork0_#t~post8#1_28| |v_thread2Thread1of1ForFork0_#t~post8#1_27|) (= |v_thread2Thread1of1ForFork0_#t~mem7#1_32| |v_thread2Thread1of1ForFork0_#t~mem7#1_31|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_64| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_63|) .cse1 (= v_~x2~0_127 v_~x2~0_126) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_89| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|) (= |v_thread2Thread1of1ForFork0_~i~1#1_116| |v_thread2Thread1of1ForFork0_~i~1#1_115|) .cse2) (and (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_89| 0)) .cse0 (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_89| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_63|) .cse1 (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_116| 1) |v_thread2Thread1of1ForFork0_~i~1#1_115|) (= (select (select |v_#memory_int_119| v_~f~0.base_87) (+ v_~f~0.offset_87 (* v_~x2~0_127 4))) v_~x2~0_126) (= (ite (and (<= 0 v_~x2~0_127) (< v_~x2~0_127 v_~size~0_93)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_63|) .cse2))) (not (< .cse3 (mod (+ v_~n~0_69 4294967295) 4294967296))))) InVars {~x2~0=v_~x2~0_127, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, ~size~0=v_~size~0_93, ~f~0.base=v_~f~0.base_87, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_64|, #memory_int=|v_#memory_int_119|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_116|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_32|, ~n~0=v_~n~0_69, ~f~0.offset=v_~f~0.offset_87, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_28|} OutVars{~x2~0=v_~x2~0_126, ~size~0=v_~size~0_93, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_19|, ~f~0.base=v_~f~0.base_87, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_63|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_115|, ~f~0.offset=v_~f~0.offset_87, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_89|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_19|, #memory_int=|v_#memory_int_119|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_31|, ~n~0=v_~n~0_69, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_27|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~post8#1] [2022-12-06 05:46:47,044 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [629] L49-2-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork1_~i~0#1_In_6| 4294967296) (mod v_~n~0_In_9 4294967296))) (= 0 |v_thread1Thread1of1ForFork1_#res#1.base_Out_4|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_6|} OutVars{thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_Out_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_Out_4|, ~n~0=v_~n~0_In_9, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base] and [634] L59-2-->thread2EXIT: Formula: (let ((.cse3 (mod |v_thread2Thread1of1ForFork0_~i~1#1_116| 4294967296))) (and (let ((.cse0 (< .cse3 (mod v_~n~0_69 4294967296))) (.cse1 (= |v_thread2Thread1of1ForFork0_#res#1.base_19| 0)) (.cse2 (= |v_thread2Thread1of1ForFork0_#res#1.offset_19| 0))) (or (and (not .cse0) (= |v_thread2Thread1of1ForFork0_#t~post8#1_28| |v_thread2Thread1of1ForFork0_#t~post8#1_27|) (= |v_thread2Thread1of1ForFork0_#t~mem7#1_32| |v_thread2Thread1of1ForFork0_#t~mem7#1_31|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_64| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_63|) .cse1 (= v_~x2~0_127 v_~x2~0_126) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_89| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|) (= |v_thread2Thread1of1ForFork0_~i~1#1_116| |v_thread2Thread1of1ForFork0_~i~1#1_115|) .cse2) (and (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_89| 0)) .cse0 (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_89| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_63|) .cse1 (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_116| 1) |v_thread2Thread1of1ForFork0_~i~1#1_115|) (= (select (select |v_#memory_int_119| v_~f~0.base_87) (+ v_~f~0.offset_87 (* v_~x2~0_127 4))) v_~x2~0_126) (= (ite (and (<= 0 v_~x2~0_127) (< v_~x2~0_127 v_~size~0_93)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_63|) .cse2))) (not (< .cse3 (mod (+ v_~n~0_69 4294967295) 4294967296))))) InVars {~x2~0=v_~x2~0_127, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, ~size~0=v_~size~0_93, ~f~0.base=v_~f~0.base_87, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_64|, #memory_int=|v_#memory_int_119|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_116|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_32|, ~n~0=v_~n~0_69, ~f~0.offset=v_~f~0.offset_87, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_28|} OutVars{~x2~0=v_~x2~0_126, ~size~0=v_~size~0_93, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_19|, ~f~0.base=v_~f~0.base_87, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_63|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_115|, ~f~0.offset=v_~f~0.offset_87, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_89|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_19|, #memory_int=|v_#memory_int_119|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_31|, ~n~0=v_~n~0_69, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_27|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~post8#1] [2022-12-06 05:46:47,286 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [629] L49-2-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork1_~i~0#1_In_6| 4294967296) (mod v_~n~0_In_9 4294967296))) (= 0 |v_thread1Thread1of1ForFork1_#res#1.base_Out_4|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_6|} OutVars{thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_Out_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_Out_4|, ~n~0=v_~n~0_In_9, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base] and [634] L59-2-->thread2EXIT: Formula: (let ((.cse3 (mod |v_thread2Thread1of1ForFork0_~i~1#1_116| 4294967296))) (and (let ((.cse0 (< .cse3 (mod v_~n~0_69 4294967296))) (.cse1 (= |v_thread2Thread1of1ForFork0_#res#1.base_19| 0)) (.cse2 (= |v_thread2Thread1of1ForFork0_#res#1.offset_19| 0))) (or (and (not .cse0) (= |v_thread2Thread1of1ForFork0_#t~post8#1_28| |v_thread2Thread1of1ForFork0_#t~post8#1_27|) (= |v_thread2Thread1of1ForFork0_#t~mem7#1_32| |v_thread2Thread1of1ForFork0_#t~mem7#1_31|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_64| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_63|) .cse1 (= v_~x2~0_127 v_~x2~0_126) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_89| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|) (= |v_thread2Thread1of1ForFork0_~i~1#1_116| |v_thread2Thread1of1ForFork0_~i~1#1_115|) .cse2) (and (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_89| 0)) .cse0 (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_89| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_63|) .cse1 (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_116| 1) |v_thread2Thread1of1ForFork0_~i~1#1_115|) (= (select (select |v_#memory_int_119| v_~f~0.base_87) (+ v_~f~0.offset_87 (* v_~x2~0_127 4))) v_~x2~0_126) (= (ite (and (<= 0 v_~x2~0_127) (< v_~x2~0_127 v_~size~0_93)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_63|) .cse2))) (not (< .cse3 (mod (+ v_~n~0_69 4294967295) 4294967296))))) InVars {~x2~0=v_~x2~0_127, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, ~size~0=v_~size~0_93, ~f~0.base=v_~f~0.base_87, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_64|, #memory_int=|v_#memory_int_119|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_116|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_32|, ~n~0=v_~n~0_69, ~f~0.offset=v_~f~0.offset_87, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_28|} OutVars{~x2~0=v_~x2~0_126, ~size~0=v_~size~0_93, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_19|, ~f~0.base=v_~f~0.base_87, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_63|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_115|, ~f~0.offset=v_~f~0.offset_87, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_89|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_19|, #memory_int=|v_#memory_int_119|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_31|, ~n~0=v_~n~0_69, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_27|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~post8#1] [2022-12-06 05:46:47,502 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [629] L49-2-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork1_~i~0#1_In_6| 4294967296) (mod v_~n~0_In_9 4294967296))) (= 0 |v_thread1Thread1of1ForFork1_#res#1.base_Out_4|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_6|} OutVars{thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_Out_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_Out_4|, ~n~0=v_~n~0_In_9, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base] and [635] L59-2-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_121| v_~f~0.base_89))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_89 (* v_~x2~0_131 4))))) (and (= |v_thread2Thread1of1ForFork0_~i~1#1_119| (+ 2 |v_thread2Thread1of1ForFork0_~i~1#1_120|)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_120| 4294967296) (mod (+ v_~n~0_71 4294967295) 4294967296)) (= (ite (and (< .cse0 v_~size~0_95) (<= 0 .cse0)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_67|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_93| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_67|) (= v_~x2~0_130 (select .cse1 (+ v_~f~0.offset_89 (* .cse0 4)))) (not (= (ite (and (< v_~x2~0_131 v_~size~0_95) (<= 0 v_~x2~0_131)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_93| 0))))) InVars {~x2~0=v_~x2~0_131, ~size~0=v_~size~0_95, ~f~0.base=v_~f~0.base_89, #memory_int=|v_#memory_int_121|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_120|, ~n~0=v_~n~0_71, ~f~0.offset=v_~f~0.offset_89} OutVars{thread2Thread1of1ForFork0_#t~mem3#1=|v_thread2Thread1of1ForFork0_#t~mem3#1_27|, ~x2~0=v_~x2~0_130, ~size~0=v_~size~0_95, ~f~0.base=v_~f~0.base_89, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_67|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_119|, ~f~0.offset=v_~f~0.offset_89, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_93|, #memory_int=|v_#memory_int_121|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_39|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_27|, ~n~0=v_~n~0_71, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem3#1, ~x2~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1] [2022-12-06 05:46:47,618 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [629] L49-2-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork1_~i~0#1_In_6| 4294967296) (mod v_~n~0_In_9 4294967296))) (= 0 |v_thread1Thread1of1ForFork1_#res#1.base_Out_4|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_6|} OutVars{thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_Out_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_Out_4|, ~n~0=v_~n~0_In_9, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base] and [635] L59-2-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_121| v_~f~0.base_89))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_89 (* v_~x2~0_131 4))))) (and (= |v_thread2Thread1of1ForFork0_~i~1#1_119| (+ 2 |v_thread2Thread1of1ForFork0_~i~1#1_120|)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_120| 4294967296) (mod (+ v_~n~0_71 4294967295) 4294967296)) (= (ite (and (< .cse0 v_~size~0_95) (<= 0 .cse0)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_67|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_93| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_67|) (= v_~x2~0_130 (select .cse1 (+ v_~f~0.offset_89 (* .cse0 4)))) (not (= (ite (and (< v_~x2~0_131 v_~size~0_95) (<= 0 v_~x2~0_131)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_93| 0))))) InVars {~x2~0=v_~x2~0_131, ~size~0=v_~size~0_95, ~f~0.base=v_~f~0.base_89, #memory_int=|v_#memory_int_121|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_120|, ~n~0=v_~n~0_71, ~f~0.offset=v_~f~0.offset_89} OutVars{thread2Thread1of1ForFork0_#t~mem3#1=|v_thread2Thread1of1ForFork0_#t~mem3#1_27|, ~x2~0=v_~x2~0_130, ~size~0=v_~size~0_95, ~f~0.base=v_~f~0.base_89, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_67|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_119|, ~f~0.offset=v_~f~0.offset_89, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_93|, #memory_int=|v_#memory_int_121|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_39|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_27|, ~n~0=v_~n~0_71, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem3#1, ~x2~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1] [2022-12-06 05:46:47,738 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:46:47,739 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1317 [2022-12-06 05:46:47,739 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 129 transitions, 1834 flow [2022-12-06 05:46:47,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:47,739 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:47,739 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:47,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 05:46:47,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-06 05:46:47,952 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:47,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:47,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1329054777, now seen corresponding path program 1 times [2022-12-06 05:46:47,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:47,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691490737] [2022-12-06 05:46:47,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:47,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:47,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:48,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:48,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:48,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691490737] [2022-12-06 05:46:48,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691490737] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:46:48,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:46:48,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:46:48,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045252630] [2022-12-06 05:46:48,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:46:48,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:46:48,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:48,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:46:48,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:46:48,057 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 05:46:48,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 129 transitions, 1834 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:48,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:48,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 05:46:48,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:48,361 INFO L130 PetriNetUnfolder]: 682/1194 cut-off events. [2022-12-06 05:46:48,361 INFO L131 PetriNetUnfolder]: For 9404/9404 co-relation queries the response was YES. [2022-12-06 05:46:48,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7387 conditions, 1194 events. 682/1194 cut-off events. For 9404/9404 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 6280 event pairs, 194 based on Foata normal form. 12/1199 useless extension candidates. Maximal degree in co-relation 5675. Up to 1180 conditions per place. [2022-12-06 05:46:48,374 INFO L137 encePairwiseOnDemand]: 37/42 looper letters, 127 selfloop transitions, 5 changer transitions 1/133 dead transitions. [2022-12-06 05:46:48,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 133 transitions, 2120 flow [2022-12-06 05:46:48,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:46:48,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:46:48,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-06 05:46:48,376 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.373015873015873 [2022-12-06 05:46:48,376 INFO L175 Difference]: Start difference. First operand has 68 places, 129 transitions, 1834 flow. Second operand 3 states and 47 transitions. [2022-12-06 05:46:48,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 133 transitions, 2120 flow [2022-12-06 05:46:48,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 133 transitions, 1928 flow, removed 95 selfloop flow, removed 2 redundant places. [2022-12-06 05:46:48,407 INFO L231 Difference]: Finished difference. Result has 69 places, 129 transitions, 1668 flow [2022-12-06 05:46:48,407 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1644, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1668, PETRI_PLACES=69, PETRI_TRANSITIONS=129} [2022-12-06 05:46:48,408 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 48 predicate places. [2022-12-06 05:46:48,408 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:48,408 INFO L89 Accepts]: Start accepts. Operand has 69 places, 129 transitions, 1668 flow [2022-12-06 05:46:48,409 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:48,409 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:48,409 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 129 transitions, 1668 flow [2022-12-06 05:46:48,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 129 transitions, 1668 flow [2022-12-06 05:46:48,468 INFO L130 PetriNetUnfolder]: 179/459 cut-off events. [2022-12-06 05:46:48,469 INFO L131 PetriNetUnfolder]: For 2593/2594 co-relation queries the response was YES. [2022-12-06 05:46:48,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2283 conditions, 459 events. 179/459 cut-off events. For 2593/2594 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2761 event pairs, 0 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 2172. Up to 201 conditions per place. [2022-12-06 05:46:48,474 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 129 transitions, 1668 flow [2022-12-06 05:46:48,474 INFO L188 LiptonReduction]: Number of co-enabled transitions 372 [2022-12-06 05:46:48,475 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:46:48,475 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 67 [2022-12-06 05:46:48,476 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 129 transitions, 1668 flow [2022-12-06 05:46:48,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:48,476 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:48,476 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:48,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-06 05:46:48,476 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:48,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:48,476 INFO L85 PathProgramCache]: Analyzing trace with hash 439020046, now seen corresponding path program 1 times [2022-12-06 05:46:48,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:48,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182113272] [2022-12-06 05:46:48,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:48,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:48,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:48,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:48,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:48,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182113272] [2022-12-06 05:46:48,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182113272] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:46:48,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:46:48,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:46:48,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64249828] [2022-12-06 05:46:48,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:46:48,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:46:48,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:48,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:46:48,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:46:48,571 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-06 05:46:48,571 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 129 transitions, 1668 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:48,571 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:48,571 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-06 05:46:48,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:48,972 INFO L130 PetriNetUnfolder]: 664/1148 cut-off events. [2022-12-06 05:46:48,973 INFO L131 PetriNetUnfolder]: For 7845/7861 co-relation queries the response was YES. [2022-12-06 05:46:48,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6893 conditions, 1148 events. 664/1148 cut-off events. For 7845/7861 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 5893 event pairs, 164 based on Foata normal form. 20/1149 useless extension candidates. Maximal degree in co-relation 6547. Up to 1044 conditions per place. [2022-12-06 05:46:48,981 INFO L137 encePairwiseOnDemand]: 35/42 looper letters, 131 selfloop transitions, 17 changer transitions 0/149 dead transitions. [2022-12-06 05:46:48,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 149 transitions, 2127 flow [2022-12-06 05:46:48,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:46:48,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:46:48,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-12-06 05:46:48,983 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2904761904761905 [2022-12-06 05:46:48,983 INFO L175 Difference]: Start difference. First operand has 68 places, 129 transitions, 1668 flow. Second operand 5 states and 61 transitions. [2022-12-06 05:46:48,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 149 transitions, 2127 flow [2022-12-06 05:46:49,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 149 transitions, 2068 flow, removed 17 selfloop flow, removed 4 redundant places. [2022-12-06 05:46:49,008 INFO L231 Difference]: Finished difference. Result has 71 places, 133 transitions, 1718 flow [2022-12-06 05:46:49,009 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1611, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1718, PETRI_PLACES=71, PETRI_TRANSITIONS=133} [2022-12-06 05:46:49,009 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 50 predicate places. [2022-12-06 05:46:49,009 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:49,009 INFO L89 Accepts]: Start accepts. Operand has 71 places, 133 transitions, 1718 flow [2022-12-06 05:46:49,011 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:49,011 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:49,011 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 133 transitions, 1718 flow [2022-12-06 05:46:49,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 133 transitions, 1718 flow [2022-12-06 05:46:49,070 INFO L130 PetriNetUnfolder]: 181/478 cut-off events. [2022-12-06 05:46:49,070 INFO L131 PetriNetUnfolder]: For 2795/2797 co-relation queries the response was YES. [2022-12-06 05:46:49,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2383 conditions, 478 events. 181/478 cut-off events. For 2795/2797 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 2945 event pairs, 0 based on Foata normal form. 1/473 useless extension candidates. Maximal degree in co-relation 2238. Up to 210 conditions per place. [2022-12-06 05:46:49,074 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 133 transitions, 1718 flow [2022-12-06 05:46:49,074 INFO L188 LiptonReduction]: Number of co-enabled transitions 380 [2022-12-06 05:46:49,327 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:46:49,328 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 319 [2022-12-06 05:46:49,328 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 132 transitions, 1716 flow [2022-12-06 05:46:49,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:49,328 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:49,328 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:49,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-06 05:46:49,329 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:49,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:49,329 INFO L85 PathProgramCache]: Analyzing trace with hash 153917828, now seen corresponding path program 1 times [2022-12-06 05:46:49,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:49,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607172733] [2022-12-06 05:46:49,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:49,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:49,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:49,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:49,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607172733] [2022-12-06 05:46:49,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607172733] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:46:49,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:46:49,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:46:49,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224646064] [2022-12-06 05:46:49,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:46:49,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:46:49,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:49,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:46:49,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:46:49,448 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 44 [2022-12-06 05:46:49,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 132 transitions, 1716 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:49,448 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:49,448 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 44 [2022-12-06 05:46:49,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:49,834 INFO L130 PetriNetUnfolder]: 664/1151 cut-off events. [2022-12-06 05:46:49,834 INFO L131 PetriNetUnfolder]: For 8195/8227 co-relation queries the response was YES. [2022-12-06 05:46:49,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6949 conditions, 1151 events. 664/1151 cut-off events. For 8195/8227 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 5956 event pairs, 43 based on Foata normal form. 17/1157 useless extension candidates. Maximal degree in co-relation 6484. Up to 1115 conditions per place. [2022-12-06 05:46:49,842 INFO L137 encePairwiseOnDemand]: 22/44 looper letters, 99 selfloop transitions, 41 changer transitions 4/145 dead transitions. [2022-12-06 05:46:49,842 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 145 transitions, 2058 flow [2022-12-06 05:46:49,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:46:49,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:46:49,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-12-06 05:46:49,843 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33636363636363636 [2022-12-06 05:46:49,843 INFO L175 Difference]: Start difference. First operand has 70 places, 132 transitions, 1716 flow. Second operand 5 states and 74 transitions. [2022-12-06 05:46:49,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 145 transitions, 2058 flow [2022-12-06 05:46:49,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 145 transitions, 2020 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-06 05:46:49,873 INFO L231 Difference]: Finished difference. Result has 73 places, 133 transitions, 1792 flow [2022-12-06 05:46:49,873 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1682, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1792, PETRI_PLACES=73, PETRI_TRANSITIONS=133} [2022-12-06 05:46:49,873 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 52 predicate places. [2022-12-06 05:46:49,873 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:49,873 INFO L89 Accepts]: Start accepts. Operand has 73 places, 133 transitions, 1792 flow [2022-12-06 05:46:49,874 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:49,874 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:49,874 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 133 transitions, 1792 flow [2022-12-06 05:46:49,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 133 transitions, 1792 flow [2022-12-06 05:46:49,933 INFO L130 PetriNetUnfolder]: 180/480 cut-off events. [2022-12-06 05:46:49,933 INFO L131 PetriNetUnfolder]: For 2855/2857 co-relation queries the response was YES. [2022-12-06 05:46:49,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2405 conditions, 480 events. 180/480 cut-off events. For 2855/2857 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 2982 event pairs, 0 based on Foata normal form. 1/475 useless extension candidates. Maximal degree in co-relation 2257. Up to 210 conditions per place. [2022-12-06 05:46:49,937 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 133 transitions, 1792 flow [2022-12-06 05:46:49,937 INFO L188 LiptonReduction]: Number of co-enabled transitions 380 [2022-12-06 05:46:49,942 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [647] $Ultimate##0-->thread2EXIT: Formula: (and (= (select (select |v_#memory_int_141| v_~f~0.base_107) (+ v_~f~0.offset_107 (* v_~x2~0_161 4))) v_~x2~0_160) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_111| 0)) (= (ite (and (<= 0 v_~x2~0_161) (< v_~x2~0_161 v_~size~0_113)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_85|) (= |v_thread2Thread1of1ForFork0_~i~1#1_143| 1) (= |v_thread2Thread1of1ForFork0_#res#1.base_21| 0) (<= (mod (+ v_~n~0_91 4294967295) 4294967296) 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_21| 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_111| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_85|)) InVars {~x2~0=v_~x2~0_161, ~size~0=v_~size~0_113, ~f~0.base=v_~f~0.base_107, #memory_int=|v_#memory_int_141|, ~n~0=v_~n~0_91, ~f~0.offset=v_~f~0.offset_107} OutVars{~x2~0=v_~x2~0_160, ~size~0=v_~size~0_113, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_21|, ~f~0.base=v_~f~0.base_107, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_85|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_143|, ~f~0.offset=v_~f~0.offset_107, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_111|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_21|, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_35|, ~n~0=v_~n~0_91, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_31|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~post8#1] and [639] $Ultimate##0-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_33| (ite (and (<= 0 v_~x1~0_81) (< v_~x1~0_81 v_~size~0_101)) 1 0)) (= |v_thread1Thread1of1ForFork1_~i~0#1_51| 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_33| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_41|) (= v_~x1~0_80 (select (select |v_#memory_int_129| v_~f~0.base_95) (+ v_~f~0.offset_95 (* v_~x1~0_81 4)))) (< (mod (+ 4294967295 |v_thread1Thread1of1ForFork1_~i~0#1_51|) 4294967296) (mod v_~n~0_79 4294967296)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_41| 0))) InVars {~size~0=v_~size~0_101, ~f~0.base=v_~f~0.base_95, #memory_int=|v_#memory_int_129|, ~n~0=v_~n~0_79, ~x1~0=v_~x1~0_81, ~f~0.offset=v_~f~0.offset_95} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_31|, ~size~0=v_~size~0_101, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_51|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_33|, ~f~0.base=v_~f~0.base_95, #memory_int=|v_#memory_int_129|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_35|, ~n~0=v_~n~0_79, ~x1~0=v_~x1~0_80, ~f~0.offset=v_~f~0.offset_95, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_41|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, ~x1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:46:50,098 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [647] $Ultimate##0-->thread2EXIT: Formula: (and (= (select (select |v_#memory_int_141| v_~f~0.base_107) (+ v_~f~0.offset_107 (* v_~x2~0_161 4))) v_~x2~0_160) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_111| 0)) (= (ite (and (<= 0 v_~x2~0_161) (< v_~x2~0_161 v_~size~0_113)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_85|) (= |v_thread2Thread1of1ForFork0_~i~1#1_143| 1) (= |v_thread2Thread1of1ForFork0_#res#1.base_21| 0) (<= (mod (+ v_~n~0_91 4294967295) 4294967296) 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_21| 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_111| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_85|)) InVars {~x2~0=v_~x2~0_161, ~size~0=v_~size~0_113, ~f~0.base=v_~f~0.base_107, #memory_int=|v_#memory_int_141|, ~n~0=v_~n~0_91, ~f~0.offset=v_~f~0.offset_107} OutVars{~x2~0=v_~x2~0_160, ~size~0=v_~size~0_113, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_21|, ~f~0.base=v_~f~0.base_107, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_85|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_143|, ~f~0.offset=v_~f~0.offset_107, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_111|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_21|, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_35|, ~n~0=v_~n~0_91, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_31|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~post8#1] and [639] $Ultimate##0-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_33| (ite (and (<= 0 v_~x1~0_81) (< v_~x1~0_81 v_~size~0_101)) 1 0)) (= |v_thread1Thread1of1ForFork1_~i~0#1_51| 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_33| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_41|) (= v_~x1~0_80 (select (select |v_#memory_int_129| v_~f~0.base_95) (+ v_~f~0.offset_95 (* v_~x1~0_81 4)))) (< (mod (+ 4294967295 |v_thread1Thread1of1ForFork1_~i~0#1_51|) 4294967296) (mod v_~n~0_79 4294967296)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_41| 0))) InVars {~size~0=v_~size~0_101, ~f~0.base=v_~f~0.base_95, #memory_int=|v_#memory_int_129|, ~n~0=v_~n~0_79, ~x1~0=v_~x1~0_81, ~f~0.offset=v_~f~0.offset_95} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_31|, ~size~0=v_~size~0_101, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_51|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_33|, ~f~0.base=v_~f~0.base_95, #memory_int=|v_#memory_int_129|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_35|, ~n~0=v_~n~0_79, ~x1~0=v_~x1~0_80, ~f~0.offset=v_~f~0.offset_95, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_41|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, ~x1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:46:50,259 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:46:50,259 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 386 [2022-12-06 05:46:50,260 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 132 transitions, 1790 flow [2022-12-06 05:46:50,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:50,260 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:50,260 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:50,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-06 05:46:50,260 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:50,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:50,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1938983425, now seen corresponding path program 1 times [2022-12-06 05:46:50,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:50,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857054220] [2022-12-06 05:46:50,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:50,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:50,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:50,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:50,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:50,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857054220] [2022-12-06 05:46:50,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857054220] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:46:50,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:46:50,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:46:50,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015961276] [2022-12-06 05:46:50,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:46:50,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:46:50,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:50,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:46:50,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:46:50,346 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 05:46:50,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 132 transitions, 1790 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:50,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:50,346 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 05:46:50,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:50,630 INFO L130 PetriNetUnfolder]: 687/1192 cut-off events. [2022-12-06 05:46:50,630 INFO L131 PetriNetUnfolder]: For 8513/8513 co-relation queries the response was YES. [2022-12-06 05:46:50,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7135 conditions, 1192 events. 687/1192 cut-off events. For 8513/8513 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 6157 event pairs, 198 based on Foata normal form. 12/1197 useless extension candidates. Maximal degree in co-relation 6656. Up to 1175 conditions per place. [2022-12-06 05:46:50,638 INFO L137 encePairwiseOnDemand]: 42/46 looper letters, 131 selfloop transitions, 7 changer transitions 0/138 dead transitions. [2022-12-06 05:46:50,638 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 138 transitions, 2099 flow [2022-12-06 05:46:50,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:46:50,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:46:50,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-12-06 05:46:50,640 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38405797101449274 [2022-12-06 05:46:50,641 INFO L175 Difference]: Start difference. First operand has 72 places, 132 transitions, 1790 flow. Second operand 3 states and 53 transitions. [2022-12-06 05:46:50,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 138 transitions, 2099 flow [2022-12-06 05:46:50,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 138 transitions, 2026 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 05:46:50,665 INFO L231 Difference]: Finished difference. Result has 73 places, 134 transitions, 1767 flow [2022-12-06 05:46:50,665 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1694, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1767, PETRI_PLACES=73, PETRI_TRANSITIONS=134} [2022-12-06 05:46:50,665 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 52 predicate places. [2022-12-06 05:46:50,665 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:50,665 INFO L89 Accepts]: Start accepts. Operand has 73 places, 134 transitions, 1767 flow [2022-12-06 05:46:50,666 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:50,666 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:50,666 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 134 transitions, 1767 flow [2022-12-06 05:46:50,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 134 transitions, 1767 flow [2022-12-06 05:46:50,718 INFO L130 PetriNetUnfolder]: 181/484 cut-off events. [2022-12-06 05:46:50,719 INFO L131 PetriNetUnfolder]: For 2873/2873 co-relation queries the response was YES. [2022-12-06 05:46:50,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2429 conditions, 484 events. 181/484 cut-off events. For 2873/2873 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3026 event pairs, 1 based on Foata normal form. 0/478 useless extension candidates. Maximal degree in co-relation 2277. Up to 212 conditions per place. [2022-12-06 05:46:50,721 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 134 transitions, 1767 flow [2022-12-06 05:46:50,721 INFO L188 LiptonReduction]: Number of co-enabled transitions 376 [2022-12-06 05:46:50,722 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:46:50,722 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 57 [2022-12-06 05:46:50,723 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 134 transitions, 1767 flow [2022-12-06 05:46:50,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:50,723 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:50,723 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:50,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-06 05:46:50,723 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:50,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:50,723 INFO L85 PathProgramCache]: Analyzing trace with hash -166629348, now seen corresponding path program 1 times [2022-12-06 05:46:50,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:50,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435803177] [2022-12-06 05:46:50,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:50,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:50,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:50,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:50,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:50,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435803177] [2022-12-06 05:46:50,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435803177] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:46:50,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:46:50,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:46:50,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194336157] [2022-12-06 05:46:50,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:46:50,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:46:50,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:50,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:46:50,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:46:50,871 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 05:46:50,871 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 134 transitions, 1767 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:50,871 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:50,871 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 05:46:50,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:51,318 INFO L130 PetriNetUnfolder]: 686/1195 cut-off events. [2022-12-06 05:46:51,318 INFO L131 PetriNetUnfolder]: For 8406/8406 co-relation queries the response was YES. [2022-12-06 05:46:51,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7209 conditions, 1195 events. 686/1195 cut-off events. For 8406/8406 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 6220 event pairs, 178 based on Foata normal form. 8/1196 useless extension candidates. Maximal degree in co-relation 6740. Up to 1073 conditions per place. [2022-12-06 05:46:51,324 INFO L137 encePairwiseOnDemand]: 37/46 looper letters, 111 selfloop transitions, 37 changer transitions 0/148 dead transitions. [2022-12-06 05:46:51,324 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 148 transitions, 2229 flow [2022-12-06 05:46:51,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:46:51,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:46:51,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-12-06 05:46:51,325 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30434782608695654 [2022-12-06 05:46:51,325 INFO L175 Difference]: Start difference. First operand has 73 places, 134 transitions, 1767 flow. Second operand 4 states and 56 transitions. [2022-12-06 05:46:51,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 148 transitions, 2229 flow [2022-12-06 05:46:51,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 148 transitions, 2218 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 05:46:51,348 INFO L231 Difference]: Finished difference. Result has 77 places, 140 transitions, 1966 flow [2022-12-06 05:46:51,348 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1750, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1966, PETRI_PLACES=77, PETRI_TRANSITIONS=140} [2022-12-06 05:46:51,349 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 56 predicate places. [2022-12-06 05:46:51,349 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:51,349 INFO L89 Accepts]: Start accepts. Operand has 77 places, 140 transitions, 1966 flow [2022-12-06 05:46:51,350 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:51,350 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:51,350 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 140 transitions, 1966 flow [2022-12-06 05:46:51,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 140 transitions, 1966 flow [2022-12-06 05:46:51,412 INFO L130 PetriNetUnfolder]: 183/487 cut-off events. [2022-12-06 05:46:51,412 INFO L131 PetriNetUnfolder]: For 3466/3467 co-relation queries the response was YES. [2022-12-06 05:46:51,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2649 conditions, 487 events. 183/487 cut-off events. For 3466/3467 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3027 event pairs, 0 based on Foata normal form. 1/483 useless extension candidates. Maximal degree in co-relation 2498. Up to 218 conditions per place. [2022-12-06 05:46:51,416 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 140 transitions, 1966 flow [2022-12-06 05:46:51,416 INFO L188 LiptonReduction]: Number of co-enabled transitions 378 [2022-12-06 05:46:51,417 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:46:51,418 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 69 [2022-12-06 05:46:51,418 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 140 transitions, 1966 flow [2022-12-06 05:46:51,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:51,418 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:51,418 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:51,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-06 05:46:51,418 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:51,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:51,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1977263802, now seen corresponding path program 1 times [2022-12-06 05:46:51,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:51,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111903280] [2022-12-06 05:46:51,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:51,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:51,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:51,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:51,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:51,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111903280] [2022-12-06 05:46:51,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111903280] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:46:51,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:46:51,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:46:51,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677244139] [2022-12-06 05:46:51,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:46:51,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:46:51,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:51,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:46:51,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:46:51,473 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 46 [2022-12-06 05:46:51,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 140 transitions, 1966 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:51,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:51,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 46 [2022-12-06 05:46:51,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:51,776 INFO L130 PetriNetUnfolder]: 662/1157 cut-off events. [2022-12-06 05:46:51,776 INFO L131 PetriNetUnfolder]: For 9759/9775 co-relation queries the response was YES. [2022-12-06 05:46:51,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7431 conditions, 1157 events. 662/1157 cut-off events. For 9759/9775 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 6050 event pairs, 187 based on Foata normal form. 18/1156 useless extension candidates. Maximal degree in co-relation 6960. Up to 1141 conditions per place. [2022-12-06 05:46:51,783 INFO L137 encePairwiseOnDemand]: 43/46 looper letters, 136 selfloop transitions, 0 changer transitions 7/144 dead transitions. [2022-12-06 05:46:51,784 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 144 transitions, 2265 flow [2022-12-06 05:46:51,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:46:51,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:46:51,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-12-06 05:46:51,785 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.391304347826087 [2022-12-06 05:46:51,785 INFO L175 Difference]: Start difference. First operand has 77 places, 140 transitions, 1966 flow. Second operand 3 states and 54 transitions. [2022-12-06 05:46:51,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 144 transitions, 2265 flow [2022-12-06 05:46:51,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 144 transitions, 2243 flow, removed 11 selfloop flow, removed 0 redundant places. [2022-12-06 05:46:51,814 INFO L231 Difference]: Finished difference. Result has 79 places, 137 transitions, 1900 flow [2022-12-06 05:46:51,815 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1934, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1900, PETRI_PLACES=79, PETRI_TRANSITIONS=137} [2022-12-06 05:46:51,817 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 58 predicate places. [2022-12-06 05:46:51,817 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:51,817 INFO L89 Accepts]: Start accepts. Operand has 79 places, 137 transitions, 1900 flow [2022-12-06 05:46:51,818 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:51,818 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:51,818 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 137 transitions, 1900 flow [2022-12-06 05:46:51,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 137 transitions, 1900 flow [2022-12-06 05:46:51,880 INFO L130 PetriNetUnfolder]: 180/479 cut-off events. [2022-12-06 05:46:51,880 INFO L131 PetriNetUnfolder]: For 3404/3405 co-relation queries the response was YES. [2022-12-06 05:46:51,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2592 conditions, 479 events. 180/479 cut-off events. For 3404/3405 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 2976 event pairs, 0 based on Foata normal form. 1/475 useless extension candidates. Maximal degree in co-relation 2441. Up to 214 conditions per place. [2022-12-06 05:46:51,885 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 137 transitions, 1900 flow [2022-12-06 05:46:51,885 INFO L188 LiptonReduction]: Number of co-enabled transitions 372 [2022-12-06 05:46:51,886 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:46:51,886 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 69 [2022-12-06 05:46:51,887 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 137 transitions, 1900 flow [2022-12-06 05:46:51,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:51,887 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:51,887 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:51,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-06 05:46:51,887 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:51,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:51,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1536986019, now seen corresponding path program 1 times [2022-12-06 05:46:51,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:51,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948172350] [2022-12-06 05:46:51,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:51,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:51,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:51,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:51,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948172350] [2022-12-06 05:46:51,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948172350] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:46:51,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:46:51,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:46:51,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554671729] [2022-12-06 05:46:51,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:46:51,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:46:51,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:51,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:46:51,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:46:51,983 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 44 [2022-12-06 05:46:51,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 137 transitions, 1900 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:51,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:51,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 44 [2022-12-06 05:46:51,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:52,375 INFO L130 PetriNetUnfolder]: 660/1152 cut-off events. [2022-12-06 05:46:52,375 INFO L131 PetriNetUnfolder]: For 9593/9609 co-relation queries the response was YES. [2022-12-06 05:46:52,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7373 conditions, 1152 events. 660/1152 cut-off events. For 9593/9609 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 5987 event pairs, 168 based on Foata normal form. 20/1153 useless extension candidates. Maximal degree in co-relation 6902. Up to 1054 conditions per place. [2022-12-06 05:46:52,383 INFO L137 encePairwiseOnDemand]: 36/44 looper letters, 135 selfloop transitions, 19 changer transitions 0/155 dead transitions. [2022-12-06 05:46:52,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 155 transitions, 2378 flow [2022-12-06 05:46:52,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:46:52,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:46:52,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-12-06 05:46:52,385 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2818181818181818 [2022-12-06 05:46:52,385 INFO L175 Difference]: Start difference. First operand has 77 places, 137 transitions, 1900 flow. Second operand 5 states and 62 transitions. [2022-12-06 05:46:52,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 155 transitions, 2378 flow [2022-12-06 05:46:52,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 155 transitions, 2331 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 05:46:52,411 INFO L231 Difference]: Finished difference. Result has 81 places, 142 transitions, 1992 flow [2022-12-06 05:46:52,411 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1859, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1992, PETRI_PLACES=81, PETRI_TRANSITIONS=142} [2022-12-06 05:46:52,411 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 60 predicate places. [2022-12-06 05:46:52,411 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:52,411 INFO L89 Accepts]: Start accepts. Operand has 81 places, 142 transitions, 1992 flow [2022-12-06 05:46:52,412 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:52,412 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:52,412 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 142 transitions, 1992 flow [2022-12-06 05:46:52,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 142 transitions, 1992 flow [2022-12-06 05:46:52,476 INFO L130 PetriNetUnfolder]: 180/481 cut-off events. [2022-12-06 05:46:52,476 INFO L131 PetriNetUnfolder]: For 3527/3528 co-relation queries the response was YES. [2022-12-06 05:46:52,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2645 conditions, 481 events. 180/481 cut-off events. For 3527/3528 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 2978 event pairs, 0 based on Foata normal form. 1/477 useless extension candidates. Maximal degree in co-relation 2495. Up to 216 conditions per place. [2022-12-06 05:46:52,481 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 142 transitions, 1992 flow [2022-12-06 05:46:52,481 INFO L188 LiptonReduction]: Number of co-enabled transitions 384 [2022-12-06 05:46:52,482 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:46:52,483 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 72 [2022-12-06 05:46:52,483 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 142 transitions, 1992 flow [2022-12-06 05:46:52,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:52,483 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:52,483 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:52,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-06 05:46:52,483 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:52,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:52,485 INFO L85 PathProgramCache]: Analyzing trace with hash 867128456, now seen corresponding path program 1 times [2022-12-06 05:46:52,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:52,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780449970] [2022-12-06 05:46:52,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:52,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:52,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:52,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:52,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:52,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780449970] [2022-12-06 05:46:52,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780449970] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:46:52,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354307742] [2022-12-06 05:46:52,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:52,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:46:52,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:46:52,623 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:46:52,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 05:46:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:52,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-06 05:46:52,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:46:52,734 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-06 05:46:52,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:46:52,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:46:55,373 INFO L321 Elim1Store]: treesize reduction 375, result has 60.5 percent of original size [2022-12-06 05:46:55,374 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 28 new quantified variables, introduced 105 case distinctions, treesize of input 572 treesize of output 764 [2022-12-06 05:47:02,470 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2022-12-06 05:47:22,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:22,391 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:47:22,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354307742] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:22,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:47:22,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 9 [2022-12-06 05:47:22,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215457840] [2022-12-06 05:47:22,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:22,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:47:22,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:22,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:47:22,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:47:22,393 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 44 [2022-12-06 05:47:22,393 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 142 transitions, 1992 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-06 05:47:22,393 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:22,393 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 44 [2022-12-06 05:47:22,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:22,906 INFO L130 PetriNetUnfolder]: 695/1302 cut-off events. [2022-12-06 05:47:22,906 INFO L131 PetriNetUnfolder]: For 10533/10565 co-relation queries the response was YES. [2022-12-06 05:47:22,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8193 conditions, 1302 events. 695/1302 cut-off events. For 10533/10565 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 7609 event pairs, 58 based on Foata normal form. 35/1326 useless extension candidates. Maximal degree in co-relation 7659. Up to 750 conditions per place. [2022-12-06 05:47:22,915 INFO L137 encePairwiseOnDemand]: 24/44 looper letters, 89 selfloop transitions, 27 changer transitions 71/188 dead transitions. [2022-12-06 05:47:22,915 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 188 transitions, 2883 flow [2022-12-06 05:47:22,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:47:22,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:47:22,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2022-12-06 05:47:22,916 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35909090909090907 [2022-12-06 05:47:22,916 INFO L175 Difference]: Start difference. First operand has 81 places, 142 transitions, 1992 flow. Second operand 5 states and 79 transitions. [2022-12-06 05:47:22,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 188 transitions, 2883 flow [2022-12-06 05:47:22,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 188 transitions, 2831 flow, removed 24 selfloop flow, removed 1 redundant places. [2022-12-06 05:47:22,950 INFO L231 Difference]: Finished difference. Result has 85 places, 110 transitions, 1524 flow [2022-12-06 05:47:22,951 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1954, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1524, PETRI_PLACES=85, PETRI_TRANSITIONS=110} [2022-12-06 05:47:22,951 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 64 predicate places. [2022-12-06 05:47:22,951 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:22,951 INFO L89 Accepts]: Start accepts. Operand has 85 places, 110 transitions, 1524 flow [2022-12-06 05:47:22,952 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:22,952 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:22,953 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 110 transitions, 1524 flow [2022-12-06 05:47:22,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 110 transitions, 1524 flow [2022-12-06 05:47:23,013 INFO L130 PetriNetUnfolder]: 109/330 cut-off events. [2022-12-06 05:47:23,014 INFO L131 PetriNetUnfolder]: For 2593/2594 co-relation queries the response was YES. [2022-12-06 05:47:23,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1779 conditions, 330 events. 109/330 cut-off events. For 2593/2594 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1933 event pairs, 2 based on Foata normal form. 1/327 useless extension candidates. Maximal degree in co-relation 1706. Up to 135 conditions per place. [2022-12-06 05:47:23,017 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 110 transitions, 1524 flow [2022-12-06 05:47:23,017 INFO L188 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-06 05:47:23,026 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [628] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_21| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_6 4)))) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_6 v_~size~0_In_15) (<= 0 v_~x1~0_In_6)) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_In_4| 1) |v_thread1Thread1of1ForFork1_~i~0#1_Out_6|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|) (< (mod |v_thread1Thread1of1ForFork1_~i~0#1_In_4| 4294967296) (mod v_~n~0_In_7 4294967296))) InVars {~size~0=v_~size~0_In_15, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_4|, ~f~0.base=v_~f~0.base_In_9, #memory_int=|v_#memory_int_In_21|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_Out_10|, ~size~0=v_~size~0_In_15, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|, ~f~0.base=v_~f~0.base_In_9, #memory_int=|v_#memory_int_In_21|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_Out_6|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_18, ~f~0.offset=v_~f~0.offset_In_9, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, ~x1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [718] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_250| v_~f~0.base_203))) (let ((.cse0 (select .cse1 (+ (* v_~x1~0_168 4) v_~f~0.offset_203)))) (and (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_205)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_78|) (< 1 (mod v_~n~0_183 4294967296)) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_205)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_86| 0)) (= v_~x1~0_166 (select .cse1 (+ v_~f~0.offset_203 (* .cse0 4)))) (= |v_thread1Thread1of1ForFork1_~i~0#1_146| 2) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_78| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_86|)))) InVars {~size~0=v_~size~0_205, ~f~0.base=v_~f~0.base_203, #memory_int=|v_#memory_int_250|, ~n~0=v_~n~0_183, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_203} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_76|, ~size~0=v_~size~0_205, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_146|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_78|, ~f~0.base=v_~f~0.base_203, #memory_int=|v_#memory_int_250|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_80|, ~n~0=v_~n~0_183, ~x1~0=v_~x1~0_166, ~f~0.offset=v_~f~0.offset_203, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_86|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, ~x1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:47:23,187 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [628] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_21| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_6 4)))) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_6 v_~size~0_In_15) (<= 0 v_~x1~0_In_6)) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_In_4| 1) |v_thread1Thread1of1ForFork1_~i~0#1_Out_6|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|) (< (mod |v_thread1Thread1of1ForFork1_~i~0#1_In_4| 4294967296) (mod v_~n~0_In_7 4294967296))) InVars {~size~0=v_~size~0_In_15, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_4|, ~f~0.base=v_~f~0.base_In_9, #memory_int=|v_#memory_int_In_21|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_Out_10|, ~size~0=v_~size~0_In_15, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|, ~f~0.base=v_~f~0.base_In_9, #memory_int=|v_#memory_int_In_21|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_Out_6|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_18, ~f~0.offset=v_~f~0.offset_In_9, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, ~x1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [718] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_250| v_~f~0.base_203))) (let ((.cse0 (select .cse1 (+ (* v_~x1~0_168 4) v_~f~0.offset_203)))) (and (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_205)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_78|) (< 1 (mod v_~n~0_183 4294967296)) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_205)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_86| 0)) (= v_~x1~0_166 (select .cse1 (+ v_~f~0.offset_203 (* .cse0 4)))) (= |v_thread1Thread1of1ForFork1_~i~0#1_146| 2) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_78| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_86|)))) InVars {~size~0=v_~size~0_205, ~f~0.base=v_~f~0.base_203, #memory_int=|v_#memory_int_250|, ~n~0=v_~n~0_183, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_203} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_76|, ~size~0=v_~size~0_205, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_146|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_78|, ~f~0.base=v_~f~0.base_203, #memory_int=|v_#memory_int_250|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_80|, ~n~0=v_~n~0_183, ~x1~0=v_~x1~0_166, ~f~0.offset=v_~f~0.offset_203, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_86|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, ~x1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:47:23,337 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [657] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse8 (select |v_#memory_int_155| v_~f~0.base_121))) (let ((.cse3 (select .cse8 (+ v_~f~0.offset_121 (* v_~x2~0_196 4))))) (let ((.cse0 (select .cse8 (+ v_~f~0.offset_121 (* .cse3 4))))) (let ((.cse9 (select .cse8 (+ v_~f~0.offset_121 (* .cse0 4))))) (let ((.cse2 (mod (+ 4294967295 v_~n~0_105) 4294967296)) (.cse1 (ite (and (< .cse9 v_~size~0_127) (<= 0 .cse9)) 1 0))) (and (not (= (ite (and (< .cse0 v_~size~0_127) (<= 0 .cse0)) 1 0) 0)) (not (= 0 .cse1)) (<= .cse2 4) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_127)) 1 0) 0)) (< 2 .cse2) (let ((.cse5 (= |v_thread2Thread1of1ForFork0_#res#1.base_27| 0)) (.cse6 (< 4 (mod v_~n~0_105 4294967296))) (.cse7 (= |v_thread2Thread1of1ForFork0_#res#1.offset_27| 0)) (.cse4 (select .cse8 (+ v_~f~0.offset_121 (* 4 .cse9))))) (or (and (= |v_thread2Thread1of1ForFork0_~i~1#1_171| 4) (= |v_thread2Thread1of1ForFork0_#t~mem7#1_48| |v_thread2Thread1of1ForFork0_#t~mem7#1_47|) (= .cse4 v_~x2~0_194) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_133| .cse1) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_107| .cse1) .cse5 (not .cse6) (= |v_thread2Thread1of1ForFork0_#t~post8#1_44| |v_thread2Thread1of1ForFork0_#t~post8#1_43|) .cse7) (and (= v_~x2~0_194 (select .cse8 (+ v_~f~0.offset_121 (* .cse4 4)))) (= 5 |v_thread2Thread1of1ForFork0_~i~1#1_171|) .cse5 (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_107|) .cse6 (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_133| 0)) .cse7 (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_127)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_107|)))) (not (= (ite (and (< v_~x2~0_196 v_~size~0_127) (<= 0 v_~x2~0_196)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_196, ~size~0=v_~size~0_127, ~f~0.base=v_~f~0.base_121, #memory_int=|v_#memory_int_155|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_48|, ~n~0=v_~n~0_105, ~f~0.offset=v_~f~0.offset_121, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_44|} OutVars{thread2Thread1of1ForFork0_#t~mem3#1=|v_thread2Thread1of1ForFork0_#t~mem3#1_59|, ~x2~0=v_~x2~0_194, ~size~0=v_~size~0_127, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_27|, ~f~0.base=v_~f~0.base_121, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_107|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_171|, ~f~0.offset=v_~f~0.offset_121, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_27|, #memory_int=|v_#memory_int_155|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_71|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_47|, ~n~0=v_~n~0_105, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_59|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_59|, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem3#1, ~x2~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread2Thread1of1ForFork0_#t~post8#1] and [718] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_250| v_~f~0.base_203))) (let ((.cse0 (select .cse1 (+ (* v_~x1~0_168 4) v_~f~0.offset_203)))) (and (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_205)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_78|) (< 1 (mod v_~n~0_183 4294967296)) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_205)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_86| 0)) (= v_~x1~0_166 (select .cse1 (+ v_~f~0.offset_203 (* .cse0 4)))) (= |v_thread1Thread1of1ForFork1_~i~0#1_146| 2) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_78| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_86|)))) InVars {~size~0=v_~size~0_205, ~f~0.base=v_~f~0.base_203, #memory_int=|v_#memory_int_250|, ~n~0=v_~n~0_183, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_203} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_76|, ~size~0=v_~size~0_205, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_146|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_78|, ~f~0.base=v_~f~0.base_203, #memory_int=|v_#memory_int_250|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_80|, ~n~0=v_~n~0_183, ~x1~0=v_~x1~0_166, ~f~0.offset=v_~f~0.offset_203, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_86|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, ~x1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:47:23,945 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [657] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse8 (select |v_#memory_int_155| v_~f~0.base_121))) (let ((.cse3 (select .cse8 (+ v_~f~0.offset_121 (* v_~x2~0_196 4))))) (let ((.cse0 (select .cse8 (+ v_~f~0.offset_121 (* .cse3 4))))) (let ((.cse9 (select .cse8 (+ v_~f~0.offset_121 (* .cse0 4))))) (let ((.cse2 (mod (+ 4294967295 v_~n~0_105) 4294967296)) (.cse1 (ite (and (< .cse9 v_~size~0_127) (<= 0 .cse9)) 1 0))) (and (not (= (ite (and (< .cse0 v_~size~0_127) (<= 0 .cse0)) 1 0) 0)) (not (= 0 .cse1)) (<= .cse2 4) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_127)) 1 0) 0)) (< 2 .cse2) (let ((.cse5 (= |v_thread2Thread1of1ForFork0_#res#1.base_27| 0)) (.cse6 (< 4 (mod v_~n~0_105 4294967296))) (.cse7 (= |v_thread2Thread1of1ForFork0_#res#1.offset_27| 0)) (.cse4 (select .cse8 (+ v_~f~0.offset_121 (* 4 .cse9))))) (or (and (= |v_thread2Thread1of1ForFork0_~i~1#1_171| 4) (= |v_thread2Thread1of1ForFork0_#t~mem7#1_48| |v_thread2Thread1of1ForFork0_#t~mem7#1_47|) (= .cse4 v_~x2~0_194) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_133| .cse1) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_107| .cse1) .cse5 (not .cse6) (= |v_thread2Thread1of1ForFork0_#t~post8#1_44| |v_thread2Thread1of1ForFork0_#t~post8#1_43|) .cse7) (and (= v_~x2~0_194 (select .cse8 (+ v_~f~0.offset_121 (* .cse4 4)))) (= 5 |v_thread2Thread1of1ForFork0_~i~1#1_171|) .cse5 (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_107|) .cse6 (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_133| 0)) .cse7 (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_127)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_107|)))) (not (= (ite (and (< v_~x2~0_196 v_~size~0_127) (<= 0 v_~x2~0_196)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_196, ~size~0=v_~size~0_127, ~f~0.base=v_~f~0.base_121, #memory_int=|v_#memory_int_155|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_48|, ~n~0=v_~n~0_105, ~f~0.offset=v_~f~0.offset_121, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_44|} OutVars{thread2Thread1of1ForFork0_#t~mem3#1=|v_thread2Thread1of1ForFork0_#t~mem3#1_59|, ~x2~0=v_~x2~0_194, ~size~0=v_~size~0_127, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_27|, ~f~0.base=v_~f~0.base_121, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_107|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_171|, ~f~0.offset=v_~f~0.offset_121, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_27|, #memory_int=|v_#memory_int_155|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_71|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_47|, ~n~0=v_~n~0_105, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_59|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_59|, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem3#1, ~x2~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread2Thread1of1ForFork0_#t~post8#1] and [718] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_250| v_~f~0.base_203))) (let ((.cse0 (select .cse1 (+ (* v_~x1~0_168 4) v_~f~0.offset_203)))) (and (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_205)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_78|) (< 1 (mod v_~n~0_183 4294967296)) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_205)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_86| 0)) (= v_~x1~0_166 (select .cse1 (+ v_~f~0.offset_203 (* .cse0 4)))) (= |v_thread1Thread1of1ForFork1_~i~0#1_146| 2) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_78| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_86|)))) InVars {~size~0=v_~size~0_205, ~f~0.base=v_~f~0.base_203, #memory_int=|v_#memory_int_250|, ~n~0=v_~n~0_183, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_203} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_76|, ~size~0=v_~size~0_205, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_146|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_78|, ~f~0.base=v_~f~0.base_203, #memory_int=|v_#memory_int_250|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_80|, ~n~0=v_~n~0_183, ~x1~0=v_~x1~0_166, ~f~0.offset=v_~f~0.offset_203, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_86|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, ~x1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:47:24,905 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [666] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse7 (select |v_#memory_int_167| v_~f~0.base_133))) (let ((.cse8 (select .cse7 (+ v_~f~0.offset_133 (* v_~x2~0_228 4))))) (let ((.cse2 (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_139)) 1 0)) (.cse0 (select .cse7 (+ v_~f~0.offset_133 (* v_~x1~0_117 4)))) (.cse1 (mod (+ 4294967295 v_~n~0_117) 4294967296))) (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53| (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_139)) 1 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_61| 0)) (< 0 .cse1) (not (= .cse2 0)) (not (= (ite (and (<= 0 v_~x2~0_228) (< v_~x2~0_228 v_~size~0_139)) 1 0) 0)) (let ((.cse3 (= |v_thread2Thread1of1ForFork0_#res#1.base_31| 0)) (.cse5 (= |v_thread2Thread1of1ForFork0_#res#1.offset_31| 0)) (.cse4 (< 2 (mod v_~n~0_117 4294967296))) (.cse6 (select .cse7 (+ v_~f~0.offset_133 (* .cse8 4))))) (or (and (= .cse2 |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_127|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_153| .cse2) (= |v_thread2Thread1of1ForFork0_#t~mem7#1_56| |v_thread2Thread1of1ForFork0_#t~mem7#1_55|) .cse3 (= 2 |v_thread2Thread1of1ForFork0_~i~1#1_191|) (not .cse4) .cse5 (= |v_thread2Thread1of1ForFork0_#t~post8#1_52| |v_thread2Thread1of1ForFork0_#t~post8#1_51|) (= .cse6 v_~x2~0_226)) (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_153| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_127|) (= (ite (and (< .cse6 v_~size~0_139) (<= 0 .cse6)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_127|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_153| 0)) .cse3 (= 3 |v_thread2Thread1of1ForFork0_~i~1#1_191|) .cse5 .cse4 (= v_~x2~0_226 (select .cse7 (+ v_~f~0.offset_133 (* .cse6 4))))))) (= (select .cse7 (+ v_~f~0.offset_133 (* .cse0 4))) v_~x1~0_116) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_61|) (= 2 |v_thread1Thread1of1ForFork1_~i~0#1_79|) (not (= 0 (ite (and (< v_~x1~0_117 v_~size~0_139) (<= 0 v_~x1~0_117)) 1 0))) (<= .cse1 2))))) InVars {~x2~0=v_~x2~0_228, ~size~0=v_~size~0_139, ~f~0.base=v_~f~0.base_133, #memory_int=|v_#memory_int_167|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_56|, ~n~0=v_~n~0_117, ~x1~0=v_~x1~0_117, ~f~0.offset=v_~f~0.offset_133, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_52|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_51|, thread2Thread1of1ForFork0_#t~mem3#1=|v_thread2Thread1of1ForFork0_#t~mem3#1_77|, ~x2~0=v_~x2~0_226, ~size~0=v_~size~0_139, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_31|, ~f~0.base=v_~f~0.base_133, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_127|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_191|, ~x1~0=v_~x1~0_116, ~f~0.offset=v_~f~0.offset_133, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_153|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_31|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_79|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53|, #memory_int=|v_#memory_int_167|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_89|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_55|, ~n~0=v_~n~0_117, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_55|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_77|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_77|, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_51|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_61|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork0_#t~mem3#1, ~x2~0, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, ~x1~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_#t~mem1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread2Thread1of1ForFork0_#t~post8#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [628] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_21| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_6 4)))) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_6 v_~size~0_In_15) (<= 0 v_~x1~0_In_6)) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_In_4| 1) |v_thread1Thread1of1ForFork1_~i~0#1_Out_6|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|) (< (mod |v_thread1Thread1of1ForFork1_~i~0#1_In_4| 4294967296) (mod v_~n~0_In_7 4294967296))) InVars {~size~0=v_~size~0_In_15, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_4|, ~f~0.base=v_~f~0.base_In_9, #memory_int=|v_#memory_int_In_21|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_Out_10|, ~size~0=v_~size~0_In_15, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|, ~f~0.base=v_~f~0.base_In_9, #memory_int=|v_#memory_int_In_21|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_Out_6|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_18, ~f~0.offset=v_~f~0.offset_In_9, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, ~x1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:47:25,319 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:47:25,320 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2369 [2022-12-06 05:47:25,320 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 110 transitions, 1561 flow [2022-12-06 05:47:25,320 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-06 05:47:25,320 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:25,320 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:25,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 05:47:25,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-12-06 05:47:25,526 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:25,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:25,527 INFO L85 PathProgramCache]: Analyzing trace with hash 406548318, now seen corresponding path program 1 times [2022-12-06 05:47:25,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:25,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318732320] [2022-12-06 05:47:25,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:25,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:25,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:25,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-06 05:47:25,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:25,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318732320] [2022-12-06 05:47:25,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318732320] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:47:25,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563564781] [2022-12-06 05:47:25,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:25,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:47:25,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:47:25,626 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:47:25,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 05:47:25,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:25,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:47:25,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:47:25,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:25,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:47:25,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:25,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563564781] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:47:25,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:47:25,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-06 05:47:25,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059005384] [2022-12-06 05:47:25,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:47:25,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:47:25,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:25,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:47:25,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:47:25,833 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 44 [2022-12-06 05:47:25,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 110 transitions, 1561 flow. Second operand has 8 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-06 05:47:25,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:25,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 44 [2022-12-06 05:47:25,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:26,188 INFO L130 PetriNetUnfolder]: 435/803 cut-off events. [2022-12-06 05:47:26,188 INFO L131 PetriNetUnfolder]: For 7967/7999 co-relation queries the response was YES. [2022-12-06 05:47:26,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5187 conditions, 803 events. 435/803 cut-off events. For 7967/7999 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4027 event pairs, 105 based on Foata normal form. 44/834 useless extension candidates. Maximal degree in co-relation 5094. Up to 647 conditions per place. [2022-12-06 05:47:26,195 INFO L137 encePairwiseOnDemand]: 32/44 looper letters, 94 selfloop transitions, 31 changer transitions 0/126 dead transitions. [2022-12-06 05:47:26,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 126 transitions, 1947 flow [2022-12-06 05:47:26,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:47:26,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:47:26,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2022-12-06 05:47:26,196 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21428571428571427 [2022-12-06 05:47:26,196 INFO L175 Difference]: Start difference. First operand has 83 places, 110 transitions, 1561 flow. Second operand 7 states and 66 transitions. [2022-12-06 05:47:26,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 126 transitions, 1947 flow [2022-12-06 05:47:26,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 126 transitions, 1703 flow, removed 44 selfloop flow, removed 10 redundant places. [2022-12-06 05:47:26,220 INFO L231 Difference]: Finished difference. Result has 81 places, 109 transitions, 1390 flow [2022-12-06 05:47:26,221 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1256, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1390, PETRI_PLACES=81, PETRI_TRANSITIONS=109} [2022-12-06 05:47:26,221 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 60 predicate places. [2022-12-06 05:47:26,221 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:26,221 INFO L89 Accepts]: Start accepts. Operand has 81 places, 109 transitions, 1390 flow [2022-12-06 05:47:26,222 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:26,222 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:26,222 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 109 transitions, 1390 flow [2022-12-06 05:47:26,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 109 transitions, 1390 flow [2022-12-06 05:47:26,267 INFO L130 PetriNetUnfolder]: 115/343 cut-off events. [2022-12-06 05:47:26,267 INFO L131 PetriNetUnfolder]: For 2635/2635 co-relation queries the response was YES. [2022-12-06 05:47:26,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1853 conditions, 343 events. 115/343 cut-off events. For 2635/2635 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2001 event pairs, 2 based on Foata normal form. 0/337 useless extension candidates. Maximal degree in co-relation 1728. Up to 152 conditions per place. [2022-12-06 05:47:26,270 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 109 transitions, 1390 flow [2022-12-06 05:47:26,270 INFO L188 LiptonReduction]: Number of co-enabled transitions 298 [2022-12-06 05:47:26,557 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:47:26,558 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 337 [2022-12-06 05:47:26,558 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 108 transitions, 1393 flow [2022-12-06 05:47:26,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 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-06 05:47:26,559 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:26,559 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:26,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 05:47:26,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:47:26,763 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:26,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:26,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1261854972, now seen corresponding path program 1 times [2022-12-06 05:47:26,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:26,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508038253] [2022-12-06 05:47:26,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:26,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:26,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:26,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:26,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508038253] [2022-12-06 05:47:26,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508038253] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:26,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:26,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:47:26,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85622835] [2022-12-06 05:47:26,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:26,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:47:26,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:26,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:47:26,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:47:26,840 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-06 05:47:26,840 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 108 transitions, 1393 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:26,840 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:26,840 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-06 05:47:26,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:27,029 INFO L130 PetriNetUnfolder]: 431/801 cut-off events. [2022-12-06 05:47:27,030 INFO L131 PetriNetUnfolder]: For 7066/7082 co-relation queries the response was YES. [2022-12-06 05:47:27,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5118 conditions, 801 events. 431/801 cut-off events. For 7066/7082 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4026 event pairs, 144 based on Foata normal form. 20/803 useless extension candidates. Maximal degree in co-relation 4747. Up to 790 conditions per place. [2022-12-06 05:47:27,035 INFO L137 encePairwiseOnDemand]: 39/42 looper letters, 105 selfloop transitions, 0 changer transitions 3/109 dead transitions. [2022-12-06 05:47:27,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 109 transitions, 1611 flow [2022-12-06 05:47:27,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:47:27,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:47:27,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-12-06 05:47:27,036 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36507936507936506 [2022-12-06 05:47:27,036 INFO L175 Difference]: Start difference. First operand has 80 places, 108 transitions, 1393 flow. Second operand 3 states and 46 transitions. [2022-12-06 05:47:27,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 109 transitions, 1611 flow [2022-12-06 05:47:27,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 109 transitions, 1515 flow, removed 27 selfloop flow, removed 7 redundant places. [2022-12-06 05:47:27,061 INFO L231 Difference]: Finished difference. Result has 76 places, 106 transitions, 1266 flow [2022-12-06 05:47:27,061 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1297, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1266, PETRI_PLACES=76, PETRI_TRANSITIONS=106} [2022-12-06 05:47:27,061 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 55 predicate places. [2022-12-06 05:47:27,061 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:27,061 INFO L89 Accepts]: Start accepts. Operand has 76 places, 106 transitions, 1266 flow [2022-12-06 05:47:27,062 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:27,062 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:27,062 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 106 transitions, 1266 flow [2022-12-06 05:47:27,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 106 transitions, 1266 flow [2022-12-06 05:47:27,105 INFO L130 PetriNetUnfolder]: 113/339 cut-off events. [2022-12-06 05:47:27,105 INFO L131 PetriNetUnfolder]: For 2134/2135 co-relation queries the response was YES. [2022-12-06 05:47:27,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1688 conditions, 339 events. 113/339 cut-off events. For 2134/2135 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1971 event pairs, 3 based on Foata normal form. 1/335 useless extension candidates. Maximal degree in co-relation 1570. Up to 150 conditions per place. [2022-12-06 05:47:27,108 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 106 transitions, 1266 flow [2022-12-06 05:47:27,108 INFO L188 LiptonReduction]: Number of co-enabled transitions 292 [2022-12-06 05:47:27,109 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:47:27,109 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48 [2022-12-06 05:47:27,109 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 106 transitions, 1266 flow [2022-12-06 05:47:27,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:27,110 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:27,110 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:27,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-06 05:47:27,110 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:27,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:27,110 INFO L85 PathProgramCache]: Analyzing trace with hash -796470670, now seen corresponding path program 1 times [2022-12-06 05:47:27,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:27,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132041320] [2022-12-06 05:47:27,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:27,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:27,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:28,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:28,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:28,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132041320] [2022-12-06 05:47:28,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132041320] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:47:28,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913203942] [2022-12-06 05:47:28,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:28,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:47:28,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:47:28,483 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:47:28,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 05:47:28,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:28,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-06 05:47:28,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:47:28,901 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:47:28,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 121 treesize of output 127 [2022-12-06 05:47:29,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-06 05:47:29,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:47:29,552 INFO L321 Elim1Store]: treesize reduction 20, result has 92.8 percent of original size [2022-12-06 05:47:29,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 312 treesize of output 360 [2022-12-06 05:47:30,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-06 05:47:30,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913203942] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:47:30,474 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:47:30,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 3] total 10 [2022-12-06 05:47:30,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009269285] [2022-12-06 05:47:30,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:47:30,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:47:30,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:30,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:47:30,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:47:30,475 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 40 [2022-12-06 05:47:30,475 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 106 transitions, 1266 flow. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:30,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:30,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 40 [2022-12-06 05:47:30,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:31,469 INFO L130 PetriNetUnfolder]: 454/853 cut-off events. [2022-12-06 05:47:31,470 INFO L131 PetriNetUnfolder]: For 6373/6405 co-relation queries the response was YES. [2022-12-06 05:47:31,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5121 conditions, 853 events. 454/853 cut-off events. For 6373/6405 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4461 event pairs, 34 based on Foata normal form. 19/864 useless extension candidates. Maximal degree in co-relation 4823. Up to 749 conditions per place. [2022-12-06 05:47:31,474 INFO L137 encePairwiseOnDemand]: 12/40 looper letters, 77 selfloop transitions, 62 changer transitions 10/150 dead transitions. [2022-12-06 05:47:31,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 150 transitions, 1900 flow [2022-12-06 05:47:31,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 05:47:31,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 05:47:31,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 107 transitions. [2022-12-06 05:47:31,476 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19107142857142856 [2022-12-06 05:47:31,476 INFO L175 Difference]: Start difference. First operand has 74 places, 106 transitions, 1266 flow. Second operand 14 states and 107 transitions. [2022-12-06 05:47:31,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 150 transitions, 1900 flow [2022-12-06 05:47:31,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 150 transitions, 1892 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-06 05:47:31,497 INFO L231 Difference]: Finished difference. Result has 93 places, 123 transitions, 1699 flow [2022-12-06 05:47:31,498 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1260, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1699, PETRI_PLACES=93, PETRI_TRANSITIONS=123} [2022-12-06 05:47:31,498 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 72 predicate places. [2022-12-06 05:47:31,498 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:31,498 INFO L89 Accepts]: Start accepts. Operand has 93 places, 123 transitions, 1699 flow [2022-12-06 05:47:31,499 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:31,499 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:31,499 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 123 transitions, 1699 flow [2022-12-06 05:47:31,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 123 transitions, 1699 flow [2022-12-06 05:47:31,541 INFO L130 PetriNetUnfolder]: 121/357 cut-off events. [2022-12-06 05:47:31,541 INFO L131 PetriNetUnfolder]: For 2971/2972 co-relation queries the response was YES. [2022-12-06 05:47:31,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2068 conditions, 357 events. 121/357 cut-off events. For 2971/2972 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2095 event pairs, 2 based on Foata normal form. 1/353 useless extension candidates. Maximal degree in co-relation 1975. Up to 162 conditions per place. [2022-12-06 05:47:31,544 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 123 transitions, 1699 flow [2022-12-06 05:47:31,544 INFO L188 LiptonReduction]: Number of co-enabled transitions 324 [2022-12-06 05:47:32,029 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [702] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_227| v_~f~0.base_181))) (let ((.cse4 (select .cse0 (+ v_~f~0.offset_181 (* v_~x2~0_330 4))))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_181 (* 4 .cse4))))) (let ((.cse5 (select .cse0 (+ v_~f~0.offset_181 (* 4 .cse2))))) (let ((.cse6 (select .cse0 (+ v_~f~0.offset_181 (* 4 .cse5))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_181 (* .cse6 4)))) (.cse3 (select .cse0 (+ v_~f~0.offset_181 (* v_~x1~0_153 4))))) (and (= (select .cse0 (+ v_~f~0.offset_181 (* .cse1 4))) v_~x2~0_328) (not (= (ite (and (< .cse2 v_~size~0_183) (<= 0 .cse2)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork1_~i~0#1_119| 4294967294) 4294967296) (mod v_~n~0_161 4294967296)) (= |v_thread2Thread1of1ForFork0_~i~1#1_259| 6) (< 4 (mod (+ 4294967295 v_~n~0_161) 4294967296)) (= v_~x1~0_152 (select .cse0 (+ v_~f~0.offset_181 (* .cse3 4)))) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_77| 0)) (not (= (ite (and (< .cse4 v_~size~0_183) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_153 v_~size~0_183) (<= 0 v_~x1~0_153)) 1 0) 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_183)) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_77|) (= |v_thread1Thread1of1ForFork1_~i~0#1_119| 2) (not (= (ite (and (<= 0 v_~x2~0_330) (< v_~x2~0_330 v_~size~0_183)) 1 0) 0)) (= (ite (and (< .cse1 v_~size~0_183) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_189|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_215| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_215| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_189|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69| (ite (and (< .cse3 v_~size~0_183) (<= 0 .cse3)) 1 0)) (not (= 0 (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_183)) 1 0)))))))))) InVars {~x2~0=v_~x2~0_330, ~size~0=v_~size~0_183, ~f~0.base=v_~f~0.base_181, #memory_int=|v_#memory_int_227|, ~n~0=v_~n~0_161, ~x1~0=v_~x1~0_153, ~f~0.offset=v_~f~0.offset_181} OutVars{thread2Thread1of1ForFork0_#t~mem3#1=|v_thread2Thread1of1ForFork0_#t~mem3#1_129|, thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_67|, ~x2~0=v_~x2~0_328, ~size~0=v_~size~0_183, ~f~0.base=v_~f~0.base_181, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_189|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_259|, ~x1~0=v_~x1~0_152, ~f~0.offset=v_~f~0.offset_181, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_215|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_119|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, #memory_int=|v_#memory_int_227|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_141|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_129|, ~n~0=v_~n~0_161, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_71|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_129|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_77|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork1_#t~post2#1, ~x2~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, ~x1~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork1_#t~mem1#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [628] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_21| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_6 4)))) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_6 v_~size~0_In_15) (<= 0 v_~x1~0_In_6)) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_In_4| 1) |v_thread1Thread1of1ForFork1_~i~0#1_Out_6|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|) (< (mod |v_thread1Thread1of1ForFork1_~i~0#1_In_4| 4294967296) (mod v_~n~0_In_7 4294967296))) InVars {~size~0=v_~size~0_In_15, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_4|, ~f~0.base=v_~f~0.base_In_9, #memory_int=|v_#memory_int_In_21|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_Out_10|, ~size~0=v_~size~0_In_15, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|, ~f~0.base=v_~f~0.base_In_9, #memory_int=|v_#memory_int_In_21|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_Out_6|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_18, ~f~0.offset=v_~f~0.offset_In_9, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, ~x1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:47:34,279 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [743] $Ultimate##0-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_283| v_~f~0.base_233))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_233 (* v_~x2~0_418 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_233 (* 4 .cse1))))) (let ((.cse5 (select .cse3 (+ v_~f~0.offset_233 (* .cse4 4))))) (let ((.cse6 (select .cse3 (+ v_~f~0.offset_233 (* .cse5 4))))) (let ((.cse0 (select .cse3 (+ v_~f~0.offset_233 (* .cse6 4))))) (let ((.cse8 (select .cse3 (+ v_~f~0.offset_233 (* .cse0 4))))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_233 (* .cse8 4)))) (.cse7 (select .cse3 (+ v_~f~0.offset_233 (* v_~x1~0_255 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_235)) 1 0) 0)) (not (= 0 (ite (and (< .cse1 v_~size~0_235) (<= 0 .cse1)) 1 0))) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_143| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_273| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_247|) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_235)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_247|) (= v_~x2~0_416 (select .cse3 (+ v_~f~0.offset_233 (* .cse2 4)))) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_135| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_143|) (= |v_thread1Thread1of1ForFork1_~i~0#1_217| 2) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_235)) 1 0) 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_235)) 1 0) 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_235)) 1 0) 0)) (< (mod (+ |v_thread2Thread1of1ForFork0_~i~1#1_321| 4294967294) 4294967296) (mod (+ 4294967295 v_~n~0_213) 4294967296)) (< (mod (+ |v_thread1Thread1of1ForFork1_~i~0#1_217| 4294967294) 4294967296) (mod v_~n~0_213 4294967296)) (not (= (ite (and (< v_~x2~0_418 v_~size~0_235) (<= 0 v_~x2~0_418)) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_135| (ite (and (< .cse7 v_~size~0_235) (<= 0 .cse7)) 1 0)) (not (= 0 (ite (and (< v_~x1~0_255 v_~size~0_235) (<= 0 v_~x1~0_255)) 1 0))) (= v_~x1~0_254 (select .cse3 (+ v_~f~0.offset_233 (* .cse7 4)))) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_273| 0)) (= |v_thread2Thread1of1ForFork0_~i~1#1_321| 8) (not (= (ite (and (< .cse8 v_~size~0_235) (<= 0 .cse8)) 1 0) 0))))))))))) InVars {~x2~0=v_~x2~0_418, ~size~0=v_~size~0_235, ~f~0.base=v_~f~0.base_233, #memory_int=|v_#memory_int_283|, ~n~0=v_~n~0_213, ~x1~0=v_~x1~0_255, ~f~0.offset=v_~f~0.offset_233} OutVars{thread2Thread1of1ForFork0_#t~mem3#1=|v_thread2Thread1of1ForFork0_#t~mem3#1_166|, thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_133|, ~x2~0=v_~x2~0_416, ~size~0=v_~size~0_235, ~f~0.base=v_~f~0.base_233, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_247|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_321|, ~x1~0=v_~x1~0_254, ~f~0.offset=v_~f~0.offset_233, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_273|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_217|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_135|, #memory_int=|v_#memory_int_283|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_178|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_166|, ~n~0=v_~n~0_213, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_137|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_166|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_143|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork1_#t~post2#1, ~x2~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, ~x1~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork1_#t~mem1#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [628] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_21| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_6 4)))) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_6 v_~size~0_In_15) (<= 0 v_~x1~0_In_6)) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_In_4| 1) |v_thread1Thread1of1ForFork1_~i~0#1_Out_6|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|) (< (mod |v_thread1Thread1of1ForFork1_~i~0#1_In_4| 4294967296) (mod v_~n~0_In_7 4294967296))) InVars {~size~0=v_~size~0_In_15, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_4|, ~f~0.base=v_~f~0.base_In_9, #memory_int=|v_#memory_int_In_21|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_Out_10|, ~size~0=v_~size~0_In_15, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|, ~f~0.base=v_~f~0.base_In_9, #memory_int=|v_#memory_int_In_21|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_Out_6|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_18, ~f~0.offset=v_~f~0.offset_In_9, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, ~x1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:47:36,849 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 05:47:36,849 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5351 [2022-12-06 05:47:36,850 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 121 transitions, 1789 flow [2022-12-06 05:47:36,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:36,850 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:36,850 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:36,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 05:47:37,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:47:37,056 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:37,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:37,057 INFO L85 PathProgramCache]: Analyzing trace with hash -373029614, now seen corresponding path program 1 times [2022-12-06 05:47:37,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:37,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099374180] [2022-12-06 05:47:37,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:37,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:37,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:37,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:37,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:37,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099374180] [2022-12-06 05:47:37,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099374180] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:47:37,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981216462] [2022-12-06 05:47:37,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:37,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:47:37,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:47:37,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-06 05:47:37,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-06 05:47:37,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:37,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-06 05:47:37,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:47:37,954 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:47:37,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2022-12-06 05:47:37,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:37,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:47:38,118 INFO L321 Elim1Store]: treesize reduction 10, result has 85.5 percent of original size [2022-12-06 05:47:38,119 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 35 treesize of output 78 [2022-12-06 05:47:38,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:38,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981216462] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:47:38,162 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:47:38,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 3] total 10 [2022-12-06 05:47:38,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191805768] [2022-12-06 05:47:38,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:47:38,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:47:38,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:38,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:47:38,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:47:38,163 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 05:47:38,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 121 transitions, 1789 flow. Second operand has 12 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-06 05:47:38,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:38,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 05:47:38,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:38,951 INFO L130 PetriNetUnfolder]: 495/912 cut-off events. [2022-12-06 05:47:38,951 INFO L131 PetriNetUnfolder]: For 9783/9783 co-relation queries the response was YES. [2022-12-06 05:47:38,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6130 conditions, 912 events. 495/912 cut-off events. For 9783/9783 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4707 event pairs, 55 based on Foata normal form. 3/911 useless extension candidates. Maximal degree in co-relation 6017. Up to 832 conditions per place. [2022-12-06 05:47:38,957 INFO L137 encePairwiseOnDemand]: 16/47 looper letters, 83 selfloop transitions, 64 changer transitions 8/155 dead transitions. [2022-12-06 05:47:38,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 155 transitions, 2385 flow [2022-12-06 05:47:38,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:47:38,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:47:38,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 87 transitions. [2022-12-06 05:47:38,958 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20567375886524822 [2022-12-06 05:47:38,958 INFO L175 Difference]: Start difference. First operand has 90 places, 121 transitions, 1789 flow. Second operand 9 states and 87 transitions. [2022-12-06 05:47:38,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 155 transitions, 2385 flow [2022-12-06 05:47:38,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 155 transitions, 2172 flow, removed 84 selfloop flow, removed 7 redundant places. [2022-12-06 05:47:38,981 INFO L231 Difference]: Finished difference. Result has 94 places, 133 transitions, 1911 flow [2022-12-06 05:47:38,981 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1586, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1911, PETRI_PLACES=94, PETRI_TRANSITIONS=133} [2022-12-06 05:47:38,981 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 73 predicate places. [2022-12-06 05:47:38,981 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:38,981 INFO L89 Accepts]: Start accepts. Operand has 94 places, 133 transitions, 1911 flow [2022-12-06 05:47:38,981 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:38,982 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:38,982 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 133 transitions, 1911 flow [2022-12-06 05:47:38,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 133 transitions, 1911 flow [2022-12-06 05:47:39,017 INFO L130 PetriNetUnfolder]: 128/365 cut-off events. [2022-12-06 05:47:39,017 INFO L131 PetriNetUnfolder]: For 3182/3183 co-relation queries the response was YES. [2022-12-06 05:47:39,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2207 conditions, 365 events. 128/365 cut-off events. For 3182/3183 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2124 event pairs, 1 based on Foata normal form. 1/360 useless extension candidates. Maximal degree in co-relation 2124. Up to 169 conditions per place. [2022-12-06 05:47:39,020 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 133 transitions, 1911 flow [2022-12-06 05:47:39,020 INFO L188 LiptonReduction]: Number of co-enabled transitions 352 [2022-12-06 05:47:39,446 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [670] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_173| v_~f~0.base_139))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_139 (* v_~x2~0_237 4))))) (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_161| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_135|) (= |v_thread1Thread1of1ForFork1_~i~0#1_87| 1) (= (select .cse0 (+ v_~f~0.offset_139 (* .cse1 4))) v_~x2~0_236) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_61| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_61| (ite (and (< v_~x1~0_131 v_~size~0_145) (<= 0 v_~x1~0_131)) 1 0)) (= 2 |v_thread2Thread1of1ForFork0_~i~1#1_201|) (= (ite (and (< .cse1 v_~size~0_145) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_135|) (< (mod (+ 4294967295 |v_thread1Thread1of1ForFork1_~i~0#1_87|) 4294967296) (mod v_~n~0_123 4294967296)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_161| 0)) (= v_~x1~0_130 (select .cse0 (+ v_~f~0.offset_139 (* v_~x1~0_131 4)))) (< 0 (mod (+ 4294967295 v_~n~0_123) 4294967296)) (not (= (ite (and (< v_~x2~0_237 v_~size~0_145) (<= 0 v_~x2~0_237)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_237, ~size~0=v_~size~0_145, ~f~0.base=v_~f~0.base_139, #memory_int=|v_#memory_int_173|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_131, ~f~0.offset=v_~f~0.offset_139} OutVars{thread2Thread1of1ForFork0_#t~mem3#1=|v_thread2Thread1of1ForFork0_#t~mem3#1_79|, thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_59|, ~x2~0=v_~x2~0_236, ~size~0=v_~size~0_145, ~f~0.base=v_~f~0.base_139, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_135|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_201|, ~x1~0=v_~x1~0_130, ~f~0.offset=v_~f~0.offset_139, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_161|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_87|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_61|, #memory_int=|v_#memory_int_173|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_91|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_79|, ~n~0=v_~n~0_123, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_63|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_79|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork1_#t~post2#1, ~x2~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, ~x1~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork1_#t~mem1#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [628] L49-2-->L49-2: Formula: (and (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_21| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_6 4)))) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_6 v_~size~0_In_15) (<= 0 v_~x1~0_In_6)) 1 0)) (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_In_4| 1) |v_thread1Thread1of1ForFork1_~i~0#1_Out_6|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|) (< (mod |v_thread1Thread1of1ForFork1_~i~0#1_In_4| 4294967296) (mod v_~n~0_In_7 4294967296))) InVars {~size~0=v_~size~0_In_15, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_4|, ~f~0.base=v_~f~0.base_In_9, #memory_int=|v_#memory_int_In_21|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_Out_10|, ~size~0=v_~size~0_In_15, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|, ~f~0.base=v_~f~0.base_In_9, #memory_int=|v_#memory_int_In_21|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_Out_6|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_18, ~f~0.offset=v_~f~0.offset_In_9, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, ~x1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:47:40,078 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [753] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_298| v_~f~0.base_247))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_247 (* v_~x1~0_292 4)))) (.cse2 (select .cse1 (+ v_~f~0.offset_247 (* v_~x2~0_455 4))))) (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_156| (ite (and (< .cse0 v_~size~0_249) (<= 0 .cse0)) 1 0)) (not (= (ite (and (< v_~x2~0_455 v_~size~0_249) (<= 0 v_~x2~0_455)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_292 v_~size~0_249) (<= 0 v_~x1~0_292)) 1 0) 0)) (< 0 (mod (+ 4294967295 v_~n~0_227) 4294967296)) (= |v_thread1Thread1of1ForFork1_~i~0#1_241| 2) (< 0 (mod v_~n~0_227 4294967296)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_156| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_164|) (= 2 |v_thread2Thread1of1ForFork0_~i~1#1_347|) (= v_~x1~0_290 (select .cse1 (+ v_~f~0.offset_247 (* 4 .cse0)))) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_164| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_299| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_273|) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_249)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_273|) (= v_~x2~0_454 (select .cse1 (+ v_~f~0.offset_247 (* .cse2 4)))) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_299| 0))))) InVars {~x2~0=v_~x2~0_455, ~size~0=v_~size~0_249, ~f~0.base=v_~f~0.base_247, #memory_int=|v_#memory_int_298|, ~n~0=v_~n~0_227, ~x1~0=v_~x1~0_292, ~f~0.offset=v_~f~0.offset_247} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_154|, thread2Thread1of1ForFork0_#t~mem3#1=|v_thread2Thread1of1ForFork0_#t~mem3#1_184|, ~x2~0=v_~x2~0_454, ~size~0=v_~size~0_249, ~f~0.base=v_~f~0.base_247, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_273|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_347|, ~x1~0=v_~x1~0_290, ~f~0.offset=v_~f~0.offset_247, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_299|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_241|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_156|, #memory_int=|v_#memory_int_298|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_196|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_158|, ~n~0=v_~n~0_227, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_184|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_184|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_164|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork0_#t~mem3#1, ~x2~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, ~x1~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork1_#t~mem1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [634] L59-2-->thread2EXIT: Formula: (let ((.cse3 (mod |v_thread2Thread1of1ForFork0_~i~1#1_116| 4294967296))) (and (let ((.cse0 (< .cse3 (mod v_~n~0_69 4294967296))) (.cse1 (= |v_thread2Thread1of1ForFork0_#res#1.base_19| 0)) (.cse2 (= |v_thread2Thread1of1ForFork0_#res#1.offset_19| 0))) (or (and (not .cse0) (= |v_thread2Thread1of1ForFork0_#t~post8#1_28| |v_thread2Thread1of1ForFork0_#t~post8#1_27|) (= |v_thread2Thread1of1ForFork0_#t~mem7#1_32| |v_thread2Thread1of1ForFork0_#t~mem7#1_31|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_64| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_63|) .cse1 (= v_~x2~0_127 v_~x2~0_126) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_89| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|) (= |v_thread2Thread1of1ForFork0_~i~1#1_116| |v_thread2Thread1of1ForFork0_~i~1#1_115|) .cse2) (and (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_89| 0)) .cse0 (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_89| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_63|) .cse1 (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_116| 1) |v_thread2Thread1of1ForFork0_~i~1#1_115|) (= (select (select |v_#memory_int_119| v_~f~0.base_87) (+ v_~f~0.offset_87 (* v_~x2~0_127 4))) v_~x2~0_126) (= (ite (and (<= 0 v_~x2~0_127) (< v_~x2~0_127 v_~size~0_93)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_63|) .cse2))) (not (< .cse3 (mod (+ v_~n~0_69 4294967295) 4294967296))))) InVars {~x2~0=v_~x2~0_127, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, ~size~0=v_~size~0_93, ~f~0.base=v_~f~0.base_87, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_64|, #memory_int=|v_#memory_int_119|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_116|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_32|, ~n~0=v_~n~0_69, ~f~0.offset=v_~f~0.offset_87, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_28|} OutVars{~x2~0=v_~x2~0_126, ~size~0=v_~size~0_93, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_19|, ~f~0.base=v_~f~0.base_87, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_63|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_115|, ~f~0.offset=v_~f~0.offset_87, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_89|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_19|, #memory_int=|v_#memory_int_119|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_31|, ~n~0=v_~n~0_69, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_27|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~post8#1] [2022-12-06 05:47:40,542 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [753] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_298| v_~f~0.base_247))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_247 (* v_~x1~0_292 4)))) (.cse2 (select .cse1 (+ v_~f~0.offset_247 (* v_~x2~0_455 4))))) (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_156| (ite (and (< .cse0 v_~size~0_249) (<= 0 .cse0)) 1 0)) (not (= (ite (and (< v_~x2~0_455 v_~size~0_249) (<= 0 v_~x2~0_455)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_292 v_~size~0_249) (<= 0 v_~x1~0_292)) 1 0) 0)) (< 0 (mod (+ 4294967295 v_~n~0_227) 4294967296)) (= |v_thread1Thread1of1ForFork1_~i~0#1_241| 2) (< 0 (mod v_~n~0_227 4294967296)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_156| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_164|) (= 2 |v_thread2Thread1of1ForFork0_~i~1#1_347|) (= v_~x1~0_290 (select .cse1 (+ v_~f~0.offset_247 (* 4 .cse0)))) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_164| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_299| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_273|) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_249)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_273|) (= v_~x2~0_454 (select .cse1 (+ v_~f~0.offset_247 (* .cse2 4)))) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_299| 0))))) InVars {~x2~0=v_~x2~0_455, ~size~0=v_~size~0_249, ~f~0.base=v_~f~0.base_247, #memory_int=|v_#memory_int_298|, ~n~0=v_~n~0_227, ~x1~0=v_~x1~0_292, ~f~0.offset=v_~f~0.offset_247} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_154|, thread2Thread1of1ForFork0_#t~mem3#1=|v_thread2Thread1of1ForFork0_#t~mem3#1_184|, ~x2~0=v_~x2~0_454, ~size~0=v_~size~0_249, ~f~0.base=v_~f~0.base_247, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_273|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_347|, ~x1~0=v_~x1~0_290, ~f~0.offset=v_~f~0.offset_247, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_299|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_241|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_156|, #memory_int=|v_#memory_int_298|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_196|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_158|, ~n~0=v_~n~0_227, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_184|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_184|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_164|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork0_#t~mem3#1, ~x2~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, ~x1~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork1_#t~mem1#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [635] L59-2-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_121| v_~f~0.base_89))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_89 (* v_~x2~0_131 4))))) (and (= |v_thread2Thread1of1ForFork0_~i~1#1_119| (+ 2 |v_thread2Thread1of1ForFork0_~i~1#1_120|)) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_120| 4294967296) (mod (+ v_~n~0_71 4294967295) 4294967296)) (= (ite (and (< .cse0 v_~size~0_95) (<= 0 .cse0)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_67|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_93| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_67|) (= v_~x2~0_130 (select .cse1 (+ v_~f~0.offset_89 (* .cse0 4)))) (not (= (ite (and (< v_~x2~0_131 v_~size~0_95) (<= 0 v_~x2~0_131)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_93| 0))))) InVars {~x2~0=v_~x2~0_131, ~size~0=v_~size~0_95, ~f~0.base=v_~f~0.base_89, #memory_int=|v_#memory_int_121|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_120|, ~n~0=v_~n~0_71, ~f~0.offset=v_~f~0.offset_89} OutVars{thread2Thread1of1ForFork0_#t~mem3#1=|v_thread2Thread1of1ForFork0_#t~mem3#1_27|, ~x2~0=v_~x2~0_130, ~size~0=v_~size~0_95, ~f~0.base=v_~f~0.base_89, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_67|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_119|, ~f~0.offset=v_~f~0.offset_89, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_93|, #memory_int=|v_#memory_int_121|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_39|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_27|, ~n~0=v_~n~0_71, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem3#1, ~x2~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1] [2022-12-06 05:47:41,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 05:47:41,290 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,SelfDestructingSolverStorable34 [2022-12-06 05:47:41,291 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IndexOutOfBoundsException: Index 12 out of bounds for length 12 at java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:64) at java.base/jdk.internal.util.Preconditions.outOfBoundsCheckIndex(Preconditions.java:70) at java.base/jdk.internal.util.Preconditions.checkIndex(Preconditions.java:248) at java.base/java.util.Objects.checkIndex(Objects.java:372) at java.base/java.util.ArrayList.get(ArrayList.java:459) at de.uni_freiburg.informatik.ultimate.automata.petrinet.PetriNetRun.getTransition(PetriNetRun.java:125) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ChoiceRule.adaptRun(ChoiceRule.java:163) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ChoiceRule.applyInternal(ChoiceRule.java:115) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:80) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.choiceRuleWrapper(LiptonReduction.java:239) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:200) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.(LiptonReduction.java:143) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.PetriNetLargeBlockEncoding.(PetriNetLargeBlockEncoding.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 05:47:41,294 INFO L158 Benchmark]: Toolchain (without parser) took 96604.28ms. Allocated memory was 178.3MB in the beginning and 444.6MB in the end (delta: 266.3MB). Free memory was 153.8MB in the beginning and 237.4MB in the end (delta: -83.6MB). Peak memory consumption was 278.7MB. Max. memory is 8.0GB. [2022-12-06 05:47:41,294 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 127.9MB. Free memory is still 105.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:47:41,294 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.38ms. Allocated memory is still 178.3MB. Free memory was 153.8MB in the beginning and 142.7MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 05:47:41,295 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.37ms. Allocated memory is still 178.3MB. Free memory was 142.7MB in the beginning and 140.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:47:41,295 INFO L158 Benchmark]: Boogie Preprocessor took 26.50ms. Allocated memory is still 178.3MB. Free memory was 140.6MB in the beginning and 139.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 05:47:41,295 INFO L158 Benchmark]: RCFGBuilder took 439.67ms. Allocated memory is still 178.3MB. Free memory was 139.0MB in the beginning and 122.7MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-06 05:47:41,295 INFO L158 Benchmark]: TraceAbstraction took 95803.93ms. Allocated memory was 178.3MB in the beginning and 444.6MB in the end (delta: 266.3MB). Free memory was 122.2MB in the beginning and 237.4MB in the end (delta: -115.2MB). Peak memory consumption was 247.3MB. Max. memory is 8.0GB. [2022-12-06 05:47:41,301 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 127.9MB. Free memory is still 105.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 275.38ms. Allocated memory is still 178.3MB. Free memory was 153.8MB in the beginning and 142.7MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.37ms. Allocated memory is still 178.3MB. Free memory was 142.7MB in the beginning and 140.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.50ms. Allocated memory is still 178.3MB. Free memory was 140.6MB in the beginning and 139.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 439.67ms. Allocated memory is still 178.3MB. Free memory was 139.0MB in the beginning and 122.7MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 95803.93ms. Allocated memory was 178.3MB in the beginning and 444.6MB in the end (delta: 266.3MB). Free memory was 122.2MB in the beginning and 237.4MB in the end (delta: -115.2MB). Peak memory consumption was 247.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 145 PlacesBefore, 21 PlacesAfterwards, 153 TransitionsBefore, 17 TransitionsAfterwards, 2692 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 64 TrivialYvCompositions, 60 ConcurrentYvCompositions, 11 ChoiceCompositions, 135 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1661, independent: 1657, independent conditional: 1657, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1661, independent: 1657, independent conditional: 0, independent unconditional: 1657, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1661, independent: 1657, independent conditional: 0, independent unconditional: 1657, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1661, independent: 1657, independent conditional: 0, independent unconditional: 1657, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1503, independent: 1499, independent conditional: 0, independent unconditional: 1499, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1503, independent: 1499, independent conditional: 0, independent unconditional: 1499, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1661, independent: 158, independent conditional: 0, independent unconditional: 158, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1503, unknown conditional: 0, unknown unconditional: 1503] , Statistics on independence cache: Total cache size (in pairs): 2919, Positive cache size: 2915, Positive conditional cache size: 0, Positive unconditional cache size: 2915, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 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.2s, 24 PlacesBefore, 22 PlacesAfterwards, 21 TransitionsBefore, 19 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 3, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15, independent: 15, independent conditional: 0, 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: 15, independent: 15, independent conditional: 0, 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: 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] , 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: 15, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 26 PlacesBefore, 26 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 108 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 4, independent unconditional: 1, 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: 4, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 5, independent: 1, independent conditional: 0, independent unconditional: 1, 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): 14, Positive cache size: 14, Positive conditional cache size: 4, Positive unconditional cache size: 10, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 30 PlacesBefore, 29 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 108 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): 17, Positive cache size: 17, Positive conditional cache size: 7, Positive unconditional cache size: 10, 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.4s, 33 PlacesBefore, 33 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 4, independent unconditional: 1, 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: 4, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 4, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 23, Positive cache size: 23, Positive conditional cache size: 11, Positive unconditional cache size: 12, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 35 PlacesBefore, 34 PlacesAfterwards, 31 TransitionsBefore, 30 TransitionsAfterwards, 124 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: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, 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: 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] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 24, Positive conditional cache size: 11, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 36 PlacesBefore, 35 PlacesAfterwards, 34 TransitionsBefore, 33 TransitionsAfterwards, 148 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): 27, Positive cache size: 27, Positive conditional cache size: 14, Positive unconditional cache size: 13, 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, 40 PlacesBefore, 40 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 156 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): 27, Positive cache size: 27, Positive conditional cache size: 14, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 41 PlacesBefore, 40 PlacesAfterwards, 36 TransitionsBefore, 35 TransitionsAfterwards, 152 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: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, 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: 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] , Statistics on independence cache: Total cache size (in pairs): 28, Positive cache size: 28, Positive conditional cache size: 14, 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.7s, 42 PlacesBefore, 43 PlacesAfterwards, 36 TransitionsBefore, 37 TransitionsAfterwards, 148 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 34, Positive cache size: 34, Positive conditional cache size: 20, 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: 3.3s, 47 PlacesBefore, 45 PlacesAfterwards, 37 TransitionsBefore, 34 TransitionsAfterwards, 150 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 22, independent: 22, independent conditional: 16, independent unconditional: 6, 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: 22, independent: 22, independent conditional: 16, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22, independent: 22, independent conditional: 16, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 14, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 0, independent unconditional: 17, 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: 22, independent: 5, independent conditional: 2, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 17, unknown conditional: 14, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 53, Positive conditional cache size: 34, Positive unconditional cache size: 19, 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.5s, 43 PlacesBefore, 42 PlacesAfterwards, 37 TransitionsBefore, 36 TransitionsAfterwards, 138 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 63, Positive cache size: 63, Positive conditional cache size: 44, Positive unconditional cache size: 19, 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: 1.7s, 46 PlacesBefore, 46 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 210 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): 63, Positive cache size: 63, Positive conditional cache size: 44, Positive unconditional cache size: 19, 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.9s, 46 PlacesBefore, 45 PlacesAfterwards, 55 TransitionsBefore, 54 TransitionsAfterwards, 216 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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): 66, Positive cache size: 66, Positive conditional cache size: 47, Positive unconditional cache size: 19, 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: 2.1s, 51 PlacesBefore, 51 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 268 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): 66, Positive cache size: 66, Positive conditional cache size: 47, Positive unconditional cache size: 19, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 52 PlacesBefore, 51 PlacesAfterwards, 77 TransitionsBefore, 76 TransitionsAfterwards, 274 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 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): 69, Positive cache size: 69, Positive conditional cache size: 50, Positive unconditional cache size: 19, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 53 PlacesBefore, 53 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 296 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): 72, Positive cache size: 72, Positive conditional cache size: 53, Positive unconditional cache size: 19, 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: 2.4s, 56 PlacesBefore, 55 PlacesAfterwards, 81 TransitionsBefore, 80 TransitionsAfterwards, 298 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 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): 75, Positive cache size: 75, Positive conditional cache size: 56, Positive unconditional cache size: 19, 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, 56 PlacesBefore, 56 PlacesAfterwards, 82 TransitionsBefore, 82 TransitionsAfterwards, 296 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): 75, Positive cache size: 75, Positive conditional cache size: 56, Positive unconditional cache size: 19, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 58 PlacesBefore, 57 PlacesAfterwards, 83 TransitionsBefore, 82 TransitionsAfterwards, 302 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 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): 78, Positive cache size: 78, Positive conditional cache size: 59, Positive unconditional cache size: 19, 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: 1.6s, 58 PlacesBefore, 58 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 286 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 79, Positive conditional cache size: 60, Positive unconditional cache size: 19, 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: 3.6s, 58 PlacesBefore, 57 PlacesAfterwards, 84 TransitionsBefore, 83 TransitionsAfterwards, 290 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 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): 82, Positive cache size: 82, Positive conditional cache size: 63, Positive unconditional cache size: 19, 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: 1.2s, 68 PlacesBefore, 68 PlacesAfterwards, 129 TransitionsBefore, 129 TransitionsAfterwards, 396 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: 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: 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: 18, independent: 12, independent conditional: 12, 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): 88, Positive cache size: 88, Positive conditional cache size: 69, Positive unconditional cache size: 19, 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, 68 PlacesBefore, 68 PlacesAfterwards, 129 TransitionsBefore, 129 TransitionsAfterwards, 372 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): 88, Positive cache size: 88, Positive conditional cache size: 69, Positive unconditional cache size: 19, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 71 PlacesBefore, 70 PlacesAfterwards, 133 TransitionsBefore, 132 TransitionsAfterwards, 380 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): 90, Positive cache size: 90, Positive conditional cache size: 71, Positive unconditional cache size: 19, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 73 PlacesBefore, 72 PlacesAfterwards, 133 TransitionsBefore, 132 TransitionsAfterwards, 380 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: 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): 91, Positive cache size: 91, Positive conditional cache size: 72, Positive unconditional cache size: 19, 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, 73 PlacesBefore, 73 PlacesAfterwards, 134 TransitionsBefore, 134 TransitionsAfterwards, 376 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: 91, Positive conditional cache size: 72, Positive unconditional cache size: 19, 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, 77 PlacesBefore, 77 PlacesAfterwards, 140 TransitionsBefore, 140 TransitionsAfterwards, 378 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: 91, Positive conditional cache size: 72, Positive unconditional cache size: 19, 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, 77 PlacesBefore, 77 PlacesAfterwards, 137 TransitionsBefore, 137 TransitionsAfterwards, 372 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: 91, Positive conditional cache size: 72, Positive unconditional cache size: 19, 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, 81 PlacesBefore, 81 PlacesAfterwards, 142 TransitionsBefore, 142 TransitionsAfterwards, 384 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: 91, Positive conditional cache size: 72, Positive unconditional cache size: 19, 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: 2.3s, 84 PlacesBefore, 83 PlacesAfterwards, 110 TransitionsBefore, 110 TransitionsAfterwards, 300 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: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 97, Positive conditional cache size: 78, Positive unconditional cache size: 19, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 81 PlacesBefore, 80 PlacesAfterwards, 109 TransitionsBefore, 108 TransitionsAfterwards, 298 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: 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): 116, Positive cache size: 116, Positive conditional cache size: 97, Positive unconditional cache size: 19, 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, 74 PlacesBefore, 74 PlacesAfterwards, 106 TransitionsBefore, 106 TransitionsAfterwards, 292 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): 116, Positive cache size: 116, Positive conditional cache size: 97, Positive unconditional cache size: 19, 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: 5.3s, 92 PlacesBefore, 90 PlacesAfterwards, 123 TransitionsBefore, 121 TransitionsAfterwards, 324 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 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: 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: 9, independent: 5, independent conditional: 5, 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): 147, Positive cache size: 147, Positive conditional cache size: 128, Positive unconditional cache size: 19, 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 - ExceptionOrErrorResult: IndexOutOfBoundsException: Index 12 out of bounds for length 12 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IndexOutOfBoundsException: Index 12 out of bounds for length 12: java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:64) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 05:47:41,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...